The category of groups in a cartesian monoidal category

We define group objects in cartesian monoidal categories.

We show that the associativity diagram of a group object is always cartesian and deduce that morphisms of group objects commute with taking inverses.

We show that a finite-product-preserving functor takes group objects to group objects.

class Grp_Class {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) extends Mon_Class X : Type v₁

A group object internal to a cartesian monoidal category. Also see the bundled Grp_.

• one : CategoryTheory.MonoidalCategoryStruct.tensorUnit C ⟶ X
• mul : CategoryTheory.MonoidalCategoryStruct.tensorObj X X ⟶ X
• one_mul : CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerRight one X) mul = (CategoryTheory.MonoidalCategoryStruct.leftUnitor X).hom
• mul_one : CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerLeft X one) mul = (CategoryTheory.MonoidalCategoryStruct.rightUnitor X).hom
• mul_assoc : CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerRight mul X) mul = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.associator X X X).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerLeft X mul) mul)
• inv : X ⟶ X

  The inverse in a group object

• left_inv : CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift inv (CategoryTheory.CategoryStruct.id X)) Mon_Class.mul = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.toUnit X) Mon_Class.one
• right_inv : CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift (CategoryTheory.CategoryStruct.id X) inv) Mon_Class.mul = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.toUnit X) Mon_Class.one

def Mon_Class.termι : Lean.ParserDescr

The inverse in a group object

Equations

• Mon_Class.termι = Lean.ParserDescr.node `Mon_Class.termι 1024 (Lean.ParserDescr.symbol "ι")

def Mon_Class.«termι[_]» : Lean.ParserDescr

The inverse in a group object

Equations

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

@[simp]

theorem Grp_Class.right_inv_assoc {C : Type u₁} {inst✝ : CategoryTheory.Category.{v₁, u₁} C} {inst✝¹ : CategoryTheory.CartesianMonoidalCategory C} (X : C) [self : Grp_Class X] {Z : C} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift (CategoryTheory.CategoryStruct.id X) inv) (CategoryTheory.CategoryStruct.comp Mon_Class.mul h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.toUnit X) (CategoryTheory.CategoryStruct.comp Mon_Class.one h)

@[simp]

theorem Grp_Class.left_inv_assoc {C : Type u₁} {inst✝ : CategoryTheory.Category.{v₁, u₁} C} {inst✝¹ : CategoryTheory.CartesianMonoidalCategory C} (X : C) [self : Grp_Class X] {Z : C} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift inv (CategoryTheory.CategoryStruct.id X)) (CategoryTheory.CategoryStruct.comp Mon_Class.mul h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.toUnit X) (CategoryTheory.CategoryStruct.comp Mon_Class.one h)

instance Grp_Class.instTensorUnit {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : Grp_Class (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)

Equations

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

@[simp]

theorem Grp_Class.inv_def {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : inv = CategoryTheory.CategoryStruct.id (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)

structure Grp_ (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : Type (max u₁ v₁)

A group object in a cartesian monoidal category.

• X : C

  The underlying object in the ambient monoidal category

• grp : Grp_Class self.X

def Grp_.toMon_ {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (A : Grp_ C) : Mon_ C

A group object is a monoid object.

Equations

• A.toMon_ = { X := A.X, mon := A.grp.toMon_Class }

@[simp]

theorem Grp_.toMon__X {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (A : Grp_ C) : A.toMon_.X = A.X

def Grp_.trivial (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : Grp_ C

The trivial group object.

Equations

• Grp_.trivial C = { X := (Mon_.trivial C).X, grp := inferInstanceAs (Grp_Class (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)) }

@[simp]

theorem Grp_.trivial_grp_inv (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : Grp_Class.inv = CategoryTheory.CategoryStruct.id (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)

@[simp]

theorem Grp_.trivial_X (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : (trivial C).X = CategoryTheory.MonoidalCategoryStruct.tensorUnit C

@[simp]

theorem Grp_.trivial_grp_mul (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : Mon_Class.mul = (CategoryTheory.MonoidalCategoryStruct.leftUnitor (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)).hom

@[simp]

theorem Grp_.trivial_grp_one (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : Mon_Class.one = CategoryTheory.CategoryStruct.id (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)

instance Grp_.instInhabited {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : Inhabited (Grp_ C)

Equations

• Grp_.instInhabited = { default := Grp_.trivial C }

@[deprecated Grp_.mk (since := "2025-06-15")]

def Grp_.mk' {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) [grp : Grp_Class X] : Grp_ C

Alias of Grp_.mk.

Equations

• @Grp_.mk' = @Grp_.mk

instance Grp_.instCategory {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.Category.{v₁, max u₁ v₁} (Grp_ C)

Equations

• Grp_.instCategory = CategoryTheory.InducedCategory.category Grp_.toMon_

@[simp]

theorem Grp_.id_hom {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (A : Grp_ C) : (CategoryTheory.CategoryStruct.id A).hom = CategoryTheory.CategoryStruct.id A.X

@[simp]

theorem Grp_.comp_hom {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {R S T : Grp_ C} (f : R ⟶ S) (g : S ⟶ T) : (CategoryTheory.CategoryStruct.comp f g).hom = CategoryTheory.CategoryStruct.comp f.hom g.hom

theorem Grp_.hom_ext {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : Grp_ C} (f g : A ⟶ B) (h : f.hom = g.hom) : f = g

theorem Grp_.hom_ext_iff {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : Grp_ C} {f g : A ⟶ B} : f = g ↔ f.hom = g.hom

@[simp]

theorem Grp_.id' {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (A : Grp_ C) : CategoryTheory.CategoryStruct.id A = CategoryTheory.CategoryStruct.id A.toMon_

@[simp]

theorem Grp_.comp' {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A₁ A₂ A₃ : Grp_ C} (f : A₁ ⟶ A₂) (g : A₂ ⟶ A₃) : CategoryTheory.CategoryStruct.comp f g = CategoryTheory.CategoryStruct.comp f g

@[simp]

theorem Grp_Class.lift_comp_inv_right {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : C} [Grp_Class B] (f : A ⟶ B) : CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift f (CategoryTheory.CategoryStruct.comp f inv)) Mon_Class.mul = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.toUnit A) Mon_Class.one

@[simp]

theorem Grp_Class.lift_comp_inv_right_assoc {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : C} [Grp_Class B] (f : A ⟶ B) {Z : C} (h : B ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift f (CategoryTheory.CategoryStruct.comp f inv)) (CategoryTheory.CategoryStruct.comp Mon_Class.mul h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.toUnit A) (CategoryTheory.CategoryStruct.comp Mon_Class.one h)

theorem Grp_Class.lift_inv_comp_right {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : C} [Grp_Class A] [Grp_Class B] (f : A ⟶ B) [IsMon_Hom f] : CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift f (CategoryTheory.CategoryStruct.comp inv f)) Mon_Class.mul = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.toUnit A) Mon_Class.one

theorem Grp_Class.lift_inv_comp_right_assoc {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : C} [Grp_Class A] [Grp_Class B] (f : A ⟶ B) [IsMon_Hom f] {Z : C} (h : B ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift f (CategoryTheory.CategoryStruct.comp inv f)) (CategoryTheory.CategoryStruct.comp Mon_Class.mul h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.toUnit A) (CategoryTheory.CategoryStruct.comp Mon_Class.one h)

@[simp]

theorem Grp_Class.lift_comp_inv_left {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : C} [Grp_Class B] (f : A ⟶ B) : CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift (CategoryTheory.CategoryStruct.comp f inv) f) Mon_Class.mul = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.toUnit A) Mon_Class.one

@[simp]

theorem Grp_Class.lift_comp_inv_left_assoc {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : C} [Grp_Class B] (f : A ⟶ B) {Z : C} (h : B ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift (CategoryTheory.CategoryStruct.comp f inv) f) (CategoryTheory.CategoryStruct.comp Mon_Class.mul h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.toUnit A) (CategoryTheory.CategoryStruct.comp Mon_Class.one h)

theorem Grp_Class.lift_inv_comp_left {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : C} [Grp_Class A] [Grp_Class B] (f : A ⟶ B) [IsMon_Hom f] : CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift (CategoryTheory.CategoryStruct.comp inv f) f) Mon_Class.mul = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.toUnit A) Mon_Class.one

theorem Grp_Class.lift_inv_comp_left_assoc {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : C} [Grp_Class A] [Grp_Class B] (f : A ⟶ B) [IsMon_Hom f] {Z : C} (h : B ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift (CategoryTheory.CategoryStruct.comp inv f) f) (CategoryTheory.CategoryStruct.comp Mon_Class.mul h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.toUnit A) (CategoryTheory.CategoryStruct.comp Mon_Class.one h)

theorem Grp_Class.eq_lift_inv_left {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : C} [Grp_Class B] (f g h : A ⟶ B) : f = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift (CategoryTheory.CategoryStruct.comp g inv) h) Mon_Class.mul ↔ CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift g f) Mon_Class.mul = h

theorem Grp_Class.lift_inv_left_eq {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : C} [Grp_Class B] (f g h : A ⟶ B) : CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift (CategoryTheory.CategoryStruct.comp f inv) g) Mon_Class.mul = h ↔ g = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift f h) Mon_Class.mul

theorem Grp_Class.eq_lift_inv_right {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : C} [Grp_Class B] (f g h : A ⟶ B) : f = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift g (CategoryTheory.CategoryStruct.comp h inv)) Mon_Class.mul ↔ CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift f h) Mon_Class.mul = g

theorem Grp_Class.lift_inv_right_eq {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : C} [Grp_Class B] (f g h : A ⟶ B) : CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift f (CategoryTheory.CategoryStruct.comp g inv)) Mon_Class.mul = h ↔ f = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift h g) Mon_Class.mul

theorem Grp_Class.lift_left_mul_ext {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : C} [Grp_Class B] {f g : A ⟶ B} (i : A ⟶ B) (h : CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift f i) Mon_Class.mul = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift g i) Mon_Class.mul) : f = g

@[simp]

theorem Grp_Class.inv_comp_inv {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (A : C) [Grp_Class A] : CategoryTheory.CategoryStruct.comp inv inv = CategoryTheory.CategoryStruct.id A

@[simp]

theorem Grp_Class.inv_comp_inv_assoc {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (A : C) [Grp_Class A] {Z : C} (h : A ⟶ Z) : CategoryTheory.CategoryStruct.comp inv (CategoryTheory.CategoryStruct.comp inv h) = h

instance Grp_Class.instIsIsoInv {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (A : C) [Grp_Class A] : CategoryTheory.IsIso inv

@[simp]

theorem Grp_Class.inv_inv {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (A : C) [Grp_Class A] : CategoryTheory.inv inv = inv

For inv ≫ inv = 𝟙 see inv_comp_inv.

theorem Grp_Class.mul_inv {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] [CategoryTheory.BraidedCategory C] (A : C) [Grp_Class A] : CategoryTheory.CategoryStruct.comp Mon_Class.mul inv = CategoryTheory.CategoryStruct.comp (β_ A A).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.tensorHom inv inv) Mon_Class.mul)

theorem Grp_Class.mul_inv_assoc {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] [CategoryTheory.BraidedCategory C] (A : C) [Grp_Class A] {Z : C} (h : A ⟶ Z) : CategoryTheory.CategoryStruct.comp Mon_Class.mul (CategoryTheory.CategoryStruct.comp inv h) = CategoryTheory.CategoryStruct.comp (β_ A A).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.tensorHom inv inv) (CategoryTheory.CategoryStruct.comp Mon_Class.mul h))

theorem Grp_Class.tensorHom_inv_inv_mul {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] [CategoryTheory.BraidedCategory C] (A : C) [Grp_Class A] : CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.tensorHom inv inv) Mon_Class.mul = CategoryTheory.CategoryStruct.comp (β_ A A).hom (CategoryTheory.CategoryStruct.comp Mon_Class.mul inv)

theorem Grp_Class.tensorHom_inv_inv_mul_assoc {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] [CategoryTheory.BraidedCategory C] (A : C) [Grp_Class A] {Z : C} (h : A ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.tensorHom inv inv) (CategoryTheory.CategoryStruct.comp Mon_Class.mul h) = CategoryTheory.CategoryStruct.comp (β_ A A).hom (CategoryTheory.CategoryStruct.comp Mon_Class.mul (CategoryTheory.CategoryStruct.comp inv h))

theorem Grp_Class.mul_inv_rev {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] [CategoryTheory.BraidedCategory C] (G : C) [Grp_Class G] : CategoryTheory.CategoryStruct.comp Mon_Class.mul inv = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.tensorHom inv inv) (CategoryTheory.CategoryStruct.comp (β_ G G).hom Mon_Class.mul)

theorem Grp_Class.mul_inv_rev_assoc {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] [CategoryTheory.BraidedCategory C] (G : C) [Grp_Class G] {Z : C} (h : G ⟶ Z) : CategoryTheory.CategoryStruct.comp Mon_Class.mul (CategoryTheory.CategoryStruct.comp inv h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.tensorHom inv inv) (CategoryTheory.CategoryStruct.comp (β_ G G).hom (CategoryTheory.CategoryStruct.comp Mon_Class.mul h))

def Grp_Class.mulRight {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A : C} [Grp_Class A] (f : CategoryTheory.MonoidalCategoryStruct.tensorUnit C ⟶ A) : A ≅ A

The map (· * f).

Equations

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

@[simp]

theorem Grp_Class.mulRight_inv {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A : C} [Grp_Class A] (f : CategoryTheory.MonoidalCategoryStruct.tensorUnit C ⟶ A) : (mulRight f).inv = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift (CategoryTheory.CategoryStruct.id A) (CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.toUnit A) (CategoryTheory.CategoryStruct.comp f inv))) Mon_Class.mul

@[simp]

theorem Grp_Class.mulRight_hom {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A : C} [Grp_Class A] (f : CategoryTheory.MonoidalCategoryStruct.tensorUnit C ⟶ A) : (mulRight f).hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.lift (CategoryTheory.CategoryStruct.id A) (CategoryTheory.CategoryStruct.comp (CategoryTheory.CartesianMonoidalCategory.toUnit A) f)) Mon_Class.mul

@[simp]

theorem Grp_Class.mulRight_one {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (A : C) [Grp_Class A] : mulRight Mon_Class.one = CategoryTheory.Iso.refl A

theorem Grp_Class.isPullback {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (A : C) [Grp_Class A] : CategoryTheory.IsPullback (CategoryTheory.MonoidalCategoryStruct.whiskerRight Mon_Class.mul A) (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.associator A A A).hom (CategoryTheory.MonoidalCategoryStruct.whiskerLeft A Mon_Class.mul)) Mon_Class.mul Mon_Class.mul

The associativity diagram of a group object is cartesian.

In fact, any monoid object whose associativity diagram is cartesian can be made into a group object (we do not prove this in this file), so we should expect that many properties of group objects follow from this result.

@[simp]

theorem Grp_Class.inv_hom {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : C} [Grp_Class A] [Grp_Class B] (f : A ⟶ B) [IsMon_Hom f] : CategoryTheory.CategoryStruct.comp inv f = CategoryTheory.CategoryStruct.comp f inv

Morphisms of group objects preserve inverses.

@[simp]

theorem Grp_Class.inv_hom_assoc {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : C} [Grp_Class A] [Grp_Class B] (f : A ⟶ B) [IsMon_Hom f] {Z : C} (h : B ⟶ Z) : CategoryTheory.CategoryStruct.comp inv (CategoryTheory.CategoryStruct.comp f h) = CategoryTheory.CategoryStruct.comp f (CategoryTheory.CategoryStruct.comp inv h)

theorem Grp_Class.toMon_Class_injective {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {X : C} : Function.Injective (@toMon_Class C inst✝ inst✝¹ X)

theorem Grp_Class.ext {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {X : C} (h₁ h₂ : Grp_Class X) (H : h₁.toMon_Class = h₂.toMon_Class) : h₁ = h₂

theorem Grp_Class.ext_iff {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {X : C} {h₁ h₂ : Grp_Class X} : h₁ = h₂ ↔ h₁.toMon_Class = h₂.toMon_Class

def Grp_.forget₂Mon_ (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.Functor (Grp_ C) (Mon_ C)

The forgetful functor from group objects to monoid objects.

Equations

• Grp_.forget₂Mon_ C = CategoryTheory.inducedFunctor Grp_.toMon_

@[simp]

theorem Grp_.forget₂Mon__obj_X (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (A : Grp_ C) : ((forget₂Mon_ C).obj A).X = A.X

def Grp_.fullyFaithfulForget₂Mon_ (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : (forget₂Mon_ C).FullyFaithful

The forgetful functor from group objects to monoid objects is fully faithful.

Equations

• Grp_.fullyFaithfulForget₂Mon_ C = CategoryTheory.fullyFaithfulInducedFunctor Grp_.toMon_

instance Grp_.instFullMon_Forget₂Mon_ (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : (forget₂Mon_ C).Full

instance Grp_.instFaithfulMon_Forget₂Mon_ (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : (forget₂Mon_ C).Faithful

@[simp]

theorem Grp_.forget₂Mon_obj_one {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (A : Grp_ C) : Mon_Class.one = Mon_Class.one

@[simp]

theorem Grp_.forget₂Mon_obj_mul {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (A : Grp_ C) : Mon_Class.mul = Mon_Class.mul

@[simp]

theorem Grp_.forget₂Mon_map_hom {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {A B : Grp_ C} (f : A ⟶ B) : ((forget₂Mon_ C).map f).hom = f.hom

def Grp_.forget (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.Functor (Grp_ C) C

The forgetful functor from group objects to the ambient category.

Equations

• Grp_.forget C = (Grp_.forget₂Mon_ C).comp (Mon_.forget C)

@[simp]

theorem Grp_.forget_obj (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (X : Grp_ C) : (forget C).obj X = X.X

@[simp]

theorem Grp_.forget_map (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {X✝ Y✝ : Grp_ C} (f : X✝ ⟶ Y✝) : (forget C).map f = f.hom

instance Grp_.instFaithfulForget (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : (forget C).Faithful

@[simp]

theorem Grp_.forget₂Mon_comp_forget (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : (forget₂Mon_ C).comp (Mon_.forget C) = forget C

instance Grp_.instIsIsoHom (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {G H : Grp_ C} {f : G ⟶ H} [CategoryTheory.IsIso f] : CategoryTheory.IsIso f.hom

def Grp_.mkIso' {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {G H : C} (e : G ≅ H) [Grp_Class G] [Grp_Class H] [IsMon_Hom e.hom] : { X := G, grp := inst✝ } ≅ { X := H, grp := inst✝¹ }

Construct an isomorphism of group objects by giving a monoid isomorphism between the underlying objects.

Equations

• Grp_.mkIso' e = (Grp_.fullyFaithfulForget₂Mon_ C).preimageIso (Mon_.mkIso' e)

@[simp]

theorem Grp_.mkIso'_hom_hom {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {G H : C} (e : G ≅ H) [Grp_Class G] [Grp_Class H] [IsMon_Hom e.hom] : (mkIso' e).hom.hom = e.hom

@[simp]

theorem Grp_.mkIso'_inv_hom {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {G H : C} (e : G ≅ H) [Grp_Class G] [Grp_Class H] [IsMon_Hom e.hom] : (mkIso' e).inv.hom = e.inv

@[reducible, inline]

abbrev Grp_.mkIso {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {G H : Grp_ C} (e : G.X ≅ H.X) (one_f : CategoryTheory.CategoryStruct.comp Mon_Class.one e.hom = Mon_Class.one := by cat_disch) (mul_f : CategoryTheory.CategoryStruct.comp Mon_Class.mul e.hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.tensorHom e.hom e.hom) Mon_Class.mul := by cat_disch) : G ≅ H

Construct an isomorphism of group objects by giving an isomorphism between the underlying objects and checking compatibility with unit and multiplication only in the forward direction.

Equations

• Grp_.mkIso e one_f mul_f = Grp_.mkIso' e

@[simp]

theorem Grp_.mkIso_inv_hom {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {G H : Grp_ C} (e : G.X ≅ H.X) (one_f : CategoryTheory.CategoryStruct.comp Mon_Class.one e.hom = Mon_Class.one := by cat_disch) (mul_f : CategoryTheory.CategoryStruct.comp Mon_Class.mul e.hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.tensorHom e.hom e.hom) Mon_Class.mul := by cat_disch) : (mkIso e one_f mul_f).inv.hom = e.inv

@[simp]

theorem Grp_.mkIso_hom_hom {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] {G H : Grp_ C} (e : G.X ≅ H.X) (one_f : CategoryTheory.CategoryStruct.comp Mon_Class.one e.hom = Mon_Class.one := by cat_disch) (mul_f : CategoryTheory.CategoryStruct.comp Mon_Class.mul e.hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.tensorHom e.hom e.hom) Mon_Class.mul := by cat_disch) : (mkIso e one_f mul_f).hom.hom = e.hom

instance Grp_.uniqueHomFromTrivial {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] (A : Grp_ C) : Unique (trivial C ⟶ A)

Equations

• A.uniqueHomFromTrivial = A.toMon_.uniqueHomFromTrivial

instance Grp_.instHasInitial {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.Limits.HasInitial (Grp_ C)

def CategoryTheory.Functor.mapGrp {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] (F : Functor C D) [F.Monoidal] : Functor (Grp_ C) (Grp_ D)

A finite-product-preserving functor takes group objects to group objects.

Equations

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

@[simp]

theorem CategoryTheory.Functor.mapGrp_obj_X {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] (F : Functor C D) [F.Monoidal] (A : Grp_ C) : (F.mapGrp.obj A).X = F.obj A.X

@[simp]

theorem CategoryTheory.Functor.mapGrp_obj_grp_one {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] (F : Functor C D) [F.Monoidal] (A : Grp_ C) : Mon_Class.one = CategoryStruct.comp (LaxMonoidal.ε F) (F.map Mon_Class.one)

@[simp]

theorem CategoryTheory.Functor.mapGrp_map_hom {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] (F : Functor C D) [F.Monoidal] {X✝ Y✝ : Grp_ C} (f : X✝ ⟶ Y✝) : (F.mapGrp.map f).hom = F.map f.hom

@[simp]

theorem CategoryTheory.Functor.mapGrp_obj_grp_inv {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] (F : Functor C D) [F.Monoidal] (A : Grp_ C) : Grp_Class.inv = F.map Grp_Class.inv

@[simp]

theorem CategoryTheory.Functor.mapGrp_obj_grp_mul {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] (F : Functor C D) [F.Monoidal] (A : Grp_ C) : Mon_Class.mul = CategoryStruct.comp (LaxMonoidal.μ F A.X A.X) (F.map Mon_Class.mul)

instance CategoryTheory.Functor.Faithful.mapGrp {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {F : Functor C D} [F.Monoidal] [F.Faithful] : F.mapGrp.Faithful

instance CategoryTheory.Functor.Full.mapGrp {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {F : Functor C D} [F.Monoidal] [F.Full] [F.Faithful] : F.mapGrp.Full

def CategoryTheory.Functor.FullyFaithful.mapGrp {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {F : Functor C D} [F.Monoidal] (hF : F.FullyFaithful) : F.mapGrp.FullyFaithful

If F : C ⥤ D is a fully faithful monoidal functor, then Grp(F) : Grp C ⥤ Grp D is fully faithful too.

Equations

• hF.mapGrp = { preimage := fun {X Y : Grp_ C} (f : F.mapGrp.obj X ⟶ F.mapGrp.obj Y) => { hom := hF.preimage f.hom, is_mon_hom := ⋯ }, map_preimage := ⋯, preimage_map := ⋯ }

@[simp]

theorem CategoryTheory.Functor.FullyFaithful.mapGrp_preimage_hom {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {F : Functor C D} [F.Monoidal] (hF : F.FullyFaithful) {X✝ Y✝ : Grp_ C} (f : F.mapGrp.obj X✝ ⟶ F.mapGrp.obj Y✝) : (hF.mapGrp.preimage f).hom = hF.preimage f.hom

@[simp]

theorem CategoryTheory.Functor.mapGrp_id_one {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] (A : Grp_ C) : Mon_Class.one = CategoryStruct.comp (CategoryStruct.id (MonoidalCategoryStruct.tensorUnit C)) Mon_Class.one

@[simp]

theorem CategoryTheory.Functor.mapGrp_id_mul {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] (A : Grp_ C) : Mon_Class.mul = CategoryStruct.comp (CategoryStruct.id (MonoidalCategoryStruct.tensorObj A.X A.X)) Mon_Class.mul

@[simp]

theorem CategoryTheory.Functor.comp_mapGrp_one {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {E : Type u₃} [Category.{v₃, u₃} E] [CartesianMonoidalCategory E] {F : Functor C D} [F.Monoidal] {G : Functor D E} [G.Monoidal] (A : Grp_ C) : Mon_Class.one = CategoryStruct.comp (LaxMonoidal.ε (F.comp G)) ((F.comp G).map Mon_Class.one)

@[simp]

theorem CategoryTheory.Functor.comp_mapGrp_mul {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {E : Type u₃} [Category.{v₃, u₃} E] [CartesianMonoidalCategory E] {F : Functor C D} [F.Monoidal] {G : Functor D E} [G.Monoidal] (A : Grp_ C) : Mon_Class.mul = CategoryStruct.comp (LaxMonoidal.μ (F.comp G) A.X A.X) ((F.comp G).map Mon_Class.mul)

def CategoryTheory.Functor.mapGrpIdIso {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] : (Functor.id C).mapGrp ≅ Functor.id (Grp_ C)

The identity functor is also the identity on group objects.

Equations

• CategoryTheory.Functor.mapGrpIdIso = CategoryTheory.NatIso.ofComponents (fun (X : Grp_ C) => Grp_.mkIso (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id C).mapGrp.obj X).X) ⋯ ⋯) ⋯

@[simp]

theorem CategoryTheory.Functor.mapGrpIdIso_hom_app_hom {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] (X : Grp_ C) : (mapGrpIdIso.hom.app X).hom = CategoryStruct.id X.X

@[simp]

theorem CategoryTheory.Functor.mapGrpIdIso_inv_app_hom {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] (X : Grp_ C) : (mapGrpIdIso.inv.app X).hom = CategoryStruct.id X.X

def CategoryTheory.Functor.mapGrpCompIso {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {E : Type u₃} [Category.{v₃, u₃} E] [CartesianMonoidalCategory E] {F : Functor C D} [F.Monoidal] {G : Functor D E} [G.Monoidal] : (F.comp G).mapGrp ≅ F.mapGrp.comp G.mapGrp

The composition functor is also the composition on group objects.

Equations

• CategoryTheory.Functor.mapGrpCompIso = CategoryTheory.NatIso.ofComponents (fun (X : Grp_ C) => Grp_.mkIso (CategoryTheory.Iso.refl ((F.comp G).mapGrp.obj X).X) ⋯ ⋯) ⋯

@[simp]

theorem CategoryTheory.Functor.mapGrpCompIso_hom_app_hom {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {E : Type u₃} [Category.{v₃, u₃} E] [CartesianMonoidalCategory E] {F : Functor C D} [F.Monoidal] {G : Functor D E} [G.Monoidal] (X : Grp_ C) : (mapGrpCompIso.hom.app X).hom = CategoryStruct.id (G.obj (F.obj X.X))

@[simp]

theorem CategoryTheory.Functor.mapGrpCompIso_inv_app_hom {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {E : Type u₃} [Category.{v₃, u₃} E] [CartesianMonoidalCategory E] {F : Functor C D} [F.Monoidal] {G : Functor D E} [G.Monoidal] (X : Grp_ C) : (mapGrpCompIso.inv.app X).hom = CategoryStruct.id (G.obj (F.obj X.X))

def CategoryTheory.Functor.mapGrpNatTrans {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {F F' : Functor C D} [F.Monoidal] [F'.Monoidal] (f : F ⟶ F') : F.mapGrp ⟶ F'.mapGrp

Natural transformations between functors lift to group objects.

Equations

• CategoryTheory.Functor.mapGrpNatTrans f = { app := fun (X : Grp_ C) => Mon_.Hom.mk' (f.app X.toMon_.X) ⋯ ⋯, naturality := ⋯ }

@[simp]

theorem CategoryTheory.Functor.mapGrpNatTrans_app_hom {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {F F' : Functor C D} [F.Monoidal] [F'.Monoidal] (f : F ⟶ F') (X : Grp_ C) : ((mapGrpNatTrans f).app X).hom = f.app X.X

def CategoryTheory.Functor.mapGrpNatIso {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {F F' : Functor C D} [F.Monoidal] [F'.Monoidal] (e : F ≅ F') : F.mapGrp ≅ F'.mapGrp

Natural isomorphisms between functors lift to group objects.

Equations

• CategoryTheory.Functor.mapGrpNatIso e = CategoryTheory.NatIso.ofComponents (fun (X : Grp_ C) => Grp_.mkIso (e.app X.toMon_.X) ⋯ ⋯) ⋯

@[simp]

theorem CategoryTheory.Functor.mapGrpNatIso_inv_app_hom {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {F F' : Functor C D} [F.Monoidal] [F'.Monoidal] (e : F ≅ F') (X : Grp_ C) : ((mapGrpNatIso e).inv.app X).hom = e.inv.app X.X

@[simp]

theorem CategoryTheory.Functor.mapGrpNatIso_hom_app_hom {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {F F' : Functor C D} [F.Monoidal] [F'.Monoidal] (e : F ≅ F') (X : Grp_ C) : ((mapGrpNatIso e).hom.app X).hom = e.hom.app X.X

noncomputable def CategoryTheory.Functor.mapGrpFunctor {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] : Functor (C ⥤ₗ D) (Functor (Grp_ C) (Grp_ D))

mapGrp is functorial in the left-exact functor.

Equations

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

@[simp]

theorem CategoryTheory.Functor.mapGrpFunctor_map_app_hom {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {F G : C ⥤ₗ D} (α : F ⟶ G) (A : Grp_ C) : ((mapGrpFunctor.map α).app A).hom = α.app A.X

@[simp]

theorem CategoryTheory.Functor.mapGrpFunctor_obj {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] (F : C ⥤ₗ D) : mapGrpFunctor.obj F = F.obj.mapGrp

def CategoryTheory.Functor.FullyFaithful.grp_Class {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {F : Functor C D} [F.Monoidal] (hF : F.FullyFaithful) (X : C) [Grp_Class (F.obj X)] : Grp_Class X

Pullback a group object along a fully faithful monoidal functor.

Equations

• hF.grp_Class X = { toMon_Class := hF.mon_Class X, inv := hF.preimage Grp_Class.inv, left_inv := ⋯, right_inv := ⋯ }

def CategoryTheory.Adjunction.mapGrp {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {F : Functor C D} {G : Functor D C} (a : F ⊣ G) [F.Monoidal] [G.Monoidal] : F.mapGrp ⊣ G.mapGrp

An adjunction of monoidal functors lifts to an adjunction of their lifts to group objects.

Equations

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

@[simp]

theorem CategoryTheory.Adjunction.mapGrp_counit {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {F : Functor C D} {G : Functor D C} (a : F ⊣ G) [F.Monoidal] [G.Monoidal] : a.mapGrp.counit = CategoryStruct.comp Functor.mapGrpCompIso.inv (CategoryStruct.comp (Functor.mapGrpNatTrans a.counit) Functor.mapGrpIdIso.hom)

@[simp]

theorem CategoryTheory.Adjunction.mapGrp_unit {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] {F : Functor C D} {G : Functor D C} (a : F ⊣ G) [F.Monoidal] [G.Monoidal] : a.mapGrp.unit = CategoryStruct.comp Functor.mapGrpIdIso.inv (CategoryStruct.comp (Functor.mapGrpNatTrans a.unit) Functor.mapGrpCompIso.hom)

def CategoryTheory.Equivalence.mapGrp {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] (e : C ≌ D) [e.functor.Monoidal] [e.inverse.Monoidal] : Grp_ C ≌ Grp_ D

An equivalence of categories lifts to an equivalence of their group objects.

Equations

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

@[simp]

theorem CategoryTheory.Equivalence.mapGrp_unitIso {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] (e : C ≌ D) [e.functor.Monoidal] [e.inverse.Monoidal] : e.mapGrp.unitIso = Functor.mapGrpIdIso.symm ≪≫ Functor.mapGrpNatIso e.unitIso ≪≫ Functor.mapGrpCompIso

@[simp]

theorem CategoryTheory.Equivalence.mapGrp_counitIso {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] (e : C ≌ D) [e.functor.Monoidal] [e.inverse.Monoidal] : e.mapGrp.counitIso = Functor.mapGrpCompIso.symm ≪≫ Functor.mapGrpNatIso e.counitIso ≪≫ Functor.mapGrpIdIso

@[simp]

theorem CategoryTheory.Equivalence.mapGrp_inverse {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] (e : C ≌ D) [e.functor.Monoidal] [e.inverse.Monoidal] : e.mapGrp.inverse = e.inverse.mapGrp

@[simp]

theorem CategoryTheory.Equivalence.mapGrp_functor {C : Type u₁} [Category.{v₁, u₁} C] [CartesianMonoidalCategory C] {D : Type u₂} [Category.{v₂, u₂} D] [CartesianMonoidalCategory D] (e : C ≌ D) [e.functor.Monoidal] [e.inverse.Monoidal] : e.mapGrp.functor = e.functor.mapGrp