Loogle!
Result
Found 93 declarations mentioning zero_add.
- zero_add 📋 Mathlib.Algebra.Group.Defs
{M : Type u} [AddZeroClass M] (a : M) : 0 + a = a - CategoryTheory.shiftFunctorAdd'_zero_add 📋 Mathlib.CategoryTheory.Shift.Basic
(C : Type u) {A : Type u_1} [CategoryTheory.Category.{v, u} C] [AddMonoid A] [CategoryTheory.HasShift C A] (a : A) : CategoryTheory.shiftFunctorAdd' C 0 a a ⋯ = (CategoryTheory.shiftFunctor C a).leftUnitor.symm ≪≫ CategoryTheory.Functor.isoWhiskerRight (CategoryTheory.shiftFunctorZero C A).symm (CategoryTheory.shiftFunctor C a) - CategoryTheory.shiftFunctorAdd'_zero_add_hom_app 📋 Mathlib.CategoryTheory.Shift.Basic
{C : Type u} {A : Type u_1} [CategoryTheory.Category.{v, u} C] [AddMonoid A] [CategoryTheory.HasShift C A] (a : A) (X : C) : (CategoryTheory.shiftFunctorAdd' C 0 a a ⋯).hom.app X = (CategoryTheory.shiftFunctor C a).map ((CategoryTheory.shiftFunctorZero C A).inv.app X) - CategoryTheory.shiftFunctorAdd'_zero_add_inv_app 📋 Mathlib.CategoryTheory.Shift.Basic
{C : Type u} {A : Type u_1} [CategoryTheory.Category.{v, u} C] [AddMonoid A] [CategoryTheory.HasShift C A] (a : A) (X : C) : (CategoryTheory.shiftFunctorAdd' C 0 a a ⋯).inv.app X = (CategoryTheory.shiftFunctor C a).map ((CategoryTheory.shiftFunctorZero C A).hom.app X) - CochainComplex.HomComplex.Cochain.id_comp 📋 Mathlib.Algebra.Homology.HomotopyCategory.HomComplex
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] {F G : CochainComplex C ℤ} {n : ℤ} (z₂ : CochainComplex.HomComplex.Cochain F G n) : (CochainComplex.HomComplex.Cochain.ofHom (CategoryTheory.CategoryStruct.id F)).comp z₂ ⋯ = z₂ - CochainComplex.HomComplex.Cochain.comp_assoc_of_first_is_zero_cochain 📋 Mathlib.Algebra.Homology.HomotopyCategory.HomComplex
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] {F G K L : CochainComplex C ℤ} {n₂ n₃ n₂₃ : ℤ} (z₁ : CochainComplex.HomComplex.Cochain F G 0) (z₂ : CochainComplex.HomComplex.Cochain G K n₂) (z₃ : CochainComplex.HomComplex.Cochain K L n₃) (h₂₃ : n₂ + n₃ = n₂₃) : (z₁.comp z₂ ⋯).comp z₃ h₂₃ = z₁.comp (z₂.comp z₃ h₂₃) ⋯ - CochainComplex.HomComplex.Cochain.comp_assoc_of_second_is_zero_cochain 📋 Mathlib.Algebra.Homology.HomotopyCategory.HomComplex
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] {F G K L : CochainComplex C ℤ} {n₁ n₃ n₁₃ : ℤ} (z₁ : CochainComplex.HomComplex.Cochain F G n₁) (z₂ : CochainComplex.HomComplex.Cochain G K 0) (z₃ : CochainComplex.HomComplex.Cochain K L n₃) (h₁₃ : n₁ + n₃ = n₁₃) : (z₁.comp z₂ ⋯).comp z₃ h₁₃ = z₁.comp (z₂.comp z₃ ⋯) h₁₃ - CochainComplex.HomComplex.δ_ofHom_comp 📋 Mathlib.Algebra.Homology.HomotopyCategory.HomComplex
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] {F G K : CochainComplex C ℤ} {n : ℤ} (f : F ⟶ G) (z : CochainComplex.HomComplex.Cochain G K n) (m : ℤ) : CochainComplex.HomComplex.δ n m ((CochainComplex.HomComplex.Cochain.ofHom f).comp z ⋯) = (CochainComplex.HomComplex.Cochain.ofHom f).comp (CochainComplex.HomComplex.δ n m z) ⋯ - CochainComplex.HomComplex.δ_zero_cochain_comp 📋 Mathlib.Algebra.Homology.HomotopyCategory.HomComplex
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] {F G K : CochainComplex C ℤ} {n₂ : ℤ} (z₁ : CochainComplex.HomComplex.Cochain F G 0) (z₂ : CochainComplex.HomComplex.Cochain G K n₂) (m₂ : ℤ) (h₂ : n₂ + 1 = m₂) : CochainComplex.HomComplex.δ n₂ m₂ (z₁.comp z₂ ⋯) = z₁.comp (CochainComplex.HomComplex.δ n₂ m₂ z₂) ⋯ + n₂.negOnePow • (CochainComplex.HomComplex.δ 0 1 z₁).comp z₂ ⋯ - CochainComplex.HomComplex.Cochain.zero_cochain_comp_v 📋 Mathlib.Algebra.Homology.HomotopyCategory.HomComplex
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] {F G K : CochainComplex C ℤ} {n : ℤ} (z₁ : CochainComplex.HomComplex.Cochain F G 0) (z₂ : CochainComplex.HomComplex.Cochain G K n) (p q : ℤ) (hpq : p + n = q) : (z₁.comp z₂ ⋯).v p q hpq = CategoryTheory.CategoryStruct.comp (z₁.v p p ⋯) (z₂.v p q hpq) - CochainComplex.HomComplex.Cochain.ofHoms_comp 📋 Mathlib.Algebra.Homology.HomotopyCategory.HomComplex
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] {F G K : CochainComplex C ℤ} (φ : (p : ℤ) → F.X p ⟶ G.X p) (ψ : (p : ℤ) → G.X p ⟶ K.X p) : (CochainComplex.HomComplex.Cochain.ofHoms φ).comp (CochainComplex.HomComplex.Cochain.ofHoms ψ) ⋯ = CochainComplex.HomComplex.Cochain.ofHoms fun p => CategoryTheory.CategoryStruct.comp (φ p) (ψ p) - CochainComplex.HomComplex.Cochain.ofHom_comp 📋 Mathlib.Algebra.Homology.HomotopyCategory.HomComplex
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] {F G K : CochainComplex C ℤ} (f : F ⟶ G) (g : G ⟶ K) : CochainComplex.HomComplex.Cochain.ofHom (CategoryTheory.CategoryStruct.comp f g) = (CochainComplex.HomComplex.Cochain.ofHom f).comp (CochainComplex.HomComplex.Cochain.ofHom g) ⋯ - CochainComplex.HomComplex.δ_zero_cocycle_comp 📋 Mathlib.Algebra.Homology.HomotopyCategory.HomComplex
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] {F G K : CochainComplex C ℤ} {n : ℤ} (z₁ : CochainComplex.HomComplex.Cocycle F G 0) (z₂ : CochainComplex.HomComplex.Cochain G K n) (m : ℤ) : CochainComplex.HomComplex.δ n m ((↑z₁).comp z₂ ⋯) = (↑z₁).comp (CochainComplex.HomComplex.δ n m z₂) ⋯ - CochainComplex.mappingCone.inr_descCochain 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCone
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.Preadditive C] {F G : CochainComplex C ℤ} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] {K : CochainComplex C ℤ} {n m : ℤ} (α : CochainComplex.HomComplex.Cochain F K m) (β : CochainComplex.HomComplex.Cochain G K n) (h : m + 1 = n) : (CochainComplex.HomComplex.Cochain.ofHom (CochainComplex.mappingCone.inr φ)).comp (CochainComplex.mappingCone.descCochain φ α β h) ⋯ = β - CochainComplex.mappingCone.inr_snd 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCone
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.Preadditive C] {F G : CochainComplex C ℤ} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] : (CochainComplex.HomComplex.Cochain.ofHom (CochainComplex.mappingCone.inr φ)).comp (CochainComplex.mappingCone.snd φ) ⋯ = CochainComplex.HomComplex.Cochain.ofHom (CategoryTheory.CategoryStruct.id G) - CochainComplex.mappingCone.ext_cochain_from_iff 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCone
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.Preadditive C] {F G : CochainComplex C ℤ} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] (i j : ℤ) (hij : i + 1 = j) {K : CochainComplex C ℤ} {γ₁ γ₂ : CochainComplex.HomComplex.Cochain (CochainComplex.mappingCone φ) K j} : γ₁ = γ₂ ↔ (CochainComplex.mappingCone.inl φ).comp γ₁ ⋯ = (CochainComplex.mappingCone.inl φ).comp γ₂ ⋯ ∧ (CochainComplex.HomComplex.Cochain.ofHom (CochainComplex.mappingCone.inr φ)).comp γ₁ ⋯ = (CochainComplex.HomComplex.Cochain.ofHom (CochainComplex.mappingCone.inr φ)).comp γ₂ ⋯ - CochainComplex.mappingCone.descCocycle 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCone
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.Preadditive C] {F G : CochainComplex C ℤ} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] {K : CochainComplex C ℤ} {n m : ℤ} (α : CochainComplex.HomComplex.Cochain F K m) (β : CochainComplex.HomComplex.Cocycle G K n) (h : m + 1 = n) (eq : CochainComplex.HomComplex.δ m n α = n.negOnePow • (CochainComplex.HomComplex.Cochain.ofHom φ).comp ↑β ⋯) : CochainComplex.HomComplex.Cocycle (CochainComplex.mappingCone φ) K n - CochainComplex.mappingCone.inr_fst 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCone
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.Preadditive C] {F G : CochainComplex C ℤ} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] : (CochainComplex.HomComplex.Cochain.ofHom (CochainComplex.mappingCone.inr φ)).comp ↑(CochainComplex.mappingCone.fst φ) ⋯ = 0 - CochainComplex.mappingCone.lift_snd 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCone
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.Preadditive C] {F G : CochainComplex C ℤ} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] {K : CochainComplex C ℤ} (α : CochainComplex.HomComplex.Cocycle K F 1) (β : CochainComplex.HomComplex.Cochain K G 0) (eq : CochainComplex.HomComplex.δ 0 1 β + (↑α).comp (CochainComplex.HomComplex.Cochain.ofHom φ) ⋯ = 0) : (CochainComplex.HomComplex.Cochain.ofHom (CochainComplex.mappingCone.lift φ α β eq)).comp (CochainComplex.mappingCone.snd φ) ⋯ = β - CochainComplex.mappingCone.descCocycle_coe 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCone
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.Preadditive C] {F G : CochainComplex C ℤ} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] {K : CochainComplex C ℤ} {n m : ℤ} (α : CochainComplex.HomComplex.Cochain F K m) (β : CochainComplex.HomComplex.Cocycle G K n) (h : m + 1 = n) (eq : CochainComplex.HomComplex.δ m n α = n.negOnePow • (CochainComplex.HomComplex.Cochain.ofHom φ).comp ↑β ⋯) : ↑(CochainComplex.mappingCone.descCocycle φ α β h eq) = CochainComplex.mappingCone.descCochain φ α (↑β) h - CochainComplex.mappingCone.ofHom_lift 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCone
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.Preadditive C] {F G : CochainComplex C ℤ} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] {K : CochainComplex C ℤ} (α : CochainComplex.HomComplex.Cocycle K F 1) (β : CochainComplex.HomComplex.Cochain K G 0) (eq : CochainComplex.HomComplex.δ 0 1 β + (↑α).comp (CochainComplex.HomComplex.Cochain.ofHom φ) ⋯ = 0) : CochainComplex.HomComplex.Cochain.ofHom (CochainComplex.mappingCone.lift φ α β eq) = CochainComplex.mappingCone.liftCochain φ (↑α) β ⋯ - CochainComplex.mappingCone.δ_descCochain 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCone
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.Preadditive C] {F G : CochainComplex C ℤ} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] {K : CochainComplex C ℤ} {n m : ℤ} (α : CochainComplex.HomComplex.Cochain F K m) (β : CochainComplex.HomComplex.Cochain G K n) (h : m + 1 = n) (n' : ℤ) (hn' : n + 1 = n') : CochainComplex.HomComplex.δ n n' (CochainComplex.mappingCone.descCochain φ α β h) = (↑(CochainComplex.mappingCone.fst φ)).comp (CochainComplex.HomComplex.δ m n α + n'.negOnePow • (CochainComplex.HomComplex.Cochain.ofHom φ).comp β ⋯) ⋯ + (CochainComplex.mappingCone.snd φ).comp (CochainComplex.HomComplex.δ n n' β) ⋯ - CochainComplex.mappingCone.lift_fst 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCone
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.Preadditive C] {F G : CochainComplex C ℤ} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] {K : CochainComplex C ℤ} (α : CochainComplex.HomComplex.Cocycle K F 1) (β : CochainComplex.HomComplex.Cochain K G 0) (eq : CochainComplex.HomComplex.δ 0 1 β + (↑α).comp (CochainComplex.HomComplex.Cochain.ofHom φ) ⋯ = 0) : (CochainComplex.HomComplex.Cochain.ofHom (CochainComplex.mappingCone.lift φ α β eq)).comp ↑(CochainComplex.mappingCone.fst φ) ⋯ = ↑α - CochainComplex.mappingCone.descHomotopy 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCone
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.Preadditive C] {F G : CochainComplex C ℤ} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] {K : CochainComplex C ℤ} (f₁ f₂ : CochainComplex.mappingCone φ ⟶ K) (γ₁ : CochainComplex.HomComplex.Cochain F K (-2)) (γ₂ : CochainComplex.HomComplex.Cochain G K (-1)) (h₁ : (CochainComplex.mappingCone.inl φ).comp (CochainComplex.HomComplex.Cochain.ofHom f₁) ⋯ = CochainComplex.HomComplex.δ (-2) (-1) γ₁ + (CochainComplex.HomComplex.Cochain.ofHom φ).comp γ₂ ⋯ + (CochainComplex.mappingCone.inl φ).comp (CochainComplex.HomComplex.Cochain.ofHom f₂) ⋯) (h₂ : CochainComplex.HomComplex.Cochain.ofHom (CategoryTheory.CategoryStruct.comp (CochainComplex.mappingCone.inr φ) f₁) = CochainComplex.HomComplex.δ (-1) 0 γ₂ + CochainComplex.HomComplex.Cochain.ofHom (CategoryTheory.CategoryStruct.comp (CochainComplex.mappingCone.inr φ) f₂)) : Homotopy f₁ f₂ - CochainComplex.mappingCone.liftHomotopy 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCone
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.Preadditive C] {F G : CochainComplex C ℤ} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] {K : CochainComplex C ℤ} (f₁ f₂ : K ⟶ CochainComplex.mappingCone φ) (α : CochainComplex.HomComplex.Cochain K F 0) (β : CochainComplex.HomComplex.Cochain K G (-1)) (h₁ : (CochainComplex.HomComplex.Cochain.ofHom f₁).comp ↑(CochainComplex.mappingCone.fst φ) ⋯ = -CochainComplex.HomComplex.δ 0 1 α + (CochainComplex.HomComplex.Cochain.ofHom f₂).comp ↑(CochainComplex.mappingCone.fst φ) ⋯) (h₂ : (CochainComplex.HomComplex.Cochain.ofHom f₁).comp (CochainComplex.mappingCone.snd φ) ⋯ = CochainComplex.HomComplex.δ (-1) 0 β + α.comp (CochainComplex.HomComplex.Cochain.ofHom φ) ⋯ + (CochainComplex.HomComplex.Cochain.ofHom f₂).comp (CochainComplex.mappingCone.snd φ) ⋯) : Homotopy f₁ f₂ - CategoryTheory.Functor.CommShift.isoZero_isoAdd'_ 📋 Mathlib.CategoryTheory.Shift.CommShift
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {F : CategoryTheory.Functor C D} {A : Type u_4} [AddMonoid A] [CategoryTheory.HasShift C A] [CategoryTheory.HasShift D A] {a : A} (e : (CategoryTheory.shiftFunctor C a).comp F ≅ F.comp (CategoryTheory.shiftFunctor D a)) : CategoryTheory.Functor.CommShift.isoAdd' ⋯ (CategoryTheory.Functor.CommShift.isoZero F A) e = e - CategoryTheory.Functor.shiftIso_zero 📋 Mathlib.CategoryTheory.Shift.ShiftSequence
{C : Type u_1} {A : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_3, u_3} A] (F : CategoryTheory.Functor C A) {M : Type u_4} [AddMonoid M] [CategoryTheory.HasShift C M] [F.ShiftSequence M] (a : M) : F.shiftIso 0 a a ⋯ = CategoryTheory.Functor.isoWhiskerRight (CategoryTheory.shiftFunctorZero C M) (F.shift a) ≪≫ (F.shift a).leftUnitor - CategoryTheory.Functor.ShiftSequence.shiftIso_zero 📋 Mathlib.CategoryTheory.Shift.ShiftSequence
{C : Type u_1} {A : Type u_3} {inst✝ : CategoryTheory.Category.{v_1, u_1} C} {inst✝¹ : CategoryTheory.Category.{v_3, u_3} A} {F : CategoryTheory.Functor C A} {M : Type u_4} {inst✝² : AddMonoid M} {inst✝³ : CategoryTheory.HasShift C M} [self : F.ShiftSequence M] (a : M) : CategoryTheory.Functor.ShiftSequence.shiftIso 0 a a ⋯ = CategoryTheory.Functor.isoWhiskerRight (CategoryTheory.shiftFunctorZero C M) (CategoryTheory.Functor.ShiftSequence.sequence F a) ≪≫ (CategoryTheory.Functor.ShiftSequence.sequence F a).leftUnitor - CategoryTheory.Functor.shiftIso_zero_hom_app 📋 Mathlib.CategoryTheory.Shift.ShiftSequence
{C : Type u_1} {A : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_3, u_3} A] (F : CategoryTheory.Functor C A) {M : Type u_4} [AddMonoid M] [CategoryTheory.HasShift C M] [F.ShiftSequence M] (a : M) (X : C) : (F.shiftIso 0 a a ⋯).hom.app X = (F.shift a).map ((CategoryTheory.shiftFunctorZero C M).hom.app X) - CategoryTheory.Functor.shiftIso_zero_inv_app 📋 Mathlib.CategoryTheory.Shift.ShiftSequence
{C : Type u_1} {A : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_3, u_3} A] (F : CategoryTheory.Functor C A) {M : Type u_4} [AddMonoid M] [CategoryTheory.HasShift C M] [F.ShiftSequence M] (a : M) (X : C) : (F.shiftIso 0 a a ⋯).inv.app X = (F.shift a).map ((CategoryTheory.shiftFunctorZero C M).inv.app X) - CategoryTheory.Functor.ShiftSequence.mk 📋 Mathlib.CategoryTheory.Shift.ShiftSequence
{C : Type u_1} {A : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_3, u_3} A] {F : CategoryTheory.Functor C A} {M : Type u_4} [AddMonoid M] [CategoryTheory.HasShift C M] (sequence : M → CategoryTheory.Functor C A) (isoZero : sequence 0 ≅ F) (shiftIso : (n a a' : M) → n + a = a' → ((CategoryTheory.shiftFunctor C n).comp (sequence a) ≅ sequence a')) (shiftIso_zero : ∀ (a : M), shiftIso 0 a a ⋯ = CategoryTheory.Functor.isoWhiskerRight (CategoryTheory.shiftFunctorZero C M) (sequence a) ≪≫ (sequence a).leftUnitor) (shiftIso_add : ∀ (n m a a' a'' : M) (ha' : n + a = a') (ha'' : m + a' = a''), shiftIso (m + n) a a'' ⋯ = CategoryTheory.Functor.isoWhiskerRight (CategoryTheory.shiftFunctorAdd C m n) (sequence a) ≪≫ (CategoryTheory.shiftFunctor C m).associator (CategoryTheory.shiftFunctor C n) (sequence a) ≪≫ (CategoryTheory.shiftFunctor C m).isoWhiskerLeft (shiftIso n a a' ha') ≪≫ shiftIso m a' a'' ha'') : F.ShiftSequence M - CategoryTheory.ShiftedHom.map_naturality 📋 Mathlib.CategoryTheory.Shift.ShiftedHom
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] {M : Type u_4} [AddMonoid M] [CategoryTheory.HasShift C M] [CategoryTheory.HasShift D M] {X Y : C} {a : M} (f : CategoryTheory.ShiftedHom X Y a) {F G : CategoryTheory.Functor C D} (τ : F ⟶ G) [F.CommShift M] [G.CommShift M] [CategoryTheory.NatTrans.CommShift τ M] : (f.map F).comp (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ (τ.app Y)) ⋯ = (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ (τ.app X)).comp (f.map G) ⋯ - CategoryTheory.ShiftedHom.map_naturality_1 📋 Mathlib.CategoryTheory.Shift.ShiftedHom
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] {M : Type u_4} [AddMonoid M] [CategoryTheory.HasShift C M] [CategoryTheory.HasShift D M] {X Y : C} {a : M} (f : CategoryTheory.ShiftedHom X Y a) {F G : CategoryTheory.Functor C D} (e : F ≅ G) [F.CommShift M] [G.CommShift M] [CategoryTheory.NatTrans.CommShift e.hom M] : (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ (e.inv.app X)).comp ((f.map F).comp (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ (e.hom.app Y)) ⋯) ⋯ = f.map G - CategoryTheory.ShiftedHom.map_naturality_2 📋 Mathlib.CategoryTheory.Shift.ShiftedHom
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] {M : Type u_4} [AddMonoid M] [CategoryTheory.HasShift C M] [CategoryTheory.HasShift D M] {X Y : C} {a : M} (f : CategoryTheory.ShiftedHom X Y a) {F G : CategoryTheory.Functor C D} (e : F ≅ G) [F.CommShift M] [G.CommShift M] [CategoryTheory.NatTrans.CommShift e.hom M] : (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ (e.hom.app X)).comp ((f.map G).comp (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ (e.inv.app Y)) ⋯) ⋯ = f.map F - CochainComplex.shiftShortComplexFunctorIso_zero_add_hom_app 📋 Mathlib.Algebra.Homology.HomotopyCategory.ShiftSequence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (a : ℤ) (K : CochainComplex C ℤ) : (CochainComplex.shiftShortComplexFunctorIso C 0 a a ⋯).hom.app K = (HomologicalComplex.shortComplexFunctor C (ComplexShape.up ℤ) a).map ((CategoryTheory.shiftFunctorZero (CochainComplex C ℤ) ℤ).hom.app K) - CategoryTheory.SingleFunctors.shiftIso_zero 📋 Mathlib.CategoryTheory.Shift.SingleFunctors
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {A : Type u_5} [AddMonoid A] [CategoryTheory.HasShift D A] (self : CategoryTheory.SingleFunctors C D A) (a : A) : self.shiftIso 0 a a ⋯ = (self.functor a).isoWhiskerLeft (CategoryTheory.shiftFunctorZero D A) - CategoryTheory.SingleFunctors.shiftIso_zero_inv_app 📋 Mathlib.CategoryTheory.Shift.SingleFunctors
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {A : Type u_5} [AddMonoid A] [CategoryTheory.HasShift D A] (F : CategoryTheory.SingleFunctors C D A) (a : A) (X : C) : (F.shiftIso 0 a a ⋯).inv.app X = (CategoryTheory.shiftFunctorZero D A).inv.app ((F.functor a).1 X) - CategoryTheory.SingleFunctors.shiftIso_zero_hom_app 📋 Mathlib.CategoryTheory.Shift.SingleFunctors
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {A : Type u_5} [AddMonoid A] [CategoryTheory.HasShift D A] (F : CategoryTheory.SingleFunctors C D A) (a : A) (X : C) : (F.shiftIso 0 a a ⋯).hom.app X = (CategoryTheory.shiftFunctorZero D A).hom.app ((F.functor a).obj X) - CategoryTheory.SingleFunctors.mk 📋 Mathlib.CategoryTheory.Shift.SingleFunctors
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {A : Type u_5} [AddMonoid A] [CategoryTheory.HasShift D A] (functor : A → CategoryTheory.Functor C D) (shiftIso : (n a a' : A) → n + a = a' → ((functor a').comp (CategoryTheory.shiftFunctor D n) ≅ functor a)) (shiftIso_zero : ∀ (a : A), shiftIso 0 a a ⋯ = (functor a).isoWhiskerLeft (CategoryTheory.shiftFunctorZero D A)) (shiftIso_add : ∀ (n m a a' a'' : A) (ha' : n + a = a') (ha'' : m + a' = a''), shiftIso (m + n) a a'' ⋯ = (functor a'').isoWhiskerLeft (CategoryTheory.shiftFunctorAdd D m n) ≪≫ ((functor a'').associator (CategoryTheory.shiftFunctor D m) (CategoryTheory.shiftFunctor D n)).symm ≪≫ CategoryTheory.Functor.isoWhiskerRight (shiftIso m a' a'' ha'') (CategoryTheory.shiftFunctor D n) ≪≫ shiftIso n a a' ha') : CategoryTheory.SingleFunctors C D A - CochainComplex.mappingCocone.inl_comp_descCochain 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCocone
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {K L : CochainComplex C ℤ} (φ : K ⟶ L) [HomologicalComplex.HasHomotopyCofiber φ] {M : CochainComplex C ℤ} {n m : ℤ} (α : CochainComplex.HomComplex.Cochain K M m) (β : CochainComplex.HomComplex.Cochain L M n) (h : m + 1 = n) : (CochainComplex.mappingCocone.inl φ).comp (CochainComplex.mappingCocone.descCochain φ α β h) ⋯ = α - CochainComplex.mappingCocone.descCocycle 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCocone
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {K L : CochainComplex C ℤ} (φ : K ⟶ L) [HomologicalComplex.HasHomotopyCofiber φ] {M : CochainComplex C ℤ} {n m : ℤ} (α : CochainComplex.HomComplex.Cochain K M m) (β : CochainComplex.HomComplex.Cocycle L M n) (h : m + 1 = n) (hαβ : CochainComplex.HomComplex.δ m n α + m.negOnePow • (CochainComplex.HomComplex.Cochain.ofHom φ).comp ↑β ⋯ = 0) : CochainComplex.HomComplex.Cocycle (CochainComplex.mappingCocone φ) M m - CochainComplex.mappingCocone.δ_descCochain 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCocone
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {K L : CochainComplex C ℤ} (φ : K ⟶ L) [HomologicalComplex.HasHomotopyCofiber φ] {M : CochainComplex C ℤ} {n m : ℤ} (α : CochainComplex.HomComplex.Cochain K M m) (β : CochainComplex.HomComplex.Cochain L M n) (h : m + 1 = n) (n' : ℤ) (hn' : n + 1 = n') : CochainComplex.HomComplex.δ m n (CochainComplex.mappingCocone.descCochain φ α β h) = (CochainComplex.HomComplex.Cochain.ofHom (CochainComplex.mappingCocone.fst φ)).comp (CochainComplex.HomComplex.δ m n α + m.negOnePow • (CochainComplex.HomComplex.Cochain.ofHom φ).comp β ⋯) ⋯ + (CochainComplex.mappingCocone.snd φ).comp (CochainComplex.HomComplex.δ n n' β) ⋯ - CochainComplex.mappingCocone.desc 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCocone
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {K L : CochainComplex C ℤ} (φ : K ⟶ L) [HomologicalComplex.HasHomotopyCofiber φ] {M : CochainComplex C ℤ} (α : CochainComplex.HomComplex.Cochain K M 0) (β : CochainComplex.HomComplex.Cocycle L M 1) (hαβ : CochainComplex.HomComplex.δ 0 1 α + (CochainComplex.HomComplex.Cochain.ofHom φ).comp ↑β ⋯ = 0) : CochainComplex.mappingCocone φ ⟶ M - CochainComplex.mappingCocone.ofHom_desc 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCocone
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {K L : CochainComplex C ℤ} (φ : K ⟶ L) [HomologicalComplex.HasHomotopyCofiber φ] {M : CochainComplex C ℤ} (α : CochainComplex.HomComplex.Cochain K M 0) (β : CochainComplex.HomComplex.Cocycle L M 1) (hαβ : CochainComplex.HomComplex.δ 0 1 α + (CochainComplex.HomComplex.Cochain.ofHom φ).comp ↑β ⋯ = 0) : CochainComplex.HomComplex.Cochain.ofHom (CochainComplex.mappingCocone.desc φ α β hαβ) = CochainComplex.mappingCocone.descCochain φ α (↑β) CochainComplex.mappingCocone.ofHom_desc._proof_2 - CochainComplex.mappingCocone.descCocycle_coe 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCocone
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {K L : CochainComplex C ℤ} (φ : K ⟶ L) [HomologicalComplex.HasHomotopyCofiber φ] {M : CochainComplex C ℤ} {n m : ℤ} (α : CochainComplex.HomComplex.Cochain K M m) (β : CochainComplex.HomComplex.Cocycle L M n) (h : m + 1 = n) (hαβ : CochainComplex.HomComplex.δ m n α + m.negOnePow • (CochainComplex.HomComplex.Cochain.ofHom φ).comp ↑β ⋯ = 0) : ↑(CochainComplex.mappingCocone.descCocycle φ α β h hαβ) = CochainComplex.mappingCocone.descCochain φ α (↑β) h - CochainComplex.mappingCocone.inl_v_desc_f 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCocone
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {K L : CochainComplex C ℤ} (φ : K ⟶ L) [HomologicalComplex.HasHomotopyCofiber φ] {M : CochainComplex C ℤ} (α : CochainComplex.HomComplex.Cochain K M 0) (β : CochainComplex.HomComplex.Cocycle L M 1) (hαβ : CochainComplex.HomComplex.δ 0 1 α + (CochainComplex.HomComplex.Cochain.ofHom φ).comp ↑β ⋯ = 0) (p : ℤ) : CategoryTheory.CategoryStruct.comp ((CochainComplex.mappingCocone.inl φ).v p p ⋯) ((CochainComplex.mappingCocone.desc φ α β hαβ).f p) = α.v p p ⋯ - CochainComplex.mappingCocone.inl_v_desc_f_assoc 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCocone
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {K L : CochainComplex C ℤ} (φ : K ⟶ L) [HomologicalComplex.HasHomotopyCofiber φ] {M : CochainComplex C ℤ} (α : CochainComplex.HomComplex.Cochain K M 0) (β : CochainComplex.HomComplex.Cocycle L M 1) (hαβ : CochainComplex.HomComplex.δ 0 1 α + (CochainComplex.HomComplex.Cochain.ofHom φ).comp ↑β ⋯ = 0) (p : ℤ) {Z : C} (h : M.X p ⟶ Z) : CategoryTheory.CategoryStruct.comp ((CochainComplex.mappingCocone.inl φ).v p p ⋯) (CategoryTheory.CategoryStruct.comp ((CochainComplex.mappingCocone.desc φ α β hαβ).f p) h) = CategoryTheory.CategoryStruct.comp (α.v p p ⋯) h - CochainComplex.mappingCocone.inr_v_desc_f 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCocone
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {K L : CochainComplex C ℤ} (φ : K ⟶ L) [HomologicalComplex.HasHomotopyCofiber φ] {M : CochainComplex C ℤ} (α : CochainComplex.HomComplex.Cochain K M 0) (β : CochainComplex.HomComplex.Cocycle L M 1) (hαβ : CochainComplex.HomComplex.δ 0 1 α + (CochainComplex.HomComplex.Cochain.ofHom φ).comp ↑β ⋯ = 0) (p q : ℤ) (hpq : p + 1 = q) : CategoryTheory.CategoryStruct.comp ((↑(CochainComplex.mappingCocone.inr φ)).v p q hpq) ((CochainComplex.mappingCocone.desc φ α β hαβ).f q) = (↑β).v p q hpq - CochainComplex.mappingCocone.inr_v_desc_f_assoc 📋 Mathlib.Algebra.Homology.HomotopyCategory.MappingCocone
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {K L : CochainComplex C ℤ} (φ : K ⟶ L) [HomologicalComplex.HasHomotopyCofiber φ] {M : CochainComplex C ℤ} (α : CochainComplex.HomComplex.Cochain K M 0) (β : CochainComplex.HomComplex.Cocycle L M 1) (hαβ : CochainComplex.HomComplex.δ 0 1 α + (CochainComplex.HomComplex.Cochain.ofHom φ).comp ↑β ⋯ = 0) (p q : ℤ) (hpq : p + 1 = q) {Z : C} (h : M.X q ⟶ Z) : CategoryTheory.CategoryStruct.comp ((↑(CochainComplex.mappingCocone.inr φ)).v p q hpq) (CategoryTheory.CategoryStruct.comp ((CochainComplex.mappingCocone.desc φ α β hαβ).f q) h) = CategoryTheory.CategoryStruct.comp ((↑β).v p q hpq) h - CategoryTheory.LocalizerMorphism.smallShiftedHomMap_mk 📋 Mathlib.CategoryTheory.Localization.SmallShiftedHom
{C₁ : Type u₁} [CategoryTheory.Category.{v₁, u₁} C₁] {C₂ : Type u₂} [CategoryTheory.Category.{v₂, u₂} C₂] {W₁ : CategoryTheory.MorphismProperty C₁} {W₂ : CategoryTheory.MorphismProperty C₂} (Φ : CategoryTheory.LocalizerMorphism W₁ W₂) {M : Type w'} [AddMonoid M] [CategoryTheory.HasShift C₁ M] [CategoryTheory.HasShift C₂ M] [Φ.functor.CommShift M] {X₁ Y₁ : C₁} {X₂ Y₂ : C₂} [CategoryTheory.Localization.HasSmallLocalizedShiftedHom W₁ M X₁ Y₁] [CategoryTheory.Localization.HasSmallLocalizedShiftedHom W₂ M X₂ X₂] [CategoryTheory.Localization.HasSmallLocalizedShiftedHom W₂ M X₂ Y₂] [CategoryTheory.Localization.HasSmallLocalizedShiftedHom W₂ M Y₂ Y₂] (eX : Φ.functor.obj X₁ ≅ X₂) (eY : Φ.functor.obj Y₁ ≅ Y₂) [W₁.IsCompatibleWithShift M] [W₂.IsCompatibleWithShift M] {m : M} (f : CategoryTheory.ShiftedHom X₁ Y₁ m) : Φ.smallShiftedHomMap eX eY (CategoryTheory.Localization.SmallShiftedHom.mk W₁ f) = CategoryTheory.Localization.SmallShiftedHom.mk W₂ ((CategoryTheory.ShiftedHom.mk₀ 0 ⋯ eX.inv).comp ((f.map Φ.functor).comp (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ eY.hom) ⋯) ⋯) - CategoryTheory.LocalizerMorphism.equiv_smallShiftedHomMap 📋 Mathlib.CategoryTheory.Localization.SmallShiftedHom
{C₁ : Type u₁} [CategoryTheory.Category.{v₁, u₁} C₁] {C₂ : Type u₂} [CategoryTheory.Category.{v₂, u₂} C₂] {D₁ : Type u₁'} [CategoryTheory.Category.{v₁', u₁'} D₁] {D₂ : Type u₂'} [CategoryTheory.Category.{v₂', u₂'} D₂] {W₁ : CategoryTheory.MorphismProperty C₁} {W₂ : CategoryTheory.MorphismProperty C₂} (Φ : CategoryTheory.LocalizerMorphism W₁ W₂) (L₁ : CategoryTheory.Functor C₁ D₁) (L₂ : CategoryTheory.Functor C₂ D₂) [L₁.IsLocalization W₁] [L₂.IsLocalization W₂] {M : Type w'} [AddMonoid M] [CategoryTheory.HasShift C₁ M] [CategoryTheory.HasShift C₂ M] [CategoryTheory.HasShift D₁ M] [CategoryTheory.HasShift D₂ M] [L₁.CommShift M] [L₂.CommShift M] [Φ.functor.CommShift M] {X₁ Y₁ : C₁} {X₂ Y₂ : C₂} [CategoryTheory.Localization.HasSmallLocalizedShiftedHom W₁ M X₁ Y₁] [CategoryTheory.Localization.HasSmallLocalizedShiftedHom W₂ M X₂ X₂] [CategoryTheory.Localization.HasSmallLocalizedShiftedHom W₂ M X₂ Y₂] [CategoryTheory.Localization.HasSmallLocalizedShiftedHom W₂ M Y₂ Y₂] (eX : Φ.functor.obj X₁ ≅ X₂) (eY : Φ.functor.obj Y₁ ≅ Y₂) (G : CategoryTheory.Functor D₁ D₂) [G.CommShift M] (e : Φ.functor.comp L₂ ≅ L₁.comp G) [CategoryTheory.NatTrans.CommShift e.hom M] {m : M} (f : CategoryTheory.Localization.SmallShiftedHom W₁ X₁ Y₁ m) : (CategoryTheory.Localization.SmallShiftedHom.equiv W₂ L₂) (Φ.smallShiftedHomMap eX eY f) = (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ (CategoryTheory.CategoryStruct.comp (L₂.map eX.inv) (e.hom.app X₁))).comp ((((CategoryTheory.Localization.SmallShiftedHom.equiv W₁ L₁) f).map G).comp (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ (CategoryTheory.CategoryStruct.comp (e.inv.app Y₁) (L₂.map eY.hom))) ⋯) ⋯ - CategoryTheory.Abelian.Ext.mk₀_id_comp 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {X Y : C} {n : ℕ} (α : CategoryTheory.Abelian.Ext X Y n) : (CategoryTheory.Abelian.Ext.mk₀ (CategoryTheory.CategoryStruct.id X)).comp α ⋯ = α - CategoryTheory.Abelian.Ext.mk₀_comp_mk₀ 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {X Y Z : C} (f : X ⟶ Y) (g : Y ⟶ Z) : (CategoryTheory.Abelian.Ext.mk₀ f).comp (CategoryTheory.Abelian.Ext.mk₀ g) ⋯ = CategoryTheory.Abelian.Ext.mk₀ (CategoryTheory.CategoryStruct.comp f g) - CategoryTheory.Abelian.Ext.comp_assoc_of_second_deg_zero 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {X Y Z T : C} {a₁ a₃ a₁₃ : ℕ} (α : CategoryTheory.Abelian.Ext X Y a₁) (β : CategoryTheory.Abelian.Ext Y Z 0) (γ : CategoryTheory.Abelian.Ext Z T a₃) (h₁₃ : a₁ + a₃ = a₁₃) : (α.comp β ⋯).comp γ h₁₃ = α.comp (β.comp γ ⋯) h₁₃ - CategoryTheory.Abelian.Ext.mk₀_comp_mk₀_assoc 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {X Y Z T : C} (f : X ⟶ Y) (g : Y ⟶ Z) {n : ℕ} (α : CategoryTheory.Abelian.Ext Z T n) : (CategoryTheory.Abelian.Ext.mk₀ f).comp ((CategoryTheory.Abelian.Ext.mk₀ g).comp α ⋯) ⋯ = (CategoryTheory.Abelian.Ext.mk₀ (CategoryTheory.CategoryStruct.comp f g)).comp α ⋯ - CategoryTheory.Abelian.Ext.biprod_ext 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {Y : C} {n : ℕ} {X₁ X₂ : C} {α β : CategoryTheory.Abelian.Ext (X₁ ⊞ X₂) Y n} (h₁ : (CategoryTheory.Abelian.Ext.mk₀ CategoryTheory.Limits.biprod.inl).comp α ⋯ = (CategoryTheory.Abelian.Ext.mk₀ CategoryTheory.Limits.biprod.inl).comp β ⋯) (h₂ : (CategoryTheory.Abelian.Ext.mk₀ CategoryTheory.Limits.biprod.inr).comp α ⋯ = (CategoryTheory.Abelian.Ext.mk₀ CategoryTheory.Limits.biprod.inr).comp β ⋯) : α = β - CategoryTheory.ShortComplex.ShortExact.extClass_naturality 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.ExtClass
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {S₁ S₂ : CategoryTheory.ShortComplex C} (h₁ : S₁.ShortExact) (h₂ : S₂.ShortExact) (f : S₁ ⟶ S₂) : h₁.extClass.comp (CategoryTheory.Abelian.Ext.mk₀ f.τ₁) ⋯ = (CategoryTheory.Abelian.Ext.mk₀ f.τ₃).comp h₂.extClass ⋯ - CategoryTheory.ShortComplex.ShortExact.comp_extClass_assoc 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.ExtClass
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {S : CategoryTheory.ShortComplex C} (hS : S.ShortExact) {Y : C} {n : ℕ} (γ : CategoryTheory.Abelian.Ext S.X₁ Y n) {n' : ℕ} (h : 1 + n = n') : (CategoryTheory.Abelian.Ext.mk₀ S.g).comp (hS.extClass.comp γ h) ⋯ = 0 - CategoryTheory.ShortComplex.ShortExact.extClass_comp_assoc 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.ExtClass
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {S : CategoryTheory.ShortComplex C} (hS : S.ShortExact) {Y : C} {n : ℕ} (γ : CategoryTheory.Abelian.Ext S.X₂ Y n) {n' : ℕ} {h : 1 + n = n'} : hS.extClass.comp ((CategoryTheory.Abelian.Ext.mk₀ S.f).comp γ ⋯) h = 0 - CategoryTheory.ShortComplex.ShortExact.comp_extClass 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.ExtClass
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {S : CategoryTheory.ShortComplex C} (hS : S.ShortExact) : (CategoryTheory.Abelian.Ext.mk₀ S.g).comp hS.extClass ⋯ = 0 - CategoryTheory.ShortComplex.ext_mk₀_f_comp_ext_mk₀_g 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.ExtClass
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] (S : CategoryTheory.ShortComplex C) : (CategoryTheory.Abelian.Ext.mk₀ S.f).comp (CategoryTheory.Abelian.Ext.mk₀ S.g) ⋯ = 0 - CategoryTheory.Pretriangulated.shiftFunctorZero_op_hom_app 📋 Mathlib.CategoryTheory.Triangulated.Opposite.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.HasShift C ℤ] (X : Cᵒᵖ) : (CategoryTheory.shiftFunctorZero Cᵒᵖ ℤ).hom.app X = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Pretriangulated.shiftFunctorOpIso C 0 0 ⋯).hom.app X) ((CategoryTheory.shiftFunctorZero C ℤ).inv.app (Opposite.unop X)).op - CategoryTheory.Pretriangulated.shiftFunctorZero_op_inv_app 📋 Mathlib.CategoryTheory.Triangulated.Opposite.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.HasShift C ℤ] (X : Cᵒᵖ) : (CategoryTheory.shiftFunctorZero Cᵒᵖ ℤ).inv.app X = CategoryTheory.CategoryStruct.comp ((CategoryTheory.shiftFunctorZero C ℤ).hom.app (Opposite.unop X)).op ((CategoryTheory.Pretriangulated.shiftFunctorOpIso C 0 0 ⋯).inv.app X) - CategoryTheory.ShiftedHom.opEquiv'_zero_add_symm 📋 Mathlib.CategoryTheory.Shift.ShiftedHomOpposite
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.HasShift C ℤ] {X Y : C} (a : ℤ) (f : Opposite.op ((CategoryTheory.shiftFunctor C a).obj Y) ⟶ (CategoryTheory.shiftFunctor Cᵒᵖ 0).obj (Opposite.op X)) : (CategoryTheory.ShiftedHom.opEquiv' 0 a a ⋯).symm f = CategoryTheory.CategoryStruct.comp ((CategoryTheory.shiftFunctorZero Cᵒᵖ ℤ).hom.app (Opposite.op X)).unop f.unop - CategoryTheory.Abelian.Ext.mono_precomp_mk₀_of_epi 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.ExactSequences
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] (L : C) {M N : C} (g : M ⟶ N) [hg : CategoryTheory.Epi g] : CategoryTheory.Mono (AddCommGrpCat.ofHom ((CategoryTheory.Abelian.Ext.mk₀ g).precomp L ⋯)) - CategoryTheory.Abelian.Ext.singleFunctor_map_comp_hom 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.ExactSequences
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] [HasDerivedCategory C] {X Y Z : C} (f : X ⟶ Y) {n : ℕ} (x : CategoryTheory.Abelian.Ext Y Z n) : CategoryTheory.CategoryStruct.comp ((DerivedCategory.singleFunctor C 0).map f) x.hom = ((CategoryTheory.Abelian.Ext.mk₀ f).comp x ⋯).hom - CategoryTheory.Abelian.Ext.contravariant_sequence_exact₁ 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.ExactSequences
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {S : CategoryTheory.ShortComplex C} (hS : S.ShortExact) (Y : C) {n₀ : ℕ} (x₁ : CategoryTheory.Abelian.Ext S.X₁ Y n₀) {n₁ : ℕ} (hn₁ : 1 + n₀ = n₁) (hx₁ : hS.extClass.comp x₁ hn₁ = 0) : ∃ x₂, (CategoryTheory.Abelian.Ext.mk₀ S.f).comp x₂ ⋯ = x₁ - CategoryTheory.Abelian.Ext.contravariant_sequence_exact₃ 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.ExactSequences
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {S : CategoryTheory.ShortComplex C} (hS : S.ShortExact) (Y : C) {n₁ : ℕ} (x₃ : CategoryTheory.Abelian.Ext S.X₃ Y n₁) (hx₃ : (CategoryTheory.Abelian.Ext.mk₀ S.g).comp x₃ ⋯ = 0) {n₀ : ℕ} (hn₀ : 1 + n₀ = n₁) : ∃ x₁, hS.extClass.comp x₁ hn₀ = x₃ - CategoryTheory.Abelian.Ext.contravariant_sequence_exact₂ 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.ExactSequences
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {S : CategoryTheory.ShortComplex C} (hS : S.ShortExact) (Y : C) {n : ℕ} (x₂ : CategoryTheory.Abelian.Ext S.X₂ Y n) (hx₂ : (CategoryTheory.Abelian.Ext.mk₀ S.f).comp x₂ ⋯ = 0) : ∃ x₁, (CategoryTheory.Abelian.Ext.mk₀ S.g).comp x₁ ⋯ = x₂ - CategoryTheory.Abelian.Ext.contravariant_sequence_exact₁' 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.ExactSequences
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {S : CategoryTheory.ShortComplex C} (hS : S.ShortExact) (Y : C) (n₀ n₁ : ℕ) (h : 1 + n₀ = n₁) : { X₁ := AddCommGrpCat.of (CategoryTheory.Abelian.Ext S.X₂ Y n₀), X₂ := AddCommGrpCat.of (CategoryTheory.Abelian.Ext S.X₁ Y n₀), X₃ := AddCommGrpCat.of (CategoryTheory.Abelian.Ext S.X₃ Y n₁), f := AddCommGrpCat.ofHom ((CategoryTheory.Abelian.Ext.mk₀ S.f).precomp Y ⋯), g := AddCommGrpCat.ofHom (hS.extClass.precomp Y h), zero := ⋯ }.Exact - CategoryTheory.Abelian.Ext.contravariant_sequence_exact₃' 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.ExactSequences
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {S : CategoryTheory.ShortComplex C} (hS : S.ShortExact) (Y : C) (n₀ n₁ : ℕ) (h : 1 + n₀ = n₁) : { X₁ := AddCommGrpCat.of (CategoryTheory.Abelian.Ext S.X₁ Y n₀), X₂ := AddCommGrpCat.of (CategoryTheory.Abelian.Ext S.X₃ Y n₁), X₃ := AddCommGrpCat.of (CategoryTheory.Abelian.Ext S.X₂ Y n₁), f := AddCommGrpCat.ofHom (hS.extClass.precomp Y h), g := AddCommGrpCat.ofHom ((CategoryTheory.Abelian.Ext.mk₀ S.g).precomp Y ⋯), zero := ⋯ }.Exact - CategoryTheory.Abelian.Ext.contravariant_sequence_exact₂' 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.ExactSequences
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {S : CategoryTheory.ShortComplex C} (hS : S.ShortExact) (Y : C) (n : ℕ) : { X₁ := AddCommGrpCat.of (CategoryTheory.Abelian.Ext S.X₃ Y n), X₂ := AddCommGrpCat.of (CategoryTheory.Abelian.Ext S.X₂ Y n), X₃ := AddCommGrpCat.of (CategoryTheory.Abelian.Ext S.X₁ Y n), f := AddCommGrpCat.ofHom ((CategoryTheory.Abelian.Ext.mk₀ S.g).precomp Y ⋯), g := AddCommGrpCat.ofHom ((CategoryTheory.Abelian.Ext.mk₀ S.f).precomp Y ⋯), zero := ⋯ }.Exact - CategoryTheory.Abelian.Ext.precomp_mk₀_injective_of_epi 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.ExactSequences
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] (L : C) {M N : C} (g : M ⟶ N) [hg : CategoryTheory.Epi g] : Function.Injective ⇑((CategoryTheory.Abelian.Ext.mk₀ g).precomp L ⋯) - CliffordAlgebra.odd_induction 📋 Mathlib.LinearAlgebra.CliffordAlgebra.Grading
{R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) {P : (x : CliffordAlgebra Q) → x ∈ CliffordAlgebra.evenOdd Q 1 → Prop} (ι : ∀ (v : M), P ((CliffordAlgebra.ι Q) v) ⋯) (add : ∀ (x y : CliffordAlgebra Q) (hx : x ∈ CliffordAlgebra.evenOdd Q 1) (hy : y ∈ CliffordAlgebra.evenOdd Q 1), P x hx → P y hy → P (x + y) ⋯) (ι_mul_ι_mul : ∀ (m₁ m₂ : M) (x : CliffordAlgebra Q) (hx : x ∈ CliffordAlgebra.evenOdd Q 1), P x hx → P ((CliffordAlgebra.ι Q) m₁ * (CliffordAlgebra.ι Q) m₂ * x) ⋯) (x : CliffordAlgebra Q) (hx : x ∈ CliffordAlgebra.evenOdd Q 1) : P x hx - CliffordAlgebra.even_induction 📋 Mathlib.LinearAlgebra.CliffordAlgebra.Grading
{R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) {motive : (x : CliffordAlgebra Q) → x ∈ CliffordAlgebra.evenOdd Q 0 → Prop} (algebraMap : ∀ (r : R), motive ((algebraMap R (CliffordAlgebra Q)) r) ⋯) (add : ∀ (x y : CliffordAlgebra Q) (hx : x ∈ CliffordAlgebra.evenOdd Q 0) (hy : y ∈ CliffordAlgebra.evenOdd Q 0), motive x hx → motive y hy → motive (x + y) ⋯) (ι_mul_ι_mul : ∀ (m₁ m₂ : M) (x : CliffordAlgebra Q) (hx : x ∈ CliffordAlgebra.evenOdd Q 0), motive x hx → motive ((CliffordAlgebra.ι Q) m₁ * (CliffordAlgebra.ι Q) m₂ * x) ⋯) (x : CliffordAlgebra Q) (hx : x ∈ CliffordAlgebra.evenOdd Q 0) : motive x hx - CliffordAlgebra.evenOdd_induction 📋 Mathlib.LinearAlgebra.CliffordAlgebra.Grading
{R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] (Q : QuadraticForm R M) (n : ZMod 2) {motive : (x : CliffordAlgebra Q) → x ∈ CliffordAlgebra.evenOdd Q n → Prop} (range_ι_pow : ∀ (v : CliffordAlgebra Q) (h : v ∈ (CliffordAlgebra.ι Q).range ^ n.val), motive v ⋯) (add : ∀ (x y : CliffordAlgebra Q) (hx : x ∈ CliffordAlgebra.evenOdd Q n) (hy : y ∈ CliffordAlgebra.evenOdd Q n), motive x hx → motive y hy → motive (x + y) ⋯) (ι_mul_ι_mul : ∀ (m₁ m₂ : M) (x : CliffordAlgebra Q) (hx : x ∈ CliffordAlgebra.evenOdd Q n), motive x hx → motive ((CliffordAlgebra.ι Q) m₁ * (CliffordAlgebra.ι Q) m₂ * x) ⋯) (x : CliffordAlgebra Q) (hx : x ∈ CliffordAlgebra.evenOdd Q n) : motive x hx - CochainComplex.Lifting.comp_coe_cocycle₁_comp 📋 Mathlib.Algebra.Homology.ModelCategory.Lifting
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Abelian C] {A B X Y : CochainComplex C ℤ} {t : A ⟶ X} {i : A ⟶ B} {p : X ⟶ Y} {b : B ⟶ Y} (sq : CategoryTheory.CommSq t i p b) (hsq : (n : ℤ) → ⋯.LiftStruct) {Q : CochainComplex C ℤ} {π : B ⟶ Q} {hπ : CategoryTheory.CategoryStruct.comp i π = 0} (hQ : CategoryTheory.Limits.IsColimit (CategoryTheory.Limits.CokernelCofork.ofπ π hπ)) {K : CochainComplex C ℤ} {ι : K ⟶ X} {hι : CategoryTheory.CategoryStruct.comp ι p = 0} (hK : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.KernelFork.ofι ι hι)) : (CochainComplex.HomComplex.Cochain.ofHom π).comp ((↑(CochainComplex.Lifting.cocycle₁ sq hsq hQ hK)).comp (CochainComplex.HomComplex.Cochain.ofHom ι) ⋯) ⋯ = ↑(CochainComplex.Lifting.cocycle₁' sq hsq) - CochainComplex.HomComplex.Cochain.toSingleMk_precomp 📋 Mathlib.Algebra.Homology.HomotopyCategory.HomComplexSingle
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasZeroObject C] {X : C} {K : CochainComplex C ℤ} {p q : ℤ} (f : K.X p ⟶ X) {n : ℤ} (h : p + n = q) {L : CochainComplex C ℤ} (g : L ⟶ K) : CochainComplex.HomComplex.Cochain.toSingleMk (CategoryTheory.CategoryStruct.comp (g.f p) f) h = (CochainComplex.HomComplex.Cochain.ofHom g).comp (CochainComplex.HomComplex.Cochain.toSingleMk f h) ⋯ - CochainComplex.HomComplex.Cochain.fromSingleMk_precomp 📋 Mathlib.Algebra.Homology.HomotopyCategory.HomComplexSingle
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasZeroObject C] {X : C} {K : CochainComplex C ℤ} {X' : C} (g : X' ⟶ X) {p q : ℤ} (f : X ⟶ K.X q) {n : ℤ} (h : p + n = q) : CochainComplex.HomComplex.Cochain.fromSingleMk (CategoryTheory.CategoryStruct.comp g f) h = (CochainComplex.HomComplex.Cochain.ofHom ((CochainComplex.singleFunctor C p).map g)).comp (CochainComplex.HomComplex.Cochain.fromSingleMk f h) ⋯ - CategoryTheory.GradedObject.Monoidal.leftUnitor_inv_apply 📋 Mathlib.CategoryTheory.GradedObject.Monoidal
{I : Type u} [AddMonoid I] {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.MonoidalCategory C] [DecidableEq I] [CategoryTheory.Limits.HasInitial C] [∀ (X₂ : C), CategoryTheory.Limits.PreservesColimit (CategoryTheory.Functor.empty C) ((CategoryTheory.MonoidalCategory.curriedTensor C).flip.obj X₂)] (X : CategoryTheory.GradedObject I C) (i : I) : (CategoryTheory.GradedObject.Monoidal.leftUnitor X).inv i = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.leftUnitor (X i)).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerRight CategoryTheory.GradedObject.Monoidal.tensorUnit₀.inv (X i)) (CategoryTheory.GradedObject.Monoidal.ιTensorObj CategoryTheory.GradedObject.Monoidal.tensorUnit X 0 i i ⋯)) - HomologicalComplex.leftUnitor'_inv 📋 Mathlib.Algebra.Homology.Monoidal
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.Preadditive C] [CategoryTheory.Limits.HasZeroObject C] [(CategoryTheory.MonoidalCategory.curriedTensor C).Additive] [∀ (X₁ : C), ((CategoryTheory.MonoidalCategory.curriedTensor C).obj X₁).Additive] {I : Type u_2} [AddMonoid I] {c : ComplexShape I} [c.TensorSigns] (K : HomologicalComplex C c) [DecidableEq I] [∀ (X₂ : C), CategoryTheory.Limits.PreservesColimit (CategoryTheory.Functor.empty C) ((CategoryTheory.MonoidalCategory.curriedTensor C).flip.obj X₂)] (i : I) : K.leftUnitor'.inv i = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.leftUnitor (K.X i)).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerRight (HomologicalComplex.singleObjXSelf c 0 (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)).inv (K.X i)) ((HomologicalComplex.tensorUnit C c).ιTensorObj K 0 i i ⋯)) - TensorPower.one_mul 📋 Mathlib.LinearAlgebra.TensorPower.Basic
{R : Type u_1} {M : Type u_2} [CommSemiring R] [AddCommMonoid M] [Module R M] {n : ℕ} (a : TensorPower R n M) : (TensorPower.cast R M ⋯) (GradedMonoid.GMul.mul GradedMonoid.GOne.one a) = a - TensorPower.algebraMap₀_mul 📋 Mathlib.LinearAlgebra.TensorPower.Basic
{R : Type u_1} {M : Type u_2} [CommSemiring R] [AddCommMonoid M] [Module R M] {n : ℕ} (r : R) (a : TensorPower R n M) : (TensorPower.cast R M ⋯) (GradedMonoid.GMul.mul (TensorPower.algebraMap₀ r) a) = r • a - CategoryTheory.InjectiveResolution.mk₀_comp_extMk 📋 Mathlib.CategoryTheory.Abelian.Injective.Ext
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {X Y : C} (R : CategoryTheory.InjectiveResolution Y) {n : ℕ} (f : X ⟶ R.cocomplex.X n) (m : ℕ) (hm : n + 1 = m) (hf : CategoryTheory.CategoryStruct.comp f (R.cocomplex.d n m) = 0) {X' : C} (g : X' ⟶ X) : (CategoryTheory.Abelian.Ext.mk₀ g).comp (R.extMk f m hm hf) ⋯ = R.extMk (CategoryTheory.CategoryStruct.comp g f) m hm ⋯ - CategoryTheory.InjectiveResolution.extEquivCohomologyClass_extMk 📋 Mathlib.CategoryTheory.Abelian.Injective.Ext
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {X Y : C} (R : CategoryTheory.InjectiveResolution Y) {n : ℕ} (f : X ⟶ R.cocomplex.X n) (m : ℕ) (hm : n + 1 = m) (hf : CategoryTheory.CategoryStruct.comp f (R.cocomplex.d n m) = 0) : R.extEquivCohomologyClass (R.extMk f m hm hf) = CochainComplex.HomComplex.CohomologyClass.mk (CochainComplex.HomComplex.Cocycle.fromSingleMk (CategoryTheory.CategoryStruct.comp f (R.cochainComplexXIso (↑n) n ⋯).inv) ⋯ ↑m ⋯ ⋯) - CategoryTheory.InjectiveResolution.extEquivCohomologyClass_symm_mk_hom 📋 Mathlib.CategoryTheory.Abelian.Injective.Ext
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {X Y : C} (R : CategoryTheory.InjectiveResolution Y) {n : ℕ} [HasDerivedCategory C] (x : CochainComplex.HomComplex.Cocycle ((CochainComplex.singleFunctor C 0).obj X) R.cochainComplex ↑n) : (R.extEquivCohomologyClass.symm (CochainComplex.HomComplex.CohomologyClass.mk x)).hom = (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ ((DerivedCategory.singleFunctorIsoCompQ C 0).hom.app X)).comp ((CategoryTheory.ShiftedHom.map (CochainComplex.HomComplex.Cocycle.equivHomShift.symm x) DerivedCategory.Q).comp (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ (CategoryTheory.CategoryStruct.comp (CategoryTheory.inv (DerivedCategory.Q.map R.ι')) ((DerivedCategory.singleFunctorIsoCompQ C 0).inv.app Y))) ⋯) ⋯ - CategoryTheory.InjectiveResolution.extMk_hom 📋 Mathlib.CategoryTheory.Abelian.Injective.Ext
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {X Y : C} (R : CategoryTheory.InjectiveResolution Y) [HasDerivedCategory C] {n : ℕ} (f : X ⟶ R.cocomplex.X n) (m : ℕ) (hm : n + 1 = m) (hf : CategoryTheory.CategoryStruct.comp f (R.cocomplex.d n m) = 0) : (R.extMk f m hm hf).hom = (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ ((DerivedCategory.singleFunctorIsoCompQ C 0).hom.app X)).comp ((CategoryTheory.ShiftedHom.map (CochainComplex.HomComplex.Cocycle.equivHomShift.symm (CochainComplex.HomComplex.Cocycle.fromSingleMk (CategoryTheory.CategoryStruct.comp f (R.cochainComplexXIso (↑n) n ⋯).inv) ⋯ ↑m ⋯ ⋯)) DerivedCategory.Q).comp (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ (CategoryTheory.CategoryStruct.comp (CategoryTheory.inv (DerivedCategory.Q.map R.ι')) ((DerivedCategory.singleFunctorIsoCompQ C 0).inv.app Y))) ⋯) ⋯ - CategoryTheory.ProjectiveResolution.mk₀_comp_extMk 📋 Mathlib.CategoryTheory.Abelian.Projective.Ext
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {X Y : C} {R : CategoryTheory.ProjectiveResolution X} {n : ℕ} (f : R.complex.X n ⟶ Y) (m : ℕ) (hm : n + 1 = m) (hf : CategoryTheory.CategoryStruct.comp (R.complex.d m n) f = 0) {X' : C} {R' : CategoryTheory.ProjectiveResolution X'} {g : X' ⟶ X} (φ : R'.Hom R g) : (CategoryTheory.Abelian.Ext.mk₀ g).comp (R.extMk f m hm hf) ⋯ = R'.extMk (CategoryTheory.CategoryStruct.comp (φ.hom.f n) f) m hm ⋯ - CategoryTheory.ProjectiveResolution.extMk_hom 📋 Mathlib.CategoryTheory.Abelian.Projective.Ext
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {X Y : C} (R : CategoryTheory.ProjectiveResolution X) [HasDerivedCategory C] {n : ℕ} (f : R.complex.X n ⟶ Y) (m : ℕ) (hm : n + 1 = m) (hf : CategoryTheory.CategoryStruct.comp (R.complex.d m n) f = 0) : (R.extMk f m hm hf).hom = (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ (CategoryTheory.CategoryStruct.comp ((DerivedCategory.singleFunctorIsoCompQ C 0).hom.app X) (CategoryTheory.inv (DerivedCategory.Q.map R.π')))).comp ((CategoryTheory.ShiftedHom.map (CochainComplex.HomComplex.Cocycle.equivHomShift.symm (CochainComplex.HomComplex.Cocycle.toSingleMk (CategoryTheory.CategoryStruct.comp (R.cochainComplexXIso (-↑n) n ⋯).hom f) ⋯ (-↑m) ⋯ ⋯)) DerivedCategory.Q).comp (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ ((DerivedCategory.singleFunctorIsoCompQ C 0).inv.app Y)) ⋯) ⋯ - CategoryTheory.ProjectiveResolution.extEquivCohomologyClass_symm_mk_hom 📋 Mathlib.CategoryTheory.Abelian.Projective.Ext
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.HasExt C] {X Y : C} (R : CategoryTheory.ProjectiveResolution X) {n : ℕ} [HasDerivedCategory C] (x : CochainComplex.HomComplex.Cocycle R.cochainComplex ((CochainComplex.singleFunctor C 0).obj Y) ↑n) : (R.extEquivCohomologyClass.symm (CochainComplex.HomComplex.CohomologyClass.mk x)).hom = (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ (CategoryTheory.CategoryStruct.comp ((DerivedCategory.singleFunctorIsoCompQ C 0).hom.app X) (CategoryTheory.inv (DerivedCategory.Q.map R.π')))).comp ((CategoryTheory.ShiftedHom.map (CochainComplex.HomComplex.Cocycle.equivHomShift.symm x) DerivedCategory.Q).comp (CategoryTheory.ShiftedHom.mk₀ 0 ⋯ ((DerivedCategory.singleFunctorIsoCompQ C 0).inv.app Y)) ⋯) ⋯ - CategoryTheory.GrothendieckTopology.MayerVietorisSquare.mk₀_f_comp_biprodAddEquiv_symm_biprodIsoProd_hom 📋 Mathlib.CategoryTheory.Sites.SheafCohomology.MayerVietoris
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} [CategoryTheory.HasWeakSheafify J (Type v)] [CategoryTheory.HasSheafify J AddCommGrpCat] [CategoryTheory.HasExt (CategoryTheory.Sheaf J AddCommGrpCat)] (S : J.MayerVietorisSquare) (F : CategoryTheory.Sheaf J AddCommGrpCat) {n : ℕ} (x : ↑(F.H' n S.X₂ ⊞ F.H' n S.X₃)) : (CategoryTheory.Abelian.Ext.mk₀ S.shortComplex.f).comp (CategoryTheory.Abelian.Ext.biprodAddEquiv.symm ((CategoryTheory.ConcreteCategory.hom ((F.H' n S.X₂).biprodIsoProd (F.H' n S.X₃)).hom) x)) ⋯ = (CategoryTheory.ConcreteCategory.hom (S.fromBiprod F n)) x - CategoryTheory.GrothendieckTopology.MayerVietorisSquare.biprodAddEquiv_symm_biprodIsoProd_hom_toBiprod_apply 📋 Mathlib.CategoryTheory.Sites.SheafCohomology.MayerVietoris
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} [CategoryTheory.HasWeakSheafify J (Type v)] [CategoryTheory.HasSheafify J AddCommGrpCat] [CategoryTheory.HasExt (CategoryTheory.Sheaf J AddCommGrpCat)] (S : J.MayerVietorisSquare) (F : CategoryTheory.Sheaf J AddCommGrpCat) {n : ℕ} (x : ↑(F.H' n S.X₄)) : CategoryTheory.Abelian.Ext.biprodAddEquiv.symm ((CategoryTheory.ConcreteCategory.hom ((F.H' n S.X₂).biprodIsoProd (F.H' n S.X₃)).hom) ((CategoryTheory.ConcreteCategory.hom (S.toBiprod F n)) x)) = (CategoryTheory.Abelian.Ext.mk₀ S.shortComplex.g).comp x ⋯ - FirstOrder.Language.BoundedFormula.relabel_sumInl 📋 Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {α : Type u'} {n : ℕ} (φ : L.BoundedFormula α n) : FirstOrder.Language.BoundedFormula.relabel Sum.inl φ = FirstOrder.Language.BoundedFormula.castLE ⋯ φ
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 01cceef