Essential image of a functor

The essential image essImage of a functor consists of the objects in the target category which are isomorphic to an object in the image of the object function. This, for instance, allows us to talk about objects belonging to a subcategory expressed as a functor rather than a subtype, preserving the principle of equivalence. For example this lets us define exponential ideals.

The essential image can also be seen as a subcategory of the target category, and witnesses that a functor decomposes into an essentially surjective functor and a fully faithful functor. (TODO: show that this decomposition forms an orthogonal factorisation system).

def CategoryTheory.Functor.essImage {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) : Set D

The essential image of a functor F consists of those objects in the target category which are isomorphic to an object in the image of the function F.obj. In other words, this is the closure under isomorphism of the function F.obj. This is the "non-evil" way of describing the image of a functor.

Equations

• F.essImage Y = ∃ (X : C), Nonempty (F.obj X ≅ Y)

def CategoryTheory.Functor.essImage.witness {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {Y : D} (h : Y ∈ F.essImage) : C

Get the witnessing object that Y is in the subcategory given by F.

Equations

• CategoryTheory.Functor.essImage.witness h = Exists.choose h

def CategoryTheory.Functor.essImage.getIso {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {Y : D} (h : Y ∈ F.essImage) : F.obj (CategoryTheory.Functor.essImage.witness h) ≅ Y

Extract the isomorphism between F.obj h.witness and Y itself.

Equations

• CategoryTheory.Functor.essImage.getIso h = Classical.choice ⋯

theorem CategoryTheory.Functor.essImage.ofIso {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {Y Y' : D} (h : Y ≅ Y') (hY : Y ∈ F.essImage) : Y' ∈ F.essImage

Being in the essential image is a "hygienic" property: it is preserved under isomorphism.

theorem CategoryTheory.Functor.essImage.ofNatIso {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] {F F' : CategoryTheory.Functor C D} (h : F ≅ F') {Y : D} (hY : Y ∈ F.essImage) : Y ∈ F'.essImage

If Y is in the essential image of F then it is in the essential image of F' as long as F ≅ F'.

theorem CategoryTheory.Functor.essImage_eq_of_natIso {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] {F F' : CategoryTheory.Functor C D} (h : F ≅ F') : F.essImage = F'.essImage

Isomorphic functors have equal essential images.

theorem CategoryTheory.Functor.obj_mem_essImage {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor D C) (Y : D) : F.obj Y ∈ F.essImage

An object in the image is in the essential image.

def CategoryTheory.Functor.EssImageSubcategory {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) : Type u₂

The essential image of a functor, interpreted as a full subcategory of the target category.

Equations

• F.EssImageSubcategory = CategoryTheory.FullSubcategory F.essImage

instance CategoryTheory.Functor.instCategoryEssImageSubcategory {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} : CategoryTheory.Category.{v₂, u₂} F.EssImageSubcategory

Equations

• CategoryTheory.Functor.instCategoryEssImageSubcategory = inferInstance

def CategoryTheory.Functor.essImageInclusion {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) : CategoryTheory.Functor F.EssImageSubcategory D

The essential image as a subcategory has a fully faithful inclusion into the target category.

Equations

• F.essImageInclusion = CategoryTheory.fullSubcategoryInclusion F.essImage

@[simp]

theorem CategoryTheory.Functor.essImageInclusion_map {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) {X✝ Y✝ : CategoryTheory.InducedCategory D CategoryTheory.FullSubcategory.obj} (f : X✝ ⟶ Y✝) : F.essImageInclusion.map f = f

@[simp]

theorem CategoryTheory.Functor.essImageInclusion_obj {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (self : CategoryTheory.FullSubcategory F.essImage) : F.essImageInclusion.obj self = self.obj

instance CategoryTheory.Functor.instFullEssImageSubcategoryEssImageInclusion {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} : F.essImageInclusion.Full

Equations

• ⋯ = ⋯

instance CategoryTheory.Functor.instFaithfulEssImageSubcategoryEssImageInclusion {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} : F.essImageInclusion.Faithful

Equations

• ⋯ = ⋯

theorem CategoryTheory.Functor.essImage_ext {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) {X Y : F.EssImageSubcategory} (f g : X ⟶ Y) (h : F.essImageInclusion.map f = F.essImageInclusion.map g) : f = g

def CategoryTheory.Functor.toEssImage {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) : CategoryTheory.Functor C F.EssImageSubcategory

Given a functor F : C ⥤ D, we have an (essentially surjective) functor from C to the essential image of F.

Equations

• F.toEssImage = CategoryTheory.FullSubcategory.lift F.essImage F ⋯

@[simp]

theorem CategoryTheory.Functor.toEssImage_obj_obj {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (X : C) : (F.toEssImage.obj X).obj = F.obj X

@[simp]

theorem CategoryTheory.Functor.toEssImage_map {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) {X✝ Y✝ : C} (f : X✝ ⟶ Y✝) : F.toEssImage.map f = F.map f

def CategoryTheory.Functor.toEssImageCompEssentialImageInclusion {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) : F.toEssImage.comp F.essImageInclusion ≅ F

The functor F factorises through its essential image, where the first functor is essentially surjective and the second is fully faithful.

Equations

• F.toEssImageCompEssentialImageInclusion = CategoryTheory.FullSubcategory.lift_comp_inclusion F.essImage F ⋯

@[simp]

theorem CategoryTheory.Functor.toEssImageCompEssentialImageInclusion_inv_app {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (X : C) : F.toEssImageCompEssentialImageInclusion.inv.app X = CategoryTheory.CategoryStruct.id (F.obj X)

@[simp]

theorem CategoryTheory.Functor.toEssImageCompEssentialImageInclusion_hom_app {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (X : C) : F.toEssImageCompEssentialImageInclusion.hom.app X = CategoryTheory.CategoryStruct.id (F.obj X)

class CategoryTheory.Functor.EssSurj {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) : Prop

A functor F : C ⥤ D is essentially surjective if every object of D is in the essential image of F. In other words, for every Y : D, there is some X : C with F.obj X ≅ Y.

See https://stacks.math.columbia.edu/tag/001C.

• mem_essImage : ∀ (Y : D), Y ∈ F.essImage

  All the objects of the target category are in the essential image.

instance CategoryTheory.Functor.EssSurj.toEssImage {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} : F.toEssImage.EssSurj

Equations

• ⋯ = ⋯

theorem CategoryTheory.Functor.essSurj_of_surj {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} (h : Function.Surjective F.obj) : F.EssSurj

def CategoryTheory.Functor.objPreimage {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) [F.EssSurj] (Y : D) : C

Given an essentially surjective functor, we can find a preimage for every object Y in the codomain. Applying the functor to this preimage will yield an object isomorphic to Y, see obj_obj_preimage_iso.

Equations

• F.objPreimage Y = CategoryTheory.Functor.essImage.witness ⋯

def CategoryTheory.Functor.objObjPreimageIso {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) [F.EssSurj] (Y : D) : F.obj (F.objPreimage Y) ≅ Y

Applying an essentially surjective functor to a preimage of Y yields an object that is isomorphic to Y.

Equations

• F.objObjPreimageIso Y = CategoryTheory.Functor.essImage.getIso ⋯

instance CategoryTheory.Functor.Faithful.toEssImage {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) [F.Faithful] : F.toEssImage.Faithful

The induced functor of a faithful functor is faithful.

Equations

• ⋯ = ⋯

instance CategoryTheory.Functor.Full.toEssImage {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) [F.Full] : F.toEssImage.Full

The induced functor of a full functor is full.

Equations

• ⋯ = ⋯

instance CategoryTheory.Functor.instEssSurjId {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : (CategoryTheory.Functor.id C).EssSurj

Equations

• ⋯ = ⋯

theorem CategoryTheory.Functor.essSurj_of_iso {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] {F G : CategoryTheory.Functor C D} [F.EssSurj] (α : F ≅ G) : G.EssSurj

instance CategoryTheory.Functor.essSurj_comp {C : Type u₁} {D : Type u₂} {E : Type u₃} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Category.{v₃, u₃} E] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D E) [F.EssSurj] [G.EssSurj] : (F.comp G).EssSurj

Equations

• ⋯ = ⋯

theorem CategoryTheory.Functor.essSurj_of_comp_fully_faithful {C : Type u₁} {D : Type u₂} {E : Type u₃} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Category.{v₃, u₃} E] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D E) [(F.comp G).EssSurj] [G.Faithful] [G.Full] : F.EssSurj

@[deprecated CategoryTheory.Functor.EssSurj]

def CategoryTheory.EssSurj {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) : Prop

Alias of CategoryTheory.Functor.EssSurj.

---

A functor F : C ⥤ D is essentially surjective if every object of D is in the essential image of F. In other words, for every Y : D, there is some X : C with F.obj X ≅ Y.

See https://stacks.math.columbia.edu/tag/001C.

Equations

• @CategoryTheory.EssSurj = @CategoryTheory.Functor.EssSurj

@[deprecated CategoryTheory.Functor.essSurj_of_iso]

theorem CategoryTheory.Iso.map_essSurj {C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] {F G : CategoryTheory.Functor C D} [F.EssSurj] (α : F ≅ G) : G.EssSurj

Alias of CategoryTheory.Functor.essSurj_of_iso.