You have 3 free guides left 😟
Unlock your guides
You have 3 free guides left 😟
Unlock your guides

Functors and natural transformations are the building blocks of . They allow us to map between categories and compare different functors, giving us powerful tools to analyze mathematical structures and relationships.

These concepts help us understand how different mathematical objects relate to each other. By using functors and natural transformations, we can uncover deep connections between seemingly unrelated areas of math, leading to new insights and discoveries.

Functors and their properties

Definition and structure of functors

Top images from around the web for Definition and structure of functors
Top images from around the web for Definition and structure of functors
  • A is a structure-preserving map between categories, consisting of an object map and a map
  • The object map assigns to each object in the source category an object in the target category
  • The morphism map assigns to each morphism in the source category a morphism in the target category
    • Preserves the domain and codomain of the morphisms (if f:ABf: A \to B in the source category, then F(f):F(A)F(B)F(f): F(A) \to F(B) in the target category)

Properties of functors

  • Functors preserve identity morphisms
    • The image of an identity morphism under a functor is an identity morphism (if idAid_A is the identity morphism of object AA in the source category, then F(idA)=idF(A)F(id_A) = id_{F(A)} in the target category)
  • Functors preserve composition
    • The image of a composite morphism under a functor is equal to the composition of the images of the individual morphisms (if f:ABf: A \to B and g:BCg: B \to C in the source category, then F(gf)=F(g)F(f)F(g \circ f) = F(g) \circ F(f) in the target category)
  • Examples of functors
    • The IdC:CCId_C: C \to C maps each object and morphism in a category CC to itself
    • The forgetful functor U:GrpSetU: Grp \to Set maps each group to its underlying set and each group homomorphism to its underlying function

Composition of functors

Composing functors

  • Functors can be composed, forming a new functor from the target category of the first functor to the target category of the second functor
    • If F:CDF: C \to D and G:DEG: D \to E are functors, then their composition GF:CEG \circ F: C \to E is a functor
    • The composition of functors is defined by (GF)(A)=G(F(A))(G \circ F)(A) = G(F(A)) for objects and (GF)(f)=G(F(f))(G \circ F)(f) = G(F(f)) for morphisms

Properties of functor composition

  • The composition of functors is associative
    • (FG)H=F(GH)(F \circ G) \circ H = F \circ (G \circ H) for functors FF, GG, and HH
  • The identity functor acts as the identity element for functor composition
    • IdCF=F=FIdDId_C \circ F = F = F \circ Id_D for a functor F:CDF: C \to D
  • The composition of functors preserves the properties of functors
    • Such as the preservation of identity morphisms and composition
  • Example of functor composition
    • Consider the functors F:SetGrpF: Set \to Grp (free group functor) and U:GrpSetU: Grp \to Set (forgetful functor). Their composition UF:SetSetU \circ F: Set \to Set maps each set to its underlying set of the free group generated by that set

Natural transformations in category theory

Definition and components of natural transformations

  • A is a morphism between functors, providing a way to compare and relate different functors between the same categories
  • Given two functors F,G:CDF, G: C \to D, a natural transformation η:FG\eta: F \Rightarrow G assigns to each object XX in CC a morphism ηX:F(X)G(X)\eta_X: F(X) \to G(X) in DD
    • Such that for every morphism f:XYf: X \to Y in CC, the following diagram commutes: G(f)ηX=ηYF(f)G(f) \circ \eta_X = \eta_Y \circ F(f)
  • The components of a natural transformation, ηX\eta_X, are the morphisms assigned to each object XX in the source category

Composition and properties of natural transformations

  • Natural transformations can be composed vertically
    • When the target functor of one natural transformation is the source functor of another (if η:FG\eta: F \Rightarrow G and θ:GH\theta: G \Rightarrow H, then θη:FH\theta \circ \eta: F \Rightarrow H is a natural transformation)
  • Natural transformations can be composed horizontally
    • When the functors involved have a common source or target category (if η:FG\eta: F \Rightarrow G and θ:HK\theta: H \Rightarrow K, then η×θ:FHGK\eta \times \theta: F \circ H \Rightarrow G \circ K is a natural transformation)
  • Natural transformations provide a way to study the relationships between functors and to define equivalences between categories
    • Two categories CC and DD are equivalent if there exist functors F:CDF: C \to D and G:DCG: D \to C such that GFIdCG \circ F \cong Id_C and FGIdDF \circ G \cong Id_D via natural isomorphisms
  • Example of a natural transformation
    • The determinant det:GLnRdet: GL_n \Rightarrow \mathbb{R}^* is a natural transformation from the general linear group functor GLn:RingGrpGL_n: Ring \to Grp to the multiplicative group functor R:RingGrp\mathbb{R}^*: Ring \to Grp

Functors vs Natural transformations

Functors and natural transformations form a 2-category

  • Categories as objects, functors as morphisms, and natural transformations as 2-morphisms
  • The functor category [C,D][C, D] has functors from CC to DD as objects and natural transformations between these functors as morphisms

Adjoint functors and universal properties

  • Adjoint functors are pairs of functors (F:CD,G:DC)(F: C \to D, G: D \to C) with a between the hom-sets HomD(F(X),Y)Hom_D(F(X), Y) and HomC(X,G(Y))Hom_C(X, G(Y))
  • Adjoint functors play a crucial role in category theory and are closely related to universal properties
    • Universal properties characterize objects and morphisms in terms of their relationships with other objects and morphisms in the category
    • Examples of adjoint functors: free and forgetful functors, product and diagonal functors, and exponential and evaluation functors

The Yoneda lemma and its implications

  • The Yoneda lemma establishes a relationship between an object and its representable functor
    • A representable functor HomC(X,):CSetHom_C(X, -): C \to Set assigns to each object YY in CC the set of morphisms HomC(X,Y)Hom_C(X, Y)
  • The Yoneda lemma states that for any functor F:CSetF: C \to Set and object XX in CC, there is a bijection between the set of natural transformations Nat(HomC(X,),F)Nat(Hom_C(X, -), F) and the set F(X)F(X)
  • The Yoneda lemma is a fundamental result in category theory that involves functors and natural transformations
    • It allows for the study of objects in a category through their relationships with other objects, as captured by the representable functors

Applications of functors and natural transformations

  • Functors and natural transformations are used to study and compare different mathematical structures
    • Such as algebras, topological spaces, and sheaves, by examining their categorical properties and relationships
  • Functors and natural transformations provide a unified framework for understanding and relating various mathematical concepts
    • For example, the concept of a group can be generalized to the notion of a group object in a category, which is defined using functors and natural transformations
  • Functors and natural transformations are essential tools in homological algebra and algebraic topology
    • They allow for the construction of algebraic invariants (such as homology and cohomology groups) that capture important topological properties of spaces
© 2024 Fiveable Inc. All rights reserved.
AP® and SAT® are trademarks registered by the College Board, which is not affiliated with, and does not endorse this website.


© 2024 Fiveable Inc. All rights reserved.
AP® and SAT® are trademarks registered by the College Board, which is not affiliated with, and does not endorse this website.

© 2024 Fiveable Inc. All rights reserved.
AP® and SAT® are trademarks registered by the College Board, which is not affiliated with, and does not endorse this website.
Glossary
Glossary