Loogle!
Result
Found 44 declarations mentioning Homotopy.hom.
- Homotopy.hom 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} {f g : C ⟶ D} (self : Homotopy f g) (i j : ι) : C.X i ⟶ D.X j - Homotopy.ext 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} {inst✝ : CategoryTheory.Category.{v, u} V} {inst✝¹ : CategoryTheory.Preadditive V} {c : ComplexShape ι} {C D : HomologicalComplex V c} {f g : C ⟶ D} {x y : Homotopy f g} (hom : x.hom = y.hom) : x = y - Homotopy.ext_iff 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} {inst✝ : CategoryTheory.Category.{v, u} V} {inst✝¹ : CategoryTheory.Preadditive V} {c : ComplexShape ι} {C D : HomologicalComplex V c} {f g : C ⟶ D} {x y : Homotopy f g} : x = y ↔ x.hom = y.hom - Homotopy.refl_hom 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} (f : C ⟶ D) (i j : ι) : (Homotopy.refl f).hom i j = 0 - Homotopy.zero 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} {f g : C ⟶ D} (self : Homotopy f g) (i j : ι) : ¬c.Rel j i → self.hom i j = 0 - Homotopy.compLeftId_hom 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} {f : D ⟶ D} (h : Homotopy f (CategoryTheory.CategoryStruct.id D)) (g : C ⟶ D) (i j : ι) : (h.compLeftId g).hom i j = CategoryTheory.CategoryStruct.comp (g.f i) (h.hom i j) - Homotopy.compRightId_hom 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} {f : C ⟶ C} (h : Homotopy f (CategoryTheory.CategoryStruct.id C)) (g : C ⟶ D) (i j : ι) : (h.compRightId g).hom i j = CategoryTheory.CategoryStruct.comp (h.hom i j) (g.f j) - Homotopy.nullHomotopy_hom 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} (hom : (i j : ι) → C.X i ⟶ D.X j) (zero : ∀ (i j : ι), ¬c.Rel j i → hom i j = 0) (i j : ι) : (Homotopy.nullHomotopy hom zero).hom i j = hom i j - Homotopy.compLeft_hom 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D E : HomologicalComplex V c} {f g : D ⟶ E} (h : Homotopy f g) (e : C ⟶ D) (i j : ι) : (h.compLeft e).hom i j = CategoryTheory.CategoryStruct.comp (e.f i) (h.hom i j) - Homotopy.compRight_hom 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D E : HomologicalComplex V c} {e f : C ⟶ D} (h : Homotopy e f) (g : D ⟶ E) (i j : ι) : (h.compRight g).hom i j = CategoryTheory.CategoryStruct.comp (h.hom i j) (g.f j) - Homotopy.eq_add_nullHomotopicMap 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} {f g : C ⟶ D} (h : Homotopy f g) : f = g + Homotopy.nullHomotopicMap h.hom - Homotopy.eq_sub_nullHomotopicMap 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} {f g : C ⟶ D} (h : Homotopy f g) : g = f - Homotopy.nullHomotopicMap h.hom - Homotopy.nullHomotopy'_hom 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} (h : (i j : ι) → c.Rel j i → (C.X i ⟶ D.X j)) (i j : ι) : (Homotopy.nullHomotopy' h).hom i j = dite (c.Rel j i) (h i j) fun x => 0 - Homotopy.sub_eq_nullHomotopicMap 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} {f g : C ⟶ D} (h : Homotopy f g) : f - g = Homotopy.nullHomotopicMap h.hom - Homotopy.ofEq_hom 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} {f g : C ⟶ D} (h : f = g) (i j : ι) : (Homotopy.ofEq h).hom i j = 0 i j - Homotopy.symm_hom 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} {f g : C ⟶ D} (h : Homotopy f g) (i j : ι) : h.symm.hom i j = -h.hom i j - CategoryTheory.Functor.mapHomotopy_hom 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} {W : Type u_2} [CategoryTheory.Category.{v_1, u_2} W] [CategoryTheory.Preadditive W] (F : CategoryTheory.Functor V W) [F.Additive] {f g : C ⟶ D} (h : Homotopy f g) (i j : ι) : (F.mapHomotopy h).hom i j = F.map (h.hom i j) - Homotopy.trans_hom 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} {e f g : C ⟶ D} (h : Homotopy e f) (k : Homotopy f g) (i j : ι) : (h.trans k).hom i j = h.hom i j + k.hom i j - Homotopy.comp_hom 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C₁ C₂ C₃ : HomologicalComplex V c} {f₁ g₁ : C₁ ⟶ C₂} {f₂ g₂ : C₂ ⟶ C₃} (h₁ : Homotopy f₁ g₁) (h₂ : Homotopy f₂ g₂) (i j : ι) : (h₁.comp h₂).hom i j = CategoryTheory.CategoryStruct.comp (h₁.hom i j) (f₂.f j) + CategoryTheory.CategoryStruct.comp (g₁.f i) (h₂.hom i j) - Homotopy.add_hom 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} {f₁ g₁ f₂ g₂ : C ⟶ D} (h₁ : Homotopy f₁ g₁) (h₂ : Homotopy f₂ g₂) (i j : ι) : (h₁.add h₂).hom i j = h₁.hom i j + h₂.hom i j - Homotopy.smul_hom 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} {f g : C ⟶ D} {R : Type u_2} [Semiring R] [CategoryTheory.Linear R V] (h : Homotopy f g) (a : R) (i j : ι) : (h.smul a).hom i j = a • h.hom i j - Homotopy.comm 📋 Mathlib.Algebra.Homology.Homotopy
{ι : Type u_1} {V : Type u} [CategoryTheory.Category.{v, u} V] [CategoryTheory.Preadditive V] {c : ComplexShape ι} {C D : HomologicalComplex V c} {f g : C ⟶ D} (self : Homotopy f g) (i : ι) : f.f i = (dNext i) self.hom + (prevD i) self.hom + g.f i - CochainComplex.HomComplex.Cochain.equivHomotopy_symm_apply_hom 📋 Mathlib.Algebra.Homology.HomotopyCategory.HomComplex
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] {F G : CochainComplex C ℤ} (φ₁ φ₂ : F ⟶ G) (z : { z // CochainComplex.HomComplex.Cochain.ofHom φ₁ = CochainComplex.HomComplex.δ (-1) 0 z + CochainComplex.HomComplex.Cochain.ofHom φ₂ }) (i j : ℤ) : ((CochainComplex.HomComplex.Cochain.equivHomotopy φ₁ φ₂).symm z).hom i j = if hij : i + -1 = j then (↑z).v i j hij else 0 - HomologicalComplex.homotopyCofiber.inrCompHomotopy_hom 📋 Mathlib.Algebra.Homology.HomotopyCofiber
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {ι : Type u_2} {c : ComplexShape ι} {F G : HomologicalComplex C c} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] [DecidableRel c.Rel] (hc : ∀ (j : ι), ∃ i, c.Rel i j) (i j : ι) (hij : c.Rel j i) : (HomologicalComplex.homotopyCofiber.inrCompHomotopy φ hc).hom i j = HomologicalComplex.homotopyCofiber.inlX φ i j hij - HomologicalComplex.homotopyCofiber.inrCompHomotopy_hom_eq_zero 📋 Mathlib.Algebra.Homology.HomotopyCofiber
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {ι : Type u_2} {c : ComplexShape ι} {F G : HomologicalComplex C c} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] [DecidableRel c.Rel] (hc : ∀ (j : ι), ∃ i, c.Rel i j) (i j : ι) (hij : ¬c.Rel j i) : (HomologicalComplex.homotopyCofiber.inrCompHomotopy φ hc).hom i j = 0 - HomologicalComplex.homotopyCofiber.inlX_desc_f 📋 Mathlib.Algebra.Homology.HomotopyCofiber
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {ι : Type u_2} {c : ComplexShape ι} {F G K : HomologicalComplex C c} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] [DecidableRel c.Rel] (α : G ⟶ K) (hα : Homotopy (CategoryTheory.CategoryStruct.comp φ α) 0) (i j : ι) (hjk : c.Rel j i) : CategoryTheory.CategoryStruct.comp (HomologicalComplex.homotopyCofiber.inlX φ i j hjk) ((HomologicalComplex.homotopyCofiber.desc φ α hα).f j) = hα.hom i j - HomologicalComplex.homotopyCofiber.inlX_desc_f_assoc 📋 Mathlib.Algebra.Homology.HomotopyCofiber
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {ι : Type u_2} {c : ComplexShape ι} {F G K : HomologicalComplex C c} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] [DecidableRel c.Rel] (α : G ⟶ K) (hα : Homotopy (CategoryTheory.CategoryStruct.comp φ α) 0) (i j : ι) (hjk : c.Rel j i) {Z : C} (h : K.X j ⟶ Z) : CategoryTheory.CategoryStruct.comp (HomologicalComplex.homotopyCofiber.inlX φ i j hjk) (CategoryTheory.CategoryStruct.comp ((HomologicalComplex.homotopyCofiber.desc φ α hα).f j) h) = CategoryTheory.CategoryStruct.comp (hα.hom i j) h - HomologicalComplex.homotopyCofiber.inrCompHomotopy_hom_desc_hom 📋 Mathlib.Algebra.Homology.HomotopyCofiber
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {ι : Type u_2} {c : ComplexShape ι} {F G K : HomologicalComplex C c} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] [DecidableRel c.Rel] (α : G ⟶ K) (hα : Homotopy (CategoryTheory.CategoryStruct.comp φ α) 0) (hc : ∀ (j : ι), ∃ i, c.Rel i j) (i j : ι) : CategoryTheory.CategoryStruct.comp ((HomologicalComplex.homotopyCofiber.inrCompHomotopy φ hc).hom i j) ((HomologicalComplex.homotopyCofiber.desc φ α hα).f j) = hα.hom i j - HomologicalComplex.homotopyCofiber.inrCompHomotopy_hom_desc_hom_assoc 📋 Mathlib.Algebra.Homology.HomotopyCofiber
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {ι : Type u_2} {c : ComplexShape ι} {F G K : HomologicalComplex C c} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] [DecidableRel c.Rel] (α : G ⟶ K) (hα : Homotopy (CategoryTheory.CategoryStruct.comp φ α) 0) (hc : ∀ (j : ι), ∃ i, c.Rel i j) (i j : ι) {Z : C} (h : K.X j ⟶ Z) : CategoryTheory.CategoryStruct.comp ((HomologicalComplex.homotopyCofiber.inrCompHomotopy φ hc).hom i j) (CategoryTheory.CategoryStruct.comp ((HomologicalComplex.homotopyCofiber.desc φ α hα).f j) h) = CategoryTheory.CategoryStruct.comp (hα.hom i j) h - HomologicalComplex.homotopyCofiber.desc_f 📋 Mathlib.Algebra.Homology.HomotopyCofiber
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {ι : Type u_2} {c : ComplexShape ι} {F G K : HomologicalComplex C c} (φ : F ⟶ G) [HomologicalComplex.HasHomotopyCofiber φ] [DecidableRel c.Rel] (α : G ⟶ K) (hα : Homotopy (CategoryTheory.CategoryStruct.comp φ α) 0) (j k : ι) (hjk : c.Rel j k) : (HomologicalComplex.homotopyCofiber.desc φ α hα).f j = CategoryTheory.CategoryStruct.comp (HomologicalComplex.homotopyCofiber.fstX φ j k hjk) (hα.hom k j) + CategoryTheory.CategoryStruct.comp (HomologicalComplex.homotopyCofiber.sndX φ j) (α.f j) - HomologicalComplex.homotopyCofiber.descSigma_ext_iff 📋 Mathlib.Algebra.Homology.HomotopyCofiber
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {ι : Type u_2} {c : ComplexShape ι} {F G : HomologicalComplex C c} {φ : F ⟶ G} {K : HomologicalComplex C c} (x y : (α : G ⟶ K) × Homotopy (CategoryTheory.CategoryStruct.comp φ α) 0) : x = y ↔ x.fst = y.fst ∧ ∀ (i j : ι), c.Rel j i → x.snd.hom i j = y.snd.hom i j - Homotopy.op_hom 📋 Mathlib.Algebra.Homology.Opposite
{V : Type u_1} [CategoryTheory.Category.{v_1, u_1} V] {ι : Type u_2} {c : ComplexShape ι} [CategoryTheory.Preadditive V] {F G : HomologicalComplex V c} {φ₁ φ₂ : F ⟶ G} (h : Homotopy φ₁ φ₂) (i j : ι) : h.op.hom i j = (h.hom j i).op - Homotopy.unop_hom 📋 Mathlib.Algebra.Homology.Opposite
{V : Type u_1} [CategoryTheory.Category.{v_1, u_1} V] {ι : Type u_2} {c : ComplexShape ι} [CategoryTheory.Preadditive V] {F G : HomologicalComplex Vᵒᵖ c} {φ₁ φ₂ : F ⟶ G} (h : Homotopy φ₁ φ₂) (i j : ι) : h.unop.hom i j = (h.hom j i).unop - HomologicalComplex.mapBifunctorMapHomotopy.ιMapBifunctor_hom₁ 📋 Mathlib.Algebra.Homology.BifunctorHomotopy
{C₁ : Type u_1} {C₂ : Type u_2} {D : Type u_3} {I₁ : Type u_4} {I₂ : Type u_5} {J : Type u_6} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] [CategoryTheory.Category.{v_3, u_3} D] [CategoryTheory.Preadditive C₁] [CategoryTheory.Preadditive C₂] [CategoryTheory.Preadditive D] {c₁ : ComplexShape I₁} {c₂ : ComplexShape I₂} {K₁ L₁ : HomologicalComplex C₁ c₁} {f₁ f₁' : K₁ ⟶ L₁} (h₁ : Homotopy f₁ f₁') {K₂ L₂ : HomologicalComplex C₂ c₂} (f₂ : K₂ ⟶ L₂) (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ D)) [F.Additive] [∀ (X₁ : C₁), (F.obj X₁).Additive] (c : ComplexShape J) [DecidableEq J] [TotalComplexShape c₁ c₂ c] [K₁.HasMapBifunctor K₂ F c] [L₁.HasMapBifunctor L₂ F c] (i₁ i₁' : I₁) (i₂ : I₂) (j j' : J) (h : c₁.π c₂ c (i₁', i₂) = j) (h' : c₁.prev i₁' = i₁) : CategoryTheory.CategoryStruct.comp (K₁.ιMapBifunctor K₂ F c i₁' i₂ j h) (HomologicalComplex.mapBifunctorMapHomotopy.hom₁ h₁ f₂ F c j j') = c₁.ε₁ c₂ c (i₁, i₂) • CategoryTheory.CategoryStruct.comp ((F.map (h₁.hom i₁' i₁)).app (K₂.X i₂)) (CategoryTheory.CategoryStruct.comp ((F.obj (L₁.X i₁)).map (f₂.f i₂)) (L₁.ιMapBifunctorOrZero L₂ F c i₁ i₂ j')) - HomologicalComplex.mapBifunctorMapHomotopy.ιMapBifunctor_hom₂ 📋 Mathlib.Algebra.Homology.BifunctorHomotopy
{C₁ : Type u_1} {C₂ : Type u_2} {D : Type u_3} {I₁ : Type u_4} {I₂ : Type u_5} {J : Type u_6} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] [CategoryTheory.Category.{v_3, u_3} D] [CategoryTheory.Preadditive C₁] [CategoryTheory.Preadditive C₂] [CategoryTheory.Preadditive D] {c₁ : ComplexShape I₁} {c₂ : ComplexShape I₂} {K₁ L₁ : HomologicalComplex C₁ c₁} (f₁ : K₁ ⟶ L₁) {K₂ L₂ : HomologicalComplex C₂ c₂} {f₂ f₂' : K₂ ⟶ L₂} (h₂ : Homotopy f₂ f₂') (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ D)) [F.Additive] [∀ (X₁ : C₁), (F.obj X₁).Additive] (c : ComplexShape J) [DecidableEq J] [TotalComplexShape c₁ c₂ c] [K₁.HasMapBifunctor K₂ F c] [L₁.HasMapBifunctor L₂ F c] (i₁ : I₁) (i₂ i₂' : I₂) (j j' : J) (h : c₁.π c₂ c (i₁, i₂') = j) (h' : c₂.prev i₂' = i₂) : CategoryTheory.CategoryStruct.comp (K₁.ιMapBifunctor K₂ F c i₁ i₂' j h) (HomologicalComplex.mapBifunctorMapHomotopy.hom₂ f₁ h₂ F c j j') = c₁.ε₂ c₂ c (i₁, i₂) • CategoryTheory.CategoryStruct.comp ((F.map (f₁.f i₁)).app (K₂.X i₂')) (CategoryTheory.CategoryStruct.comp ((F.obj (L₁.X i₁)).map (h₂.hom i₂' i₂)) (L₁.ιMapBifunctorOrZero L₂ F c i₁ i₂ j')) - HomologicalComplex.mapBifunctorMapHomotopy.ιMapBifunctor_hom₁_assoc 📋 Mathlib.Algebra.Homology.BifunctorHomotopy
{C₁ : Type u_1} {C₂ : Type u_2} {D : Type u_3} {I₁ : Type u_4} {I₂ : Type u_5} {J : Type u_6} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] [CategoryTheory.Category.{v_3, u_3} D] [CategoryTheory.Preadditive C₁] [CategoryTheory.Preadditive C₂] [CategoryTheory.Preadditive D] {c₁ : ComplexShape I₁} {c₂ : ComplexShape I₂} {K₁ L₁ : HomologicalComplex C₁ c₁} {f₁ f₁' : K₁ ⟶ L₁} (h₁ : Homotopy f₁ f₁') {K₂ L₂ : HomologicalComplex C₂ c₂} (f₂ : K₂ ⟶ L₂) (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ D)) [F.Additive] [∀ (X₁ : C₁), (F.obj X₁).Additive] (c : ComplexShape J) [DecidableEq J] [TotalComplexShape c₁ c₂ c] [K₁.HasMapBifunctor K₂ F c] [L₁.HasMapBifunctor L₂ F c] (i₁ i₁' : I₁) (i₂ : I₂) (j j' : J) (h : c₁.π c₂ c (i₁', i₂) = j) (h' : c₁.prev i₁' = i₁) {Z : D} (h✝ : (L₁.mapBifunctor L₂ F c).X j' ⟶ Z) : CategoryTheory.CategoryStruct.comp (K₁.ιMapBifunctor K₂ F c i₁' i₂ j h) (CategoryTheory.CategoryStruct.comp (HomologicalComplex.mapBifunctorMapHomotopy.hom₁ h₁ f₂ F c j j') h✝) = CategoryTheory.CategoryStruct.comp (c₁.ε₁ c₂ c (i₁, i₂) • CategoryTheory.CategoryStruct.comp ((F.map (h₁.hom i₁' i₁)).app (K₂.X i₂)) (CategoryTheory.CategoryStruct.comp ((F.obj (L₁.X i₁)).map (f₂.f i₂)) (L₁.ιMapBifunctorOrZero L₂ F c i₁ i₂ j'))) h✝ - HomologicalComplex.mapBifunctorMapHomotopy.ιMapBifunctor_hom₂_assoc 📋 Mathlib.Algebra.Homology.BifunctorHomotopy
{C₁ : Type u_1} {C₂ : Type u_2} {D : Type u_3} {I₁ : Type u_4} {I₂ : Type u_5} {J : Type u_6} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] [CategoryTheory.Category.{v_3, u_3} D] [CategoryTheory.Preadditive C₁] [CategoryTheory.Preadditive C₂] [CategoryTheory.Preadditive D] {c₁ : ComplexShape I₁} {c₂ : ComplexShape I₂} {K₁ L₁ : HomologicalComplex C₁ c₁} (f₁ : K₁ ⟶ L₁) {K₂ L₂ : HomologicalComplex C₂ c₂} {f₂ f₂' : K₂ ⟶ L₂} (h₂ : Homotopy f₂ f₂') (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ D)) [F.Additive] [∀ (X₁ : C₁), (F.obj X₁).Additive] (c : ComplexShape J) [DecidableEq J] [TotalComplexShape c₁ c₂ c] [K₁.HasMapBifunctor K₂ F c] [L₁.HasMapBifunctor L₂ F c] (i₁ : I₁) (i₂ i₂' : I₂) (j j' : J) (h : c₁.π c₂ c (i₁, i₂') = j) (h' : c₂.prev i₂' = i₂) {Z : D} (h✝ : (L₁.mapBifunctor L₂ F c).X j' ⟶ Z) : CategoryTheory.CategoryStruct.comp (K₁.ιMapBifunctor K₂ F c i₁ i₂' j h) (CategoryTheory.CategoryStruct.comp (HomologicalComplex.mapBifunctorMapHomotopy.hom₂ f₁ h₂ F c j j') h✝) = CategoryTheory.CategoryStruct.comp (c₁.ε₂ c₂ c (i₁, i₂) • CategoryTheory.CategoryStruct.comp ((F.map (f₁.f i₁)).app (K₂.X i₂')) (CategoryTheory.CategoryStruct.comp ((F.obj (L₁.X i₁)).map (h₂.hom i₂' i₂)) (L₁.ιMapBifunctorOrZero L₂ F c i₁ i₂ j'))) h✝ - HomologicalComplex.mapBifunctorMapHomotopy.comm₁_aux 📋 Mathlib.Algebra.Homology.BifunctorHomotopy
{C₁ : Type u_1} {C₂ : Type u_2} {D : Type u_3} {I₁ : Type u_4} {I₂ : Type u_5} {J : Type u_6} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] [CategoryTheory.Category.{v_3, u_3} D] [CategoryTheory.Preadditive C₁] [CategoryTheory.Preadditive C₂] [CategoryTheory.Preadditive D] {c₁ : ComplexShape I₁} {c₂ : ComplexShape I₂} {K₁ L₁ : HomologicalComplex C₁ c₁} {f₁ f₁' : K₁ ⟶ L₁} (h₁ : Homotopy f₁ f₁') {K₂ L₂ : HomologicalComplex C₂ c₂} (f₂ : K₂ ⟶ L₂) (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ D)) [F.Additive] [∀ (X₁ : C₁), (F.obj X₁).Additive] (c : ComplexShape J) [DecidableEq J] [TotalComplexShape c₁ c₂ c] [K₁.HasMapBifunctor K₂ F c] [L₁.HasMapBifunctor L₂ F c] {i₁ i₁' : I₁} (hi₁ : c₁.Rel i₁ i₁') {i₂ i₂' : I₂} (hi₂ : c₂.Rel i₂ i₂') (j : J) (hj : c₁.π c₂ c (i₁', i₂) = j) : c₁.ε₁ c₂ c (i₁, i₂) • CategoryTheory.CategoryStruct.comp ((F.map (h₁.hom i₁' i₁)).app (K₂.X i₂)) (CategoryTheory.CategoryStruct.comp ((F.obj (L₁.X i₁)).map (f₂.f i₂)) ((((F.mapBifunctorHomologicalComplex c₁ c₂).obj L₁).obj L₂).d₂ c i₁ i₂ j)) = -CategoryTheory.CategoryStruct.comp ((((F.mapBifunctorHomologicalComplex c₁ c₂).obj K₁).obj K₂).d₂ c i₁' i₂ (c.next j)) (HomologicalComplex.mapBifunctorMapHomotopy.hom₁ h₁ f₂ F c (c.next j) j) - CochainComplex.homotopyOp_hom_eq 📋 Mathlib.Algebra.Homology.CochainComplexOpposite
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {K L : CochainComplex C ℤ} {f g : K ⟶ L} (h : Homotopy f g) (p q p' q' : ℤ) (hp : p + p' = 0 := by lia) (hq : q + q' = 0 := by lia) : (CochainComplex.homotopyOp h).hom p q = CategoryTheory.CategoryStruct.comp (HomologicalComplex.XIsoOfEq L ⋯).hom.op (CategoryTheory.CategoryStruct.comp (h.hom q' p').op (HomologicalComplex.XIsoOfEq K ⋯).hom.op) - CochainComplex.homotopyUnop_hom_eq 📋 Mathlib.Algebra.Homology.CochainComplexOpposite
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] {K L : CochainComplex C ℤ} {f g : K ⟶ L} (h : Homotopy ((CochainComplex.opEquivalence C).functor.map f.op) ((CochainComplex.opEquivalence C).functor.map g.op)) (p q p' q' : ℤ) (hp : p + p' = 0 := by lia) (hq : q + q' = 0 := by lia) : (CochainComplex.homotopyUnop h).hom p q = CategoryTheory.CategoryStruct.comp (HomologicalComplex.XIsoOfEq K ⋯).hom (CategoryTheory.CategoryStruct.comp (h.hom q' p').unop (HomologicalComplex.XIsoOfEq L ⋯).hom) - Homotopy.extend_hom_eq 📋 Mathlib.Algebra.Homology.Embedding.ExtendHomotopy
{ι : Type u_1} {ι' : Type u_2} {c : ComplexShape ι} {c' : ComplexShape ι'} {C : Type u_3} [CategoryTheory.Category.{v_1, u_3} C] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.Preadditive C] {K L : HomologicalComplex C c} {f g : K ⟶ L} (h : Homotopy f g) (e : c.Embedding c') [e.IsRelIff] {i' j' : ι'} {i j : ι} (hi : e.f i = i') (hj : e.f j = j') : (h.extend e).hom i' j' = CategoryTheory.CategoryStruct.comp (K.extendXIso e hi).hom (CategoryTheory.CategoryStruct.comp (h.hom i j) (L.extendXIso e hj).inv) - Homotopy.ofExtend_hom 📋 Mathlib.Algebra.Homology.Embedding.ExtendHomotopy
{ι : Type u_1} {ι' : Type u_2} {c : ComplexShape ι} {c' : ComplexShape ι'} {C : Type u_3} [CategoryTheory.Category.{v_1, u_3} C] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.Preadditive C] {K L : HomologicalComplex C c} {f g : K ⟶ L} {e : c.Embedding c'} [e.IsRelIff] (h : Homotopy (HomologicalComplex.extendMap f e) (HomologicalComplex.extendMap g e)) (i j : ι) : h.ofExtend.hom i j = CategoryTheory.CategoryStruct.comp (K.extendXIso e ⋯).inv (CategoryTheory.CategoryStruct.comp (h.hom (e.f i) (e.f j)) (L.extendXIso e ⋯).hom) - AlgebraicTopology.DoldKan.homotopyPInftyToId_hom 📋 Mathlib.AlgebraicTopology.DoldKan.HomotopyEquivalence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (X : CategoryTheory.SimplicialObject C) (i j : ℕ) : (AlgebraicTopology.DoldKan.homotopyPInftyToId X).hom i j = (AlgebraicTopology.DoldKan.homotopyPToId X (j + 1)).hom i j - AlgebraicTopology.DoldKan.homotopyPToId_eventually_constant 📋 Mathlib.AlgebraicTopology.DoldKan.HomotopyEquivalence
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Preadditive C] (X : CategoryTheory.SimplicialObject C) {q n : ℕ} (hqn : n < q) : (AlgebraicTopology.DoldKan.homotopyPToId X (q + 1)).hom n (n + 1) = (AlgebraicTopology.DoldKan.homotopyPToId X q).hom n (n + 1)
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 69fae59