ΘρϵηΠατπ

Category
A category 𝒞 consists of
  • a collection ob (𝒞) of objects
  • for each A,Bob(𝒞), a collection mor(A,B) of what we call morphisms / arrows from A to B
  • for each A,B,Cob(𝒞), a function which we call composition 𝒞:mor(B,C)×mor(A,B)mor(A,C)
  • 𝒞(g,f):=gf
  • for each Aob(𝒞), an element 1A of mor(A,A), called the identity on A, satisfying the following axioms:
    • associativity: for each fmor(A,B),gmor(B,C) and hmor(C,D), we have (hg)f=h(gf);
    • identity laws: for each fmor(A,B), we have f1A=f=1Bf.
Domain and Codomain
Each morphism has associated domain and codomain, denoted f:AB
  • The domain of f, denoted dom(f), is A
  • The codomain of f, denoted cod(f), is B
Some Notations on Morphism
  • f,g:AB denotes two morphisms with the same domain and codomain
  • f:AB:g denotes two morphisms, f:AB and g:BA
Isomorphism / Isomorphic
Let 𝒞 be a category, A,Bob(𝒞). f:AB is an isomorphism if and only if g:BA.amp;gf=1Aamp;fg=1B In which case A,B are isomorphic and denoted as AB
Endomorphism
Let 𝒞 be a category, Aob(𝒞). f:AA 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 endomorphismf is an isomorphism
Opposite Category, Duality
Let 𝒞 be a category. Then the opposite category 𝒞op is defined as follow:
  • ob(𝒞op)=ob(𝒞)
  • For each fmor𝒞(B,A), a morphism fopmor𝒞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:AB,gop:BC,hop:CD be morphisms in 𝒞op. Correspondingly, we have morphisms f:BA,g:CB,h:DC in 𝒞. We then have the following reasoning (composition subscript omitted): (hopgop)fop=(gh)opfop=(f(gh))op=((fg)h)op=hop(fg)op=hop(gopfop)

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:AB be a morphism in 𝒞. We can show the following: fop1Aop=(1Af)op=(f)op1Bopfop=(f1B)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 AF(A)
  • - for each A,A𝒜, a function mor𝒜(A,A)mor(F(A),F(A)) written as fF(f), satisfying the following axioms:
    • F(ff)=F(f)F(f) whenever AfAfA 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 x0X is a point of X. Morphisms between (X,x0) and (Y,y0) are continuous functions f:XY 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:Top0Grp 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 fhom((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 hhom(π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 _ { \left( X, x _ 0 \right), \left( X, x _ 0 \right) } \left( \operatorname{ id } _ { \left( X, x _ 0 \right) } \right) = \operatorname{ id } _ { \pi _ 1 ^ { \operatorname{ ob } } \left( X, x_0 \right) } = \operatorname{ id } _ { \pi _ 1 } \left( X, x_0 \right) } ParseError: Expected 'EOF', got '}' at position 274: …, x_0 \right) }̲ 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)(gf)=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: (hghf)([γ])=hg(hf([γ]))=hg([fγ])=[g(fγ)]=[(gf)γ]=F(X,x0),(Y,y0)(gf) so our original equation holds true.

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