mathlib documentation

category_theory.full_subcategory

Induced categories and full subcategories #

Given a category D and a function F : C → Dfrom a type C to the objects of D, there is an essentially unique way to give C a category structure such that F becomes a fully faithful functor, namely by taking $$ Hom_C(X, Y) = Hom_D(FX, FY) $$. We call this the category induced from D along F.

As a special case, if C is a subtype of D, this produces the full subcategory of D on the objects belonging to C. In general the induced category is equivalent to the full subcategory of D on the image of F.

Implementation notes #

It looks odd to make D an explicit argument of induced_category, when it is determined by the argument F anyways. The reason to make D explicit is in order to control its syntactic form, so that instances like induced_category.has_forget₂ (elsewhere) refer to the correct form of D. This is used to set up several algebraic categories like

def CommMon : Type (u+1) := induced_category Mon (bundled.map @comm_monoid.to_monoid) -- not induced_category (bundled monoid) (bundled.map @comm_monoid.to_monoid), -- even though Mon = bundled monoid!

@[nolint]
def category_theory.induced_category {C : Type u₁} (D : Type u₂) [category_theory.category D] (F : C → D) :
Type u₁

induced_category D F, 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.

Equations
@[protected, instance]
def category_theory.induced_category.has_coe_to_sort {C : Type u₁} {D : Type u₂} [category_theory.category D] (F : C → D) {α : Sort u_1} [has_coe_to_sort D α] :
Equations
@[protected, instance]
Equations
def category_theory.induced_functor {C : Type u₁} {D : Type u₂} [category_theory.category D] (F : C → D) :

The forgetful functor from an induced category to the original category, forgetting the extra data.

Equations
@[simp]
theorem category_theory.induced_functor_obj {C : Type u₁} {D : Type u₂} [category_theory.category D] (F : C → D) (ᾰ : C) :
@[simp]
theorem category_theory.induced_functor_map {C : Type u₁} {D : Type u₂} [category_theory.category D] (F : C → D) (x y : category_theory.induced_category D F) (f : x y) :
@[protected, instance]
@[protected, instance]
def category_theory.full_subcategory {C : Type u₂} [category_theory.category C] (Z : C → Prop) :

The category structure on a subtype; morphisms just ignore the property.

See https://stacks.math.columbia.edu/tag/001D. We do not define 'strictly full' subcategories.

Equations
def category_theory.full_subcategory_inclusion {C : Type u₂} [category_theory.category C] (Z : C → Prop) :
{X // Z X} C

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

Equations
@[simp]
theorem category_theory.full_subcategory_inclusion.obj {C : Type u₂} [category_theory.category C] (Z : C → Prop) {X : {X // Z X}} :
@[simp]
theorem category_theory.full_subcategory_inclusion.map {C : Type u₂} [category_theory.category C] (Z : C → Prop) {X Y : {X // Z X}} {f : X Y} :