The Yoneda embedding

The Yoneda embedding as a functor yoneda : C ⥤ (Cᵒᵖ ⥤ Type v₁), along with an instance that it is FullyFaithful.

Also the Yoneda lemma, yonedaLemma : (yoneda_pairing C) ≅ (yoneda_evaluation C).

References

• Stacks: Opposite Categories and the Yoneda Lemma

@[simp]

theorem CategoryTheory.yoneda_obj_obj {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (Y : Cᵒᵖ) : (CategoryTheory.yoneda.obj X).obj Y = (Y.unop ⟶ X)

@[simp]

theorem CategoryTheory.yoneda_map_app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : ∀ {X Y : C} (f : X ⟶ Y) (Y_1 : Cᵒᵖ) (g : ((fun (X : C) => { toPrefunctor := { obj := fun (Y : Cᵒᵖ) => Y.unop ⟶ X, map := fun {X_1 Y : Cᵒᵖ} (f : X_1 ⟶ Y) (g : (fun (Y : Cᵒᵖ) => Y.unop ⟶ X) X_1) => CategoryTheory.CategoryStruct.comp f.unop g }, map_id := ⋯, map_comp := ⋯ }) X).obj Y_1), (CategoryTheory.yoneda.map f).app Y_1 g = CategoryTheory.CategoryStruct.comp g f

@[simp]

theorem CategoryTheory.yoneda_obj_map {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) : ∀ {X_1 Y : Cᵒᵖ} (f : X_1 ⟶ Y) (g : X_1.unop ⟶ X), (CategoryTheory.yoneda.obj X).map f g = CategoryTheory.CategoryStruct.comp f.unop g

def CategoryTheory.yoneda {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.Functor C (CategoryTheory.Functor Cᵒᵖ (Type v₁))

The Yoneda embedding, as a functor from C into presheaves on C.

See .

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.coyoneda_obj_map {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : Cᵒᵖ) : ∀ {X_1 Y : C} (f : X_1 ⟶ Y) (g : X.unop ⟶ X_1), (CategoryTheory.coyoneda.obj X).map f g = CategoryTheory.CategoryStruct.comp g f

@[simp]

theorem CategoryTheory.coyoneda_obj_obj {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : Cᵒᵖ) (Y : C) : (CategoryTheory.coyoneda.obj X).obj Y = (X.unop ⟶ Y)

@[simp]

theorem CategoryTheory.coyoneda_map_app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : ∀ {X Y : Cᵒᵖ} (f : X ⟶ Y) (Y_1 : C) (g : ((fun (X : Cᵒᵖ) => { toPrefunctor := { obj := fun (Y : C) => X.unop ⟶ Y, map := fun {X_1 Y : C} (f : X_1 ⟶ Y) (g : (fun (Y : C) => X.unop ⟶ Y) X_1) => CategoryTheory.CategoryStruct.comp g f }, map_id := ⋯, map_comp := ⋯ }) X).obj Y_1), (CategoryTheory.coyoneda.map f).app Y_1 g = CategoryTheory.CategoryStruct.comp f.unop g

def CategoryTheory.coyoneda {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.Functor Cᵒᵖ (CategoryTheory.Functor C (Type v₁))

The co-Yoneda embedding, as a functor from Cᵒᵖ into co-presheaves on C.

Equations

• One or more equations did not get rendered due to their size.

theorem CategoryTheory.Yoneda.obj_map_id {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} {Y : C} (f : Opposite.op X ⟶ Opposite.op Y) : (CategoryTheory.yoneda.obj X).map f (CategoryTheory.CategoryStruct.id X) = (CategoryTheory.yoneda.map f.unop).app (Opposite.op Y) (CategoryTheory.CategoryStruct.id Y)

@[simp]

theorem CategoryTheory.Yoneda.naturality {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} {Y : C} (α : CategoryTheory.yoneda.obj X ⟶ CategoryTheory.yoneda.obj Y) {Z : C} {Z' : C} (f : Z ⟶ Z') (h : Z' ⟶ X) : CategoryTheory.CategoryStruct.comp f (α.app (Opposite.op Z') h) = α.app (Opposite.op Z) (CategoryTheory.CategoryStruct.comp f h)

instance CategoryTheory.Yoneda.yonedaFull {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.Functor.Full CategoryTheory.yoneda

The Yoneda embedding is full.

See .

Equations

• One or more equations did not get rendered due to their size.

instance CategoryTheory.Yoneda.yoneda_faithful {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.Functor.Faithful CategoryTheory.yoneda

The Yoneda embedding is faithful.

See .

Equations

• ⋯ = ⋯

def CategoryTheory.Yoneda.ext {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (Y : C) (p : {Z : C} → (Z ⟶ X) → (Z ⟶ Y)) (q : {Z : C} → (Z ⟶ Y) → (Z ⟶ X)) (h₁ : ∀ {Z : C} (f : Z ⟶ X), q (p f) = f) (h₂ : ∀ {Z : C} (f : Z ⟶ Y), p (q f) = f) (n : ∀ {Z Z' : C} (f : Z' ⟶ Z) (g : Z ⟶ X), p (CategoryTheory.CategoryStruct.comp f g) = CategoryTheory.CategoryStruct.comp f (p g)) : X ≅ Y

Extensionality via Yoneda. The typical usage would be

-- Goal is `X ≅ Y`
apply yoneda.ext,
-- Goals are now functions `(Z ⟶ X) → (Z ⟶ Y)`, `(Z ⟶ Y) → (Z ⟶ X)`, and the fact that these
-- functions are inverses and natural in `Z`.

Equations

• One or more equations did not get rendered due to their size.

theorem CategoryTheory.Yoneda.isIso {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} {Y : C} (f : X ⟶ Y) [CategoryTheory.IsIso (CategoryTheory.yoneda.map f)] : CategoryTheory.IsIso f

If yoneda.map f is an isomorphism, so was f.

@[simp]

theorem CategoryTheory.Coyoneda.naturality {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : Cᵒᵖ} {Y : Cᵒᵖ} (α : CategoryTheory.coyoneda.obj X ⟶ CategoryTheory.coyoneda.obj Y) {Z : C} {Z' : C} (f : Z' ⟶ Z) (h : X.unop ⟶ Z') : CategoryTheory.CategoryStruct.comp (α.app Z' h) f = α.app Z (CategoryTheory.CategoryStruct.comp h f)

instance CategoryTheory.Coyoneda.coyonedaFull {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.Functor.Full CategoryTheory.coyoneda

Equations

• One or more equations did not get rendered due to their size.

instance CategoryTheory.Coyoneda.coyoneda_faithful {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.Functor.Faithful CategoryTheory.coyoneda

Equations

• ⋯ = ⋯

theorem CategoryTheory.Coyoneda.isIso {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : Cᵒᵖ} {Y : Cᵒᵖ} (f : X ⟶ Y) [CategoryTheory.IsIso (CategoryTheory.coyoneda.map f)] : CategoryTheory.IsIso f

If coyoneda.map f is an isomorphism, so was f.

def CategoryTheory.Coyoneda.punitIso : CategoryTheory.coyoneda.obj (Opposite.op PUnit.{v₁ + 1} ) ≅ CategoryTheory.Functor.id (Type v₁)

The identity functor on Type is isomorphic to the coyoneda functor coming from PUnit.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.Coyoneda.objOpOp_inv_app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (X : Cᵒᵖ) : ∀ (a : (CategoryTheory.yoneda.obj X✝).obj X), (CategoryTheory.Coyoneda.objOpOp X✝).inv.app X a = (CategoryTheory.opEquiv (Opposite.op X✝) X).symm a

@[simp]

theorem CategoryTheory.Coyoneda.objOpOp_hom_app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (X : Cᵒᵖ) : ∀ (a : (CategoryTheory.coyoneda.obj (Opposite.op (Opposite.op X✝))).obj X), (CategoryTheory.Coyoneda.objOpOp X✝).hom.app X a = (CategoryTheory.opEquiv (Opposite.op X✝) X) a

def CategoryTheory.Coyoneda.objOpOp {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) : CategoryTheory.coyoneda.obj (Opposite.op (Opposite.op X)) ≅ CategoryTheory.yoneda.obj X

Taking the unop of morphisms is a natural isomorphism.

Equations

• CategoryTheory.Coyoneda.objOpOp X = CategoryTheory.NatIso.ofComponents (fun (x : Cᵒᵖ) => Equiv.toIso (CategoryTheory.opEquiv (Opposite.op (Opposite.op X)).unop x)) ⋯

class CategoryTheory.Functor.Representable {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v₁)) : Prop

A functor F : Cᵒᵖ ⥤ Type v₁ is representable if there is object X so F ≅ yoneda.obj X.

See .

• has_representation : ∃ (X : C), Nonempty (CategoryTheory.yoneda.obj X ≅ F)

  Hom(-,X) ≅ F via f

instance CategoryTheory.Functor.instRepresentableObjToQuiverToCategoryStructFunctorOppositeOppositeTypeTypesToQuiverToCategoryStructCategoryToPrefunctorYoneda {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} : CategoryTheory.Functor.Representable (CategoryTheory.yoneda.obj X)

Equations

• ⋯ = ⋯

class CategoryTheory.Functor.Corepresentable {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor C (Type v₁)) : Prop

A functor F : C ⥤ Type v₁ is corepresentable if there is object X so F ≅ coyoneda.obj X.

See .

• has_corepresentation : ∃ (X : Cᵒᵖ), Nonempty (CategoryTheory.coyoneda.obj X ≅ F)

  Hom(X,-) ≅ F via f

instance CategoryTheory.Functor.instCorepresentableObjOppositeToQuiverToCategoryStructOppositeFunctorTypeTypesToQuiverToCategoryStructCategoryToPrefunctorCoyoneda {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : Cᵒᵖ} : CategoryTheory.Functor.Corepresentable (CategoryTheory.coyoneda.obj X)

Equations

• ⋯ = ⋯

noncomputable def CategoryTheory.Functor.reprX {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v₁)) [hF : CategoryTheory.Functor.Representable F] : C

The representing object for the representable functor F.

Equations

• CategoryTheory.Functor.reprX F = Exists.choose ⋯

noncomputable def CategoryTheory.Functor.reprW {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v₁)) [hF : CategoryTheory.Functor.Representable F] : CategoryTheory.yoneda.obj (CategoryTheory.Functor.reprX F) ≅ F

An isomorphism between a representable F and a functor of the form C(-, F.reprX). Note the components F.reprW.app X definitionally have type (X.unop ⟶ F.repr_X) ≅ F.obj X.

Equations

• CategoryTheory.Functor.reprW F = Nonempty.some ⋯

noncomputable def CategoryTheory.Functor.reprx {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v₁)) [hF : CategoryTheory.Functor.Representable F] : F.obj (Opposite.op (CategoryTheory.Functor.reprX F))

The representing element for the representable functor F, sometimes called the universal element of the functor.

Equations

• CategoryTheory.Functor.reprx F = (CategoryTheory.Functor.reprW F).hom.app (Opposite.op (CategoryTheory.Functor.reprX F)) (CategoryTheory.CategoryStruct.id (CategoryTheory.Functor.reprX F))

theorem CategoryTheory.Functor.reprW_app_hom {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v₁)) [hF : CategoryTheory.Functor.Representable F] (X : Cᵒᵖ) (f : X.unop ⟶ CategoryTheory.Functor.reprX F) : ((CategoryTheory.Functor.reprW F).app X).hom f = F.map f.op (CategoryTheory.Functor.reprx F)

noncomputable def CategoryTheory.Functor.coreprX {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor C (Type v₁)) [hF : CategoryTheory.Functor.Corepresentable F] : C

The representing object for the corepresentable functor F.

Equations

• CategoryTheory.Functor.coreprX F = (Exists.choose ⋯).unop

noncomputable def CategoryTheory.Functor.coreprW {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor C (Type v₁)) [hF : CategoryTheory.Functor.Corepresentable F] : CategoryTheory.coyoneda.obj (Opposite.op (CategoryTheory.Functor.coreprX F)) ≅ F

An isomorphism between a corepresnetable F and a functor of the form C(F.corepr X, -). Note the components F.coreprW.app X definitionally have type F.corepr_X ⟶ X ≅ F.obj X.

Equations

• CategoryTheory.Functor.coreprW F = Nonempty.some ⋯

noncomputable def CategoryTheory.Functor.coreprx {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor C (Type v₁)) [hF : CategoryTheory.Functor.Corepresentable F] : F.obj (CategoryTheory.Functor.coreprX F)

The representing element for the corepresentable functor F, sometimes called the universal element of the functor.

Equations

• CategoryTheory.Functor.coreprx F = (CategoryTheory.Functor.coreprW F).hom.app (CategoryTheory.Functor.coreprX F) (CategoryTheory.CategoryStruct.id (CategoryTheory.Functor.coreprX F))

theorem CategoryTheory.Functor.coreprW_app_hom {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor C (Type v₁)) [hF : CategoryTheory.Functor.Corepresentable F] (X : C) (f : CategoryTheory.Functor.coreprX F ⟶ X) : ((CategoryTheory.Functor.coreprW F).app X).hom f = F.map f (CategoryTheory.Functor.coreprx F)

theorem CategoryTheory.representable_of_natIso {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v₁)) {G : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (i : F ≅ G) [CategoryTheory.Functor.Representable F] : CategoryTheory.Functor.Representable G

theorem CategoryTheory.corepresentable_of_natIso {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor C (Type v₁)) {G : CategoryTheory.Functor C (Type v₁)} (i : F ≅ G) [CategoryTheory.Functor.Corepresentable F] : CategoryTheory.Functor.Corepresentable G

instance CategoryTheory.instCorepresentableTypeTypesId : CategoryTheory.Functor.Corepresentable (CategoryTheory.Functor.id (Type v₁))

Equations

• CategoryTheory.instCorepresentableTypeTypesId = ⋯

instance CategoryTheory.prodCategoryInstance1 (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.Category.{max u₁ v₁, max u₁ (max (v₁ + 1) u₁) v₁} (CategoryTheory.Functor Cᵒᵖ (Type v₁) × Cᵒᵖ)

Equations

• CategoryTheory.prodCategoryInstance1 C = CategoryTheory.prod (CategoryTheory.Functor Cᵒᵖ (Type v₁)) Cᵒᵖ

instance CategoryTheory.prodCategoryInstance2 (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.Category.{max u₁ v₁, max (max (max (v₁ + 1) u₁) v₁) u₁} (Cᵒᵖ × CategoryTheory.Functor Cᵒᵖ (Type v₁))

Equations

• CategoryTheory.prodCategoryInstance2 C = CategoryTheory.prod Cᵒᵖ (CategoryTheory.Functor Cᵒᵖ (Type v₁))

def CategoryTheory.yonedaEvaluation (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.Functor (Cᵒᵖ × CategoryTheory.Functor Cᵒᵖ (Type v₁)) (Type (max u₁ v₁))

The "Yoneda evaluation" functor, which sends X : Cᵒᵖ and F : Cᵒᵖ ⥤ Type to F.obj X, functorially in both X and F.

Equations

• CategoryTheory.yonedaEvaluation C = CategoryTheory.Functor.comp (CategoryTheory.evaluationUncurried Cᵒᵖ (Type v₁)) CategoryTheory.uliftFunctor.{u₁, v₁}

@[simp]

theorem CategoryTheory.yonedaEvaluation_map_down (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] (P : Cᵒᵖ × CategoryTheory.Functor Cᵒᵖ (Type v₁)) (Q : Cᵒᵖ × CategoryTheory.Functor Cᵒᵖ (Type v₁)) (α : P ⟶ Q) (x : (CategoryTheory.yonedaEvaluation C).obj P) : ((CategoryTheory.yonedaEvaluation C).map α x).down = α.2.app Q.1 (P.2.map α.1 x.down)

def CategoryTheory.yonedaPairing (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.Functor (Cᵒᵖ × CategoryTheory.Functor Cᵒᵖ (Type v₁)) (Type (max u₁ v₁))

The "Yoneda pairing" functor, which sends X : Cᵒᵖ and F : Cᵒᵖ ⥤ Type to yoneda.op.obj X ⟶ F, functorially in both X and F.

Equations

• One or more equations did not get rendered due to their size.

theorem CategoryTheory.yonedaPairingExt (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] {X : Cᵒᵖ × CategoryTheory.Functor Cᵒᵖ (Type v₁)} {x : (CategoryTheory.yonedaPairing C).obj X} {y : (CategoryTheory.yonedaPairing C).obj X} (w : ∀ (Y : Cᵒᵖ), x.app Y = y.app Y) : x = y

@[simp]

theorem CategoryTheory.yonedaPairing_map (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] (P : Cᵒᵖ × CategoryTheory.Functor Cᵒᵖ (Type v₁)) (Q : Cᵒᵖ × CategoryTheory.Functor Cᵒᵖ (Type v₁)) (α : P ⟶ Q) (β : (CategoryTheory.yonedaPairing C).obj P) : (CategoryTheory.yonedaPairing C).map α β = CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map α.1.unop) (CategoryTheory.CategoryStruct.comp β α.2)

def CategoryTheory.yonedaCompUliftFunctorEquiv {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor Cᵒᵖ (Type (max v₁ w))) (X : C) : (CategoryTheory.Functor.comp (CategoryTheory.yoneda.obj X) CategoryTheory.uliftFunctor.{w, v₁} ⟶ F) ≃ F.obj (Opposite.op X)

A bijection (yoneda.obj X ⋙ uliftFunctor ⟶ F) ≃ F.obj (op X) which is a variant of yonedaEquiv with heterogeneous universes.

Equations

• One or more equations did not get rendered due to their size.

def CategoryTheory.yonedaLemma (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.yonedaPairing C ≅ CategoryTheory.yonedaEvaluation C

The Yoneda lemma asserts that the Yoneda pairing (X : Cᵒᵖ, F : Cᵒᵖ ⥤ Type) ↦ (yoneda.obj (unop X) ⟶ F) is naturally isomorphic to the evaluation (X, F) ↦ F.obj X.

See .

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem CategoryTheory.yonedaSections_inv_app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ (Type v₁)) : ∀ (a : (CategoryTheory.yonedaEvaluation C).obj (Opposite.op X, F)) (X_1 : Cᵒᵖ) (a_1 : ((CategoryTheory.Functor.prod CategoryTheory.yoneda.op (CategoryTheory.Functor.id (CategoryTheory.Functor Cᵒᵖ (Type v₁)))).obj (Opposite.op X, F)).1.unop.obj X_1), ((CategoryTheory.yonedaSections X F).inv a).app X_1 a_1 = F.map a_1.op a.down

@[simp]

theorem CategoryTheory.yonedaSections_hom_down {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ (Type v₁)) : ∀ (a : (CategoryTheory.yonedaPairing C).obj (Opposite.op X, F)), ((CategoryTheory.yonedaSections X F).hom a).down = a.app (Opposite.op X) (CategoryTheory.CategoryStruct.id X)

def CategoryTheory.yonedaSections {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ (Type v₁)) : (CategoryTheory.yoneda.obj X ⟶ F) ≅ ULift.{u₁, v₁} (F.obj (Opposite.op X))

The isomorphism between yoneda.obj X ⟶ F and F.obj (op X) (we need to insert a ULift to get the universes right!) given by the Yoneda lemma.

Equations

• CategoryTheory.yonedaSections X F = (CategoryTheory.yonedaLemma C).app (Opposite.op X, F)

def CategoryTheory.yonedaEquiv {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} : (CategoryTheory.yoneda.obj X ⟶ F) ≃ F.obj (Opposite.op X)

We have a type-level equivalence between natural transformations from the yoneda embedding and elements of F.obj X, without any universe switching.

Equations

• CategoryTheory.yonedaEquiv = (CategoryTheory.yonedaSections X F).trans Equiv.ulift

theorem CategoryTheory.yonedaEquiv_apply {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (f : CategoryTheory.yoneda.obj X ⟶ F) : CategoryTheory.yonedaEquiv f = f.app (Opposite.op X) (CategoryTheory.CategoryStruct.id X)

@[simp]

theorem CategoryTheory.yonedaEquiv_symm_app_apply {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (x : F.obj (Opposite.op X)) (Y : Cᵒᵖ) (f : Y.unop ⟶ X) : (CategoryTheory.yonedaEquiv.symm x).app Y f = F.map f.op x

theorem CategoryTheory.yonedaEquiv_naturality {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} {Y : C} {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (f : CategoryTheory.yoneda.obj X ⟶ F) (g : Y ⟶ X) : F.map g.op (CategoryTheory.yonedaEquiv f) = CategoryTheory.yonedaEquiv (CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map g) f)

theorem CategoryTheory.yonedaEquiv_naturality' {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : Cᵒᵖ} {Y : Cᵒᵖ} {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (f : CategoryTheory.yoneda.obj X.unop ⟶ F) (g : X ⟶ Y) : F.map g (CategoryTheory.yonedaEquiv f) = CategoryTheory.yonedaEquiv (CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map g.unop) f)

theorem CategoryTheory.yonedaEquiv_comp {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} {G : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (α : CategoryTheory.yoneda.obj X ⟶ F) (β : F ⟶ G) : CategoryTheory.yonedaEquiv (CategoryTheory.CategoryStruct.comp α β) = β.app (Opposite.op X) (CategoryTheory.yonedaEquiv α)

theorem CategoryTheory.yonedaEquiv_comp' {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : Cᵒᵖ} {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} {G : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (α : CategoryTheory.yoneda.obj X.unop ⟶ F) (β : F ⟶ G) : CategoryTheory.yonedaEquiv (CategoryTheory.CategoryStruct.comp α β) = β.app X (CategoryTheory.yonedaEquiv α)

@[simp]

theorem CategoryTheory.yonedaEquiv_yoneda_map {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} {Y : C} (f : X ⟶ Y) : CategoryTheory.yonedaEquiv (CategoryTheory.yoneda.map f) = f

theorem CategoryTheory.yonedaEquiv_symm_map {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : Cᵒᵖ} {Y : Cᵒᵖ} (f : X ⟶ Y) {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (t : F.obj X) : CategoryTheory.yonedaEquiv.symm (F.map f t) = CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map f.unop) (CategoryTheory.yonedaEquiv.symm t)

def CategoryTheory.yonedaSectionsSmall {C : Type u₁} [CategoryTheory.SmallCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ (Type u₁)) : (CategoryTheory.yoneda.obj X ⟶ F) ≅ F.obj (Opposite.op X)

When C is a small category, we can restate the isomorphism from yoneda_sections without having to change universes.

Equations

• CategoryTheory.yonedaSectionsSmall X F = CategoryTheory.yonedaSections X F ≪≫ CategoryTheory.uliftTrivial (F.obj (Opposite.op X))

@[simp]

theorem CategoryTheory.yonedaSectionsSmall_hom {C : Type u₁} [CategoryTheory.SmallCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ (Type u₁)) (f : CategoryTheory.yoneda.obj X ⟶ F) : (CategoryTheory.yonedaSectionsSmall X F).hom f = f.app { unop := X } (CategoryTheory.CategoryStruct.id { unop := X }.unop)

@[simp]

theorem CategoryTheory.yonedaSectionsSmall_inv_app_apply {C : Type u₁} [CategoryTheory.SmallCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ (Type u₁)) (t : F.obj (Opposite.op X)) (Y : Cᵒᵖ) (f : Y.unop ⟶ X) : ((CategoryTheory.yonedaSectionsSmall X F).inv t).app Y f = F.map f.op t

def CategoryTheory.curriedYonedaLemma {C : Type u₁} [CategoryTheory.SmallCategory C] : CategoryTheory.Functor.comp CategoryTheory.yoneda.op CategoryTheory.coyoneda ≅ CategoryTheory.evaluation Cᵒᵖ (Type u₁)

The curried version of yoneda lemma when C is small.

Equations

• One or more equations did not get rendered due to their size.

def CategoryTheory.curriedYonedaLemma' {C : Type u₁} [CategoryTheory.SmallCategory C] : CategoryTheory.Functor.comp CategoryTheory.yoneda ((CategoryTheory.whiskeringLeft Cᵒᵖ (CategoryTheory.Functor Cᵒᵖ (Type u₁))ᵒᵖ (Type u₁)).obj CategoryTheory.yoneda.op) ≅ CategoryTheory.Functor.id (CategoryTheory.Functor Cᵒᵖ (Type u₁))

The curried version of yoneda lemma when C is small.

Equations

• One or more equations did not get rendered due to their size.

theorem CategoryTheory.isIso_of_yoneda_map_bijective {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} {Y : C} (f : X ⟶ Y) (hf : ∀ (T : C), Function.Bijective fun (x : T ⟶ X) => CategoryTheory.CategoryStruct.comp x f) : CategoryTheory.IsIso f