The Yoneda embedding for preadditive categories

The Yoneda embedding for preadditive categories sends an object Y to the presheaf sending an object X to the group of morphisms X ⟶ Y. At each point, we get an additional End Y-module structure.

We also show that this presheaf is additive and that it is compatible with the normal Yoneda embedding in the expected way and deduce that the preadditive Yoneda embedding is fully faithful.

TODO

• The Yoneda embedding is additive itself

def CategoryTheory.preadditiveYonedaObj {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] (Y : C) : CategoryTheory.Functor Cᵒᵖ (ModuleCat (CategoryTheory.End Y))

The Yoneda embedding for preadditive categories sends an object Y to the presheaf sending an object X to the End Y-module of morphisms X ⟶ Y.

Equations

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

@[simp]

theorem CategoryTheory.preadditiveYonedaObj_map {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] (Y : C) {X✝ Y✝ : Cᵒᵖ} (f : X✝ ⟶ Y✝) : (CategoryTheory.preadditiveYonedaObj Y).map f = ModuleCat.asHom { toFun := fun (g : Opposite.unop X✝ ⟶ Y) => CategoryTheory.CategoryStruct.comp f.unop g, map_add' := ⋯, map_smul' := ⋯ }

@[simp]

theorem CategoryTheory.preadditiveYonedaObj_obj {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] (Y : C) (X : Cᵒᵖ) : (CategoryTheory.preadditiveYonedaObj Y).obj X = ModuleCat.of (CategoryTheory.End Y) (Opposite.unop X ⟶ Y)

def CategoryTheory.preadditiveYoneda {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] : CategoryTheory.Functor C (CategoryTheory.Functor Cᵒᵖ AddCommGrp)

The Yoneda embedding for preadditive categories sends an object Y to the presheaf sending an object X to the group of morphisms X ⟶ Y. At each point, we get an additional End Y-module structure, see preadditiveYonedaObj.

Equations

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

@[simp]

theorem CategoryTheory.preadditiveYoneda_obj {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] (Y : C) : CategoryTheory.preadditiveYoneda.obj Y = (CategoryTheory.preadditiveYonedaObj Y).comp (CategoryTheory.forget₂ (ModuleCat (CategoryTheory.End Y)) AddCommGrp)

@[simp]

theorem CategoryTheory.preadditiveYoneda_map_app_apply {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] {X✝ Y✝ : C} (f : X✝ ⟶ Y✝) (x✝ : Cᵒᵖ) (g : ↑(((fun (Y : C) => (CategoryTheory.preadditiveYonedaObj Y).comp (CategoryTheory.forget₂ (ModuleCat (CategoryTheory.End Y)) AddCommGrp)) X✝).obj x✝)) : ((CategoryTheory.preadditiveYoneda.map f).app x✝) g = CategoryTheory.CategoryStruct.comp g f

def CategoryTheory.preadditiveCoyonedaObj {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] (X : Cᵒᵖ) : CategoryTheory.Functor C (ModuleCat (CategoryTheory.End X))

The Yoneda embedding for preadditive categories sends an object X to the copresheaf sending an object Y to the End X-module of morphisms X ⟶ Y.

Equations

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

@[simp]

theorem CategoryTheory.preadditiveCoyonedaObj_obj {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] (X : Cᵒᵖ) (Y : C) : (CategoryTheory.preadditiveCoyonedaObj X).obj Y = ModuleCat.of (CategoryTheory.End X) (Opposite.unop X ⟶ Y)

@[simp]

theorem CategoryTheory.preadditiveCoyonedaObj_map {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] (X : Cᵒᵖ) {X✝ Y✝ : C} (f : X✝ ⟶ Y✝) : (CategoryTheory.preadditiveCoyonedaObj X).map f = ModuleCat.asHom { toFun := fun (g : Opposite.unop X ⟶ X✝) => CategoryTheory.CategoryStruct.comp g f, map_add' := ⋯, map_smul' := ⋯ }

def CategoryTheory.preadditiveCoyoneda {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] : CategoryTheory.Functor Cᵒᵖ (CategoryTheory.Functor C AddCommGrp)

The Yoneda embedding for preadditive categories sends an object X to the copresheaf sending an object Y to the group of morphisms X ⟶ Y. At each point, we get an additional End X-module structure, see preadditiveCoyonedaObj.

Equations

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

@[simp]

theorem CategoryTheory.preadditiveCoyoneda_obj {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] (X : Cᵒᵖ) : CategoryTheory.preadditiveCoyoneda.obj X = (CategoryTheory.preadditiveCoyonedaObj X).comp (CategoryTheory.forget₂ (ModuleCat (CategoryTheory.End X)) AddCommGrp)

@[simp]

theorem CategoryTheory.preadditiveCoyoneda_map_app_apply {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] {X✝ Y✝ : Cᵒᵖ} (f : X✝ ⟶ Y✝) (x✝ : C) (g : ↑(((fun (X : Cᵒᵖ) => (CategoryTheory.preadditiveCoyonedaObj X).comp (CategoryTheory.forget₂ (ModuleCat (CategoryTheory.End X)) AddCommGrp)) X✝).obj x✝)) : ((CategoryTheory.preadditiveCoyoneda.map f).app x✝) g = CategoryTheory.CategoryStruct.comp f.unop g

instance CategoryTheory.additive_yonedaObj {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] (X : C) : (CategoryTheory.preadditiveYonedaObj X).Additive

Equations

• ⋯ = ⋯

instance CategoryTheory.additive_yonedaObj' {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] (X : C) : (CategoryTheory.preadditiveYoneda.obj X).Additive

Equations

• ⋯ = ⋯

instance CategoryTheory.additive_coyonedaObj {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] (X : Cᵒᵖ) : (CategoryTheory.preadditiveCoyonedaObj X).Additive

Equations

• ⋯ = ⋯

instance CategoryTheory.additive_coyonedaObj' {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] (X : Cᵒᵖ) : (CategoryTheory.preadditiveCoyoneda.obj X).Additive

Equations

• ⋯ = ⋯

@[simp]

theorem CategoryTheory.whiskering_preadditiveYoneda {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] : CategoryTheory.preadditiveYoneda.comp ((CategoryTheory.whiskeringRight Cᵒᵖ AddCommGrp (Type v)).obj (CategoryTheory.forget AddCommGrp)) = CategoryTheory.yoneda

Composing the preadditive yoneda embedding with the forgetful functor yields the regular Yoneda embedding.

@[simp]

theorem CategoryTheory.whiskering_preadditiveCoyoneda {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] : CategoryTheory.preadditiveCoyoneda.comp ((CategoryTheory.whiskeringRight C AddCommGrp (Type v)).obj (CategoryTheory.forget AddCommGrp)) = CategoryTheory.coyoneda

Composing the preadditive yoneda embedding with the forgetful functor yields the regular Yoneda embedding.

instance CategoryTheory.full_preadditiveYoneda {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] : CategoryTheory.preadditiveYoneda.Full

Equations

• ⋯ = ⋯

instance CategoryTheory.full_preadditiveCoyoneda {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] : CategoryTheory.preadditiveCoyoneda.Full

Equations

• ⋯ = ⋯

instance CategoryTheory.faithful_preadditiveYoneda {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] : CategoryTheory.preadditiveYoneda.Faithful

Equations

• ⋯ = ⋯

instance CategoryTheory.faithful_preadditiveCoyoneda {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] : CategoryTheory.preadditiveCoyoneda.Faithful

Equations

• ⋯ = ⋯