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 #
AddCommGroupCat.free
: constructs the functor associating to a typeX
the free abelian group with generatorsx : X
.GroupCat.free
: constructs the functor associating to a typeX
the free group with generatorsx : X
.abelianize
: constructs the functor which associates to a groupG
its abelianizationGᵃᵇ
.
Main statements #
AddCommGroupCat.adj
: proves thatAddCommGroupCat.free
is the left adjoint of the forgetful functor from abelian groups to types.GroupCat.adj
: proves thatGroupCat.free
is the left adjoint of the forgetful functor from groups to types.abelianizeAdj
: proves thatabelianize
is 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
.
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[simp]
theorem
AddCommGroupCat.free_obj_coe
{α : Type u}
:
↑(AddCommGroupCat.free.obj α) = FreeAbelianGroup α
theorem
AddCommGroupCat.free_map_coe
{α : Type u}
{β : Type u}
{f : α → β}
(x : FreeAbelianGroup α)
:
(AddCommGroupCat.free.map f) x = f <$> x
The free-forgetful adjunction for abelian groups.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The free functor Type u ⥤ Group
sending a type X
to the free group with generators x : X
.
Equations
- GroupCat.free = { obj := fun (α : Type u) => GroupCat.of (FreeGroup α), map := fun {X Y : Type u} => FreeGroup.map, map_id := GroupCat.free.proof_1, map_comp := @GroupCat.free.proof_2 }
Instances For
The free-forgetful adjunction for groups.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- GroupCat.instIsRightAdjointForget = { left := GroupCat.free, adj := GroupCat.adj }
@[simp]
theorem
MonCat.units_map :
∀ {X Y : MonCat} (f : X ⟶ Y), MonCat.units.map f = GroupCat.ofHom (Units.map f)
The functor taking a monoid to its subgroup of units.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- instIsRightAdjointGroupCatMonCatUnits = { left := CategoryTheory.forget₂ GroupCat MonCat, adj := GroupCat.forget₂MonAdj }
@[simp]
@[simp]
theorem
CommMonCat.units_map :
∀ {X Y : CommMonCat} (f : X ⟶ Y), CommMonCat.units.map f = CommGroupCat.ofHom (Units.map f)
The functor taking a monoid to its subgroup of units.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The forgetful-units adjunction between CommGroupCat
and CommMonCat
.
Equations
- One or more equations did not get rendered due to their size.