Comonoid objects in a Cartesian monoidal category. #
The category of comonoid objects in a Cartesian monoidal category is equivalent to the category itself, via the forgetful functor.
The functor from a Cartesian monoidal category to comonoids in that category, equipping every object with the diagonal map as a comultiplication.
Instances For
@[simp]
theorem
CategoryTheory.counit_eq_toUnit
{C : Type u}
[Category.{v, u} C]
[CartesianMonoidalCategory C]
(A : C)
[ComonObj A]
:
@[simp]
theorem
CategoryTheory.comul_eq_lift
{C : Type u}
[Category.{v, u} C]
[CartesianMonoidalCategory C]
(A : C)
[ComonObj A]
:
def
CategoryTheory.isoCartesianComon
{C : Type u}
[Category.{v, u} C]
[CartesianMonoidalCategory C]
(A : Comon C)
:
Every comonoid object in a Cartesian monoidal category is equivalent to the canonical comonoid structure on the underlying object.
Instances For
@[simp]
theorem
CategoryTheory.isoCartesianComon_inv_hom
{C : Type u}
[Category.{v, u} C]
[CartesianMonoidalCategory C]
(A : Comon C)
:
(isoCartesianComon A).inv.hom = CategoryStruct.id ((cartesianComon C).obj A.X).X
@[simp]
theorem
CategoryTheory.isoCartesianComon_hom_hom
{C : Type u}
[Category.{v, u} C]
[CartesianMonoidalCategory C]
(A : Comon C)
:
(isoCartesianComon A).hom.hom = CategoryStruct.id A.X
The category of comonoid objects in a Cartesian monoidal category is equivalent to the category itself, via the forgetful functor.
Instances For
@[simp]
theorem
CategoryTheory.comonEquiv_counitIso
{C : Type u}
[Category.{v, u} C]
[CartesianMonoidalCategory C]
:
comonEquiv.counitIso = NatIso.ofComponents (fun (x : C) => Iso.refl (((cartesianComon C).comp (Comon.forget C)).obj x)) ⋯
@[simp]
theorem
CategoryTheory.comonEquiv_inverse
{C : Type u}
[Category.{v, u} C]
[CartesianMonoidalCategory C]
:
@[simp]
theorem
CategoryTheory.comonEquiv_unitIso
{C : Type u}
[Category.{v, u} C]
[CartesianMonoidalCategory C]
:
@[simp]
theorem
CategoryTheory.comonEquiv_functor
{C : Type u}
[Category.{v, u} C]
[CartesianMonoidalCategory C]
: