Let hA = Hom(A,-) and hB = Hom(-,B)
hA(f) = Hom(A,f) = the set map that sends g → gf (do g then do f)
hB(f) = Hom(f, B) = the map that sends g → fg (precomposing with f)
Let hf = Hom(f, -) and hf = Hom(-, f). These are natural transformations
hf: hB → hA by
hf(X): hB(X) → hA(X) which sends g: B → X to fg: A → X
So hf(X) = hX(f). So a way to remember is to recall that X is always above f
Similarly, hf: hA → hB given by sending g: X → A to gf : X → B
Thus hf(X) = hX(f)
hAB = hBA = hA(B) = hB(A) = Hom(A,B)
hf(X) = hX(f) = hfX = hfX= Hom(f,X) hf(X) = hX(f) = hXf = hfX = Hom(X,f)
So this notation is actually really nice, and lets us do some tensor-like analysis
Let C be a locally small category (small morphisms)
Nat(hA, F) ≅ F(A) as a natural isomorphism
More precisely, say η : hA → F is a natural transformation We identify it with the element ηA(idA) ∈ F(A)
To see naturality, we need to view these as functors from C × SetC → Set
Nat(h•, •) : A × F → Nat(hA, F) ε: A × F → F(A)
Say f: A → B. We have
Nat(h, -)(f, η) : Nat(hA, F) → Nat(hB, G)
sends a φ: hA ⇒ F to the natural transformation hf φ η
hf: hB ⇒ hA
ε(f, η) : F(A) → G(B)
We define this by ε(f,η) = ηA G(f) Note that by naturality of η, this is also F(f) ηB
η: F ⇒ G ηA: F(A) → G(A)
ηA G(f): F(A) → G(B)
Let Φ: Nat(h, -) ⇒ ε
If f: A → B and η: F → G , forming a morphism (f, η) in C × SetC then naturality requires that
Φ(A,F) ε(f, η) = Nat(f, η) Φ(B,G)
Φ(A,F) ηA G(f) = hf (-) η Φ(B,G)
Nat(hA, F) → Nat(hB, G) ↓ ↓ F(A) → G(B)
Right-Down
hf (-) η Φ(B,G): ψ → Φ(B,G) [hf ψ η ] = (hf(B) ψB ηB)(idB) = hB(f) ψB ηB : Hom(B,B) → G(B) applied to idB
hB(f): hB(B) → hB(A) = hA(B)
hB(f)(idB) = f
So we end up with ηB(ψB(f))
Down-Right
Φ(A,F) : Nat(hA, F) → F(A) ψ → ψA(idA)
We then apply ε(f,η) = ηA G(f), which sends this to
G(f)(ηA(ψA(idA)))
Then we can pull G(f) through, since η and ψ are natural transformations
We get ηB(ψB(G(f)(idA))) = G(f)(ηA(ψA(idA))) = (ηB ˆ F(f) ˆ ψA)(idA) = (ηB ˆ ψB ˆ hA(f))(idA) = (ηB ˆ ψB)(f)
Nat(hA, G) ≅ G(A)
If we have such a natural transformation,
We have Nat(hA , hB) ≅ hB(A) = Hom(B,A)
Then the map C → SetC given by A → hA is a contravariant functor that is fully faithful So Cop is embedded in SetC.
Similarly, Nat(hA , hB) ≅ hB(A) = Hom(A,B)
Giving a fully faithful covariant functor C → SetCop
In this way, we can think of C as being embedded in the category of presheaves on it.
In fact we have that Cop ≅ hA|A ∈ C and C ≅ hA|A ∈ C
In algebraic geometry and topos theory, we will often think of categories as categories of presheaves, and determine whether the presheaves are actually sheaves.
This corresponds to saying that our category is a Grothendieck topos.
A functor such that F ≅ hA for some A is said to be represented by A A representable presheaf is F ≅ hA
So the Yoneda embedding gives a way of thinking of every object in C as representing its own presheaf
These correspond to isomorphisms in Nat(hA, F)
Using the Yoneda lemma, given any (X, x) with x ∈ F(X), this corresponds to ψx = F(-)(x) : hA ⇒ F
Say we had some u such that ψu is a natural isomorphism. In particular, we have F ⇒ hA
This tells us that given any x ∈ F(X), we get a bijection F(X) ≅ hAX which will send x → fx
Then by applying ψu, we get that F(fx)(u) = x
Since it's a bijection, this is the unique such map with this property.
This is usually stated as:
Given any (x,X) with x ∈ F(X), there is a unique map f: A → X such that F(f)(u) = x.
This is the thing that shows up when we talk about universal properties
Consider the functor category
If we take a limit/colimit in D, then we can compute the corresponding limit/colimit in [C,D] objectwise
Let Φ : J → [C,D] be a functor.
lim Φ is an object in [C,D] (a functor) along with maps into each Φ(F)
Let X ∈ C. We can define ΦX : J → D
by ΦX(A) = Φ(A)[X]
We can define a new functor in [C,D] as follows:
Take Φ* : C → D to be
Φ*(X) = lim ΦX
This will end up being the limit of Φ
In particular, if we look at hA or hB, we can express limits and colimits in a nice way
(hA × hB)(X) = hA(X) × hB(X)
Similarly, the fiber product / pullback is
hA ×x hB = hA(X) ×x hB(X)