Documentation

Mathlib.CategoryTheory.Widesubcategory

Wide subcategories #

A wide subcategory of a category C is a subcategory containing all the objects of C.

Main declarations #

Given a category D, a function F : C β†’ D from a type C to the objects of D, and a morphism property P on D which contains identities and is stable under composition, the type class InducedWideCategory D F P is a typeclass synonym for C which comes equipped with a category structure whose morphisms X ⟢ Y are the morphisms in D which have the property P.

The instance WideSubcategory.category provides a category structure on WideSubcategory P whose objects are the objects of C and morphisms are the morphisms in C which have the property P.

def CategoryTheory.InducedWideCategory {C : Type u₁} (D : Type uβ‚‚) [Category.{v₁, uβ‚‚} D] (_F : C β†’ D) (_P : MorphismProperty D) [_P.IsMultiplicative] :
Type u₁

InducedWideCategory D F P, where F : C β†’ D, is a typeclass synonym for C, which provides a category structure so that the morphisms X ⟢ Y are the morphisms in D from F X to F Y which satisfy a property P : MorphismProperty D that is multiplicative.

Equations
    Instances For
      instance CategoryTheory.InducedWideCategory.hasCoeToSort {C : Type u₁} {D : Type uβ‚‚} [Category.{v₁, uβ‚‚} D] (F : C β†’ D) (P : MorphismProperty D) [P.IsMultiplicative] {Ξ± : Sort u_1} [CoeSort D Ξ±] :
      Equations
        @[simp]
        theorem CategoryTheory.InducedWideCategory.category_comp_coe {C : Type u₁} {D : Type uβ‚‚} [Category.{v₁, uβ‚‚} D] (F : C β†’ D) (P : MorphismProperty D) [P.IsMultiplicative] {x✝ x✝¹ x✝² : InducedWideCategory D F P} (f : ↑{f : F x✝ ⟢ F x✝¹ | P f}) (g : ↑{f : F x✝¹ ⟢ F x✝² | P f}) :
        ↑(CategoryStruct.comp f g) = CategoryStruct.comp ↑f ↑g

        The forgetful functor from an induced wide category to the original category.

        Equations
          Instances For
            @[simp]
            theorem CategoryTheory.wideInducedFunctor_obj {C : Type u₁} {D : Type uβ‚‚} [Category.{v₁, uβ‚‚} D] (F : C β†’ D) (P : MorphismProperty D) [P.IsMultiplicative] (a✝ : C) :
            (wideInducedFunctor F P).obj a✝ = F a✝
            @[simp]
            theorem CategoryTheory.wideInducedFunctor_map {C : Type u₁} {D : Type uβ‚‚} [Category.{v₁, uβ‚‚} D] (F : C β†’ D) (P : MorphismProperty D) [P.IsMultiplicative] {x✝ x✝¹ : InducedWideCategory D F P} (f : x✝ ⟢ x✝¹) :
            (wideInducedFunctor F P).map f = ↑f

            The induced functor wideInducedFunctor F P : InducedWideCategory D F P β₯€ D is faithful.

            Structure for wide subcategories. Objects ignore the morphism property.

            • obj : C

              The category of which this is a wide subcategory

            Instances For
              theorem CategoryTheory.WideSubcategory.ext_iff {C : Type u₁} {inst✝ : Category.{v₁, u₁} C} {_P : MorphismProperty C} {inst✝¹ : _P.IsMultiplicative} {x y : WideSubcategory _P} :
              x = y ↔ x.obj = y.obj
              theorem CategoryTheory.WideSubcategory.ext {C : Type u₁} {inst✝ : Category.{v₁, u₁} C} {_P : MorphismProperty C} {inst✝¹ : _P.IsMultiplicative} {x y : WideSubcategory _P} (obj : x.obj = y.obj) :
              x = y

              The forgetful functor from a wide subcategory into the original category ("forgetting" the condition).

              Equations
                Instances For