mathlib documentation

algebra.category.Group.limits

The category of (commutative) (additive) groups has all limits #

Further, these limits are preserved by the forgetful functor --- that is, the underlying types are just the limits in the category of types.

@[instance]
Equations
def Group.sections_subgroup {J : Type u} [category_theory.small_category J] (F : J Group) :
subgroup (Π (j : J), (F.obj j))

The flat sections of a functor into Group form a subgroup of all sections.

Equations

The flat sections of a functor into AddGroup form an additive subgroup of all sections.

@[instance]

We show that the forgetful functor GroupMon creates limits.

All we need to do is notice that the limit point has a group instance available, and then reuse the existing limit.

Equations

A choice of limit cone for a functor into Group. (Generally, you'll just want to use limit F.)

A choice of limit cone for a functor into Group. (Generally, you'll just want to use limit F.)

Equations

The chosen cone is a limit cone. (Generally, you'll just want to use limit.cone F.)

@[instance]

The category of groups has all limits.

@[instance]

The forgetful functor from groups to monoids preserves all limits. (That is, the underlying monoid could have been computed instead as limits in the category of monoids.)

Equations
@[instance]

The forgetful functor from groups to types preserves all limits. (That is, the underlying types could have been computed instead as limits in the category of types.)

Equations
@[instance]

We show that the forgetful functor CommGroupGroup creates limits.

All we need to do is notice that the limit point has a comm_group instance available, and then reuse the existing limit.

Equations

A choice of limit cone for a functor into CommGroup. (Generally, you'll just want to use limit F.)

Equations

A choice of limit cone for a functor into CommGroup. (Generally, you'll just want to use limit F.)

The chosen cone is a limit cone. (Generally, you'll just wantto use limit.cone F.)

@[instance]

The category of commutative groups has all limits.

@[instance]

The forgetful functor from commutative groups to groups preserves all limits. (That is, the underlying group could have been computed instead as limits in the category of groups.)

Equations
@[instance]

The forgetful functor from commutative groups to commutative monoids preserves all limits. (That is, the underlying commutative monoids could have been computed instead as limits in the category of commutative monoids.)

Equations
@[instance]

The forgetful functor from commutative groups to types preserves all limits. (That is, the underlying types could have been computed instead as limits in the category of types.)

Equations