The category of (commutative) rings 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.
Equations
- SemiRingCat.semiringObj F j = inferInstanceAs (Semiring ↑(F.obj j))
The flat sections of a functor into SemiRingCat
form a subsemiring of all sections.
Equations
- SemiRingCat.sectionsSubsemiring F = { carrier := (F.comp (CategoryTheory.forget SemiRingCat)).sections, mul_mem' := ⋯, one_mem' := ⋯, add_mem' := ⋯, zero_mem' := ⋯ }
Instances For
Equations
- SemiRingCat.sectionsSemiring F = (SemiRingCat.sectionsSubsemiring F).toSemiring
Equations
- SemiRingCat.limitSemiring F = inferInstanceAs (Semiring (Shrink.{?u.65, max ?u.65 ?u.66} ↑(F.comp (CategoryTheory.forget SemiRingCat)).sections))
limit.π (F ⋙ forget SemiRingCat) j
as a RingHom
.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Construction of a limit cone in SemiRingCat
.
(Internal use only; use the limits API.)
Equations
- One or more equations did not get rendered due to their size.
Instances For
Witness that the limit cone in SemiRingCat
is a limit cone.
(Internal use only; use the limits API.)
Equations
- One or more equations did not get rendered due to their size.
Instances For
If (F ⋙ forget SemiRingCat).sections
is u
-small, F
has a limit.
If J
is u
-small, SemiRingCat.{u}
has limits of shape J
.
The category of rings has all limits.
Auxiliary lemma to prove the cone induced by limitCone
is a limit cone.
Equations
Instances For
The forgetful functor from semirings to additive commutative monoids preserves all limits.
An auxiliary declaration to speed up typechecking.
Equations
Instances For
The forgetful functor from semirings to monoids preserves all limits.
The forgetful functor from semirings to types preserves all limits.
Equations
- CommSemiRingCat.commSemiringObj F j = inferInstanceAs (CommSemiring ↑(F.obj j))
Equations
- CommSemiRingCat.limitCommSemiring F = inferInstanceAs (CommSemiring (Shrink.{?u.65, max ?u.65 ?u.66} ↑(F.comp (CategoryTheory.forget CommSemiRingCat)).sections))
We show that the forgetful functor CommSemiRingCat ⥤ SemiRingCat
creates limits.
All we need to do is notice that the limit point has a CommSemiring
instance available,
and then reuse the existing limit.
Equations
- One or more equations did not get rendered due to their size.
A choice of limit cone for a functor into CommSemiRingCat
.
(Generally, you'll just want to use limit F
.)
Equations
Instances For
The chosen cone is a limit cone.
(Generally, you'll just want to use limit.cone F
.)
Equations
Instances For
If (F ⋙ forget CommSemiRingCat).sections
is u
-small, F
has a limit.
If J
is u
-small, CommSemiRingCat.{u}
has limits of shape J
.
The category of rings has all limits.
The forgetful functor from rings to semirings preserves all limits.
The forgetful functor from rings to types preserves all limits. (That is, the underlying types could have been computed instead as limits in the category of types.)
Equations
- RingCat.ringObj F j = inferInstanceAs (Ring ↑(F.obj j))
The flat sections of a functor into RingCat
form a subring of all sections.
Equations
- RingCat.sectionsSubring F = { carrier := (F.comp (CategoryTheory.forget RingCat)).sections, mul_mem' := ⋯, one_mem' := ⋯, add_mem' := ⋯, zero_mem' := ⋯, neg_mem' := ⋯ }
Instances For
Equations
- RingCat.limitRing F = inferInstanceAs (Ring (Shrink.{?u.65, max ?u.65 ?u.66} ↑(F.comp (CategoryTheory.forget RingCat)).sections))
We show that the forgetful functor CommRingCat ⥤ RingCat
creates limits.
All we need to do is notice that the limit point has a Ring
instance available,
and then reuse the existing limit.
Equations
- One or more equations did not get rendered due to their size.
A choice of limit cone for a functor into RingCat
.
(Generally, you'll just want to use limit F
.)
Equations
Instances For
The chosen cone is a limit cone.
(Generally, you'll just want to use limit.cone F
.)
Equations
Instances For
If (F ⋙ forget RingCat).sections
is u
-small, F
has a limit.
If J
is u
-small, RingCat.{u}
has limits of shape J
.
The category of rings has all limits.
The forgetful functor from rings to semirings preserves all limits.
An auxiliary declaration to speed up typechecking.
Equations
Instances For
The forgetful functor from rings to additive commutative groups preserves all limits.
The forgetful functor from rings to types preserves all limits. (That is, the underlying types could have been computed instead as limits in the category of types.)
Equations
- CommRingCat.commRingObj F j = inferInstanceAs (CommRing ↑(F.obj j))
Equations
- CommRingCat.limitCommRing F = inferInstanceAs (CommRing (Shrink.{?u.65, max ?u.65 ?u.66} ↑(F.comp (CategoryTheory.forget CommRingCat)).sections))
We show that the forgetful functor CommRingCat ⥤ RingCat
creates limits.
All we need to do is notice that the limit point has a CommRing
instance available,
and then reuse the existing limit.
Equations
- One or more equations did not get rendered due to their size.
A choice of limit cone for a functor into CommRingCat
.
(Generally, you'll just want to use limit F
.)
Equations
Instances For
The chosen cone is a limit cone.
(Generally, you'll just want to use limit.cone F
.)
Equations
Instances For
If (F ⋙ forget CommRingCat).sections
is u
-small, F
has a limit.
If J
is u
-small, CommRingCat.{u}
has limits of shape J
.
The category of commutative rings has all limits.
The forgetful functor from commutative rings to rings preserves all limits. (That is, the underlying rings could have been computed instead as limits in the category of rings.)
An auxiliary declaration to speed up typechecking.
Equations
Instances For
The forgetful functor from commutative rings to commutative semirings preserves all limits. (That is, the underlying commutative semirings could have been computed instead as limits in the category of commutative semirings.)
The forgetful functor from commutative rings to types preserves all limits. (That is, the underlying types could have been computed instead as limits in the category of types.)