Documentation

Mathlib.Topology.Category.CompHausLike.Limits

Explicit limits and colimits #

This file collects some constructions of explicit limits and colimits in CompHausLike P, which may be useful due to their definitional properties.

Main definitions #

Main results #

@[reducible, inline]
abbrev CompHausLike.HasExplicitFiniteCoproduct {P : TopCatProp} {α : Type w} (X : αCompHausLike P) :

A typeclass describing the property that forming the disjoint union is stable under the property P.

Equations
    Instances For

      The coproduct of a finite family of objects in CompHaus, constructed as the disjoint union with its usual topology.

      Equations
        Instances For

          The inclusion of one of the factors into the explicit finite coproduct.

          Equations
            Instances For
              def CompHausLike.finiteCoproduct.desc {P : TopCatProp} {α : Type w} [Finite α] (X : αCompHausLike P) [HasExplicitFiniteCoproduct X] {B : CompHausLike P} (e : (a : α) → X a B) :

              To construct a morphism from the explicit finite coproduct, it suffices to specify a morphism from each of its factors. This is essentially the universal property of the coproduct.

              Equations
                Instances For
                  @[simp]
                  theorem CompHausLike.finiteCoproduct.ι_desc {P : TopCatProp} {α : Type w} [Finite α] (X : αCompHausLike P) [HasExplicitFiniteCoproduct X] {B : CompHausLike P} (e : (a : α) → X a B) (a : α) :
                  @[reducible, inline]

                  The coproduct cocone associated to the explicit finite coproduct.

                  Equations
                    Instances For

                      The explicit finite coproduct cocone is a colimit cocone.

                      Equations
                        Instances For
                          theorem CompHausLike.finiteCoproduct.ι_jointly_surjective {P : TopCatProp} {α : Type w} [Finite α] (X : αCompHausLike P) [HasExplicitFiniteCoproduct X] (R : (finiteCoproduct X).toTop) :
                          ∃ (a : α) (r : (X a).toTop), R = (CategoryTheory.ConcreteCategory.hom (ι X a)) r
                          theorem CompHausLike.finiteCoproduct.ι_desc_apply {P : TopCatProp} {α : Type w} [Finite α] (X : αCompHausLike P) [HasExplicitFiniteCoproduct X] {B : CompHausLike P} {π : (a : α) → X a B} (a : α) (x : (fun (X : CompHausLike P) => X.toTop) (X a)) :

                          A typeclass describing the property that forming all finite disjoint unions is stable under the property P.

                          Instances

                            The inclusion maps into the explicit finite coproduct are open embeddings.

                            The inclusion maps into the abstract finite coproduct are open embeddings.

                            The functor to another CompHausLike preserves finite coproducts if they exist.

                            @[reducible, inline]
                            abbrev CompHausLike.HasExplicitPullback {P : TopCatProp} {X Y B : CompHausLike P} (f : X B) (g : Y B) :

                            A typeclass describing the property that an explicit pullback is stable under the property P.

                            Equations
                              Instances For
                                def CompHausLike.pullback {P : TopCatProp} {X Y B : CompHausLike P} (f : X B) (g : Y B) [HasExplicitPullback f g] :

                                The pullback of two morphisms f,g in CompHaus, constructed explicitly as the set of pairs (x,y) such that f x = g y, with the topology induced by the product.

                                Equations
                                  Instances For
                                    def CompHausLike.pullback.fst {P : TopCatProp} {X Y B : CompHausLike P} (f : X B) (g : Y B) [HasExplicitPullback f g] :

                                    The projection from the pullback to the first component.

                                    Equations
                                      Instances For
                                        def CompHausLike.pullback.snd {P : TopCatProp} {X Y B : CompHausLike P} (f : X B) (g : Y B) [HasExplicitPullback f g] :

                                        The projection from the pullback to the second component.

                                        Equations
                                          Instances For
                                            def CompHausLike.pullback.lift {P : TopCatProp} {X Y B : CompHausLike P} (f : X B) (g : Y B) [HasExplicitPullback f g] {Z : CompHausLike P} (a : Z X) (b : Z Y) (w : CategoryTheory.CategoryStruct.comp a f = CategoryTheory.CategoryStruct.comp b g) :

                                            Construct a morphism to the explicit pullback given morphisms to the factors which are compatible with the maps to the base. This is essentially the universal property of the pullback.

                                            Equations
                                              Instances For
                                                @[simp]
                                                @[simp]

                                                The pullback cone whose cone point is the explicit pullback.

                                                Equations
                                                  Instances For
                                                    @[simp]
                                                    theorem CompHausLike.pullback.cone_π {P : TopCatProp} {X Y B : CompHausLike P} (f : X B) (g : Y B) [HasExplicitPullback f g] :
                                                    @[simp]
                                                    theorem CompHausLike.pullback.cone_pt {P : TopCatProp} {X Y B : CompHausLike P} (f : X B) (g : Y B) [HasExplicitPullback f g] :
                                                    (cone f g).pt = pullback f g

                                                    The explicit pullback cone is a limit cone.

                                                    Equations
                                                      Instances For
                                                        @[simp]
                                                        theorem CompHausLike.pullback.isLimit_lift {P : TopCatProp} {X Y B : CompHausLike P} (f : X B) (g : Y B) [HasExplicitPullback f g] (s : CategoryTheory.Limits.PullbackCone f g) :
                                                        (isLimit f g).lift s = lift f g s.fst s.snd

                                                        The functor to TopCat creates pullbacks if they exist.

                                                        Equations

                                                          The functor to another CompHausLike preserves pullbacks.

                                                          A typeclass describing the property that forming all explicit pullbacks is stable under the property P.

                                                          Instances

                                                            A typeclass describing the property that explicit pullbacks along inclusion maps into disjoint unions is stable under the property P.

                                                            Instances

                                                              A one-element space is terminal in CompHaus

                                                              Equations
                                                                Instances For