Adjunctions regarding the category of monoids #
This file proves the adjunction between adjoining a unit to a semigroup and the forgetful functor from monoids to semigroups.
TODO #
- free-forgetful adjunction for monoids
- adjunctions related to commutative monoids
The functor of adjoining a neutral element one
to a semigroup.
Equations
- MonCat.adjoinOne = { obj := fun (S : Semigrp) => MonCat.of (WithOne ↑S), map := fun {X Y : Semigrp} => WithOne.map, map_id := MonCat.adjoinOne.proof_1, map_comp := @MonCat.adjoinOne.proof_2 }
Instances For
The functor of adjoining a neutral element zero
to a semigroup
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[simp]
theorem
AddMonCat.adjoinZero_obj
(S : AddSemigrp)
:
AddMonCat.adjoinZero.obj S = AddMonCat.of (WithZero ↑S)
@[simp]
@[simp]
theorem
AddMonCat.adjoinZero_map :
∀ {X Y : AddSemigrp} (f : AddHom ↑X ↑Y), AddMonCat.adjoinZero.map f = WithZero.map f
@[simp]
theorem
MonCat.adjoinOne_map :
∀ {X Y : Semigrp} (f : ↑X →ₙ* ↑Y), MonCat.adjoinOne.map f = WithOne.map f
Equations
- One or more equations did not get rendered due to their size.
Equations
- One or more equations did not get rendered due to their size.
The adjoinZero
-forgetful adjunction from AddSemigrp
to AddMonCat
Equations
- One or more equations did not get rendered due to their size.
Instances For
The free functor Type u ⥤ MonCat
sending a type X
to the free monoid on X
.
Equations
- MonCat.free = { obj := fun (α : Type ?u.10) => MonCat.of (FreeMonoid α), map := fun {X Y : Type ?u.10} => FreeMonoid.map, map_id := MonCat.free.proof_1, map_comp := @MonCat.free.proof_2 }
Instances For
The free-forgetful adjunction for monoids.
Equations
- One or more equations did not get rendered due to their size.