Loogle!
Result
Found 17 declarations mentioning CochainComplex.mapBifunctor.
- CochainComplex.mapBifunctor š 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.Limits.HasZeroMorphisms Cā] (Kā : CochainComplex Cā ā¤) (Kā : CochainComplex Cā ā¤) [CategoryTheory.Preadditive D] (F : CategoryTheory.Functor Cā (CategoryTheory.Functor Cā D)) [F.PreservesZeroMorphisms] [ā (Xā : Cā), (F.obj Xā).PreservesZeroMorphisms] [Kā.HasMapBifunctor Kā F] : CochainComplex D ⤠- CochainComplex.ιMapBifunctor š 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.Limits.HasZeroMorphisms Cā] (Kā : CochainComplex Cā ā¤) (Kā : CochainComplex Cā ā¤) [CategoryTheory.Preadditive D] (F : CategoryTheory.Functor Cā (CategoryTheory.Functor Cā D)) [F.PreservesZeroMorphisms] [ā (Xā : Cā), (F.obj Xā).PreservesZeroMorphisms] [Kā.HasMapBifunctor Kā F] (nā nā n : ā¤) (h : nā + nā = n) : (F.obj (Kā.X nā)).obj (Kā.X nā) ā¶ (Kā.mapBifunctor Kā F).X n - CochainComplex.mapBifunctorShiftāIso š 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ā : CochainComplex Cā ā¤) (Kā : CochainComplex Cā ā¤) (F : CategoryTheory.Functor Cā (CategoryTheory.Functor Cā D)) [F.Additive] [ā (Xā : Cā), (F.obj Xā).PreservesZeroMorphisms] (x : ā¤) [Kā.HasMapBifunctor Kā F] : ((CategoryTheory.shiftFunctor (CochainComplex Cā ā¤) x).obj Kā).mapBifunctor Kā F ā (CategoryTheory.shiftFunctor (CochainComplex D ā¤) x).obj (Kā.mapBifunctor Kā F) - CochainComplex.mapBifunctorShiftāIso š 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ā : CochainComplex Cā ā¤) (F : CategoryTheory.Functor Cā (CategoryTheory.Functor Cā D)) [F.PreservesZeroMorphisms] [ā (Xā : Cā), (F.obj Xā).Additive] (y : ā¤) [Kā.HasMapBifunctor Kā F] : Kā.mapBifunctor ((CategoryTheory.shiftFunctor (CochainComplex Cā ā¤) y).obj Kā) F ā (CategoryTheory.shiftFunctor (CochainComplex D ā¤) y).obj (Kā.mapBifunctor Kā F) - CochainComplex.ι_mapBifunctorShiftāIso_hom_f š 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ā : CochainComplex Cā ā¤) (Kā : CochainComplex Cā ā¤) (F : CategoryTheory.Functor Cā (CategoryTheory.Functor Cā D)) [F.Additive] [ā (Xā : Cā), (F.obj Xā).PreservesZeroMorphisms] (x : ā¤) [Kā.HasMapBifunctor Kā F] (nā nā n : ā¤) (h : nā + nā = n) (mā m : ā¤) (hmā : mā = nā + x) (hm : m = n + x) : CategoryTheory.CategoryStruct.comp (((CategoryTheory.shiftFunctor (CochainComplex Cā ā¤) x).obj Kā).ιMapBifunctor Kā F nā nā n h) ((Kā.mapBifunctorShiftāIso Kā F x).hom.f n) = CategoryTheory.CategoryStruct.comp ((F.map (Kā.shiftFunctorObjXIso x nā mā hmā).hom).app (Kā.X nā)) (CategoryTheory.CategoryStruct.comp (Kā.ιMapBifunctor Kā F mā nā m āÆ) ((Kā.mapBifunctor Kā F).shiftFunctorObjXIso x n m hm).inv) - CochainComplex.ι_mapBifunctorShiftāIso_hom_f_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ā : CochainComplex Cā ā¤) (Kā : CochainComplex Cā ā¤) (F : CategoryTheory.Functor Cā (CategoryTheory.Functor Cā D)) [F.Additive] [ā (Xā : Cā), (F.obj Xā).PreservesZeroMorphisms] (x : ā¤) [Kā.HasMapBifunctor Kā F] (nā nā n : ā¤) (h : nā + nā = n) (mā m : ā¤) (hmā : mā = nā + x) (hm : m = n + x) {Z : D} (hā : ((CategoryTheory.shiftFunctor (CochainComplex D ā¤) x).obj (Kā.mapBifunctor Kā F)).X n ā¶ Z) : CategoryTheory.CategoryStruct.comp (((CategoryTheory.shiftFunctor (CochainComplex Cā ā¤) x).obj Kā).ιMapBifunctor Kā F nā nā n h) (CategoryTheory.CategoryStruct.comp ((Kā.mapBifunctorShiftāIso Kā F x).hom.f n) hā) = CategoryTheory.CategoryStruct.comp ((F.map (Kā.shiftFunctorObjXIso x nā mā hmā).hom).app (Kā.X nā)) (CategoryTheory.CategoryStruct.comp (Kā.ιMapBifunctor Kā F mā nā m āÆ) (CategoryTheory.CategoryStruct.comp ((Kā.mapBifunctor Kā F).shiftFunctorObjXIso x n m hm).inv hā)) - CategoryTheory.Functor.commShiftIso_mapāCochainComplex_hom_app š 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.Preadditive Cā] [CategoryTheory.Preadditive D] (F : CategoryTheory.Functor Cā (CategoryTheory.Functor Cā D)) [F.Additive] [ā (Xā : Cā), (F.obj Xā).Additive] [ā (Kā : CochainComplex Cā ā¤) (Kā : CochainComplex Cā ā¤), Kā.HasMapBifunctor Kā F] (Kā : CochainComplex Cā ā¤) (Kā : CochainComplex Cā ā¤) (n : ā¤) : (CategoryTheory.Functor.commShiftIso (F.mapāCochainComplex.obj Kā) n).hom.app Kā = (Kā.mapBifunctorShiftāIso Kā F n).hom - CategoryTheory.Functor.commShiftIso_mapāCochainComplex_inv_app š 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.Preadditive Cā] [CategoryTheory.Preadditive D] (F : CategoryTheory.Functor Cā (CategoryTheory.Functor Cā D)) [F.Additive] [ā (Xā : Cā), (F.obj Xā).Additive] [ā (Kā : CochainComplex Cā ā¤) (Kā : CochainComplex Cā ā¤), Kā.HasMapBifunctor Kā F] (Kā : CochainComplex Cā ā¤) (Kā : CochainComplex Cā ā¤) (n : ā¤) : (CategoryTheory.Functor.commShiftIso (F.mapāCochainComplex.obj Kā) n).inv.app Kā = (Kā.mapBifunctorShiftāIso Kā F n).inv - 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 ā¤))) - CategoryTheory.Functor.commShiftIso_mapāCochainComplex_flip_hom_app š 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.Preadditive Cā] [CategoryTheory.Preadditive D] (F : CategoryTheory.Functor Cā (CategoryTheory.Functor Cā D)) [F.Additive] [ā (Xā : Cā), (F.obj Xā).Additive] [ā (Kā : CochainComplex Cā ā¤) (Kā : CochainComplex Cā ā¤), Kā.HasMapBifunctor Kā F] (Kā : CochainComplex Cā ā¤) (Kā : CochainComplex Cā ā¤) (n : ā¤) : (CategoryTheory.Functor.commShiftIso (F.mapāCochainComplex.flip.obj Kā) n).hom.app Kā = (Kā.mapBifunctorShiftāIso Kā F n).hom - CategoryTheory.Functor.commShiftIso_mapāCochainComplex_flip_inv_app š 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.Preadditive Cā] [CategoryTheory.Preadditive D] (F : CategoryTheory.Functor Cā (CategoryTheory.Functor Cā D)) [F.Additive] [ā (Xā : Cā), (F.obj Xā).Additive] [ā (Kā : CochainComplex Cā ā¤) (Kā : CochainComplex Cā ā¤), Kā.HasMapBifunctor Kā F] (Kā : CochainComplex Cā ā¤) (Kā : CochainComplex Cā ā¤) (n : ā¤) : (CategoryTheory.Functor.commShiftIso (F.mapāCochainComplex.flip.obj Kā) n).inv.app Kā = (Kā.mapBifunctorShiftāIso Kā F n).inv - 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) - CochainComplex.ι_mapBifunctorShiftāIso_hom_f š 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ā : CochainComplex Cā ā¤) (F : CategoryTheory.Functor Cā (CategoryTheory.Functor Cā D)) [F.PreservesZeroMorphisms] [ā (Xā : Cā), (F.obj Xā).Additive] (y : ā¤) [Kā.HasMapBifunctor Kā F] (nā nā n : ā¤) (h : nā + nā = n) (mā m : ā¤) (hmā : mā = nā + y) (hm : m = n + y) : CategoryTheory.CategoryStruct.comp (Kā.ιMapBifunctor ((CategoryTheory.shiftFunctor (CochainComplex Cā ā¤) y).obj Kā) F nā nā n h) ((Kā.mapBifunctorShiftāIso Kā F y).hom.f n) = (nā * y).negOnePow ⢠CategoryTheory.CategoryStruct.comp ((F.obj (Kā.X nā)).map (Kā.shiftFunctorObjXIso y nā mā hmā).hom) (CategoryTheory.CategoryStruct.comp (Kā.ιMapBifunctor Kā F nā mā m āÆ) ((Kā.mapBifunctor Kā F).shiftFunctorObjXIso y n m hm).inv) - CochainComplex.ι_mapBifunctorShiftāIso_hom_f_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ā : CochainComplex Cā ā¤) (F : CategoryTheory.Functor Cā (CategoryTheory.Functor Cā D)) [F.PreservesZeroMorphisms] [ā (Xā : Cā), (F.obj Xā).Additive] (y : ā¤) [Kā.HasMapBifunctor Kā F] (nā nā n : ā¤) (h : nā + nā = n) (mā m : ā¤) (hmā : mā = nā + y) (hm : m = n + y) {Z : D} (hā : ((CategoryTheory.shiftFunctor (CochainComplex D ā¤) y).obj (Kā.mapBifunctor Kā F)).X n ā¶ Z) : CategoryTheory.CategoryStruct.comp (Kā.ιMapBifunctor ((CategoryTheory.shiftFunctor (CochainComplex Cā ā¤) y).obj Kā) F nā nā n h) (CategoryTheory.CategoryStruct.comp ((Kā.mapBifunctorShiftāIso Kā F y).hom.f n) hā) = CategoryTheory.CategoryStruct.comp ((nā * y).negOnePow ⢠CategoryTheory.CategoryStruct.comp ((F.obj (Kā.X nā)).map (Kā.shiftFunctorObjXIso y nā mā hmā).hom) (CategoryTheory.CategoryStruct.comp (Kā.ιMapBifunctor Kā F nā mā m āÆ) ((Kā.mapBifunctor Kā F).shiftFunctorObjXIso y n m hm).inv)) hā - CochainComplex.mapBifunctorShiftāIso_trans_mapBifunctorShiftāIso š 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.Preadditive Cā] [CategoryTheory.Preadditive D] (Kā : CochainComplex Cā ā¤) (Kā : CochainComplex Cā ā¤) (F : CategoryTheory.Functor Cā (CategoryTheory.Functor Cā D)) [F.Additive] [ā (Xā : Cā), (F.obj Xā).Additive] (x y : ā¤) [Kā.HasMapBifunctor Kā F] : Kā.mapBifunctorShiftāIso ((CategoryTheory.shiftFunctor (CochainComplex Cā ā¤) y).obj Kā) F x āŖā« (CategoryTheory.shiftFunctor (CochainComplex D ā¤) x).mapIso (Kā.mapBifunctorShiftāIso Kā F y) = (x * y).negOnePow ⢠((CategoryTheory.shiftFunctor (CochainComplex Cā ā¤) x).obj Kā).mapBifunctorShiftāIso Kā F y āŖā« (CategoryTheory.shiftFunctor (CochainComplex D ā¤) y).mapIso (Kā.mapBifunctorShiftāIso Kā F x) āŖā« (CategoryTheory.shiftFunctorComm (CochainComplex D ā¤) x y).app (Kā.mapBifunctor Kā F)
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