Loogle!
Result
Found 5 declarations mentioning AlgebraicTopology.AlternatingFaceMapComplex.map.
- AlgebraicTopology.AlternatingFaceMapComplex.map š Mathlib.AlgebraicTopology.AlternatingFaceMapComplex
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] {X Y : CategoryTheory.SimplicialObject C} (f : X ā¶ Y) : AlgebraicTopology.AlternatingFaceMapComplex.obj X ā¶ AlgebraicTopology.AlternatingFaceMapComplex.obj Y - AlgebraicTopology.AlternatingFaceMapComplex.map_f š Mathlib.AlgebraicTopology.AlternatingFaceMapComplex
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] {X Y : CategoryTheory.SimplicialObject C} (f : X ā¶ Y) (n : ā) : (AlgebraicTopology.AlternatingFaceMapComplex.map f).f n = f.app (Opposite.op (SimplexCategory.mk n)) - AlgebraicTopology.DoldKan.Nā_map_f š Mathlib.AlgebraicTopology.DoldKan.FunctorN
{C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] {Xā Yā : CategoryTheory.SimplicialObject C} (f : Xā ā¶ Yā) : (AlgebraicTopology.DoldKan.Nā.map f).f = CategoryTheory.CategoryStruct.comp AlgebraicTopology.DoldKan.PInfty (AlgebraicTopology.AlternatingFaceMapComplex.map f) - AlgebraicTopology.DoldKan.PInftyToNormalizedMooreComplex_naturality š Mathlib.AlgebraicTopology.DoldKan.Normalized
{A : Type u_1} [CategoryTheory.Category.{u_2, u_1} A] [CategoryTheory.Abelian A] {X Y : CategoryTheory.SimplicialObject A} (f : X ā¶ Y) : CategoryTheory.CategoryStruct.comp (AlgebraicTopology.AlternatingFaceMapComplex.map f) (AlgebraicTopology.DoldKan.PInftyToNormalizedMooreComplex Y) = CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.PInftyToNormalizedMooreComplex X) (AlgebraicTopology.NormalizedMooreComplex.map f) - AlgebraicTopology.DoldKan.PInftyToNormalizedMooreComplex_naturality_assoc š Mathlib.AlgebraicTopology.DoldKan.Normalized
{A : Type u_1} [CategoryTheory.Category.{u_2, u_1} A] [CategoryTheory.Abelian A] {X Y : CategoryTheory.SimplicialObject A} (f : X ā¶ Y) {Z : ChainComplex A ā} (h : AlgebraicTopology.NormalizedMooreComplex.obj Y ā¶ Z) : CategoryTheory.CategoryStruct.comp (AlgebraicTopology.AlternatingFaceMapComplex.map f) (CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.PInftyToNormalizedMooreComplex Y) h) = CategoryTheory.CategoryStruct.comp (AlgebraicTopology.DoldKan.PInftyToNormalizedMooreComplex X) (CategoryTheory.CategoryStruct.comp (AlgebraicTopology.NormalizedMooreComplex.map f) h)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using (by default) Ctrl-K Ctrl-S. 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 ?a
If 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 ?b
By 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_tsum
even though the hypothesisf i < g i
is not the last.
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.
This is Loogle revision 19971e9
serving mathlib revision bce1d65