Loogle!
Result
Found 14 declarations mentioning HomologicalComplex.mapBifunctorMap.
- HomologicalComplex.mapBifunctorMap 📋 Mathlib.Algebra.Homology.Bifunctor
{C₁ : Type u_1} {C₂ : Type u_2} {D : Type u_3} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] [CategoryTheory.Category.{v_3, u_3} D] {I₁ : Type u_4} {I₂ : Type u_5} {J : Type u_6} {c₁ : ComplexShape I₁} {c₂ : ComplexShape I₂} [CategoryTheory.Limits.HasZeroMorphisms C₁] [CategoryTheory.Limits.HasZeroMorphisms C₂] [CategoryTheory.Preadditive D] {K₁ L₁ : HomologicalComplex C₁ c₁} {K₂ L₂ : HomologicalComplex C₂ c₂} (f₁ : K₁ ⟶ L₁) (f₂ : K₂ ⟶ L₂) (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ D)) [F.PreservesZeroMorphisms] [∀ (X₁ : C₁), (F.obj X₁).PreservesZeroMorphisms] (c : ComplexShape J) [TotalComplexShape c₁ c₂ c] [K₁.HasMapBifunctor K₂ F c] [L₁.HasMapBifunctor L₂ F c] [DecidableEq J] : K₁.mapBifunctor K₂ F c ⟶ L₁.mapBifunctor L₂ F c - CategoryTheory.Functor.map₂HomologicalComplex_obj_map 📋 Mathlib.Algebra.Homology.Bifunctor
{C₁ : Type u_1} {C₂ : Type u_2} {D : Type u_3} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] [CategoryTheory.Category.{v_3, u_3} D] [CategoryTheory.Limits.HasZeroMorphisms C₁] [CategoryTheory.Limits.HasZeroMorphisms C₂] [CategoryTheory.Preadditive D] (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ D)) [F.PreservesZeroMorphisms] [∀ (X₁ : C₁), (F.obj X₁).PreservesZeroMorphisms] {I₁ : Type u_4} {I₂ : Type u_5} {J : Type u_6} (c₁ : ComplexShape I₁) (c₂ : ComplexShape I₂) (c : ComplexShape J) [DecidableEq J] [TotalComplexShape c₁ c₂ c] [∀ (K₁ : HomologicalComplex C₁ c₁) (K₂ : HomologicalComplex C₂ c₂), K₁.HasMapBifunctor K₂ F c] (K₁ : HomologicalComplex C₁ c₁) {X✝ Y✝ : HomologicalComplex C₂ c₂} (g : X✝ ⟶ Y✝) : ((F.map₂HomologicalComplex c₁ c₂ c).obj K₁).map g = HomologicalComplex.mapBifunctorMap (CategoryTheory.CategoryStruct.id K₁) g F c - CategoryTheory.Functor.map₂HomologicalComplex_map_app 📋 Mathlib.Algebra.Homology.Bifunctor
{C₁ : Type u_1} {C₂ : Type u_2} {D : Type u_3} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] [CategoryTheory.Category.{v_3, u_3} D] [CategoryTheory.Limits.HasZeroMorphisms C₁] [CategoryTheory.Limits.HasZeroMorphisms C₂] [CategoryTheory.Preadditive D] (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ D)) [F.PreservesZeroMorphisms] [∀ (X₁ : C₁), (F.obj X₁).PreservesZeroMorphisms] {I₁ : Type u_4} {I₂ : Type u_5} {J : Type u_6} (c₁ : ComplexShape I₁) (c₂ : ComplexShape I₂) (c : ComplexShape J) [DecidableEq J] [TotalComplexShape c₁ c₂ c] [∀ (K₁ : HomologicalComplex C₁ c₁) (K₂ : HomologicalComplex C₂ c₂), K₁.HasMapBifunctor K₂ F c] {X✝ Y✝ : HomologicalComplex C₁ c₁} (f : X✝ ⟶ Y✝) (K₂ : HomologicalComplex C₂ c₂) : ((F.map₂HomologicalComplex c₁ c₂ c).map f).app K₂ = HomologicalComplex.mapBifunctorMap f (CategoryTheory.CategoryStruct.id K₂) F c - HomologicalComplex.ι_mapBifunctorMap 📋 Mathlib.Algebra.Homology.Bifunctor
{C₁ : Type u_1} {C₂ : Type u_2} {D : Type u_3} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] [CategoryTheory.Category.{v_3, u_3} D] {I₁ : Type u_4} {I₂ : Type u_5} {J : Type u_6} {c₁ : ComplexShape I₁} {c₂ : ComplexShape I₂} [CategoryTheory.Limits.HasZeroMorphisms C₁] [CategoryTheory.Limits.HasZeroMorphisms C₂] [CategoryTheory.Preadditive D] {K₁ L₁ : HomologicalComplex C₁ c₁} {K₂ L₂ : HomologicalComplex C₂ c₂} (f₁ : K₁ ⟶ L₁) (f₂ : K₂ ⟶ L₂) (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ D)) [F.PreservesZeroMorphisms] [∀ (X₁ : C₁), (F.obj X₁).PreservesZeroMorphisms] (c : ComplexShape J) [TotalComplexShape c₁ c₂ c] [K₁.HasMapBifunctor K₂ F c] [L₁.HasMapBifunctor L₂ F c] [DecidableEq J] (i₁ : I₁) (i₂ : I₂) (j : J) (h : c₁.π c₂ c (i₁, i₂) = j) : CategoryTheory.CategoryStruct.comp (K₁.ιMapBifunctor K₂ F c i₁ i₂ j h) ((HomologicalComplex.mapBifunctorMap f₁ f₂ F c).f j) = CategoryTheory.CategoryStruct.comp ((F.map (f₁.f i₁)).app (K₂.X i₂)) (CategoryTheory.CategoryStruct.comp ((F.obj (L₁.X i₁)).map (f₂.f i₂)) (L₁.ιMapBifunctor L₂ F c i₁ i₂ j h)) - HomologicalComplex.ι_mapBifunctorMap_assoc 📋 Mathlib.Algebra.Homology.Bifunctor
{C₁ : Type u_1} {C₂ : Type u_2} {D : Type u_3} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] [CategoryTheory.Category.{v_3, u_3} D] {I₁ : Type u_4} {I₂ : Type u_5} {J : Type u_6} {c₁ : ComplexShape I₁} {c₂ : ComplexShape I₂} [CategoryTheory.Limits.HasZeroMorphisms C₁] [CategoryTheory.Limits.HasZeroMorphisms C₂] [CategoryTheory.Preadditive D] {K₁ L₁ : HomologicalComplex C₁ c₁} {K₂ L₂ : HomologicalComplex C₂ c₂} (f₁ : K₁ ⟶ L₁) (f₂ : K₂ ⟶ L₂) (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ D)) [F.PreservesZeroMorphisms] [∀ (X₁ : C₁), (F.obj X₁).PreservesZeroMorphisms] (c : ComplexShape J) [TotalComplexShape c₁ c₂ c] [K₁.HasMapBifunctor K₂ F c] [L₁.HasMapBifunctor L₂ F c] [DecidableEq J] (i₁ : I₁) (i₂ : I₂) (j : J) (h : c₁.π c₂ c (i₁, i₂) = j) {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.mapBifunctorMap f₁ f₂ F c).f j) h✝) = CategoryTheory.CategoryStruct.comp ((F.map (f₁.f i₁)).app (K₂.X i₂)) (CategoryTheory.CategoryStruct.comp ((F.obj (L₁.X i₁)).map (f₂.f i₂)) (CategoryTheory.CategoryStruct.comp (L₁.ιMapBifunctor L₂ F c i₁ i₂ j h) h✝)) - HomologicalComplex.mapBifunctorFlipIso_hom_naturality 📋 Mathlib.Algebra.Homology.BifunctorFlip
{C₁ : Type u_1} {C₂ : Type u_2} {D : Type u_3} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] [CategoryTheory.Category.{v_3, u_3} D] {I₁ : Type u_4} {I₂ : Type u_5} {J : Type u_6} {c₁ : ComplexShape I₁} {c₂ : ComplexShape I₂} [CategoryTheory.Limits.HasZeroMorphisms C₁] [CategoryTheory.Limits.HasZeroMorphisms C₂] [CategoryTheory.Preadditive D] {K₁ L₁ : HomologicalComplex C₁ c₁} (φ₁ : K₁ ⟶ L₁) {K₂ L₂ : HomologicalComplex C₂ c₂} (φ₂ : K₂ ⟶ L₂) (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ D)) [F.PreservesZeroMorphisms] [∀ (X₁ : C₁), (F.obj X₁).PreservesZeroMorphisms] (c : ComplexShape J) [TotalComplexShape c₁ c₂ c] [TotalComplexShape c₂ c₁ c] [TotalComplexShapeSymmetry c₁ c₂ c] [DecidableEq J] [K₁.HasMapBifunctor K₂ F c] [L₁.HasMapBifunctor L₂ F c] : CategoryTheory.CategoryStruct.comp (HomologicalComplex.mapBifunctorMap φ₂ φ₁ F.flip c) (L₁.mapBifunctorFlipIso L₂ F c).hom = CategoryTheory.CategoryStruct.comp (K₁.mapBifunctorFlipIso K₂ F c).hom (HomologicalComplex.mapBifunctorMap φ₁ φ₂ F c) - HomologicalComplex.mapBifunctorFlipIso_hom_naturality_assoc 📋 Mathlib.Algebra.Homology.BifunctorFlip
{C₁ : Type u_1} {C₂ : Type u_2} {D : Type u_3} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] [CategoryTheory.Category.{v_3, u_3} D] {I₁ : Type u_4} {I₂ : Type u_5} {J : Type u_6} {c₁ : ComplexShape I₁} {c₂ : ComplexShape I₂} [CategoryTheory.Limits.HasZeroMorphisms C₁] [CategoryTheory.Limits.HasZeroMorphisms C₂] [CategoryTheory.Preadditive D] {K₁ L₁ : HomologicalComplex C₁ c₁} (φ₁ : K₁ ⟶ L₁) {K₂ L₂ : HomologicalComplex C₂ c₂} (φ₂ : K₂ ⟶ L₂) (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ D)) [F.PreservesZeroMorphisms] [∀ (X₁ : C₁), (F.obj X₁).PreservesZeroMorphisms] (c : ComplexShape J) [TotalComplexShape c₁ c₂ c] [TotalComplexShape c₂ c₁ c] [TotalComplexShapeSymmetry c₁ c₂ c] [DecidableEq J] [K₁.HasMapBifunctor K₂ F c] [L₁.HasMapBifunctor L₂ F c] {Z : HomologicalComplex D c} (h : L₁.mapBifunctor L₂ F c ⟶ Z) : CategoryTheory.CategoryStruct.comp (HomologicalComplex.mapBifunctorMap φ₂ φ₁ F.flip c) (CategoryTheory.CategoryStruct.comp (L₁.mapBifunctorFlipIso L₂ F c).hom h) = CategoryTheory.CategoryStruct.comp (K₁.mapBifunctorFlipIso K₂ F c).hom (CategoryTheory.CategoryStruct.comp (HomologicalComplex.mapBifunctorMap φ₁ φ₂ F c) h) - HomologicalComplex.mapBifunctorMapHomotopy₁ 📋 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] : Homotopy (HomologicalComplex.mapBifunctorMap f₁ f₂ F c) (HomologicalComplex.mapBifunctorMap f₁' f₂ F c) - HomologicalComplex.mapBifunctorMapHomotopy₂ 📋 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] : Homotopy (HomologicalComplex.mapBifunctorMap f₁ f₂ F c) (HomologicalComplex.mapBifunctorMap f₁ f₂' F c) - HomologicalComplex.mapBifunctorMapHomotopy.comm₁ 📋 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] (j : J) : (HomologicalComplex.mapBifunctorMap f₁ f₂ F c).f j = CategoryTheory.CategoryStruct.comp ((K₁.mapBifunctor K₂ F c).d j (c.next j)) (HomologicalComplex.mapBifunctorMapHomotopy.hom₁ h₁ f₂ F c (c.next j) j) + CategoryTheory.CategoryStruct.comp (HomologicalComplex.mapBifunctorMapHomotopy.hom₁ h₁ f₂ F c j (c.prev j)) ((L₁.mapBifunctor L₂ F c).d (c.prev j) j) + (HomologicalComplex.mapBifunctorMap f₁' f₂ F c).f j - CochainComplex.mapBifunctorShift₁Iso_hom_naturality₁ 📋 Mathlib.Algebra.Homology.BifunctorShift
{C₁ : Type u_1} {C₂ : Type u_2} {D : Type u_3} [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.Limits.HasZeroMorphisms C₂] [CategoryTheory.Preadditive D] {K₁ L₁ : CochainComplex C₁ ℤ} (f₁ : K₁ ⟶ L₁) (K₂ : CochainComplex C₂ ℤ) (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ D)) [F.Additive] [∀ (X₁ : C₁), (F.obj X₁).PreservesZeroMorphisms] (x : ℤ) [K₁.HasMapBifunctor K₂ F] [L₁.HasMapBifunctor K₂ F] : CategoryTheory.CategoryStruct.comp (HomologicalComplex.mapBifunctorMap ((CategoryTheory.shiftFunctor (HomologicalComplex C₁ (ComplexShape.up ℤ)) x).map f₁) (CategoryTheory.CategoryStruct.id K₂) F (ComplexShape.up ℤ)) (L₁.mapBifunctorShift₁Iso K₂ F x).hom = CategoryTheory.CategoryStruct.comp (K₁.mapBifunctorShift₁Iso K₂ F x).hom ((CategoryTheory.shiftFunctor (CochainComplex D ℤ) x).map (HomologicalComplex.mapBifunctorMap f₁ (CategoryTheory.CategoryStruct.id K₂) F (ComplexShape.up ℤ))) - CochainComplex.mapBifunctorShift₂Iso_hom_naturality₂ 📋 Mathlib.Algebra.Homology.BifunctorShift
{C₁ : Type u_1} {C₂ : Type u_2} {D : Type u_3} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] [CategoryTheory.Category.{v_3, u_3} D] [CategoryTheory.Limits.HasZeroMorphisms C₁] [CategoryTheory.Preadditive C₂] [CategoryTheory.Preadditive D] (K₁ : CochainComplex C₁ ℤ) {K₂ L₂ : CochainComplex C₂ ℤ} (f₂ : K₂ ⟶ L₂) (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ D)) [F.PreservesZeroMorphisms] [∀ (X₁ : C₁), (F.obj X₁).Additive] (y : ℤ) [K₁.HasMapBifunctor K₂ F] [K₁.HasMapBifunctor L₂ F] : CategoryTheory.CategoryStruct.comp (HomologicalComplex.mapBifunctorMap (CategoryTheory.CategoryStruct.id K₁) ((CategoryTheory.shiftFunctor (HomologicalComplex C₂ (ComplexShape.up ℤ)) y).map f₂) F (ComplexShape.up ℤ)) (K₁.mapBifunctorShift₂Iso L₂ F y).hom = CategoryTheory.CategoryStruct.comp (K₁.mapBifunctorShift₂Iso K₂ F y).hom ((CategoryTheory.shiftFunctor (CochainComplex D ℤ) y).map (HomologicalComplex.mapBifunctorMap (CategoryTheory.CategoryStruct.id K₁) f₂ F (ComplexShape.up ℤ))) - CochainComplex.mapBifunctorShift₁Iso_hom_naturality₁_assoc 📋 Mathlib.Algebra.Homology.BifunctorShift
{C₁ : Type u_1} {C₂ : Type u_2} {D : Type u_3} [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.Limits.HasZeroMorphisms C₂] [CategoryTheory.Preadditive D] {K₁ L₁ : CochainComplex C₁ ℤ} (f₁ : K₁ ⟶ L₁) (K₂ : CochainComplex C₂ ℤ) (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ D)) [F.Additive] [∀ (X₁ : C₁), (F.obj X₁).PreservesZeroMorphisms] (x : ℤ) [K₁.HasMapBifunctor K₂ F] [L₁.HasMapBifunctor K₂ F] {Z : HomologicalComplex D (ComplexShape.up ℤ)} (h : (CategoryTheory.shiftFunctor (CochainComplex D ℤ) x).obj (L₁.mapBifunctor K₂ F) ⟶ Z) : CategoryTheory.CategoryStruct.comp (HomologicalComplex.mapBifunctorMap ((CategoryTheory.shiftFunctor (HomologicalComplex C₁ (ComplexShape.up ℤ)) x).map f₁) (CategoryTheory.CategoryStruct.id K₂) F (ComplexShape.up ℤ)) (CategoryTheory.CategoryStruct.comp (L₁.mapBifunctorShift₁Iso K₂ F x).hom h) = CategoryTheory.CategoryStruct.comp (K₁.mapBifunctorShift₁Iso K₂ F x).hom (CategoryTheory.CategoryStruct.comp ((CategoryTheory.shiftFunctor (CochainComplex D ℤ) x).map (HomologicalComplex.mapBifunctorMap f₁ (CategoryTheory.CategoryStruct.id K₂) F (ComplexShape.up ℤ))) h) - CochainComplex.mapBifunctorShift₂Iso_hom_naturality₂_assoc 📋 Mathlib.Algebra.Homology.BifunctorShift
{C₁ : Type u_1} {C₂ : Type u_2} {D : Type u_3} [CategoryTheory.Category.{v_1, u_1} C₁] [CategoryTheory.Category.{v_2, u_2} C₂] [CategoryTheory.Category.{v_3, u_3} D] [CategoryTheory.Limits.HasZeroMorphisms C₁] [CategoryTheory.Preadditive C₂] [CategoryTheory.Preadditive D] (K₁ : CochainComplex C₁ ℤ) {K₂ L₂ : CochainComplex C₂ ℤ} (f₂ : K₂ ⟶ L₂) (F : CategoryTheory.Functor C₁ (CategoryTheory.Functor C₂ D)) [F.PreservesZeroMorphisms] [∀ (X₁ : C₁), (F.obj X₁).Additive] (y : ℤ) [K₁.HasMapBifunctor K₂ F] [K₁.HasMapBifunctor L₂ F] {Z : HomologicalComplex D (ComplexShape.up ℤ)} (h : (CategoryTheory.shiftFunctor (CochainComplex D ℤ) y).obj (K₁.mapBifunctor L₂ F) ⟶ Z) : CategoryTheory.CategoryStruct.comp (HomologicalComplex.mapBifunctorMap (CategoryTheory.CategoryStruct.id K₁) ((CategoryTheory.shiftFunctor (HomologicalComplex C₂ (ComplexShape.up ℤ)) y).map f₂) F (ComplexShape.up ℤ)) (CategoryTheory.CategoryStruct.comp (K₁.mapBifunctorShift₂Iso L₂ F y).hom h) = CategoryTheory.CategoryStruct.comp (K₁.mapBifunctorShift₂Iso K₂ F y).hom (CategoryTheory.CategoryStruct.comp ((CategoryTheory.shiftFunctor (CochainComplex D ℤ) y).map (HomologicalComplex.mapBifunctorMap (CategoryTheory.CategoryStruct.id K₁) f₂ F (ComplexShape.up ℤ))) h)
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