Theorems · Definition · category theory

CategoryTheory.Comonad.ComonadicityInternal.comparisonAdjunction

{C : Type u₁} →
  {D : Type u₂} →
    [inst : CategoryTheory.Category.{v₁, u₁} C] →
      [inst_1 : CategoryTheory.Category.{v₁, u₂} D] →
        {F : CategoryTheory.Functor C D} →
          {G : CategoryTheory.Functor D C} →
            (adj : F ⊣ G) →
              [inst_2 :
                  ∀ (A : adj.toComonad.Coalgebra),
                    CategoryTheory.Limits.HasEqualizer (G.map A.a) (adj.unit.app (G.obj A.A))] →
                CategoryTheory.Comonad.comparison adj ⊣
                  CategoryTheory.Comonad.ComonadicityInternal.rightAdjointComparison adj

Provided we have the appropriate equalizers, we have an adjunction to the comparison functor.

Defined in

Mathlib.CategoryTheory.Monad.Comonadicity

Cited by

4 results in Mathlib

Foundations

Depth 34 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

CategoryTheory.CategoryCategoryTheory.CategoryCategoryTheory.Limits.HasEqualizer