Yoneda embedding of Mon C

We show that monoid objects in Cartesian monoidal categories are exactly those whose yoneda presheaf is a presheaf of monoids, by constructing the yoneda embedding Mon C ⥤ Cᵒᵖ ⥤ MonCat.{v} and showing that it is fully faithful and its (essential) image is the representable functors.

instance CategoryTheory.MonObj.instIsMonHomToUnit {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M : C} [MonObj M] : IsMonHom (SemiCartesianMonoidalCategory.toUnit M)

instance CategoryTheory.MonObj.instIsMonHomOne {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M : C} [MonObj M] : IsMonHom one

theorem CategoryTheory.MonObj.lift_lift_assoc {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {A B : C} [MonObj B] (f g h : A ⟶ B) : CategoryStruct.comp (CartesianMonoidalCategory.lift (CategoryStruct.comp (CartesianMonoidalCategory.lift f g) mul) h) mul = CategoryStruct.comp (CartesianMonoidalCategory.lift f (CategoryStruct.comp (CartesianMonoidalCategory.lift g h) mul)) mul

@[simp]

theorem CategoryTheory.MonObj.lift_comp_one_left {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {A B : C} [MonObj B] (f : A ⟶ MonoidalCategoryStruct.tensorUnit C) (g : A ⟶ B) : CategoryStruct.comp (CartesianMonoidalCategory.lift (CategoryStruct.comp f one) g) mul = g

@[simp]

theorem CategoryTheory.MonObj.lift_comp_one_left_assoc {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {A B : C} [MonObj B] (f : A ⟶ MonoidalCategoryStruct.tensorUnit C) (g : A ⟶ B) {Z : C} (h : B ⟶ Z) : CategoryStruct.comp (CartesianMonoidalCategory.lift (CategoryStruct.comp f one) g) (CategoryStruct.comp mul h) = CategoryStruct.comp g h

@[simp]

theorem CategoryTheory.MonObj.lift_comp_one_right {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {A B : C} [MonObj B] (f : A ⟶ B) (g : A ⟶ MonoidalCategoryStruct.tensorUnit C) : CategoryStruct.comp (CartesianMonoidalCategory.lift f (CategoryStruct.comp g one)) mul = f

@[simp]

theorem CategoryTheory.MonObj.lift_comp_one_right_assoc {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {A B : C} [MonObj B] (f : A ⟶ B) (g : A ⟶ MonoidalCategoryStruct.tensorUnit C) {Z : C} (h : B ⟶ Z) : CategoryStruct.comp (CartesianMonoidalCategory.lift f (CategoryStruct.comp g one)) (CategoryStruct.comp mul h) = CategoryStruct.comp f h

instance CategoryTheory.MonObj.instIsMonHomFst {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N : C} [MonObj M] [MonObj N] [BraidedCategory C] : IsMonHom (SemiCartesianMonoidalCategory.fst M N)

instance CategoryTheory.MonObj.instIsMonHomSnd {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N : C} [MonObj M] [MonObj N] [BraidedCategory C] : IsMonHom (SemiCartesianMonoidalCategory.snd M N)

instance CategoryTheory.MonObj.instIsMonHomLift {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N O : C} [MonObj M] [MonObj N] [MonObj O] [BraidedCategory C] {f : M ⟶ N} {g : M ⟶ O} [IsMonHom f] [IsMonHom g] : IsMonHom (CartesianMonoidalCategory.lift f g)

instance CategoryTheory.MonObj.instIsMonHomMulOfIsCommMonObj {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M : C} [MonObj M] [BraidedCategory C] [IsCommMonObj M] : IsMonHom mul

instance CategoryTheory.Mon.instCartesianMonoidalCategory {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [BraidedCategory C] : CartesianMonoidalCategory (Mon C)

@[simp]

theorem CategoryTheory.Mon.lift_hom {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [BraidedCategory C] {M N₁ N₂ : Mon C} (f : M ⟶ N₁) (g : M ⟶ N₂) : (CartesianMonoidalCategory.lift f g).hom = CartesianMonoidalCategory.lift f.hom g.hom

@[simp]

theorem CategoryTheory.Mon.fst_hom {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [BraidedCategory C] (M N : Mon C) : (SemiCartesianMonoidalCategory.fst M N).hom = SemiCartesianMonoidalCategory.fst M.X N.X

@[simp]

theorem CategoryTheory.Mon.snd_hom {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [BraidedCategory C] (M N : Mon C) : (SemiCartesianMonoidalCategory.snd M N).hom = SemiCartesianMonoidalCategory.snd M.X N.X

Comm monoid objects are internal monoid objects

instance CategoryTheory.Mon.instMonObjOfIsCommMonObjX {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [BraidedCategory C] {M : Mon C} [IsCommMonObj M.X] : MonObj M

A commutative monoid object is a monoid object in the category of monoid objects.

@[simp]

theorem CategoryTheory.Mon.hom_one {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [BraidedCategory C] (M : Mon C) [IsCommMonObj M.X] : MonObj.one.hom = MonObj.one

@[simp]

theorem CategoryTheory.Mon.hom_mul {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [BraidedCategory C] (M : Mon C) [IsCommMonObj M.X] : MonObj.mul.hom = MonObj.mul

instance CategoryTheory.Mon.instIsCommMonObj {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [BraidedCategory C] {M : Mon C} [IsCommMonObj M.X] : IsCommMonObj M

A commutative monoid object is a commutative monoid object in the category of monoid objects.

def CategoryTheory.MonObj.ofRepresentableBy {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (X : C) (F : Functor Cᵒᵖ MonCat) (α : (F.comp (forget MonCat)).RepresentableBy X) : MonObj X

If X represents a presheaf of monoids, then X is a monoid object.

@[simp]

theorem CategoryTheory.MonObj.ofRepresentableBy_one {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (X : C) (F : Functor Cᵒᵖ MonCat) (α : (F.comp (forget MonCat)).RepresentableBy X) : one = α.homEquiv.symm 1

@[simp]

theorem CategoryTheory.MonObj.ofRepresentableBy_mul {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (X : C) (F : Functor Cᵒᵖ MonCat) (α : (F.comp (forget MonCat)).RepresentableBy X) : mul = α.homEquiv.symm (α.homEquiv (SemiCartesianMonoidalCategory.fst X X) * α.homEquiv (SemiCartesianMonoidalCategory.snd X X))

@[deprecated CategoryTheory.MonObj.ofRepresentableBy (since := "2025-09-09")]

def CategoryTheory.Mon_Class.ofRepresentableBy {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (X : C) (F : Functor Cᵒᵖ MonCat) (α : (F.comp (forget MonCat)).RepresentableBy X) : MonObj X

Alias of CategoryTheory.MonObj.ofRepresentableBy.

---

If X represents a presheaf of monoids, then X is a monoid object.

@[deprecated CategoryTheory.MonObj.ofRepresentableBy (since := "2025-09-09")]

def CategoryTheory.Mon_ClassOfRepresentableBy {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (X : C) (F : Functor Cᵒᵖ MonCat) (α : (F.comp (forget MonCat)).RepresentableBy X) : MonObj X

Alias of CategoryTheory.MonObj.ofRepresentableBy.

---

If X represents a presheaf of monoids, then X is a monoid object.

@[reducible, inline]

abbrev CategoryTheory.Hom.monoid {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M X : C} [MonObj M] : Monoid (X ⟶ M)

If M is a monoid object, then Hom(X, M) has a monoid structure.

theorem CategoryTheory.Hom.one_def {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M X : C} [MonObj M] : 1 = CategoryStruct.comp (SemiCartesianMonoidalCategory.toUnit X) MonObj.one

theorem CategoryTheory.Hom.mul_def {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M X : C} [MonObj M] (f₁ f₂ : X ⟶ M) : f₁ * f₂ = CategoryStruct.comp (CartesianMonoidalCategory.lift f₁ f₂) MonObj.mul

theorem CategoryTheory.Functor.map_mul {C : Type u_1} {D : Type u_2} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [Category.{w, u_2} D] [CartesianMonoidalCategory D] {M X : C} [MonObj M] (F : Functor C D) [F.Monoidal] (f g : X ⟶ M) : F.map (f * g) = F.map f * F.map g

@[simp]

theorem CategoryTheory.Functor.map_one {C : Type u_1} {D : Type u_2} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [Category.{w, u_2} D] [CartesianMonoidalCategory D] {M X : C} [MonObj M] (F : Functor C D) [F.Monoidal] : F.map 1 = 1

def CategoryTheory.Functor.homMonoidHom {C : Type u_1} {D : Type u_2} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [Category.{w, u_2} D] [CartesianMonoidalCategory D] {M X : C} [MonObj M] (F : Functor C D) [F.Monoidal] : (X ⟶ M) →* (F.obj X ⟶ F.obj M)

Functor.map of a monoidal functor as a MonoidHom.

@[simp]

theorem CategoryTheory.Functor.homMonoidHom_apply {C : Type u_1} {D : Type u_2} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [Category.{w, u_2} D] [CartesianMonoidalCategory D] {M X : C} [MonObj M] (F : Functor C D) [F.Monoidal] (a✝ : X ⟶ M) : F.homMonoidHom a✝ = F.map a✝

def CategoryTheory.Functor.FullyFaithful.homMulEquiv {C : Type u_1} {D : Type u_2} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [Category.{w, u_2} D] [CartesianMonoidalCategory D] {M X : C} [MonObj M] (F : Functor C D) [F.Monoidal] (hF : F.FullyFaithful) : (X ⟶ M) ≃* (F.obj X ⟶ F.obj M)

Functor.map of a fully faithful monoidal functor as a MulEquiv.

@[simp]

theorem CategoryTheory.Functor.FullyFaithful.homMulEquiv_symm_apply {C : Type u_1} {D : Type u_2} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [Category.{w, u_2} D] [CartesianMonoidalCategory D] {M X : C} [MonObj M] (F : Functor C D) [F.Monoidal] (hF : F.FullyFaithful) (f : F.obj X ⟶ F.obj M) : (homMulEquiv F hF).symm f = hF.preimage f

@[simp]

theorem CategoryTheory.Functor.FullyFaithful.homMulEquiv_apply {C : Type u_1} {D : Type u_2} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [Category.{w, u_2} D] [CartesianMonoidalCategory D] {M X : C} [MonObj M] (F : Functor C D) [F.Monoidal] (hF : F.FullyFaithful) (a✝ : X ⟶ M) : (homMulEquiv F hF) a✝ = F.map a✝

@[reducible, inline]

abbrev CategoryTheory.Hom.commMonoid {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M X : C} [MonObj M] [BraidedCategory C] [IsCommMonObj M] : CommMonoid (X ⟶ M)

If M is a commutative monoid object, then Hom(X, M) has a commutative monoid structure.

@[simp]

theorem CategoryTheory.Mon.Hom.hom_one {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [BraidedCategory C] {M N : Mon C} [IsCommMonObj N.X] : hom 1 = 1

@[simp]

theorem CategoryTheory.Mon.Hom.hom_mul {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [BraidedCategory C] {M N : Mon C} [IsCommMonObj N.X] (f g : M ⟶ N) : (f * g).hom = f.hom * g.hom

@[simp]

theorem CategoryTheory.Mon.Hom.hom_pow {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] [BraidedCategory C] {M N : Mon C} [IsCommMonObj N.X] (f : M ⟶ N) (n : ℕ) : (f ^ n).hom = f.hom ^ n

def CategoryTheory.yonedaMonObj {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (M : C) [MonObj M] : Functor Cᵒᵖ MonCat

If M is a monoid object, then Hom(-, M) is a presheaf of monoids.

@[simp]

theorem CategoryTheory.yonedaMonObj_obj_coe {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (M : C) [MonObj M] (X : Cᵒᵖ) : ↑((yonedaMonObj M).obj X) = (Opposite.unop X ⟶ M)

@[simp]

theorem CategoryTheory.yonedaMonObj_map {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (M : C) [MonObj M] {X Y₂ : Cᵒᵖ} (φ : X ⟶ Y₂) : (yonedaMonObj M).map φ = MonCat.ofHom { toFun := fun (x : Opposite.unop X ⟶ M) => CategoryStruct.comp φ.unop x, map_one' := ⋯, map_mul' := ⋯ }

def CategoryTheory.yonedaMonObjIsoOfRepresentableBy {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (X : C) (F : Functor Cᵒᵖ MonCat) (α : (F.comp (forget MonCat)).RepresentableBy X) : yonedaMonObj X ≅ F

If X represents a presheaf of monoids F, then Hom(-, X) is isomorphic to F as a presheaf of monoids.

@[simp]

theorem CategoryTheory.yonedaMonObjIsoOfRepresentableBy_hom_app_hom_apply {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (X : C) (F : Functor Cᵒᵖ MonCat) (α : (F.comp (forget MonCat)).RepresentableBy X) (X✝ : Cᵒᵖ) (a✝ : Opposite.unop X✝ ⟶ X) : (MonCat.Hom.hom ((yonedaMonObjIsoOfRepresentableBy X F α).hom.app X✝)) a✝ = α.homEquiv a✝

@[simp]

theorem CategoryTheory.yonedaMonObjIsoOfRepresentableBy_inv_app_hom_apply {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (X : C) (F : Functor Cᵒᵖ MonCat) (α : (F.comp (forget MonCat)).RepresentableBy X) (X✝ : Cᵒᵖ) (a✝ : ↑(F.1 X✝)) : (MonCat.Hom.hom ((yonedaMonObjIsoOfRepresentableBy X F α).inv.app X✝)) a✝ = α.homEquiv.symm a✝

def CategoryTheory.yonedaMon {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] : Functor (Mon C) (Functor Cᵒᵖ MonCat)

The yoneda embedding of Mon_C into presheaves of monoids.

@[simp]

theorem CategoryTheory.yonedaMon_map_app {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N : Mon C} (ψ : M ⟶ N) (Y : Cᵒᵖ) : (yonedaMon.map ψ).app Y = MonCat.ofHom { toFun := fun (x : Opposite.unop Y ⟶ M.X) => CategoryStruct.comp x ψ.hom, map_one' := ⋯, map_mul' := ⋯ }

@[simp]

theorem CategoryTheory.yonedaMon_obj {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (M : Mon C) : yonedaMon.obj M = yonedaMonObj M.X

theorem CategoryTheory.yonedaMon_naturality {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N X Y : C} [MonObj M] [MonObj N] (α : yonedaMonObj M ⟶ yonedaMonObj N) (f : X ⟶ Y) (g : Y ⟶ M) : (ConcreteCategory.hom (α.app (Opposite.op X))) (CategoryStruct.comp f g) = CategoryStruct.comp f ((ConcreteCategory.hom (α.app (Opposite.op Y))) g)

theorem CategoryTheory.yonedaMon_naturality_assoc {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N X Y : C} [MonObj M] [MonObj N] (α : yonedaMonObj M ⟶ yonedaMonObj N) (f : X ⟶ Y) (g : Y ⟶ M) {Z : C} (h : N ⟶ Z) : CategoryStruct.comp ((ConcreteCategory.hom (α.app (Opposite.op X))) (CategoryStruct.comp f g)) h = CategoryStruct.comp f (CategoryStruct.comp ((ConcreteCategory.hom (α.app (Opposite.op Y))) g) h)

def CategoryTheory.yonedaMonObjRepresentableBy {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (M : C) [MonObj M] : ((yonedaMonObj M).comp (forget MonCat)).RepresentableBy M

If M is a monoid object, then Hom(-, M) as a presheaf of monoids is represented by M.

theorem CategoryTheory.MonObj.ofRepresentableBy_yonedaMonObjRepresentableBy {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (M : C) [MonObj M] : ofRepresentableBy M (yonedaMonObj M) (yonedaMonObjRepresentableBy M) = inst✝

@[deprecated CategoryTheory.MonObj.ofRepresentableBy_yonedaMonObjRepresentableBy (since := "2025-09-09")]

theorem CategoryTheory.Mon_Class.ofRepresentableBy_yonedaMonObjRepresentableBy {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (M : C) [MonObj M] : MonObj.ofRepresentableBy M (yonedaMonObj M) (yonedaMonObjRepresentableBy M) = inst✝

Alias of CategoryTheory.MonObj.ofRepresentableBy_yonedaMonObjRepresentableBy.

@[deprecated CategoryTheory.MonObj.ofRepresentableBy_yonedaMonObjRepresentableBy (since := "2025-09-09")]

theorem CategoryTheory.Mon_ClassOfRepresentableBy_yonedaMonObjRepresentableBy {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (M : C) [MonObj M] : MonObj.ofRepresentableBy M (yonedaMonObj M) (yonedaMonObjRepresentableBy M) = inst✝

Alias of CategoryTheory.MonObj.ofRepresentableBy_yonedaMonObjRepresentableBy.

def CategoryTheory.yonedaMonFullyFaithful {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] : yonedaMon.FullyFaithful

The yoneda embedding for Mon_C is fully faithful.

instance CategoryTheory.instFullMonFunctorOppositeMonCatYonedaMon {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] : yonedaMon.Full

instance CategoryTheory.instFaithfulMonFunctorOppositeMonCatYonedaMon {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] : yonedaMon.Faithful

theorem CategoryTheory.essImage_yonedaMon {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] : yonedaMon.essImage = (fun (x : Functor Cᵒᵖ MonCat) => x.comp (forget MonCat)) ⁻¹' setOf Functor.IsRepresentable

@[simp]

theorem CategoryTheory.MonObj.one_comp {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N X : C} [MonObj M] [MonObj N] (f : M ⟶ N) [IsMonHom f] : CategoryStruct.comp 1 f = 1

@[simp]

theorem CategoryTheory.MonObj.one_comp_assoc {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N X : C} [MonObj M] [MonObj N] (f : M ⟶ N) [IsMonHom f] {Z : C} (h : N ⟶ Z) : CategoryStruct.comp 1 (CategoryStruct.comp f h) = CategoryStruct.comp 1 h

@[deprecated CategoryTheory.MonObj.one_comp (since := "2025-09-09")]

theorem CategoryTheory.Mon_Class.one_comp {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N X : C} [MonObj M] [MonObj N] (f : M ⟶ N) [IsMonHom f] : CategoryStruct.comp 1 f = 1

Alias of CategoryTheory.MonObj.one_comp.

theorem CategoryTheory.MonObj.mul_comp {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N X : C} [MonObj M] [MonObj N] (f₁ f₂ : X ⟶ M) (g : M ⟶ N) [IsMonHom g] : CategoryStruct.comp (f₁ * f₂) g = CategoryStruct.comp f₁ g * CategoryStruct.comp f₂ g

theorem CategoryTheory.MonObj.mul_comp_assoc {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N X : C} [MonObj M] [MonObj N] (f₁ f₂ : X ⟶ M) (g : M ⟶ N) [IsMonHom g] {Z : C} (h : N ⟶ Z) : CategoryStruct.comp (f₁ * f₂) (CategoryStruct.comp g h) = CategoryStruct.comp (CategoryStruct.comp f₁ g * CategoryStruct.comp f₂ g) h

@[deprecated CategoryTheory.MonObj.mul_comp (since := "2025-09-09")]

theorem CategoryTheory.Mon_Class.mul_comp {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N X : C} [MonObj M] [MonObj N] (f₁ f₂ : X ⟶ M) (g : M ⟶ N) [IsMonHom g] : CategoryStruct.comp (f₁ * f₂) g = CategoryStruct.comp f₁ g * CategoryStruct.comp f₂ g

Alias of CategoryTheory.MonObj.mul_comp.

theorem CategoryTheory.MonObj.pow_comp {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N X : C} [MonObj M] [MonObj N] (f : X ⟶ M) (n : ℕ) (g : M ⟶ N) [IsMonHom g] : CategoryStruct.comp (f ^ n) g = CategoryStruct.comp f g ^ n

theorem CategoryTheory.MonObj.pow_comp_assoc {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N X : C} [MonObj M] [MonObj N] (f : X ⟶ M) (n : ℕ) (g : M ⟶ N) [IsMonHom g] {Z : C} (h : N ⟶ Z) : CategoryStruct.comp (f ^ n) (CategoryStruct.comp g h) = CategoryStruct.comp (CategoryStruct.comp f g ^ n) h

@[deprecated CategoryTheory.MonObj.pow_comp (since := "2025-09-09")]

theorem CategoryTheory.Mon_Class.pow_comp {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N X : C} [MonObj M] [MonObj N] (f : X ⟶ M) (n : ℕ) (g : M ⟶ N) [IsMonHom g] : CategoryStruct.comp (f ^ n) g = CategoryStruct.comp f g ^ n

Alias of CategoryTheory.MonObj.pow_comp.

@[simp]

theorem CategoryTheory.MonObj.comp_one {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M X Y : C} [MonObj M] (f : X ⟶ Y) : CategoryStruct.comp f 1 = 1

@[simp]

theorem CategoryTheory.MonObj.comp_one_assoc {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M X Y : C} [MonObj M] (f : X ⟶ Y) {Z : C} (h : M ⟶ Z) : CategoryStruct.comp f (CategoryStruct.comp 1 h) = CategoryStruct.comp 1 h

@[deprecated CategoryTheory.MonObj.comp_one (since := "2025-09-09")]

theorem CategoryTheory.Mon_Class.comp_one {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M X Y : C} [MonObj M] (f : X ⟶ Y) : CategoryStruct.comp f 1 = 1

Alias of CategoryTheory.MonObj.comp_one.

theorem CategoryTheory.MonObj.comp_mul {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M X Y : C} [MonObj M] (f : X ⟶ Y) (g₁ g₂ : Y ⟶ M) : CategoryStruct.comp f (g₁ * g₂) = CategoryStruct.comp f g₁ * CategoryStruct.comp f g₂

theorem CategoryTheory.MonObj.comp_mul_assoc {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M X Y : C} [MonObj M] (f : X ⟶ Y) (g₁ g₂ : Y ⟶ M) {Z : C} (h : M ⟶ Z) : CategoryStruct.comp f (CategoryStruct.comp (g₁ * g₂) h) = CategoryStruct.comp (CategoryStruct.comp f g₁ * CategoryStruct.comp f g₂) h

@[deprecated CategoryTheory.MonObj.comp_mul (since := "2025-09-09")]

theorem CategoryTheory.Mon_Class.comp_mul {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M X Y : C} [MonObj M] (f : X ⟶ Y) (g₁ g₂ : Y ⟶ M) : CategoryStruct.comp f (g₁ * g₂) = CategoryStruct.comp f g₁ * CategoryStruct.comp f g₂

Alias of CategoryTheory.MonObj.comp_mul.

theorem CategoryTheory.MonObj.comp_pow {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M X Y : C} [MonObj M] (f : X ⟶ M) (n : ℕ) (h : Y ⟶ X) : CategoryStruct.comp h (f ^ n) = CategoryStruct.comp h f ^ n

theorem CategoryTheory.MonObj.comp_pow_assoc {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M X Y : C} [MonObj M] (f : X ⟶ M) (n : ℕ) (h : Y ⟶ X) {Z : C} (h✝ : M ⟶ Z) : CategoryStruct.comp h (CategoryStruct.comp (f ^ n) h✝) = CategoryStruct.comp (CategoryStruct.comp h f ^ n) h✝

@[deprecated CategoryTheory.MonObj.comp_pow (since := "2025-09-09")]

theorem CategoryTheory.Mon_Class.comp_pow {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M X Y : C} [MonObj M] (f : X ⟶ M) (n : ℕ) (h : Y ⟶ X) : CategoryStruct.comp h (f ^ n) = CategoryStruct.comp h f ^ n

Alias of CategoryTheory.MonObj.comp_pow.

theorem CategoryTheory.MonObj.one_eq_one {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (M : C) [MonObj M] : one = 1

@[deprecated CategoryTheory.MonObj.one_eq_one (since := "2025-09-09")]

theorem CategoryTheory.Mon_Class.one_eq_one {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (M : C) [MonObj M] : MonObj.one = 1

Alias of CategoryTheory.MonObj.one_eq_one.

theorem CategoryTheory.MonObj.mul_eq_mul {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (M : C) [MonObj M] : mul = SemiCartesianMonoidalCategory.fst M M * SemiCartesianMonoidalCategory.snd M M

@[deprecated CategoryTheory.MonObj.mul_eq_mul (since := "2025-09-09")]

theorem CategoryTheory.Mon_Class.mul_eq_mul {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (M : C) [MonObj M] : MonObj.mul = SemiCartesianMonoidalCategory.fst M M * SemiCartesianMonoidalCategory.snd M M

Alias of CategoryTheory.MonObj.mul_eq_mul.

def CategoryTheory.Hom.mulEquivCongrRight {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N : C} [MonObj M] [MonObj N] (e : M ≅ N) [IsMonHom e.hom] (X : C) : (X ⟶ M) ≃* (X ⟶ N)

If M and N are isomorphic as monoid objects, then X ⟶ M and X ⟶ N are isomorphic monoids.

@[simp]

theorem CategoryTheory.Hom.mulEquivCongrRight_apply {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N : C} [MonObj M] [MonObj N] (e : M ≅ N) [IsMonHom e.hom] (X : C) (a : ↑((yonedaMon.obj { X := M, mon := inst✝ }).obj (Opposite.op X))) : (mulEquivCongrRight e X) a = CategoryStruct.comp a e.hom

@[simp]

theorem CategoryTheory.Hom.mulEquivCongrRight_symm_apply {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] {M N : C} [MonObj M] [MonObj N] (e : M ≅ N) [IsMonHom e.hom] (X : C) (a : ↑((yonedaMon.obj { X := N, mon := inst✝ }).obj (Opposite.op X))) : (mulEquivCongrRight e X).symm a = CategoryStruct.comp a e.inv

theorem CategoryTheory.isCommMonObj_iff_isMulCommutative {C : Type u_1} [Category.{v, u_1} C] [CartesianMonoidalCategory C] (M : C) [MonObj M] [BraidedCategory C] : IsCommMonObj M ↔ ∀ (X : C), IsMulCommutative (X ⟶ M)

A monoid object M is commutative if and only if X ⟶ M is commutative for all X.