Loogle!
Result
Found 69 declarations mentioning Path.Homotopic.Quotient.
- Path.Homotopic.Quotient 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] (x₀ x₁ : X) : Type u - Path.Homotopic.instInhabitedQuotientUnitUnit 📋 Mathlib.Topology.Homotopy.Path
: Inhabited (Path.Homotopic.Quotient () ()) - Path.Homotopic.Quotient.refl 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] (x : X) : Path.Homotopic.Quotient x x - Path.Homotopic.Quotient.mk 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] {x₀ x₁ : X} (p : Path x₀ x₁) : Path.Homotopic.Quotient x₀ x₁ - Path.Homotopic.Quotient.symm 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] {x₀ x₁ : X} (P : Path.Homotopic.Quotient x₀ x₁) : Path.Homotopic.Quotient x₁ x₀ - Path.Homotopic.Quotient.mk_surjective 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] {x₀ x₁ : X} : Function.Surjective Path.Homotopic.Quotient.mk - Path.Homotopic.Quotient.trans 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] {x₀ x₁ x₂ : X} (P₀ : Path.Homotopic.Quotient x₀ x₁) (P₁ : Path.Homotopic.Quotient x₁ x₂) : Path.Homotopic.Quotient x₀ x₂ - Path.Homotopic.Quotient.mk_refl 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] (x : X) : Path.Homotopic.Quotient.mk (Path.refl x) = Path.Homotopic.Quotient.refl x - Path.Homotopic.Quotient.cast 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] {x y : X} (γ : Path.Homotopic.Quotient x y) {x' y' : X} (hx : x' = x) (hy : y' = y) : Path.Homotopic.Quotient x' y' - Path.Homotopic.Quotient.ind 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] {x y : X} {motive : Path.Homotopic.Quotient x y → Prop} (mk : ∀ (a : Path x y), motive (Path.Homotopic.Quotient.mk a)) (q : Path.Homotopic.Quotient x y) : motive q - Path.Homotopic.Quotient.cast_rfl_rfl 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] {x y : X} (γ : Path.Homotopic.Quotient x y) : γ.cast ⋯ ⋯ = γ - Path.Homotopic.Quotient.mk_symm 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] {x₀ x₁ : X} (P : Path x₀ x₁) : Path.Homotopic.Quotient.mk P.symm = (Path.Homotopic.Quotient.mk P).symm - Path.Homotopic.Quotient.exact 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] {x₀ x₁ : X} {p q : Path x₀ x₁} (h : Path.Homotopic.Quotient.mk p = Path.Homotopic.Quotient.mk q) : p.Homotopic q - Path.Homotopic.Quotient.eq 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] {x₀ x₁ : X} {p q : Path x₀ x₁} : Path.Homotopic.Quotient.mk p = Path.Homotopic.Quotient.mk q ↔ p.Homotopic q - Path.Homotopic.Quotient.cast_heq 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] {x y x' y' : X} (hx : x' = x) (hy : y' = y) {γ : Path.Homotopic.Quotient x y} : γ.cast hx hy ≍ γ - Path.Homotopic.Quotient.map 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {x₀ x₁ : X} (P₀ : Path.Homotopic.Quotient x₀ x₁) (f : C(X, Y)) : Path.Homotopic.Quotient (f x₀) (f x₁) - Path.Homotopic.Quotient.mk_trans 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] {x₀ x₁ x₂ : X} (P₀ : Path x₀ x₁) (P₁ : Path x₁ x₂) : Path.Homotopic.Quotient.mk (P₀.trans P₁) = (Path.Homotopic.Quotient.mk P₀).trans (Path.Homotopic.Quotient.mk P₁) - Path.Homotopic.Quotient.mk_cast 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] {x y : X} (P : Path x y) {x' y' : X} (hx : x' = x) (hy : y' = y) : Path.Homotopic.Quotient.mk (P.cast hx hy) = (Path.Homotopic.Quotient.mk P).cast hx hy - Path.Homotopic.Quotient.ind₂ 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] {Y : Type u_1} [TopologicalSpace Y] {x₀ y₀ : X} {x₁ y₁ : Y} {motive : Path.Homotopic.Quotient x₀ y₀ → Path.Homotopic.Quotient x₁ y₁ → Prop} (mk : ∀ (a : Path x₀ y₀) (b : Path x₁ y₁), motive (Path.Homotopic.Quotient.mk a) (Path.Homotopic.Quotient.mk b)) (q₀ : Path.Homotopic.Quotient x₀ y₀) (q₁ : Path.Homotopic.Quotient x₁ y₁) : motive q₀ q₁ - Path.Homotopic.Quotient.cast_cast 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] {x y : X} (γ : Path.Homotopic.Quotient x y) {x' y' : X} (hx : x' = x) (hy : y' = y) {x'' y'' : X} (hx' : x'' = x') (hy' : y'' = y') : (γ.cast hx hy).cast hx' hy' = γ.cast ⋯ ⋯ - Path.Homotopic.hpath_hext 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} [TopologicalSpace X] {x₀ x₁ x₂ x₃ : X} {p₁ : Path x₀ x₁} {p₂ : Path x₂ x₃} (hp : ∀ (t : ↑unitInterval), p₁ t = p₂ t) : ⟦p₁⟧ ≍ ⟦p₂⟧ - Path.Homotopic.Quotient.mk_map 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {x₀ x₁ : X} (P₀ : Path x₀ x₁) (f : C(X, Y)) : Path.Homotopic.Quotient.mk (P₀.map ⋯) = (Path.Homotopic.Quotient.mk P₀).map f - Path.Homotopic.Quotient.map_comp 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {x₀ x₁ : X} {Z : Type u_1} [TopologicalSpace Z] {p : Path.Homotopic.Quotient x₀ x₁} {f : C(X, Y)} {g : C(Y, Z)} : p.map (g.comp f) = (p.map f).map g - Path.Homotopic.Quotient.map_cast 📋 Mathlib.Topology.Homotopy.Path
{X : Type u} {Y : Type v} [TopologicalSpace X] [TopologicalSpace Y] {x y : X} (p : Path.Homotopic.Quotient x y) {x' y' : X} {hx : x' = x} {hy : y' = y} {f : C(X, Y)} : (p.cast hx hy).map f = (p.map f).cast ⋯ ⋯ - Path.Homotopic.Quotient.refl_trans 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.Basic
{X : Type u_1} [TopologicalSpace X] {x₀ x₁ : X} (γ : Path.Homotopic.Quotient x₀ x₁) : (Path.Homotopic.Quotient.refl x₀).trans γ = γ - Path.Homotopic.Quotient.trans_refl 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.Basic
{X : Type u_1} [TopologicalSpace X] {x₀ x₁ : X} (γ : Path.Homotopic.Quotient x₀ x₁) : γ.trans (Path.Homotopic.Quotient.refl x₁) = γ - FundamentalGroupoid.fromPath 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.Basic
{X : Type u_1} [TopologicalSpace X] {x₀ x₁ : X} (p : Path.Homotopic.Quotient x₀ x₁) : { as := x₀ } ⟶ { as := x₁ } - Path.Homotopic.Quotient.symm_trans 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.Basic
{X : Type u_1} [TopologicalSpace X] {x₀ x₁ : X} (γ : Path.Homotopic.Quotient x₀ x₁) : γ.symm.trans γ = Path.Homotopic.Quotient.refl x₁ - Path.Homotopic.Quotient.trans_symm 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.Basic
{X : Type u_1} [TopologicalSpace X] {x₀ x₁ : X} (γ : Path.Homotopic.Quotient x₀ x₁) : γ.trans γ.symm = Path.Homotopic.Quotient.refl x₀ - Path.Homotopic.Quotient.trans_assoc 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.Basic
{X : Type u_1} [TopologicalSpace X] {x₀ x₁ x₂ x₃ : X} (γ₀ : Path.Homotopic.Quotient x₀ x₁) (γ₁ : Path.Homotopic.Quotient x₁ x₂) (γ₂ : Path.Homotopic.Quotient x₂ x₃) : (γ₀.trans γ₁).trans γ₂ = γ₀.trans (γ₁.trans γ₂) - FundamentalGroupoid.toPath 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.Basic
{X : TopCat} {x₀ x₁ : ↑(FundamentalGroupoid.fundamentalGroupoidFunctor.obj X)} (p : x₀ ⟶ x₁) : Path.Homotopic.Quotient x₀.as x₁.as - FundamentalGroupoid.map_map 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.Basic
{X : Type u_1} {Y : Type u_2} [TopologicalSpace X] [TopologicalSpace Y] (f : C(X, Y)) {X✝ Y✝ : FundamentalGroupoid X} (p : X✝ ⟶ Y✝) : (FundamentalGroupoid.map f).map p = Path.Homotopic.Quotient.map p f - FundamentalGroupoid.conj_eqToHom 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.Basic
{X : Type u_1} [TopologicalSpace X] {x y x' y' : X} {p : Path.Homotopic.Quotient x y} (hx : x' = x) (hy : y' = y) : CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom ⋯) (CategoryTheory.CategoryStruct.comp p (CategoryTheory.eqToHom ⋯)) = p.cast hx hy - FundamentalGroupoid.conj_eqToHom_assoc 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.Basic
{X : Type u_1} [TopologicalSpace X] {x y x' y' : X} {p : Path.Homotopic.Quotient x y} (hx : x' = x) (hy : y' = y) {Z : FundamentalGroupoid X} (h : { as := y' } ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom ⋯) (CategoryTheory.CategoryStruct.comp p (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom ⋯) h)) = CategoryTheory.CategoryStruct.comp (p.cast hx hy) h - FundamentalGroupoid.map_eq 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.Basic
{X Y : TopCat} {x₀ x₁ : ↑X} (f : C(↑X, ↑Y)) (p : Path.Homotopic.Quotient x₀ x₁) : (FundamentalGroupoid.fundamentalGroupoidFunctor.map (TopCat.ofHom f)).map p = p.map f - FundamentalGroup.fromPath 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.FundamentalGroup
{X : Type u_1} [TopologicalSpace X] {x : X} (p : Path.Homotopic.Quotient x x) : FundamentalGroup X x - FundamentalGroup.toPath 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.FundamentalGroup
{X : Type u_1} [TopologicalSpace X] {x : X} (p : FundamentalGroup X x) : Path.Homotopic.Quotient x x - Path.Homotopic.pi 📋 Mathlib.Topology.Homotopy.Product
{ι : Type u_1} {X : ι → Type u_2} [(i : ι) → TopologicalSpace (X i)] {as bs : (i : ι) → X i} (γ : (i : ι) → Path.Homotopic.Quotient (as i) (bs i)) : Path.Homotopic.Quotient as bs - Path.Homotopic.proj 📋 Mathlib.Topology.Homotopy.Product
{ι : Type u_1} {X : ι → Type u_2} [(i : ι) → TopologicalSpace (X i)] {as bs : (i : ι) → X i} (i : ι) (p : Path.Homotopic.Quotient as bs) : Path.Homotopic.Quotient (as i) (bs i) - Path.Homotopic.projLeft 📋 Mathlib.Topology.Homotopy.Product
{α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {c₁ c₂ : α × β} (p : Path.Homotopic.Quotient c₁ c₂) : Path.Homotopic.Quotient c₁.1 c₂.1 - Path.Homotopic.projRight 📋 Mathlib.Topology.Homotopy.Product
{α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {c₁ c₂ : α × β} (p : Path.Homotopic.Quotient c₁ c₂) : Path.Homotopic.Quotient c₁.2 c₂.2 - Path.Homotopic.prod 📋 Mathlib.Topology.Homotopy.Product
{α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {a₁ a₂ : α} {b₁ b₂ : β} (q₁ : Path.Homotopic.Quotient a₁ a₂) (q₂ : Path.Homotopic.Quotient b₁ b₂) : Path.Homotopic.Quotient (a₁, b₁) (a₂, b₂) - Path.Homotopic.proj_pi 📋 Mathlib.Topology.Homotopy.Product
{ι : Type u_1} {X : ι → Type u_2} [(i : ι) → TopologicalSpace (X i)] {as bs : (i : ι) → X i} (i : ι) (paths : (i : ι) → Path.Homotopic.Quotient (as i) (bs i)) : Path.Homotopic.proj i (Path.Homotopic.pi paths) = paths i - Path.Homotopic.pi_proj 📋 Mathlib.Topology.Homotopy.Product
{ι : Type u_1} {X : ι → Type u_2} [(i : ι) → TopologicalSpace (X i)] {as bs : (i : ι) → X i} (p : Path.Homotopic.Quotient as bs) : (Path.Homotopic.pi fun i => Path.Homotopic.proj i p) = p - Path.Homotopic.projLeft_prod 📋 Mathlib.Topology.Homotopy.Product
{α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {a₁ a₂ : α} {b₁ b₂ : β} (q₁ : Path.Homotopic.Quotient a₁ a₂) (q₂ : Path.Homotopic.Quotient b₁ b₂) : Path.Homotopic.projLeft (Path.Homotopic.prod q₁ q₂) = q₁ - Path.Homotopic.projRight_prod 📋 Mathlib.Topology.Homotopy.Product
{α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {a₁ a₂ : α} {b₁ b₂ : β} (q₁ : Path.Homotopic.Quotient a₁ a₂) (q₂ : Path.Homotopic.Quotient b₁ b₂) : Path.Homotopic.projRight (Path.Homotopic.prod q₁ q₂) = q₂ - Path.Homotopic.pi_lift 📋 Mathlib.Topology.Homotopy.Product
{ι : Type u_1} {X : ι → Type u_2} [(i : ι) → TopologicalSpace (X i)] {as bs : (i : ι) → X i} (γ : (i : ι) → Path (as i) (bs i)) : (Path.Homotopic.pi fun i => Path.Homotopic.Quotient.mk (γ i)) = Path.Homotopic.Quotient.mk (Path.pi γ) - Path.Homotopic.prod_lift 📋 Mathlib.Topology.Homotopy.Product
{α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {a₁ a₂ : α} {b₁ b₂ : β} (p₁ : Path a₁ a₂) (p₂ : Path b₁ b₂) : Path.Homotopic.prod (Path.Homotopic.Quotient.mk p₁) (Path.Homotopic.Quotient.mk p₂) = Path.Homotopic.Quotient.mk (p₁.prod p₂) - Path.Homotopic.comp_pi_eq_pi_comp 📋 Mathlib.Topology.Homotopy.Product
{ι : Type u_1} {X : ι → Type u_2} [(i : ι) → TopologicalSpace (X i)] {as bs cs : (i : ι) → X i} (γ₀ : (i : ι) → Path.Homotopic.Quotient (as i) (bs i)) (γ₁ : (i : ι) → Path.Homotopic.Quotient (bs i) (cs i)) : (Path.Homotopic.pi γ₀).trans (Path.Homotopic.pi γ₁) = Path.Homotopic.pi fun i => (γ₀ i).trans (γ₁ i) - Path.Homotopic.comp_prod_eq_prod_comp 📋 Mathlib.Topology.Homotopy.Product
{α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {a₁ a₂ a₃ : α} {b₁ b₂ b₃ : β} (q₁ : Path.Homotopic.Quotient a₁ a₂) (q₂ : Path.Homotopic.Quotient b₁ b₂) (r₁ : Path.Homotopic.Quotient a₂ a₃) (r₂ : Path.Homotopic.Quotient b₂ b₃) : (Path.Homotopic.prod q₁ q₂).trans (Path.Homotopic.prod r₁ r₂) = Path.Homotopic.prod (q₁.trans r₁) (q₂.trans r₂) - Path.Homotopic.prod_projLeft_projRight 📋 Mathlib.Topology.Homotopy.Product
{α : Type u_1} {β : Type u_2} [TopologicalSpace α] [TopologicalSpace β] {a₁ a₂ : α} {b₁ b₂ : β} (p : Path.Homotopic.Quotient (a₁, b₁) (a₂, b₂)) : Path.Homotopic.prod (Path.Homotopic.projLeft p) (Path.Homotopic.projRight p) = p - FundamentalGroupoidFunctor.piToPiTop_map 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.Product
{I : Type u} (X : I → TopCat) {X✝ Y✝ : (i : I) → ↑(FundamentalGroupoid.fundamentalGroupoidFunctor.obj (X i))} (p : X✝ ⟶ Y✝) : (FundamentalGroupoidFunctor.piToPiTop X).map p = Path.Homotopic.pi p - SimplyConnectedSpace.instSubsingletonQuotient 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.SimplyConnected
{X : Type u_3} [TopologicalSpace X] [SimplyConnectedSpace X] (x y : X) : Subsingleton (Path.Homotopic.Quotient x y) - simply_connected_iff_paths_homotopic 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.SimplyConnected
{Y : Type u_2} [TopologicalSpace Y] : SimplyConnectedSpace Y ↔ PathConnectedSpace Y ∧ ∀ (x y : Y), Subsingleton (Path.Homotopic.Quotient x y) - simply_connected_iff_unique_homotopic 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.SimplyConnected
(X : Type u_3) [TopologicalSpace X] : SimplyConnectedSpace X ↔ Nonempty X ∧ ∀ (x y : X), Nonempty (Unique (Path.Homotopic.Quotient x y)) - IsCoveringMap.monodromy 📋 Mathlib.Topology.Homotopy.Lifting
{E : Type u_1} {X : Type u_2} [TopologicalSpace E] [TopologicalSpace X] {p : E → X} (cov : IsCoveringMap p) {x y : X} (γ : Path.Homotopic.Quotient x y) : ↑(p ⁻¹' {x}) → ↑(p ⁻¹' {y}) - IsCoveringMap.monodromy_bijective 📋 Mathlib.Topology.Homotopy.Lifting
{E : Type u_1} {X : Type u_2} [TopologicalSpace E] [TopologicalSpace X] {p : E → X} (cov : IsCoveringMap p) {x y : X} (γ : Path.Homotopic.Quotient x y) : Function.Bijective (cov.monodromy γ) - IsCoveringMap.liftPathQuotient 📋 Mathlib.Topology.Homotopy.Lifting
{E : Type u_1} {X : Type u_2} [TopologicalSpace E] [TopologicalSpace X] {p : E → X} (cov : IsCoveringMap p) {x y : X} (γ : Path.Homotopic.Quotient x y) (e : ↑(p ⁻¹' {x})) : Path.Homotopic.Quotient ↑e ↑(cov.monodromy γ e) - IsCoveringMap.monodromy_trans_apply 📋 Mathlib.Topology.Homotopy.Lifting
{E : Type u_1} {X : Type u_2} [TopologicalSpace E] [TopologicalSpace X] {p : E → X} (cov : IsCoveringMap p) {x y z : X} (γ : Path.Homotopic.Quotient x y) (γ' : Path.Homotopic.Quotient y z) (e : ↑(p ⁻¹' {x})) : cov.monodromy (γ.trans γ') e = cov.monodromy γ' (cov.monodromy γ e) - IsCoveringMap.injective_path_homotopic_map 📋 Mathlib.Topology.Homotopy.Lifting
{E : Type u_1} {X : Type u_2} [TopologicalSpace E] [TopologicalSpace X] {p : E → X} (cov : IsCoveringMap p) (e₀ e₁ : E) : Function.Injective fun γ => γ.map { toFun := p, continuous_toFun := ⋯ } - IsAddQuotientCoveringMap.monodromy_ext 📋 Mathlib.Topology.Homotopy.Lifting
{E : Type u_1} {X : Type u_2} [TopologicalSpace E] [TopologicalSpace X] {p : E → X} {G : Type u_4} [AddGroup G] [AddAction G E] (hp : IsAddQuotientCoveringMap p G) {x y : X} {γ γ' : Path.Homotopic.Quotient x y} (e : ↑(p ⁻¹' {x})) : ⋯.monodromy γ e = ⋯.monodromy γ' e → ⋯.monodromy γ = ⋯.monodromy γ' - IsQuotientCoveringMap.monodromy_ext 📋 Mathlib.Topology.Homotopy.Lifting
{E : Type u_1} {X : Type u_2} [TopologicalSpace E] [TopologicalSpace X] {p : E → X} {G : Type u_4} [Group G] [MulAction G E] (hp : IsQuotientCoveringMap p G) {x y : X} {γ γ' : Path.Homotopic.Quotient x y} (e : ↑(p ⁻¹' {x})) : ⋯.monodromy γ e = ⋯.monodromy γ' e → ⋯.monodromy γ = ⋯.monodromy γ' - IsAddQuotientCoveringMap.monodromy_ext_iff 📋 Mathlib.Topology.Homotopy.Lifting
{E : Type u_1} {X : Type u_2} [TopologicalSpace E] [TopologicalSpace X] {p : E → X} {G : Type u_4} [AddGroup G] [AddAction G E] (hp : IsAddQuotientCoveringMap p G) {x y : X} {γ γ' : Path.Homotopic.Quotient x y} (e : ↑(p ⁻¹' {x})) : ⋯.monodromy γ e = ⋯.monodromy γ' e ↔ ⋯.monodromy γ = ⋯.monodromy γ' - IsQuotientCoveringMap.monodromy_ext_iff 📋 Mathlib.Topology.Homotopy.Lifting
{E : Type u_1} {X : Type u_2} [TopologicalSpace E] [TopologicalSpace X] {p : E → X} {G : Type u_4} [Group G] [MulAction G E] (hp : IsQuotientCoveringMap p G) {x y : X} {γ γ' : Path.Homotopic.Quotient x y} (e : ↑(p ⁻¹' {x})) : ⋯.monodromy γ e = ⋯.monodromy γ' e ↔ ⋯.monodromy γ = ⋯.monodromy γ' - IsCoveringMap.monodromy_map 📋 Mathlib.Topology.Homotopy.Lifting
{E : Type u_1} {X : Type u_2} [TopologicalSpace E] [TopologicalSpace X] {p : E → X} (cov : IsCoveringMap p) {x y : E} (γ : Path.Homotopic.Quotient x y) : cov.monodromy (γ.map { toFun := p, continuous_toFun := ⋯ }) ⟨x, ⋯⟩ = ⟨y, ⋯⟩ - IsCoveringMap.map_liftPathQuotient 📋 Mathlib.Topology.Homotopy.Lifting
{E : Type u_1} {X : Type u_2} [TopologicalSpace E] [TopologicalSpace X] {p : E → X} (cov : IsCoveringMap p) {x y : X} (γ : Path.Homotopic.Quotient x y) (e : ↑(p ⁻¹' {x})) : (cov.liftPathQuotient γ e).map { toFun := p, continuous_toFun := ⋯ } = γ.cast ⋯ ⋯ - IsCoveringMap.monodromy_eq_of_map_eq 📋 Mathlib.Topology.Homotopy.Lifting
{E : Type u_1} {X : Type u_2} [TopologicalSpace E] [TopologicalSpace X] {p : E → X} (cov : IsCoveringMap p) {x y : X} {γ : Path.Homotopic.Quotient x y} {ex : ↑(p ⁻¹' {x})} {ey : ↑(p ⁻¹' {y})} (Γ : Path.Homotopic.Quotient ↑ex ↑ey) (eq : Γ.map { toFun := p, continuous_toFun := ⋯ } = γ.cast ⋯ ⋯) : cov.monodromy γ ex = ey - IsQuotientCoveringMap.monodromy_toPermFiber 📋 Mathlib.Topology.Homotopy.Lifting
{E : Type u_1} {X : Type u_2} [TopologicalSpace E] [TopologicalSpace X] {p : E → X} {G : Type u_4} [Group G] [MulAction G E] (hp : IsQuotientCoveringMap p G) {g : G} {x y : X} {γ : Path.Homotopic.Quotient x y} {e : ↑(p ⁻¹' {x})} : ⋯.monodromy γ (((hp.toPermFiber x) g) e) = ((hp.toPermFiber y) g) (⋯.monodromy γ e) - IsAddQuotientCoveringMap.monodromy_toPermFiber 📋 Mathlib.Topology.Homotopy.Lifting
{E : Type u_1} {X : Type u_2} [TopologicalSpace E] [TopologicalSpace X] {p : E → X} {G : Type u_4} [AddGroup G] [AddAction G E] (hp : IsAddQuotientCoveringMap p G) {g : G} {x y : X} {γ : Path.Homotopic.Quotient x y} {e : ↑(p ⁻¹' {x})} : ⋯.monodromy γ (((⋯.toPermFiber x) g) e) = ((⋯.toPermFiber y) g) (⋯.monodromy γ e)
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