We have called * L ∶ P ⇄ Q ∶ R* an adjoint pair of functions, but of course they more than just functions. If

*is an adjunction,*

**L ⊣ R***says that*

**then property (2) of Galois connections***and*

**∀ p**_{1}, p_{2}∈ P*we have*

**q**_{1}, q_{2}∈ Q**p _{1} ≤ P p_{2} ⇒ L(p_{1}) ≤ Q L(p_{2}) and q_{1} ≤ Q q_{2} ⇒ R(q_{1}) ≤ P R(q_{2})**

That is, the functions * L ∶ P → Q* and

*are actually homomorphisms of posets.*

**R ∶ Q → P**Definition of Functor: Let * C* and

*be categories. A functor*

**D***consists a family of functions:*

**F ∶ C → D**• A function on objects * F ∶ Obj(C) → Obj(D)*,

• For each pair of objects * c_{1}, c_{2} ∈ C* a function on hom sets:

* F ∶ Hom_{C}(c_{1},c_{2}) → Hom_{D}(F(c_{1}),F(c_{2}))*. These functions must preserve the category structure:

(i) Identity: For all objects * c ∈ C* we have

*.*

**F (id**_{c}) = id_{F(c)}(ii) Composition: For all arrows * α, β ∈ C* such that

*is defined, we have*

**β ○ α****F (β ○ α) = F (β) ○ F (α)**

Functors compose in an associative way, and for each category * C* there is a distinguished identity functor

*. In other words, the collection of all categories with functors between them forms a (very big) category, which we denote by*

**id**_{C}∶ C → C*.*

**Cat**This definition is not surprising. It basically says that a functor * F ∶ C → D* sends commutative diagrams in

*to commutative diagrams in*

**C***. That is, for each diagram*

**D***in*

**D ∶ I → C***we have a diagram*

**C***in*

**F**^{I}(D) ∶ I → D*(defined by*

**D***), which is commutative if and only if*

**F**^{I}(D) ∶= F ○ D*is.*

**D**Now let’s try to guess the definition of an “adjunction of categories”. Let * C* and

*be categories and let*

**D***be any two functors. When*

**L ∶ C ⇄ D ∶ R***is a poset, recall that*

**C***we have*

**∀ x, y ∈ C***and we use the notations*

**∣Hom**_{C}(x, y)∣ ∈ {0, 1}**x ≤ y ⇐⇒ ∣Hom _{C}(x,y)∣ = 1**

**x ≤/ y ⇐⇒ ∣Hom _{C}(x,y)∣ = 0**

Thus if * C* and

*are posets, we can rephrase the definition of a poset adjunction*

**D***by stating that ∀ objects*

**L ∶ C ⇄ D ∶ R***and*

**c ∈ C***there exists a bijection of hom sets:*

**d ∈ D****Hom _{C} (c, R(d)) ←→ Hom_{D} (L(d), c)**

In this form the definition now applies to any pair of functors between categories.

However, if we want to preserve the important theorems (uniqueness of adjoints and RAPL) then we need to impose some “naturality” condition on the family of bijections between hom sets. This condition is automatic for posets, so we will have to look elsewhere for motivation.

**Adjoint Functors: **

Let * C* and

*be categories. We say that a pair of functors*

**D***is an adjunction if for all objects*

**L ∶ C ⇄ D ∶ R***and*

**c ∈ C***there exists a bijection of hom sets*

**d ∈ D****Hom _{C} (c, R(d)) ←→ Hom_{D} (L(d), c)**

Furthermore, we require that these bijections fit together in the following “natural” way. For each arrow * γ ∶ c_{2} → c_{1} in C* and each arrow

*we require that the following cube of functions commutes:*

**δ ∶ d**_{1}→ d_{2}in D**Natural Transformation: **

Let C and D be categories and consider two parallel functors * F_{1},F_{2} ∶ C → D*. A natural transformation

*consists of a family of arrows*

**Φ ∶ F ⇒ G***, one for each object*

**Φ**_{c}∶F(c) → R(c)*, such that for each arrow*

**c ∈ C***the following square commutes:*

**γ ∶ c**_{1}→ c_{2}in CThe figure below the square is called a “2-cell diagram”. It hints at the close relationship between category theory and topology.

Let * D^{C}* denote the collection of all functors from

*to*

**C***and natural transformations between them. One can check that this forms a category (called a functor category). Given*

**D***we say that*

**F**_{1}, F_{2}∈ D^{C}*and*

**F**_{1}*are naturally isomorphic if they are isomorphic in*

**F**_{2}*, i.e., if there exists a pair of natural transformations*

**D**^{C}*and*

**Φ ∶ F**_{1}⇒ F_{2}*such that*

**Ψ ∶ F**_{2}⇒ F_{1}*and*

**Ψ ○ Φ = id**_{F1}*are the identity natural transformations. In this case we will write*

**Ψ ○ Φ = id**_{F2}*and we will say that*

**F**_{1}≅ F_{2}*and*

**Φ***are natural isomorphisms.*

**Φ**^{−1}∶= ΨTo develop some intuition for this definition, let * I* be a small category and let

*be any category. We have previously referred to functors*

**C***as “diagrams of shape*

**D ∶ I → C***in*

**I***“. Now we can think of*

**C***as a category of diagrams. Given two such diagrams*

**C**^{I}*, we visualize a natural transformation*

**D**_{1}, D_{2}∈ C^{I}*as a “cylinder”:*

**Φ ∶ D**_{1}⇒ D_{2}The diagrams D1 and D2 need not be commutative, but if they are then the whole cylinder is commutative.

**Limit/Colimit: **

Consider a diagram * D ∶ I → C*. The limit of

*, if it exists, consists of an object*

**D***and a canonical natural transformation*

**lim**_{I}D ∈ C*such that for each object*

**Λ ∶ (lim**_{I}D)^{I}⇒ D*and natural transformation*

**c ∈ C***there exists a unique natural transformation*

**Φ ∶ c**^{I}⇒ D*making the following diagram in*

**υ**^{I}∶ c^{I}⇒ (lim_{I}D)^{I}*commute:*

**C**^{I}**Hom Functors:**

Let * C *be a category. For each object

*the mapping*

**c ∈ C***defines a functor from*

**d ↦ Hom**_{C}(c, d)*to the category of sets Set. We denote it by*

**C****H ^{c} ∶= Hom_{C}(c,−) ∶ C → Set**

To define the action of * H^{c}* on arrows, consider any

*. Then we must have a function*

**δ ∶ d**_{1}→ d_{2}in C*, i.e., a function*

**H**^{c}(δ) ∶ H^{c}(d_{1}) → H^{c}(d_{2})*. There is only one way to define this:*

**H**^{c}(δ) ∶ Hom_{C}(c,d_{1}) → Hom_{C}(c,d_{2})**H ^{c }(δ) (φ) ∶= δ ○ φ**

Similarly, for each arrow * δ ∶ c_{1} → c_{2}* we can define a function

*by*

**H**^{c}(δ) ∶ Hom_{C}(d_{2},c) → Hom_{C}(d_{1},c)*. This again defines a functor into sets, but this time it is from the opposite category*

**H**^{c }(δ) (φ) ∶= φ ○ δ*(which is defined by reversing all arrows in*

**C**^{op}*):*

**C****H _{c} ∶= Hom_{C}(−,c) ∶ C^{op} → Set**

Finally, we can put these two functors together to obtain the hom bifunctor

**Hom _{C}(−,−)∶ C^{op} ×C →Set **

which sends each pair of arrows (* γ ∶ c_{2} → c_{1}, δ ∶ d_{1} → d_{2}*) to the function

**Hom _{C}(γ,δ) ∶ Hom_{C}(c_{1},d_{1}) → Hom_{C}(c_{2},d_{2})**

defined by * φ ↦ δ ○ φ ○ γ*. The product category

**C**^{op}*is defined in the most obvious way.*

**× C****Adjoint Functors: **

Let * C, D* be categories and consider a pair of functors

*. By composing these with the hom bifunctors*

**L ∶ C ⇄ D ∶ R**

**Hom**_{C}*and*

**(−, −)**

**Hom**_{D}*we obtain two parallel bifunctors:*

**(−, −)*** Hom_{C}(−,R(−))∶ C^{op }× D → Set* and

**Hom**_{D}

**(L(−),−)∶ C**^{op }× D → SetWe say that * L ∶ C ⇄ D ∶ R* is an adjunction if the two bifunctors are naturally isomorphic:

* Hom_{C} (−, R(−))* ≅

**Hom**_{D}*……..*

**(L(−), −)**