Representable Functor
Statement
A functor is representable if there exists an object and a natural isomorphism:
The object is called the representing object. By the Yoneda Lemma, such an isomorphism corresponds to a distinguished element (the universal element): every element of arises uniquely as for some .
Dually, is representable if .
Visualization
represents the underlying-set functor on :
In category Ab (abelian groups):
Hom(ℤ, A) ≅ |A| (underlying set of A)
The bijection sends f : ℤ → A to f(1) ∈ A.
Inverse: given a ∈ A, define f_a(n) = n·a.
Example with A = ℤ/6ℤ:
┌────────────────────────────────────────────┐
│ Hom(ℤ, ℤ/6ℤ) ←→ {0,1,2,3,4,5} │
│ f₀ : n ↦ 0·n ←→ 0 │
│ f₁ : n ↦ n mod 6 ←→ 1 │
│ f₂ : n ↦ 2n mod 6 ←→ 2 │
│ f₃ : n ↦ 3n mod 6 ←→ 3 │
│ f₄ : n ↦ 4n mod 6 ←→ 4 │
│ f₅ : n ↦ 5n mod 6 ←→ 5 │
└────────────────────────────────────────────┘
Universal element: u = 1 ∈ ℤ (the identity map id_ℤ corresponds to 1)
Naturality: for φ : ℤ/6ℤ → ℤ/6ℤ, g ↦ φ(g(1)) = (φ∘g)(1) ✓
Proof Sketch
-
Yoneda gives the bijection: By the Yoneda Lemma, . A representing object is one for which this set of natural isomorphisms is non-empty and the iso picks out the tautological one.
-
The universal element characterises : The element for the natural isomorphism is universal: for any and any , there is a unique with .
-
Representing objects are unique up to isomorphism: If and both represent , the universal property gives morphisms and that compose to identities.
-
The yoneda embedding is fully faithful: This means , so representable functors determine and are determined by their objects.
Connections
Representability is the conceptual core of the Yoneda LemmaYoneda LemmaNatural transformations from a representable functor y_X to F biject with elements of F(X)Read more →. The universal property of free objects in Adjoint FunctorsAdjoint FunctorsA pair of functors L ⊣ R with a natural bijection Hom(LX, Y) ≅ Hom(X, RY)Read more → (free monoid, free group, etc.) can be phrased as: the underlying-set functor is representable, with the free object as representing object. Limits are also representable: — see Limits and ColimitsLimits and ColimitsUniversal cones over diagrams: limits generalize products and equalizers; colimits generalize coproducts and coequalizersRead more →.
Lean4 Proof
import Mathlib.CategoryTheory.Yoneda
open CategoryTheory
/-- The presheaf yoneda.obj X is representable (by X itself).
Mathlib: the instance `IsRepresentable (yoneda.obj X)`. -/
theorem yoneda_obj_is_representable {C : Type*} [Category C] (X : C) :
(yoneda.obj X).IsRepresentable :=
inferInstance
/-- Any presheaf isomorphic to a representable is representable.
Use `IsRepresentable.mk'` which takes a natural isomorphism witness. -/
theorem representable_of_iso {C : Type*} [Category C]
{F : Cᵒᵖ ⥤ Type*} {X : C} (e : yoneda.obj X ≅ F) :
F.IsRepresentable :=
Functor.IsRepresentable.mk' eReferenced by
- Yoneda LemmaCategory Theory