ΘρϵηΠατπ

Category
A category 𝒞 consists of
  • a collection ob (𝒞) of objects
  • for each A,B∈ob(𝒞), a collection mor⁡(A,B) of what we call morphisms / arrows from A to B
  • for each A,B,C∈ob⁡(𝒞), a function which we call composition ∘𝒞:mor⁡(B,C)×mor⁡(A,B)→mor⁡(A,C)
  • ∘𝒞(g,f):=g∘f
  • for each A∈ob(𝒞), an element 1A of mor⁡(A,A), called the identity on A, satisfying the following axioms:
    • associativity: for each f∈mor⁡(A,B),g∈mor⁡(B,C) and h∈mor⁡(C,D), we have (h∘g)∘f=h∘(g∘f);
    • identity laws: for each f∈mor⁡(A,B), we have f∘1A=f=1B∘f.
Domain and Codomain
Each morphism has associated domain and codomain, denoted f:A→B
  • The domain of f, denoted dom⁡(f), is A
  • The codomain of f, denoted cod⁡(f), is B
Some Notations on Morphism
  • f,g:A⇉B denotes two morphisms with the same domain and codomain
  • f:A⇄B:g denotes two morphisms, f:A→B and g:B→A
Isomorphism / Isomorphic
Let 𝒞 be a category, A,B∈ob⁡(𝒞). f:A→B is an isomorphism if and only if ∃g:B→A.g∘f=1A∧f∘g=1B In which case A,B are isomorphic and denoted as A≅B
Endomorphism
Let 𝒞 be a category, A∈ob⁡(𝒞). f:A→A is an endomorphism if and only if f has the same domain and codomain
Automorphism
A morphism f is an automorphism if and only if f is an endomorphism∧f is an isomorphism
Opposite Category, Duality
Let 𝒞 be a category. Then the opposite category 𝒞op is defined as follow:
  • ob⁡(𝒞op)=ob⁡(𝒞)
  • For each f∈mor𝒞⁡(B,A), a morphism fop∈mor𝒞op⁡(A,B)
  • gop∘𝒞opfop=(f∘𝒞g)op
The opposite category is a category
The construction 𝒞op indeed form a new category.

The definition already gives us the mathematical objects of a category. We only need to show composition satisfies associativity and identity law.

We first show associativity. Let fop:A→B,gop:B→C,hop:C→D be morphisms in 𝒞op. Correspondingly, we have morphisms f:B→A,g:C→B,h:D→C in 𝒞. We then have the following reasoning (composition subscript omitted): (hop∘gop)∘fop=(g∘h)op∘fop=(f∘(g∘h))op=((f∘g)∘h)op=hop∘(f∘g)op=hop∘(gop∘fop)

Lastly we show the existence of identity morphism along with their desired property. Let A,B∈𝒞op, we choose the identity morphism of this object to be 1Aop,1Bop respectively.

Let fop:A→B be a morphism in 𝒞. We can show the following: fop∘1Aop=(1A∘f)op=(f)op1Bop∘fop=(f∘1B)op=(f)op

Thus all desired properties are shown, we conclude 𝒞op is a category.

Functor
Let 𝒜 and ℬ be categories. A functor F:𝒜→ℬ consists of
  • a function ob(𝒜)→ob(ℬ), written as A↦F(A)
  • - for each A,A′∈𝒜, a function mor𝒜⁡(A,A′)→morℬ⁡(F(A),F(A′)) written as f↦F(f), satisfying the following axioms:
    • F(f′∘f)=F(f′)∘F(f) whenever A→fA′→f′A′′ in 𝒜;
    • F(1A)=1F(A) whenever A∈𝒜.
Pointed Topological Spaces Category
The category of pointed topological spaces denoted by Top0⁡ is one where objects are pairs (X,x0), where X is a topological space, and x0∈X is a point of X. Morphisms between (X,x0) and (Y,y0) are continuous functions f:X→Y such that f(x0)=y0.
Group Category
The category Grp⁡ has the class of all groups for objects and group homomorphisms for morphisms
The Fundamental Group Is a Functor
π1:Top0⁡→Grp⁡ can be completed to a functor

For each (X,x0)∈ob⁡(Top0⁡) we map it to π1(X,x0) which is the object functor. We call this function π1ob⁡:ob⁡(Top0⁡)→ob⁡(Grp⁡)

Now we will construct our morphism functor, that is given f∈hom⁡((X,x0),(Y,y0)) we map it to a function , defined by [γ]↦[f∘γ] we call this mapping h, that is: F(X,x0),(Y,y0) where F(X,x0),(Y,y0)(f)=h

We now show that h∈hom⁡(π1(X,x0),π1(Y,y0)), to do this, we must prove that it is a group homomorphism, and also that it is well defined. For the well definedness we note that if [α]=[β] then we have that [f∘α]=[f∘β]. For ease of notation recall that f∗([γ]):=[f∘γ], and we prove that our function h is a group homomorphism, that is we show that f∗([α][β])=f∗([α])f∗([β]) but on the left we have f∗([α]⋅[β])=f∗([α⋅β])=[f∘(α⋅β)]=[(f∘α)⋅(f∘β)]=[f∘α]⋅[f∘β]=f∗(α)⋅f∗(β) which is the right, so we are done.

We now verify the functor properties: F(X,x0),(X,x0)(id(X,x0)⁡)=idπ1ob⁡(X,x0)⁡=idπ1(X,x0)⁡ We have that F(X,x0),(X,x0)(id(X,x0)⁡)=h where h([γ])=[id(X,x0)⁡∘γ]=[γ], in other words h takes an element from π1(X,x0) and returns that same element, so that h=idπ1(X,x0)⁡ as needed.

We now verify that F(X,x0),(Y,y0)(g∘f)=F(Y,y0),(Z,z0)(g)∘F(X,x0),(Y,y0)(f) If we focus on the right hand side and give the two functions simpler names ; hg:π1(Y,y0)→π1(Z,z0) and hf:π1(X,x0)→π1(Y,y0) respectively, and thus on the right hand side we have: (hg∘hf)([γ])=hg(hf([γ]))=hg([f∘γ])=[g∘(f∘γ)]=[(g∘f)∘γ]=F(X,x0),(Y,y0)(g∘f) so our original equation holds true.

Thus since we've verified all the conditions, we conclude that π1 is a functor.