Theorems · Inductive type · category theory

CategoryTheory.Functor.ShiftSequence

{C : Type u_1} →
  {A : Type u_3} →
    [inst : CategoryTheory.Category.{v_1, u_1} C] →
      [inst_1 : CategoryTheory.Category.{v_3, u_3} A] →
        CategoryTheory.Functor C A →
          (M : Type u_4) →
            [inst_2 : AddMonoid M] → [CategoryTheory.HasShift C M] → Type (max (max (max (max u_1 u_3) u_4) v_1) v_3)

A shift sequence for a functor F : C ⥤ A when C is equipped with a shift by a monoid M involves a sequence of functor sequence n : C ⥤ A for all n : M which behave like shiftFunctor C n ⋙ F.

Defined in

Mathlib.CategoryTheory.Shift.ShiftSequence

Cited by

61 results in Mathlib

Foundations

Depth 2 from the axioms · uses no axioms

Assumes

CategoryTheory.CategoryCategoryTheory.CategoryAddMonoidCategoryTheory.HasShift