Theorems · Inductive type · category theory

CategoryTheory.Adjunction.CommShift

{C : Type u_1} →
  {D : Type u_2} →
    [inst : CategoryTheory.Category.{v_1, u_1} C] →
      [inst_1 : CategoryTheory.Category.{v_2, u_2} D] →
        {F : CategoryTheory.Functor C D} →
          {G : CategoryTheory.Functor D C} →
            (F ⊣ G) →
              (A : Type u_3) →
                [inst_2 : AddMonoid A] →
                  [inst_3 : CategoryTheory.HasShift C A] →
                    [inst_4 : CategoryTheory.HasShift D A] → [F.CommShift A] → [G.CommShift A] → Prop

The property for CommShift structures on F and G to be compatible with an adjunction F ⊣ G.

Defined in

Mathlib.CategoryTheory.Shift.Adjunction

Cited by

20 results in Mathlib

Foundations

Depth 3 from the axioms · uses no axioms

Assumes

CategoryTheory.CategoryCategoryTheory.CategoryAddMonoidCategoryTheory.HasShiftCategoryTheory.HasShiftCategoryTheory.Functor.CommShiftCategoryTheory.Functor.CommShift