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

Adjoint functors are like matchmakers between categories, pairing up objects and morphisms in a special way. They help us see connections between different mathematical structures and give us tools to move between them.

Left and right adjoints have unique properties, preserving certain structures as they map between categories. Understanding adjoint functors is key to grasping how different mathematical worlds relate to each other.

Adjoint Functors and Adjoints

Defining Adjoint Functors

Top images from around the web for Defining Adjoint Functors
Top images from around the web for Defining Adjoint Functors
  • Adjoint functors consist of a pair of functors F:CDF: \mathcal{C} \to \mathcal{D} and G:DCG: \mathcal{D} \to \mathcal{C} between categories C\mathcal{C} and D\mathcal{D}
  • Adjoint functors establish a relationship between the morphisms in the two categories
  • The existence of an adjunction implies that the categories C\mathcal{C} and D\mathcal{D} share similar properties and structures
  • Adjoint functors play a crucial role in understanding the connections and similarities between different mathematical structures

Left and Right Adjoints

  • If F:CDF: \mathcal{C} \to \mathcal{D} and G:DCG: \mathcal{D} \to \mathcal{C} form an adjoint pair, FF is called the of GG, and GG is called the of FF
  • The left adjoint FF preserves colimits (coproducts, coequalizers) from C\mathcal{C} to D\mathcal{D}
  • The right adjoint GG preserves limits (products, equalizers) from D\mathcal{D} to C\mathcal{C}
  • The existence of a left or right adjoint for a provides additional properties and insights into the functor's behavior (preservation of certain categorical constructions)

Adjunction Isomorphism

  • An adjunction between functors F:CDF: \mathcal{C} \to \mathcal{D} and G:DCG: \mathcal{D} \to \mathcal{C} is characterized by a : HomD(F(C),D)HomC(C,G(D))\text{Hom}_{\mathcal{D}}(F(C), D) \cong \text{Hom}_{\mathcal{C}}(C, G(D)) for all objects CC in C\mathcal{C} and DD in D\mathcal{D}
  • The adjunction isomorphism relates the morphisms between objects in the categories C\mathcal{C} and D\mathcal{D}
  • The adjunction isomorphism is natural, meaning it commutes with the composition of morphisms in both categories
  • Examples of adjoint functors include:
    • The F:SetGrpF: \mathbf{Set} \to \mathbf{Grp} (from sets to groups) and the G:GrpSetG: \mathbf{Grp} \to \mathbf{Set}
    • The product functor Π:SetISet\Pi: \mathbf{Set}^I \to \mathbf{Set} (from the of II-indexed sets to sets) and the diagonal functor Δ:SetSetI\Delta: \mathbf{Set} \to \mathbf{Set}^I

Universal Properties and Units

Universal Properties

  • A universal property characterizes an object or a in a category by its relationship with other objects and morphisms
  • Universal properties describe the unique existence of morphisms that satisfy certain conditions
  • Objects or morphisms satisfying a universal property are unique up to unique isomorphism
  • Universal properties provide a way to define and characterize mathematical structures categorically
  • Examples of universal properties include:
    • The product of objects in a category (characterized by the existence of unique morphisms from any other object to the product)
    • The coproduct of objects in a category (characterized by the existence of unique morphisms from the coproduct to any other object)

Unit and Counit of Adjunction

  • Given an adjunction between functors F:CDF: \mathcal{C} \to \mathcal{D} and G:DCG: \mathcal{D} \to \mathcal{C}, there exist natural transformations called the of the adjunction
  • The unit of the adjunction is a natural transformation η:1CGF\eta: 1_{\mathcal{C}} \to GF, where 1C1_{\mathcal{C}} is the identity functor on C\mathcal{C}
  • The counit of the adjunction is a natural transformation ε:FG1D\varepsilon: FG \to 1_{\mathcal{D}}, where 1D1_{\mathcal{D}} is the identity functor on D\mathcal{D}
  • The unit and counit satisfy the triangle identities:
    • (εF)(Fη)=1F(\varepsilon F) \circ (F \eta) = 1_F
    • (Gε)(ηG)=1G(G \varepsilon) \circ (\eta G) = 1_G
  • The unit and counit provide a way to relate the compositions of the adjoint functors FF and GG to the identity functors on their respective categories

Adjunctions and Universal Morphisms

  • Adjunctions can be expressed in terms of universal morphisms
  • The unit of an adjunction corresponds to a universal morphism from an object to its image under the right adjoint functor
  • The counit of an adjunction corresponds to a universal morphism from the image of an object under the left adjoint functor to the object itself
  • The universal property of the unit and counit characterizes the adjunction
  • Examples of universal morphisms in adjunctions include:
    • The unit of the free-forgetful adjunction between sets and groups (the inclusion of a set into its free group)
    • The counit of the product-diagonal adjunction between sets and indexed sets (the projection from a product to its components)

Equivalence of Categories

Defining Equivalence of Categories

  • An is a stronger notion than an isomorphism of categories
  • Two categories C\mathcal{C} and D\mathcal{D} are equivalent if there exist functors F:CDF: \mathcal{C} \to \mathcal{D} and G:DCG: \mathcal{D} \to \mathcal{C} such that:
    • There are natural isomorphisms α:GF1C\alpha: GF \to 1_{\mathcal{C}} and β:FG1D\beta: FG \to 1_{\mathcal{D}}
    • The compositions GFGF and FGFG are naturally isomorphic to the identity functors on C\mathcal{C} and D\mathcal{D}, respectively
  • Equivalent categories have the same categorical properties and structure, but may differ in their object and morphism sets
  • Equivalence of categories preserves limits, colimits, and other categorical constructions
  • Examples of equivalent categories include:
    • The category of finite-dimensional vector spaces over a field kk and the category of n×nn \times n matrices over kk
    • The category of sets and the category of complete atomic Boolean algebras

Adjoint Equivalence

  • An adjoint equivalence is a special case of an equivalence of categories
  • In an adjoint equivalence, the functors F:CDF: \mathcal{C} \to \mathcal{D} and G:DCG: \mathcal{D} \to \mathcal{C} form an adjoint pair
  • The unit and counit of the adjunction are natural isomorphisms
  • Adjoint equivalences provide a way to establish the equivalence of categories using the properties of adjoint functors
  • Examples of adjoint equivalences include:
    • The equivalence between the category of finite-dimensional vector spaces over a field kk and the category of finite-dimensional kk-algebras
    • The equivalence between the category of compact Hausdorff spaces and the category of commutative CC^*-algebras

Applications of Equivalence

  • Equivalence of categories allows the transfer of results and properties between equivalent categories
  • Equivalent categories can be used interchangeably in mathematical reasoning and problem-solving
  • Equivalence of categories simplifies the study of complex structures by relating them to simpler or better-understood categories
  • Equivalence of categories is used in various areas of mathematics, including algebra, topology, and geometry, to establish connections and similarities between different mathematical objects and structures
© 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