Documentation

Mathlib.CategoryTheory.Subobject.Comma

Subobjects in the category of structured arrows #

We compute the subobjects of an object A in the category StructuredArrow S T for T : C ⥤ D and S : D as a subtype of the subobjects of A.right. We deduce that StructuredArrow S T is well-powered if C is.

Main declarations #

Implementation notes #

Our computation requires that C has all limits and T preserves all limits. Furthermore, we require that the morphisms of C and D are in the same universe. It is possible that both of these requirements can be relaxed by refining the results about limits in comma categories.

We also provide the dual results. As usual, we use Subobject (op A) for the quotient objects of A.

source
def CategoryTheory.StructuredArrow.projectSubobject {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] {S : D} {T : Functor C D} [Limits.HasFiniteLimits C] [Limits.PreservesFiniteLimits T] {A : StructuredArrow S T} :
Subobject A → Subobject A.right

Every subobject of a structured arrow can be projected to a subobject of the underlying object.

Equations
  • One or more equations did not get rendered due to their size.
Instances For
    source
    @[simp]
    theorem CategoryTheory.StructuredArrow.projectSubobject_mk {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] {S : D} {T : Functor C D} [Limits.HasFiniteLimits C] [Limits.PreservesFiniteLimits T] {A P : StructuredArrow S T} (f : P ⟶ A) [Mono f] :
    projectSubobject (Subobject.mk f) = Subobject.mk f.right
    source
    theorem CategoryTheory.StructuredArrow.projectSubobject_factors {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] {S : D} {T : Functor C D} [Limits.HasFiniteLimits C] [Limits.PreservesFiniteLimits T] {A : StructuredArrow S T} (P : Subobject A) :
    ∃ (q : (Functor.fromPUnit S).obj A.left ⟶ T.obj (Subobject.underlying.obj (projectSubobject P))), CategoryStruct.comp q (T.map (projectSubobject P).arrow) = A.hom
    source
    def CategoryTheory.StructuredArrow.liftSubobject {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] {S : D} {T : Functor C D} {A : StructuredArrow S T} (P : Subobject A.right) {q : (Functor.fromPUnit S).obj A.left ⟶ T.obj (Subobject.underlying.obj P)} (hq : CategoryStruct.comp q (T.map P.arrow) = A.hom) :
    Subobject A

    A subobject of the underlying object of a structured arrow can be lifted to a subobject of the structured arrow, provided that there is a morphism making the subobject into a structured arrow.

    Equations
    Instances For
      source
      theorem CategoryTheory.StructuredArrow.lift_projectSubobject {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] {S : D} {T : Functor C D} [Limits.HasFiniteLimits C] [Limits.PreservesFiniteLimits T] {A : StructuredArrow S T} (P : Subobject A) {q : (Functor.fromPUnit S).obj A.left ⟶ T.obj (Subobject.underlying.obj (projectSubobject P))} (hq : CategoryStruct.comp q (T.map (projectSubobject P).arrow) = A.hom) :
      liftSubobject (projectSubobject P) hq = P

      Projecting and then lifting a subobject recovers the original subobject, because there is at most one morphism making the projected subobject into a structured arrow.

      source
      def CategoryTheory.StructuredArrow.subobjectEquiv {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] {S : D} {T : Functor C D} [Limits.HasFiniteLimits C] [Limits.PreservesFiniteLimits T] (A : StructuredArrow S T) :
      Subobject A ≃o { P : Subobject A.right // ∃ (q : (Functor.fromPUnit S).obj A.left ⟶ T.obj (Subobject.underlying.obj P)), CategoryStruct.comp q (T.map P.arrow) = A.hom }

      If A : S → T.obj B is a structured arrow for S : D and T : C ⥤ D, then we can explicitly describe the subobjects of A as the subobjects P of B in C for which A.hom factors through the image of P under T.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        source
        instance CategoryTheory.StructuredArrow.wellPowered_structuredArrow {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] {S : D} {T : Functor C D} [LocallySmall.{w, v₁, u₁} C] [WellPowered.{w, v₁, u₁} C] [Limits.HasFiniteLimits C] [Limits.PreservesFiniteLimits T] :
        WellPowered.{w, v₁, max u₁ v₂} (StructuredArrow S T)

        If C is well-powered and complete and T preserves limits, then StructuredArrow S T is well-powered.

        source
        def CategoryTheory.CostructuredArrow.projectQuotient {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] {S : Functor C D} {T : D} [Limits.HasFiniteColimits C] [Limits.PreservesFiniteColimits S] {A : CostructuredArrow S T} :
        Subobject (Opposite.op A) → Subobject (Opposite.op A.left)

        Every quotient of a costructured arrow can be projected to a quotient of the underlying object.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For
          source
          @[simp]
          theorem CategoryTheory.CostructuredArrow.projectQuotient_mk {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] {S : Functor C D} {T : D} [Limits.HasFiniteColimits C] [Limits.PreservesFiniteColimits S] {A : CostructuredArrow S T} {P : (CostructuredArrow S T)ᵒᵖ} (f : P ⟶ Opposite.op A) [Mono f] :
          projectQuotient (Subobject.mk f) = Subobject.mk f.unop.left.op
          source
          theorem CategoryTheory.CostructuredArrow.projectQuotient_factors {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] {S : Functor C D} {T : D} [Limits.HasFiniteColimits C] [Limits.PreservesFiniteColimits S] {A : CostructuredArrow S T} (P : Subobject (Opposite.op A)) :
          ∃ (q : S.obj (Opposite.unop (Subobject.underlying.obj (projectQuotient P))) ⟶ (Functor.fromPUnit T).obj A.right), CategoryStruct.comp (S.map (projectQuotient P).arrow.unop) q = A.hom
          source
          def CategoryTheory.CostructuredArrow.liftQuotient {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] {S : Functor C D} {T : D} {A : CostructuredArrow S T} (P : Subobject (Opposite.op A.left)) {q : S.obj (Opposite.unop (Subobject.underlying.obj P)) ⟶ (Functor.fromPUnit T).obj A.right} (hq : CategoryStruct.comp (S.map P.arrow.unop) q = A.hom) :
          Subobject (Opposite.op A)

          A quotient of the underlying object of a costructured arrow can be lifted to a quotient of the costructured arrow, provided that there is a morphism making the quotient into a costructured arrow.

          Equations
          Instances For
            source
            @[simp]
            theorem CategoryTheory.CostructuredArrow.unop_left_comp_underlyingIso_hom_unop {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] {S : Functor C D} {T : D} {A : CostructuredArrow S T} {P : (CostructuredArrow S T)ᵒᵖ} (f : P ⟶ Opposite.op A) [Mono f.unop.left.op] :
            CategoryStruct.comp f.unop.left (Subobject.underlyingIso f.unop.left.op).hom.unop = (Subobject.mk f.unop.left.op).arrow.unop

            Technical lemma for lift_projectQuotient.

            source
            theorem CategoryTheory.CostructuredArrow.lift_projectQuotient {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] {S : Functor C D} {T : D} [Limits.HasFiniteColimits C] [Limits.PreservesFiniteColimits S] {A : CostructuredArrow S T} (P : Subobject (Opposite.op A)) {q : S.obj (Opposite.unop (Subobject.underlying.obj (projectQuotient P))) ⟶ (Functor.fromPUnit T).obj A.right} (hq : CategoryStruct.comp (S.map (projectQuotient P).arrow.unop) q = A.hom) :
            liftQuotient (projectQuotient P) hq = P

            Projecting and then lifting a quotient recovers the original quotient, because there is at most one morphism making the projected quotient into a costructured arrow.

            source
            theorem CategoryTheory.CostructuredArrow.unop_left_comp_ofMkLEMk_unop {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] {S : Functor C D} {T : D} {A : CostructuredArrow S T} {P Q : (CostructuredArrow S T)ᵒᵖ} {f : P ⟶ Opposite.op A} {g : Q ⟶ Opposite.op A} [Mono f.unop.left.op] [Mono g.unop.left.op] (h : Subobject.mk f.unop.left.op ≤ Subobject.mk g.unop.left.op) :
            CategoryStruct.comp g.unop.left (Subobject.ofMkLEMk f.unop.left.op g.unop.left.op h).unop = f.unop.left

            Technical lemma for quotientEquiv.

            source
            def CategoryTheory.CostructuredArrow.quotientEquiv {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] {S : Functor C D} {T : D} [Limits.HasFiniteColimits C] [Limits.PreservesFiniteColimits S] (A : CostructuredArrow S T) :
            Subobject (Opposite.op A) ≃o { P : Subobject (Opposite.op A.left) // ∃ (q : S.obj (Opposite.unop (Subobject.underlying.obj P)) ⟶ (Functor.fromPUnit T).obj A.right), CategoryStruct.comp (S.map P.arrow.unop) q = A.hom }

            If A : S.obj B ⟶ T is a costructured arrow for S : C ⥤ D and T : D, then we can explicitly describe the quotients of A as the quotients P of B in C for which A.hom factors through the image of P under S.

            Equations
            • One or more equations did not get rendered due to their size.
            Instances For
              source
              instance CategoryTheory.CostructuredArrow.well_copowered_costructuredArrow {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] {S : Functor C D} {T : D} [LocallySmall.{w, v₁, u₁} C] [WellPowered.{w, v₁, u₁} Cᵒᵖ] [Limits.HasFiniteColimits C] [Limits.PreservesFiniteColimits S] :
              WellPowered.{w, v₁, max u₁ v₂} (CostructuredArrow S T)ᵒᵖ

              If C is well-copowered and cocomplete and S preserves colimits, then CostructuredArrow S T is well-copowered.