Preserving terminal object

Constructions to relate the notions of preserving terminal objects and reflecting terminal objects to concrete objects.

In particular, we show that terminalComparison G is an isomorphism iff G preserves terminal objects.

def CategoryTheory.Limits.isLimitMapConeEmptyConeEquiv {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) (X : C) : IsLimit (G.mapCone (asEmptyCone X)) ≃ IsTerminal (G.obj X)

The map of an empty cone is a limit iff the mapped object is terminal.

Equations

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

def CategoryTheory.Limits.IsTerminal.isTerminalObj {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) (X : C) [PreservesLimit (Functor.empty C) G] (l : IsTerminal X) : IsTerminal (G.obj X)

The property of preserving terminal objects expressed in terms of IsTerminal.

Equations

• CategoryTheory.Limits.IsTerminal.isTerminalObj G X l = (CategoryTheory.Limits.isLimitMapConeEmptyConeEquiv G X) (CategoryTheory.Limits.isLimitOfPreserves G l)

def CategoryTheory.Limits.IsTerminal.isTerminalOfObj {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) (X : C) [ReflectsLimit (Functor.empty C) G] (l : IsTerminal (G.obj X)) : IsTerminal X

The property of reflecting terminal objects expressed in terms of IsTerminal.

Equations

• CategoryTheory.Limits.IsTerminal.isTerminalOfObj G X l = CategoryTheory.Limits.isLimitOfReflects G ((CategoryTheory.Limits.isLimitMapConeEmptyConeEquiv G X).symm l)

def CategoryTheory.Limits.IsTerminal.isTerminalIffObj {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [PreservesLimit (Functor.empty C) G] [ReflectsLimit (Functor.empty C) G] (X : C) : IsTerminal X ≃ IsTerminal (G.obj X)

A functor that preserves and reflects terminal objects induces an equivalence on IsTerminal.

Equations

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

theorem CategoryTheory.Limits.preservesLimitsOfShape_pempty_of_preservesTerminal {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [PreservesLimit (Functor.empty C) G] : PreservesLimitsOfShape (Discrete PEmpty.{1}) G

Preserving the terminal object implies preserving all limits of the empty diagram.

def CategoryTheory.Limits.isLimitOfHasTerminalOfPreservesLimit {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [HasTerminal C] [PreservesLimit (Functor.empty C) G] : IsTerminal (G.obj (⊤_ C))

If G preserves the terminal object and C has a terminal object, then the image of the terminal object is terminal.

Equations

• CategoryTheory.Limits.isLimitOfHasTerminalOfPreservesLimit G = CategoryTheory.Limits.IsTerminal.isTerminalObj G (⊤_ C) CategoryTheory.Limits.terminalIsTerminal

theorem CategoryTheory.Limits.hasTerminal_of_hasTerminal_of_preservesLimit {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [HasTerminal C] [PreservesLimit (Functor.empty C) G] : HasTerminal D

If C has a terminal object and G preserves terminal objects, then D has a terminal object also. Note this property is somewhat unique to (co)limits of the empty diagram: for general J, if C has limits of shape J and G preserves them, then D does not necessarily have limits of shape J.

theorem CategoryTheory.Limits.PreservesTerminal.of_iso_comparison {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [HasTerminal C] [HasTerminal D] [i : IsIso (terminalComparison G)] : PreservesLimit (Functor.empty C) G

If the terminal comparison map for G is an isomorphism, then G preserves terminal objects.

theorem CategoryTheory.Limits.preservesTerminal_of_isIso {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [HasTerminal C] [HasTerminal D] (f : G.obj (⊤_ C) ⟶ ⊤_ D) [i : IsIso f] : PreservesLimit (Functor.empty C) G

If there is any isomorphism G.obj ⊤ ⟶ ⊤, then G preserves terminal objects.

theorem CategoryTheory.Limits.preservesTerminal_of_iso {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [HasTerminal C] [HasTerminal D] (f : G.obj (⊤_ C) ≅ ⊤_ D) : PreservesLimit (Functor.empty C) G

If there is any isomorphism G.obj ⊤ ≅ ⊤, then G preserves terminal objects.

def CategoryTheory.Limits.PreservesTerminal.iso {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [HasTerminal C] [HasTerminal D] [PreservesLimit (Functor.empty C) G] : G.obj (⊤_ C) ≅ ⊤_ D

If G preserves terminal objects, then the terminal comparison map for G is an isomorphism.

Equations

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

@[simp]

theorem CategoryTheory.Limits.PreservesTerminal.iso_hom {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [HasTerminal C] [HasTerminal D] [PreservesLimit (Functor.empty C) G] : (iso G).hom = terminalComparison G

instance CategoryTheory.Limits.instIsIsoTerminalComparison {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [HasTerminal C] [HasTerminal D] [PreservesLimit (Functor.empty C) G] : IsIso (terminalComparison G)

def CategoryTheory.Limits.isColimitMapCoconeEmptyCoconeEquiv {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) (X : C) : IsColimit (G.mapCocone (asEmptyCocone X)) ≃ IsInitial (G.obj X)

The map of an empty cocone is a colimit iff the mapped object is initial.

Equations

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

def CategoryTheory.Limits.IsInitial.isInitialObj {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) (X : C) [PreservesColimit (Functor.empty C) G] (l : IsInitial X) : IsInitial (G.obj X)

The property of preserving initial objects expressed in terms of IsInitial.

Equations

• CategoryTheory.Limits.IsInitial.isInitialObj G X l = (CategoryTheory.Limits.isColimitMapCoconeEmptyCoconeEquiv G X) (CategoryTheory.Limits.isColimitOfPreserves G l)

def CategoryTheory.Limits.IsInitial.isInitialOfObj {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) (X : C) [ReflectsColimit (Functor.empty C) G] (l : IsInitial (G.obj X)) : IsInitial X

The property of reflecting initial objects expressed in terms of IsInitial.

Equations

• CategoryTheory.Limits.IsInitial.isInitialOfObj G X l = CategoryTheory.Limits.isColimitOfReflects G ((CategoryTheory.Limits.isColimitMapCoconeEmptyCoconeEquiv G X).symm l)

def CategoryTheory.Limits.IsInitial.isInitialIffObj {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [PreservesColimit (Functor.empty C) G] [ReflectsColimit (Functor.empty C) G] (X : C) : IsInitial X ≃ IsInitial (G.obj X)

A functor that preserves and reflects initial objects induces an equivalence on IsInitial.

Equations

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

theorem CategoryTheory.Limits.preservesColimitsOfShape_pempty_of_preservesInitial {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [PreservesColimit (Functor.empty C) G] : PreservesColimitsOfShape (Discrete PEmpty.{1}) G

Preserving the initial object implies preserving all colimits of the empty diagram.

def CategoryTheory.Limits.isColimitOfHasInitialOfPreservesColimit {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [HasInitial C] [PreservesColimit (Functor.empty C) G] : IsInitial (G.obj (⊥_ C))

If G preserves the initial object and C has an initial object, then the image of the initial object is initial.

Equations

• CategoryTheory.Limits.isColimitOfHasInitialOfPreservesColimit G = CategoryTheory.Limits.IsInitial.isInitialObj G (⊥_ C) CategoryTheory.Limits.initialIsInitial

theorem CategoryTheory.Limits.hasInitial_of_hasInitial_of_preservesColimit {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [HasInitial C] [PreservesColimit (Functor.empty C) G] : HasInitial D

If C has an initial object and G preserves initial objects, then D has an initial object also. Note this property is somewhat unique to colimits of the empty diagram: for general J, if C has colimits of shape J and G preserves them, then D does not necessarily have colimits of shape J.

theorem CategoryTheory.Limits.PreservesInitial.of_iso_comparison {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [HasInitial C] [HasInitial D] [i : IsIso (initialComparison G)] : PreservesColimit (Functor.empty C) G

If the initial comparison map for G is an isomorphism, then G preserves initial objects.

theorem CategoryTheory.Limits.preservesInitial_of_isIso {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [HasInitial C] [HasInitial D] (f : ⊥_ D ⟶ G.obj (⊥_ C)) [i : IsIso f] : PreservesColimit (Functor.empty C) G

If there is any isomorphism ⊥ ⟶ G.obj ⊥, then G preserves initial objects.

theorem CategoryTheory.Limits.preservesInitial_of_iso {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [HasInitial C] [HasInitial D] (f : ⊥_ D ≅ G.obj (⊥_ C)) : PreservesColimit (Functor.empty C) G

If there is any isomorphism ⊥ ≅ G.obj ⊥, then G preserves initial objects.

def CategoryTheory.Limits.PreservesInitial.iso {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [HasInitial C] [HasInitial D] [PreservesColimit (Functor.empty C) G] : G.obj (⊥_ C) ≅ ⊥_ D

If G preserves initial objects, then the initial comparison map for G is an isomorphism.

Equations

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

@[simp]

theorem CategoryTheory.Limits.PreservesInitial.iso_hom {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [HasInitial C] [HasInitial D] [PreservesColimit (Functor.empty C) G] : (iso G).inv = initialComparison G

instance CategoryTheory.Limits.instIsIsoInitialComparison {C : Type u₁} [Category.{v₁, u₁} C] {D : Type u₂} [Category.{v₂, u₂} D] (G : Functor C D) [HasInitial C] [HasInitial D] [PreservesColimit (Functor.empty C) G] : IsIso (initialComparison G)