Documentation

Mathlib.Algebra.Category.MonCat.Limits

The category of (commutative) (additive) monoids 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.

The flat sections of a functor into MonCat form a submonoid of all sections.

Equations
Instances For

    The flat sections of a functor into AddMonCat form an additive submonoid of all sections.

    Equations
    Instances For

      Construction of a limit cone in MonCat. (Internal use only; use the limits API.)

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For

        (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 MonCat 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

            (Internal use only; use the limits API.)

            Equations
            • One or more equations did not get rendered due to their size.
            Instances For

              If J is u-small, the forgetful functor from MonCat.{u} preserves limits of shape J.

              If J is u-small, the forgetful functor from AddMonCat.{u}

              preserves limits of shape J.

              The forgetful functor from monoids to types preserves all limits.

              This means the underlying type of a limit can be computed as a limit in the category of types.

              The forgetful functor from additive monoids to types preserves all limits.

              This means the underlying type of a limit can be computed as a limit in the category of types.

              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 forgetful functor from monoids to types preserves all limits.

              Equations

              The forgetful functor from additive monoids to types preserves all limits.

              Equations

              We show that the forgetful functor CommMonCatMonCat creates limits.

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

              Equations
              • One or more equations did not get rendered due to their size.

              We show that the forgetful functor AddCommMonCatAddMonCat creates limits.

              All we need to do is notice that the limit point has an AddCommMonoid instance available,

              and then reuse the existing limit.

              Equations
              • One or more equations did not get rendered due to their size.

              If J is u-small, CommMonCat.{u} has limits of shape J.

              If J is u-small, AddCommMonCat.{u} has limits of shape J.

              The forgetful functor from commutative monoids to monoids preserves all limits.

              This means the underlying type of a limit can be computed as a limit in the category of monoids.

              The forgetful functor from additive commutative monoids to additive monoids preserves all limits.

              This means the underlying type of a limit can be computed as a limit in the category of additive

              monoids.

              If J is u-small, the forgetful functor from CommMonCat.{u} preserves limits of shape J.

              If J is u-small, the forgetful functor from AddCommMonCat.{u}

              preserves limits of shape J.

              The forgetful functor from commutative monoids to types preserves all limits.

              This means the underlying type of a limit can be computed as a limit in the category of types.

              The forgetful functor from additive commutative monoids to types preserves all

              limits.

              This means the underlying type of a limit can be computed as a limit in the category of types.

              The forgetful functor from commutative monoids to types preserves all limits.

              Equations

              The forgetful functor from commutative additive monoids to types preserves all limits.

              Equations