Adjunctions regarding the category of (abelian) groups #
This file contains construction of basic adjunctions concerning the category of groups and the category of abelian groups.
Main definitions #
AddCommGrpCat.free: constructs the functor associating to a typeXthe free abelian group with generatorsx : X.GrpCat.free: constructs the functor associating to a typeXthe free group with generatorsx : X.GrpCat.abelianize: constructs the functor which sends a groupGto its abelianizationGᵃᵇ.
Main statements #
AddCommGrpCat.adj: proves thatAddCommGrpCat.freeis the left adjoint of the forgetful functor from abelian groups to types.GrpCat.adj: proves thatGrpCat.freeis the left adjoint of the forgetful functor from groups to types.abelianizeAdj: proves thatGrpCat.abelianizeis left adjoint to the forgetful functor from abelian groups to groups.
The free functor Type u ⥤ AddCommGroup sending a type X to the
free abelian group with generators x : X.
Instances For
@[simp]
theorem
AddCommGrpCat.free_map_coe
{α β : Type u}
{f : α → β}
(x : FreeAbelianGroup α)
:
(CategoryTheory.ConcreteCategory.hom (free.map f)) x = f <$> x
The free-forgetful adjunction for abelian groups.
Instances For
The free functor Type u ⥤ Group sending a type X to the free group with generators x : X.
Instances For
The free-forgetful adjunction for groups.
Instances For
The functor taking a monoid to its subgroup of units.
Instances For
@[simp]
theorem
MonCat.val_units_map_hom_apply
{X✝ Y✝ : MonCat}
(f : X✝ ⟶ Y✝)
(u : (↑X✝)ˣ)
:
↑((GrpCat.Hom.hom (units.map f)) u) = (Hom.hom f) ↑u
@[simp]
The functor taking a monoid to its subgroup of units.
Instances For
@[simp]
theorem
CommMonCat.val_units_map_hom_apply
{X✝ Y✝ : CommMonCat}
(f : X✝ ⟶ Y✝)
(u : (↑X✝)ˣ)
:
↑((CommGrpCat.Hom.hom (units.map f)) u) = (Hom.hom f) ↑u
@[simp]
The forgetful-units adjunction between CommGrpCat and CommMonCat.