Loogle!
Result
Found 84 declarations mentioning ContinuousMap.Homotopy.
- ContinuousMap.Homotopy.instInhabitedId 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} [TopologicalSpace X] : Inhabited ((ContinuousMap.id X).Homotopy (ContinuousMap.id X)) - ContinuousMap.Homotopy 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] (f₀ f₁ : C(X, Y)) : Type (max u v) - ContinuousMap.Homotopy.refl 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] (f : C(X, Y)) : f.Homotopy f - ContinuousMap.Homotopy.Simps.apply 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) : ↑unitInterval × X → Y - ContinuousMap.Homotopy.instFunLike 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} : FunLike (f₀.Homotopy f₁) (↑unitInterval × X) Y - ContinuousMap.Homotopy.symm 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) : f₁.Homotopy f₀ - ContinuousMap.Homotopy.instHomotopyLike 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} : ContinuousMap.HomotopyLike (f₀.Homotopy f₁) f₀ f₁ - ContinuousMap.HomotopyWith.toHomotopy 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} {P : C(X, Y) → Prop} (self : f₀.HomotopyWith f₁ P) : f₀.Homotopy f₁ - ContinuousMap.Homotopy.symm_bijective 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} : Function.Bijective ContinuousMap.Homotopy.symm - ContinuousMap.Homotopy.extend 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) : C(ℝ, C(X, Y)) - ContinuousMap.Homotopy.trans 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ f₂ : C(X, Y)} (F : f₀.Homotopy f₁) (G : f₁.Homotopy f₂) : f₀.Homotopy f₂ - ContinuousMap.Homotopy.symm_symm 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) : F.symm.symm = F - ContinuousMap.Homotopy.curry 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) : C(↑unitInterval, C(X, Y)) - ContinuousMap.Homotopy.toContinuousMap 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (self : f₀.Homotopy f₁) : C(↑unitInterval × X, Y) - ContinuousMap.Homotopy.compContinuousMap 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} {Z : Type w} [TopologicalSpace X] [TopologicalSpace Y] [TopologicalSpace Z] {g₀ g₁ : C(Y, Z)} (G : g₀.Homotopy g₁) (f : C(X, Y)) : (g₀.comp f).Homotopy (g₁.comp f) - ContinuousMap.Homotopy.cast 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ g₀ g₁ : C(X, Y)} (F : f₀.Homotopy f₁) (h₀ : f₀ = g₀) (h₁ : f₁ = g₁) : g₀.Homotopy g₁ - ContinuousMap.Homotopy.pi 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {ι : Type u_2} [TopologicalSpace X] {Y : ι → Type u_3} [(i : ι) → TopologicalSpace (Y i)] {f₀ f₁ : (i : ι) → C(X, Y i)} (F : (i : ι) → (f₀ i).Homotopy (f₁ i)) : (ContinuousMap.pi f₀).Homotopy (ContinuousMap.pi f₁) - ContinuousMap.Homotopy.comp 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} {Z : Type w} [TopologicalSpace X] [TopologicalSpace Y] [TopologicalSpace Z] {f₀ f₁ : C(X, Y)} {g₀ g₁ : C(Y, Z)} (G : g₀.Homotopy g₁) (F : f₀.Homotopy f₁) : (g₀.comp f₀).Homotopy (g₁.comp f₁) - ContinuousMap.Homotopy.prodMk 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} {Z : Type w} [TopologicalSpace X] [TopologicalSpace Y] [TopologicalSpace Z] {f₀ f₁ : C(X, Y)} {g₀ g₁ : C(X, Z)} (F : f₀.Homotopy f₁) (G : g₀.Homotopy g₁) : (f₀.prodMk g₀).Homotopy (f₁.prodMk g₁) - ContinuousMap.Homotopy.refl_apply 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] (f : C(X, Y)) (x : ↑unitInterval × X) : (ContinuousMap.Homotopy.refl f) x = f x.2 - ContinuousMap.Homotopy.piMap 📋 Mathlib.Topology.Homotopy.Basic
{ι : Type u_2} {X : ι → Type u_3} {Y : ι → Type u_4} [(i : ι) → TopologicalSpace (X i)] [(i : ι) → TopologicalSpace (Y i)] {f₀ f₁ : (i : ι) → C(X i, Y i)} (F : (i : ι) → (f₀ i).Homotopy (f₁ i)) : (ContinuousMap.piMap f₀).Homotopy (ContinuousMap.piMap f₁) - ContinuousMap.Homotopy.continuous 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) : Continuous ⇑F - ContinuousMap.Homotopy.symm_trans 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ f₂ : C(X, Y)} (F : f₀.Homotopy f₁) (G : f₁.Homotopy f₂) : (F.trans G).symm = G.symm.trans F.symm - ContinuousMap.Homotopy.prodMap 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} {Z : Type w} {Z' : Type x} [TopologicalSpace X] [TopologicalSpace Y] [TopologicalSpace Z] [TopologicalSpace Z'] {f₀ f₁ : C(X, Y)} {g₀ g₁ : C(Z, Z')} (F : f₀.Homotopy f₁) (G : g₀.Homotopy g₁) : (f₀.prodMap g₀).Homotopy (f₁.prodMap g₁) - ContinuousMap.Homotopy.extend_one 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) : F.extend 1 = f₁ - ContinuousMap.Homotopy.extend_zero 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) : F.extend 0 = f₀ - ContinuousMap.Homotopy.apply_one 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) (x : X) : F (1, x) = f₁ x - ContinuousMap.Homotopy.apply_zero 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) (x : X) : F (0, x) = f₀ x - ContinuousMap.Homotopy.congr_arg 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) {x y : ↑unitInterval × X} (h : x = y) : F x = F y - ContinuousMap.Homotopy.map_one_left 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (self : f₀.Homotopy f₁) (x : X) : self.toFun (1, x) = f₁ x - ContinuousMap.Homotopy.map_zero_left 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (self : f₀.Homotopy f₁) (x : X) : self.toFun (0, x) = f₀ x - ContinuousMap.HomotopyWith.coe_toHomotopy 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} {P : C(X, Y) → Prop} (F : f₀.HomotopyWith f₁ P) : ⇑F.toHomotopy = ⇑F - ContinuousMap.Homotopy.congr_fun 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} {F G : f₀.Homotopy f₁} (h : F = G) (x : ↑unitInterval × X) : F x = G x - ContinuousMap.Homotopy.ext 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} {F G : f₀.Homotopy f₁} (h : ∀ (x : ↑unitInterval × X), F x = G x) : F = G - ContinuousMap.Homotopy.ext_iff 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} {F G : f₀.Homotopy f₁} : F = G ↔ ∀ (x : ↑unitInterval × X), F x = G x - ContinuousMap.Homotopy.symm_apply 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) (x : ↑unitInterval × X) : F.symm x = F (unitInterval.symm x.1, x.2) - ContinuousMap.Homotopy.extend_apply_of_le_zero 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) {t : ℝ} (ht : t ≤ 0) (x : X) : (F.extend t) x = f₀ x - ContinuousMap.Homotopy.extend_apply_of_one_le 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) {t : ℝ} (ht : 1 ≤ t) (x : X) : (F.extend t) x = f₁ x - ContinuousMap.Homotopy.cast_apply 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ g₀ g₁ : C(X, Y)} (F : f₀.Homotopy f₁) (h₀ : f₀ = g₀) (h₁ : f₁ = g₁) (a : ↑unitInterval × X) : (F.cast h₀ h₁) a = F a - ContinuousMap.Homotopy.curry_one 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) : F.curry 1 = f₁ - ContinuousMap.Homotopy.curry_zero 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) : F.curry 0 = f₀ - ContinuousMap.Homotopy.coe_toContinuousMap 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) : ⇑F.toContinuousMap = ⇑F - ContinuousMap.Homotopy.extend_apply_coe 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) (t : ↑unitInterval) (x : X) : (F.extend ↑t) x = F (t, x) - ContinuousMap.Homotopy.extend_apply_of_mem_I 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) {t : ℝ} (ht : t ∈ unitInterval) (x : X) : (F.extend t) x = F (⟨t, ht⟩, x) - ContinuousMap.Homotopy.curry_apply 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) (t : ↑unitInterval) (x : X) : (F.curry t) x = F (t, x) - ContinuousMap.Homotopy.compContinuousMap_apply 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} {Z : Type w} [TopologicalSpace X] [TopologicalSpace Y] [TopologicalSpace Z] {g₀ g₁ : C(Y, Z)} (G : g₀.Homotopy g₁) (f : C(X, Y)) (x : ↑unitInterval × X) : (G.compContinuousMap f) x = G (x.1, f x.2) - ContinuousMap.Homotopy.extend_of_mem_I 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (F : f₀.Homotopy f₁) {t : ℝ} (ht : t ∈ unitInterval) : F.extend t = F.curry ⟨t, ht⟩ - ContinuousMap.Homotopy.comp_apply 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} {Z : Type w} [TopologicalSpace X] [TopologicalSpace Y] [TopologicalSpace Z] {f₀ f₁ : C(X, Y)} {g₀ g₁ : C(Y, Z)} (G : g₀.Homotopy g₁) (F : f₀.Homotopy f₁) (x : ↑unitInterval × X) : (G.comp F) x = G (x.1, F x) - ContinuousMap.Homotopy.mk 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} (toContinuousMap : C(↑unitInterval × X, Y)) (map_zero_left : ∀ (x : X), toContinuousMap.toFun (0, x) = f₀ x) (map_one_left : ∀ (x : X), toContinuousMap.toFun (1, x) = f₁ x) : f₀.Homotopy f₁ - ContinuousMap.HomotopyWith.mk 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ : C(X, Y)} {P : C(X, Y) → Prop} (toHomotopy : f₀.Homotopy f₁) (prop' : ∀ (t : ↑unitInterval), P { toFun := fun x => toHomotopy.toFun (t, x), continuous_toFun := ⋯ }) : f₀.HomotopyWith f₁ P - ContinuousMap.Homotopy.trans_apply 📋 Mathlib.Topology.Homotopy.Basic
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f₀ f₁ f₂ : C(X, Y)} (F : f₀.Homotopy f₁) (G : f₁.Homotopy f₂) (x : ↑unitInterval × X) : (F.trans G) x = if h : ↑x.1 ≤ 1 / 2 then F (⟨2 * ↑x.1, ⋯⟩, x.2) else G (⟨2 * ↑x.1 - 1, ⋯⟩, x.2) - TopCat.Homotopy.refl 📋 Mathlib.Topology.Homotopy.TopCat.Basic
{X Y : TopCat} (f : X ⟶ Y) : (TopCat.Hom.hom f).Homotopy (TopCat.Hom.hom f) - TopCat.Homotopy.symm 📋 Mathlib.Topology.Homotopy.TopCat.Basic
{X Y : TopCat} {f₀ f₁ : X ⟶ Y} (F : TopCat.Homotopy f₀ f₁) : (TopCat.Hom.hom f₁).Homotopy (TopCat.Hom.hom f₀) - TopCat.Homotopy.trans 📋 Mathlib.Topology.Homotopy.TopCat.Basic
{X Y : TopCat} {f₀ f₁ f₂ : X ⟶ Y} (F : TopCat.Homotopy f₀ f₁) (G : TopCat.Homotopy f₁ f₂) : (TopCat.Hom.hom f₀).Homotopy (TopCat.Hom.hom f₂) - TopCat.Homotopy.comp_apply 📋 Mathlib.Topology.Homotopy.TopCat.Basic
{X Y Z : TopCat} {f₀ f₁ : X ⟶ Y} {g₀ g₁ : Y ⟶ Z} (G : TopCat.Homotopy g₀ g₁) (F : TopCat.Homotopy f₀ f₁) (x : ↑unitInterval × ↑X) : (G.comp F) x = G (x.1, F x) - TopPair.Homotopy.refl_fst 📋 Mathlib.Topology.Category.TopPair
{X Y : TopPair} (f : X ⟶ Y) : (TopPair.Homotopy.refl f).fst = TopCat.Homotopy.refl (TopPair.Hom.fst f) - TopPair.Homotopy.refl_snd 📋 Mathlib.Topology.Category.TopPair
{X Y : TopPair} (f : X ⟶ Y) : (TopPair.Homotopy.refl f).snd = TopCat.Homotopy.refl (TopPair.Hom.snd f) - TopPair.Homotopy.symm_fst 📋 Mathlib.Topology.Category.TopPair
{X Y : TopPair} {f₀ f₁ : X ⟶ Y} (F : TopPair.Homotopy f₀ f₁) : F.symm.fst = F.fst.symm - TopPair.Homotopy.symm_snd 📋 Mathlib.Topology.Category.TopPair
{X Y : TopPair} {f₀ f₁ : X ⟶ Y} (F : TopPair.Homotopy f₀ f₁) : F.symm.snd = F.snd.symm - TopPair.Homotopy.trans_fst 📋 Mathlib.Topology.Category.TopPair
{X Y : TopPair} {f₀ f₁ f₂ : X ⟶ Y} (F : TopPair.Homotopy f₀ f₁) (G : TopPair.Homotopy f₁ f₂) : (F.trans G).fst = F.fst.trans G.fst - TopPair.Homotopy.trans_snd 📋 Mathlib.Topology.Category.TopPair
{X Y : TopPair} {f₀ f₁ f₂ : X ⟶ Y} (F : TopPair.Homotopy f₀ f₁) (G : TopPair.Homotopy f₁ f₂) : (F.trans G).snd = F.snd.trans G.snd - Path.toHomotopyConst 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {x₀ x₁ : X} (p : Path x₀ x₁) : (ContinuousMap.const Y x₀).Homotopy (ContinuousMap.const Y x₁) - ContinuousMap.Homotopy.evalAt 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f g : C(X, Y)} (H : f.Homotopy g) (x : X) : Path (f x) (g x) - Path.toHomotopyConst_apply 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {x₀ x₁ : X} (p : Path x₀ x₁) (a✝ : ↑unitInterval × Y) : p.toHomotopyConst a✝ = p a✝.1 - ContinuousMap.Homotopy.evalAt_apply 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f g : C(X, Y)} (H : f.Homotopy g) (x : X) (t : ↑unitInterval) : (H.evalAt x) t = H (t, x) - ContinuousMap.Homotopy.pathExtend_evalAt 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {f g : C(X, Y)} (H : f.Homotopy g) (x : X) : ⇑(H.evalAt x).extend = fun t => (H.extend t) x - ContinuousMap.Homotopy.prod 📋 Mathlib.Topology.Homotopy.Product
{α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {A : Type u_3} [TopologicalSpace A] {f₀ f₁ : C(A, α)} {g₀ g₁ : C(A, β)} (F : f₀.Homotopy f₁) (G : g₀.Homotopy g₁) : (f₀.prodMk g₀).Homotopy (f₁.prodMk g₁) - ContinuousMap.Homotopy.prod_apply 📋 Mathlib.Topology.Homotopy.Product
{α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {A : Type u_3} [TopologicalSpace A] {f₀ f₁ : C(A, α)} {g₀ g₁ : C(A, β)} (F : f₀.Homotopy f₁) (G : g₀.Homotopy g₁) (t : ↑unitInterval × A) : (F.prod G) t = (F t, G t) - FundamentalGroupoidFunctor.instIsIsoFunctorFundamentalGroupoidHomotopicMapsNatIso 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps
{X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] {f g : C(X, Y)} (H : f.Homotopy g) : CategoryTheory.IsIso (FundamentalGroupoidFunctor.homotopicMapsNatIso H) - ContinuousMap.Homotopy.uliftMap 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps
{X Y : TopCat} {f g : C(↑X, ↑Y)} (H : f.Homotopy g) : C(↑(TopCat.of (ULift.{u, 0} ↑unitInterval × ↑X)), ↑Y) - FundamentalGroupoidFunctor.homotopicMapsNatIso 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps
{X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] {f g : C(X, Y)} (H : f.Homotopy g) : FundamentalGroupoid.map f ⟶ FundamentalGroupoid.map g - ContinuousMap.Homotopy.diagonalPath' 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps
{X Y : TopCat} {f g : C(↑X, ↑Y)} (H : f.Homotopy g) {x₀ x₁ : ↑X} (p : FundamentalGroupoid.fromTop x₀ ⟶ FundamentalGroupoid.fromTop x₁) : FundamentalGroupoid.fromTop (f x₀) ⟶ FundamentalGroupoid.fromTop (g x₁) - ContinuousMap.Homotopy.diagonalPath 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps
{X Y : TopCat} {f g : C(↑X, ↑Y)} (H : f.Homotopy g) {x₀ x₁ : ↑X} (p : FundamentalGroupoid.fromTop x₀ ⟶ FundamentalGroupoid.fromTop x₁) : FundamentalGroupoid.fromTop (H (0, x₀)) ⟶ FundamentalGroupoid.fromTop (H (1, x₁)) - Path.Homotopic.map_trans_evalAt 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps
{X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] {f g : C(X, Y)} (F : f.Homotopy g) {x₁ x₂ : X} (p : Path x₁ x₂) : ((p.map ⋯).trans (F.evalAt x₂)).Homotopic ((F.evalAt x₁).trans (p.map ⋯)) - ContinuousMap.Homotopy.ulift_apply 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps
{X Y : TopCat} {f g : C(↑X, ↑Y)} (H : f.Homotopy g) (i : ULift.{u, 0} ↑unitInterval) (x : ↑X) : H.uliftMap (i, x) = H (i.down, x) - ContinuousMap.Homotopy.eq_diag_path 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps
{X Y : TopCat} {f g : C(↑X, ↑Y)} (H : f.Homotopy g) {x₀ x₁ : ↑X} (p : FundamentalGroupoid.fromTop x₀ ⟶ FundamentalGroupoid.fromTop x₁) : CategoryTheory.CategoryStruct.comp ((FundamentalGroupoid.fundamentalGroupoidFunctor.map (TopCat.ofHom f)).map p) ⟦H.evalAt x₁⟧ = H.diagonalPath' p ∧ CategoryTheory.CategoryStruct.comp ⟦H.evalAt x₀⟧ ((FundamentalGroupoid.fundamentalGroupoidFunctor.map (TopCat.ofHom g)).map p) = H.diagonalPath' p - ContinuousMap.Homotopy.evalAt_eq 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps
{X Y : TopCat} {f g : C(↑X, ↑Y)} (H : f.Homotopy g) (x : ↑X) : ⟦H.evalAt x⟧ = CategoryTheory.CategoryStruct.comp (ContinuousMap.Homotopy.hcast ⋯) (CategoryTheory.CategoryStruct.comp ((FundamentalGroupoid.fundamentalGroupoidFunctor.map (TopCat.ofHom H.uliftMap)).map (ContinuousMap.Homotopy.prodToProdTopI unitInterval.uhpath01 (CategoryTheory.CategoryStruct.id (FundamentalGroupoid.fromTop x)))) (ContinuousMap.Homotopy.hcast ⋯)) - ContinuousMap.Homotopy.apply_one_path 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps
{X Y : TopCat} {f g : C(↑X, ↑Y)} (H : f.Homotopy g) {x₀ x₁ : ↑X} (p : FundamentalGroupoid.fromTop x₀ ⟶ FundamentalGroupoid.fromTop x₁) : (FundamentalGroupoid.fundamentalGroupoidFunctor.map (TopCat.ofHom g)).map p = CategoryTheory.CategoryStruct.comp (ContinuousMap.Homotopy.hcast ⋯) (CategoryTheory.CategoryStruct.comp ((FundamentalGroupoid.fundamentalGroupoidFunctor.map (TopCat.ofHom H.uliftMap)).map (ContinuousMap.Homotopy.prodToProdTopI (CategoryTheory.CategoryStruct.id (FundamentalGroupoid.fromTop { down := 1 })) p)) (ContinuousMap.Homotopy.hcast ⋯)) - ContinuousMap.Homotopy.apply_zero_path 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.InducedMaps
{X Y : TopCat} {f g : C(↑X, ↑Y)} (H : f.Homotopy g) {x₀ x₁ : ↑X} (p : FundamentalGroupoid.fromTop x₀ ⟶ FundamentalGroupoid.fromTop x₁) : (FundamentalGroupoid.fundamentalGroupoidFunctor.map (TopCat.ofHom f)).map p = CategoryTheory.CategoryStruct.comp (ContinuousMap.Homotopy.hcast ⋯) (CategoryTheory.CategoryStruct.comp ((FundamentalGroupoid.fundamentalGroupoidFunctor.map (TopCat.ofHom H.uliftMap)).map (ContinuousMap.Homotopy.prodToProdTopI (CategoryTheory.CategoryStruct.id (FundamentalGroupoid.fromTop { down := 0 })) p)) (ContinuousMap.Homotopy.hcast ⋯)) - ContinuousMap.Homotopy.affine 📋 Mathlib.Topology.Homotopy.Affine
{X : Type u_1} {E : Type u_2} [TopologicalSpace X] [AddCommGroup E] [TopologicalSpace E] [IsTopologicalAddGroup E] [Module ℝ E] [ContinuousSMul ℝ E] (f g : C(X, E)) : f.Homotopy g - ContinuousMap.Homotopy.affine_apply 📋 Mathlib.Topology.Homotopy.Affine
{X : Type u_1} {E : Type u_2} [TopologicalSpace X] [AddCommGroup E] [TopologicalSpace E] [IsTopologicalAddGroup E] [Module ℝ E] [ContinuousSMul ℝ E] (f g : C(X, E)) (x : ↑unitInterval × X) : (ContinuousMap.Homotopy.affine f g) x = (AffineMap.lineMap (f x.2) (g x.2)) ↑x.1 - ContinuousMap.Homotopy.curveIntegral_add_curveIntegral_eq_of_hasFDerivWithinAt 📋 Mathlib.MeasureTheory.Integral.CurveIntegral.Poincare
{𝕜 : Type u_1} {E : Type u_2} {F : Type u_3} [RCLike 𝕜] [NormedAddCommGroup E] [NormedSpace 𝕜 E] [NormedAddCommGroup F] [NormedSpace 𝕜 F] [NormedSpace ℝ E] [NormedSpace ℝ F] {a b c d : E} {γ₁ : Path a b} {γ₂ : Path c d} {t : Set E} {ω : E → E →L[𝕜] F} {dω : E → E →L[ℝ] E →L[𝕜] F} (φ : (↑γ₁).Homotopy ↑γ₂) (hφt : ∀ a_1 ∈ Set.Ioo 0 1, ∀ b_1 ∈ Set.Ioo 0 1, φ (a_1, b_1) ∈ t) (hω : ∀ x ∈ t, HasFDerivWithinAt ω (dω x) t x) (hωc : ContinuousOn ω (closure t)) (hdω_symm : ∀ x ∈ t, ∀ u ∈ tangentConeAt ℝ t x, ∀ v ∈ tangentConeAt ℝ t x, ((dω x) u) v = ((dω x) v) u) (hcontdiff : ContDiffOn ℝ 2 (fun xy => Set.IccExtend ⋯ (⇑(φ.extend xy.1)) xy.2) (Set.Icc 0 1)) : ∫ᶜ (x : E) in γ₁, ω x + ∫ᶜ (x : E) in φ.evalAt 1, ω x = ∫ᶜ (x : E) in γ₂, ω x + ∫ᶜ (x : E) in φ.evalAt 0, ω x - ContinuousMap.Homotopy.curveIntegral_add_curveIntegral_eq_of_diffContOnCl 📋 Mathlib.MeasureTheory.Integral.CurveIntegral.Poincare
{𝕜 : Type u_1} {E : Type u_2} {F : Type u_3} [RCLike 𝕜] [NormedAddCommGroup E] [NormedSpace 𝕜 E] [NormedAddCommGroup F] [NormedSpace 𝕜 F] [NormedSpace ℝ E] [NormedSpace ℝ F] {a b c d : E} {γ₁ : Path a b} {γ₂ : Path c d} {t : Set E} {ω : E → E →L[𝕜] F} (φ : (↑γ₁).Homotopy ↑γ₂) (hφt : ∀ a_1 ∈ Set.Ioo 0 1, ∀ b_1 ∈ Set.Ioo 0 1, φ (a_1, b_1) ∈ t) (hω : DiffContOnCl ℝ ω t) (hdω_symm : ∀ x ∈ t, ∀ u ∈ tangentConeAt ℝ t x, ∀ v ∈ tangentConeAt ℝ t x, ((fderivWithin ℝ ω t x) u) v = ((fderivWithin ℝ ω t x) v) u) (hcontdiff : ContDiffOn ℝ 2 (fun xy => Set.IccExtend ⋯ (⇑(φ.extend xy.1)) xy.2) (Set.Icc 0 1)) : ∫ᶜ (x : E) in γ₁, ω x + ∫ᶜ (x : E) in φ.evalAt 1, ω x = ∫ᶜ (x : E) in γ₂, ω x + ∫ᶜ (x : E) in φ.evalAt 0, ω x - ContinuousMap.Homotopy.curveIntegral_add_curveIntegral_eq_of_hasFDerivWithinAt_off_countable 📋 Mathlib.MeasureTheory.Integral.CurveIntegral.Poincare
{𝕜 : Type u_1} {E : Type u_2} {F : Type u_3} [RCLike 𝕜] [NormedAddCommGroup E] [NormedSpace 𝕜 E] [NormedAddCommGroup F] [NormedSpace 𝕜 F] [NormedSpace ℝ E] [NormedSpace ℝ F] {a b c d : E} {γ₁ : Path a b} {γ₂ : Path c d} {s : Set (↑unitInterval × ↑unitInterval)} {t : Set E} {ω : E → E →L[𝕜] F} {dω : E → E →L[ℝ] E →L[𝕜] F} (φ : (↑γ₁).Homotopy ↑γ₂) (hs : s.Countable) (hφt : ∀ a_1 ∈ Set.Ioo 0 1, ∀ b_1 ∈ Set.Ioo 0 1, φ (a_1, b_1) ∈ t) (hω : ∀ a_1 ∈ Set.Ioo 0 1, ∀ b_1 ∈ Set.Ioo 0 1, (a_1, b_1) ∉ s → HasFDerivWithinAt ω (dω (φ (a_1, b_1))) t (φ (a_1, b_1))) (hωc : ContinuousOn ω (closure t)) (hdω_symm : ∀ a_1 ∈ Set.Ioo 0 1, ∀ b_1 ∈ Set.Ioo 0 1, (a_1, b_1) ∉ s → ∀ u ∈ tangentConeAt ℝ t (φ (a_1, b_1)), ∀ v ∈ tangentConeAt ℝ t (φ (a_1, b_1)), ((dω (φ (a_1, b_1))) u) v = ((dω (φ (a_1, b_1))) v) u) (hcontdiff : ContDiffOn ℝ 2 (fun xy => Set.IccExtend ⋯ (⇑(φ.extend xy.1)) xy.2) (Set.Icc 0 1)) : ∫ᶜ (x : E) in γ₁, ω x + ∫ᶜ (x : E) in φ.evalAt 1, ω x = ∫ᶜ (x : E) in γ₂, ω x + ∫ᶜ (x : E) in φ.evalAt 0, ω x
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 ce5dd8c