Loogle!
Result
Found 15 declarations mentioning CategoryTheory.CommSq.map.
- CategoryTheory.CommSq.map 📋 Mathlib.CategoryTheory.CommSq
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] (F : CategoryTheory.Functor C D) {W X Y Z : C} {f : W ⟶ X} {g : W ⟶ Y} {h : X ⟶ Z} {i : Y ⟶ Z} (s : CategoryTheory.CommSq f g h i) : CategoryTheory.CommSq (F.map f) (F.map g) (F.map h) (F.map i) - CochainComplex.Lifting.cochain₀ 📋 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) : CochainComplex.HomComplex.Cochain B X 0 - CochainComplex.Lifting.cocycle₁' 📋 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) : CochainComplex.HomComplex.Cocycle B X 1 - CochainComplex.Lifting.coe_cocycle₁'_v_comp_eq_zero 📋 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) (n m : ℤ) (hnm : n + 1 = m := by lia) : CategoryTheory.CategoryStruct.comp ((↑(CochainComplex.Lifting.cocycle₁' sq hsq)).v n m hnm) (p.f m) = 0 - CochainComplex.Lifting.comp_coe_cocyle₁'_v_eq_zero 📋 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) (n m : ℤ) (hnm : n + 1 = m := by lia) : CategoryTheory.CategoryStruct.comp (i.f n) ((↑(CochainComplex.Lifting.cocycle₁' sq hsq)).v n m hnm) = 0 - CochainComplex.Lifting.coe_cocycle₁'_v_comp_eq_zero_assoc 📋 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) (n m : ℤ) (hnm : n + 1 = m := by lia) {Z : C} (h : Y.X m ⟶ Z) : CategoryTheory.CategoryStruct.comp ((↑(CochainComplex.Lifting.cocycle₁' sq hsq)).v n m hnm) (CategoryTheory.CategoryStruct.comp (p.f m) h) = CategoryTheory.CategoryStruct.comp 0 h - CochainComplex.Lifting.comp_coe_cocyle₁'_v_eq_zero_assoc 📋 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) (n m : ℤ) (hnm : n + 1 = m := by lia) {Z : C} (h : X.X m ⟶ Z) : CategoryTheory.CategoryStruct.comp (i.f n) (CategoryTheory.CategoryStruct.comp ((↑(CochainComplex.Lifting.cocycle₁' sq hsq)).v n m hnm) h) = CategoryTheory.CategoryStruct.comp 0 h - CochainComplex.Lifting.cochain₁ 📋 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 Q K 1 - CochainComplex.Lifting.cocycle₁ 📋 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.Cocycle Q K 1 - CochainComplex.Lifting.hasLift 📋 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 Q K 0) (hα : CochainComplex.HomComplex.δ 0 1 α = ↑(CochainComplex.Lifting.cocycle₁ sq hsq hQ hK)) : sq.HasLift - 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.Lifting.π_f_cochain₁_v_ι_f 📋 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ι)) (n m : ℤ) (hnm : n + 1 = m) : CategoryTheory.CategoryStruct.comp (π.f n) (CategoryTheory.CategoryStruct.comp ((CochainComplex.Lifting.cochain₁ sq hsq hQ hK).v n m hnm) (ι.f m)) = (↑(CochainComplex.Lifting.cocycle₁' sq hsq)).v n m hnm - CochainComplex.Lifting.π_f_cochain₁_v_ι_f_assoc 📋 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ι)) (n m : ℤ) (hnm : n + 1 = m) {Z : C} (h : X.X m ⟶ Z) : CategoryTheory.CategoryStruct.comp (π.f n) (CategoryTheory.CategoryStruct.comp ((CochainComplex.Lifting.cochain₁ sq hsq hQ hK).v n m hnm) (CategoryTheory.CategoryStruct.comp (ι.f m) h)) = CategoryTheory.CategoryStruct.comp ((↑(CochainComplex.Lifting.cocycle₁' sq hsq)).v n m hnm) h - CochainComplex.Lifting.exists_hom 📋 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ι)) (n m : ℤ) (hnm : n + 1 = m := by lia) : ∃ φ, CategoryTheory.CategoryStruct.comp (π.f n) (CategoryTheory.CategoryStruct.comp φ (ι.f m)) = (↑(CochainComplex.Lifting.cocycle₁' sq hsq)).v n m hnm - CategoryTheory.CommSq.HasLift.over 📋 Mathlib.CategoryTheory.LiftingProperties.Over
{C : Type u} [CategoryTheory.Category.{v, u} C] {S : C} {X₁ X₂ X₃ X₄ : CategoryTheory.Over S} {t : X₁ ⟶ X₂} {l : X₁ ⟶ X₃} {r : X₂ ⟶ X₄} {b : X₃ ⟶ X₄} {sq : CategoryTheory.CommSq t l r b} [⋯.HasLift] : sq.HasLift
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 ?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 88c39f3 serving mathlib revision 9977002