Effective epimorphic sieves

We define the notion of effective epimorphic (pre)sieves and provide some API for relating the notion with the notions of effective epimorphism and effective epimorphic family.

More precisely, if f is a morphism, then f is an effective epi if and only if the sieve it generates is effective epimorphic; see CategoryTheory.Sieve.effectiveEpimorphic_singleton. The analogous statement for a family of morphisms is in the theorem CategoryTheory.Sieve.effectiveEpimorphic_family.

def CategoryTheory.Sieve.EffectiveEpimorphic {C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] {X : C} (S : CategoryTheory.Sieve X) : Prop

A sieve is effective epimorphic if the associated cocone is a colimit cocone.

Equations

• CategoryTheory.Sieve.EffectiveEpimorphic S = Nonempty (CategoryTheory.Limits.IsColimit (CategoryTheory.Presieve.cocone S.arrows))

@[inline, reducible]

abbrev CategoryTheory.Presieve.EffectiveEpimorphic {C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] {X : C} (S : CategoryTheory.Presieve X) : Prop

A presieve is effective epimorphic if the cocone associated to the sieve it generates is a colimit cocone.

Equations

• CategoryTheory.Presieve.EffectiveEpimorphic S = CategoryTheory.Sieve.EffectiveEpimorphic (CategoryTheory.Sieve.generate S)

def CategoryTheory.Sieve.generateSingleton {C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] {X : C} {Y : C} (f : Y ⟶ X) : CategoryTheory.Sieve X

The sieve of morphisms which factor through a given morphism f. This is equal to Sieve.generate (Presieve.singleton f), but has more convenient definitional properties.

Equations

• CategoryTheory.Sieve.generateSingleton f = { arrows := fun (Z : C) => {g : Z ⟶ X | ∃ (e : Z ⟶ Y), CategoryTheory.CategoryStruct.comp e f = g}, downward_closed := ⋯ }

theorem CategoryTheory.Sieve.generateSingleton_eq {C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] {X : C} {Y : C} (f : Y ⟶ X) : CategoryTheory.Sieve.generate (CategoryTheory.Presieve.singleton f) = CategoryTheory.Sieve.generateSingleton f

def CategoryTheory.isColimitOfEffectiveEpiStruct {C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] {X : C} {Y : C} (f : Y ⟶ X) (Hf : CategoryTheory.EffectiveEpiStruct f) : CategoryTheory.Limits.IsColimit (CategoryTheory.Presieve.cocone (CategoryTheory.Sieve.generateSingleton f).arrows)

Implementation: This is a construction which will be used in the proof that the sieve generated by a single arrow is effective epimorphic if and only if the arrow is an effective epi.

Equations

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

noncomputable def CategoryTheory.effectiveEpiStructOfIsColimit {C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] {X : C} {Y : C} (f : Y ⟶ X) (Hf : CategoryTheory.Limits.IsColimit (CategoryTheory.Presieve.cocone (CategoryTheory.Sieve.generateSingleton f).arrows)) : CategoryTheory.EffectiveEpiStruct f

Implementation: This is a construction which will be used in the proof that the sieve generated by a single arrow is effective epimorphic if and only if the arrow is an effective epi.

Equations

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

theorem CategoryTheory.Sieve.effectiveEpimorphic_singleton {C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] {X : C} {Y : C} (f : Y ⟶ X) : CategoryTheory.Presieve.EffectiveEpimorphic (CategoryTheory.Presieve.singleton f) ↔ CategoryTheory.EffectiveEpi f

def CategoryTheory.Sieve.generateFamily {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] {B : C} {α : Type u_2} (X : α → C) (π : (a : α) → X a ⟶ B) : CategoryTheory.Sieve B

The sieve of morphisms which factor through a morphism in a given family. This is equal to Sieve.generate (Presieve.ofArrows X π), but has more convenient definitional properties.

Equations

• CategoryTheory.Sieve.generateFamily X π = { arrows := fun (Y : C) => {f : Y ⟶ B | ∃ (a : α) (g : Y ⟶ X a), CategoryTheory.CategoryStruct.comp g (π a) = f}, downward_closed := ⋯ }

theorem CategoryTheory.Sieve.generateFamily_eq {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] {B : C} {α : Type u_2} (X : α → C) (π : (a : α) → X a ⟶ B) : CategoryTheory.Sieve.generate (CategoryTheory.Presieve.ofArrows X π) = CategoryTheory.Sieve.generateFamily X π

def CategoryTheory.isColimitOfEffectiveEpiFamilyStruct {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] {B : C} {α : Type u_2} (X : α → C) (π : (a : α) → X a ⟶ B) (H : CategoryTheory.EffectiveEpiFamilyStruct X π) : CategoryTheory.Limits.IsColimit (CategoryTheory.Presieve.cocone (CategoryTheory.Sieve.generateFamily X π).arrows)

Implementation: This is a construction which will be used in the proof that the sieve generated by a family of arrows is effective epimorphic if and only if the family is an effective epi.

Equations

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

noncomputable def CategoryTheory.effectiveEpiFamilyStructOfIsColimit {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] {B : C} {α : Type u_2} (X : α → C) (π : (a : α) → X a ⟶ B) (H : CategoryTheory.Limits.IsColimit (CategoryTheory.Presieve.cocone (CategoryTheory.Sieve.generateFamily X π).arrows)) : CategoryTheory.EffectiveEpiFamilyStruct X π

Implementation: This is a construction which will be used in the proof that the sieve generated by a family of arrows is effective epimorphic if and only if the family is an effective epi.

Equations

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

theorem CategoryTheory.Sieve.effectiveEpimorphic_family {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] {B : C} {α : Type u_2} (X : α → C) (π : (a : α) → X a ⟶ B) : CategoryTheory.Presieve.EffectiveEpimorphic (CategoryTheory.Presieve.ofArrows X π) ↔ CategoryTheory.EffectiveEpiFamily X π