Special equalizers associated to a comonad

Associated to a comonad T : C ⥤ C we have important equalizer constructions: Any coalgebra is an equalizer (in the category of coalgebras) of cofree coalgebras. Furthermore, this equalizer is coreflexive. In C, this fork diagram is a split equalizer (in particular, it is still an equalizer). This split equalizer is known as the Beck equalizer (as it features heavily in Beck's comonadicity theorem).

This file is adapted from Mathlib.CategoryTheory.Monad.Coequalizer. Please try to keep them in sync.

Show that any coalgebra is an equalizer of cofree coalgebras.

@[simp]

theorem CategoryTheory.Comonad.CofreeEqualizer.topMap_f {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) : (CategoryTheory.Comonad.CofreeEqualizer.topMap X).f = T.map X.a

def CategoryTheory.Comonad.CofreeEqualizer.topMap {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) : T.cofree.obj X.A ⟶ T.cofree.obj (T.obj X.A)

The top map in the equalizer diagram we will construct.

Equations

• CategoryTheory.Comonad.CofreeEqualizer.topMap X = T.cofree.map X.a

@[simp]

theorem CategoryTheory.Comonad.CofreeEqualizer.bottomMap_f {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) : (CategoryTheory.Comonad.CofreeEqualizer.bottomMap X).f = T.δ.app X.A

def CategoryTheory.Comonad.CofreeEqualizer.bottomMap {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) : T.cofree.obj X.A ⟶ T.cofree.obj (T.obj X.A)

The bottom map in the equalizer diagram we will construct.

Equations

• CategoryTheory.Comonad.CofreeEqualizer.bottomMap X = { f := T.δ.app X.A, h := ⋯ }

@[simp]

theorem CategoryTheory.Comonad.CofreeEqualizer.ι_f {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) : (CategoryTheory.Comonad.CofreeEqualizer.ι X).f = X.a

def CategoryTheory.Comonad.CofreeEqualizer.ι {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) : X ⟶ T.cofree.obj X.A

The fork map in the equalizer diagram we will construct.

Equations

• CategoryTheory.Comonad.CofreeEqualizer.ι X = { f := X.a, h := ⋯ }

theorem CategoryTheory.Comonad.CofreeEqualizer.condition {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Comonad.CofreeEqualizer.ι X) (CategoryTheory.Comonad.CofreeEqualizer.topMap X) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Comonad.CofreeEqualizer.ι X) (CategoryTheory.Comonad.CofreeEqualizer.bottomMap X)

instance CategoryTheory.Comonad.instIsCoreflexivePairCoalgebraTopMapBottomMap {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) : CategoryTheory.IsCoreflexivePair (CategoryTheory.Comonad.CofreeEqualizer.topMap X) (CategoryTheory.Comonad.CofreeEqualizer.bottomMap X)

Equations

• ⋯ = ⋯

@[simp]

theorem CategoryTheory.Comonad.beckCoalgebraFork_pt {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) : (CategoryTheory.Comonad.beckCoalgebraFork X).pt = X

@[simp]

theorem CategoryTheory.Comonad.beckCoalgebraFork_π_app {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) (X : CategoryTheory.Limits.WalkingParallelPair) : (CategoryTheory.Comonad.beckCoalgebraFork X✝).π.app X = CategoryTheory.Limits.WalkingParallelPair.rec (motive := fun (t : CategoryTheory.Limits.WalkingParallelPair) => X = t → (X✝ ⟶ (CategoryTheory.Limits.parallelPair (CategoryTheory.Comonad.CofreeEqualizer.topMap X✝) (CategoryTheory.Comonad.CofreeEqualizer.bottomMap X✝)).obj X)) (fun (h : X = CategoryTheory.Limits.WalkingParallelPair.zero) => ⋯ ▸ CategoryTheory.Comonad.CofreeEqualizer.ι X✝) (fun (h : X = CategoryTheory.Limits.WalkingParallelPair.one) => ⋯ ▸ CategoryTheory.CategoryStruct.comp (CategoryTheory.Comonad.CofreeEqualizer.ι X✝) (CategoryTheory.Comonad.CofreeEqualizer.topMap X✝)) X ⋯

def CategoryTheory.Comonad.beckCoalgebraFork {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) : CategoryTheory.Limits.Fork (CategoryTheory.Comonad.CofreeEqualizer.topMap X) (CategoryTheory.Comonad.CofreeEqualizer.bottomMap X)

Construct the Beck fork in the category of coalgebras. This fork is coreflexive as well as an equalizer.

Equations

• CategoryTheory.Comonad.beckCoalgebraFork X = CategoryTheory.Limits.Fork.ofι (CategoryTheory.Comonad.CofreeEqualizer.ι X) ⋯

def CategoryTheory.Comonad.beckCoalgebraEqualizer {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) : CategoryTheory.Limits.IsLimit (CategoryTheory.Comonad.beckCoalgebraFork X)

The fork constructed is a limit. This shows that any coalgebra is a (coreflexive) equalizer of cofree coalgebras.

Equations

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

def CategoryTheory.Comonad.beckSplitEqualizer {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) : CategoryTheory.IsSplitEqualizer (T.map X.a) (T.δ.app X.A) X.a

The Beck fork is a split equalizer.

Equations

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

@[simp]

theorem CategoryTheory.Comonad.beckFork_pt {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) : (CategoryTheory.Comonad.beckFork X).pt = X.A

def CategoryTheory.Comonad.beckFork {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) : CategoryTheory.Limits.Fork (T.map X.a) (T.δ.app X.A)

This is the Beck fork. It is a split equalizer, in particular a equalizer.

Equations

• CategoryTheory.Comonad.beckFork X = (CategoryTheory.Comonad.beckSplitEqualizer X).asFork

@[simp]

theorem CategoryTheory.Comonad.beckFork_ι {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) : (CategoryTheory.Comonad.beckFork X).ι = X.a

def CategoryTheory.Comonad.beckEqualizer {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) : CategoryTheory.Limits.IsLimit (CategoryTheory.Comonad.beckFork X)

The Beck fork is a equalizer.

Equations

• CategoryTheory.Comonad.beckEqualizer X = (CategoryTheory.Comonad.beckSplitEqualizer X).isEqualizer

@[simp]

theorem CategoryTheory.Comonad.beckEqualizer_lift {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Comonad C} (X : T.Coalgebra) (s : CategoryTheory.Limits.Fork (T.map X.a) (T.δ.app X.A)) : (CategoryTheory.Comonad.beckEqualizer X).lift s = CategoryTheory.CategoryStruct.comp s.ι (T.ε.app X.A)