Loogle!
Result
Found 87 declarations mentioning SSet.Subcomplex.Pairing.RankFunction.
- SSet.Subcomplex.Pairing.RankFunction 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) (α : Type v) [PartialOrder α] : Type (max u v) - SSet.Subcomplex.Pairing.RankFunction.toWeakRankFunction 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) (α : Type v) [PartialOrder α] (f : P.RankFunction α) : P.WeakRankFunction α - SSet.Subcomplex.Pairing.RankFunction.rank 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {α : Type v} [PartialOrder α] (self : P.RankFunction α) : ↑P.II → α - SSet.Subcomplex.PairingCore.rankFunctionEquiv 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) (α : Type v) [PartialOrder α] : h.RankFunction α ≃ h.pairing.RankFunction α - SSet.Subcomplex.Pairing.RankFunction.isRegular 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {α : Type v} [PartialOrder α] [WellFoundedLT α] (f : P.RankFunction α) [P.IsProper] : P.IsRegular - SSet.Subcomplex.Pairing.RankFunction.wf_ancestralRel 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {α : Type v} [PartialOrder α] [WellFoundedLT α] (f : P.RankFunction α) : WellFounded P.AncestralRel - SSet.Subcomplex.Pairing.RankFunction.toWeakRankFunction_rank 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) (α : Type v) [PartialOrder α] (f : P.RankFunction α) (a✝ : ↑P.II) : (SSet.Subcomplex.Pairing.RankFunction.toWeakRankFunction P α f).rank a✝ = f.rank a✝ - SSet.Subcomplex.Pairing.RankFunction.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {α : Type v} [PartialOrder α] (rank : ↑P.II → α) (lt : ∀ {x y : ↑P.II}, P.AncestralRel x y → rank x < rank y) : P.RankFunction α - SSet.Subcomplex.Pairing.RankFunction.lt 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.Rank
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {α : Type v} [PartialOrder α] (self : P.RankFunction α) {x y : ↑P.II} : P.AncestralRel x y → self.rank x < self.rank y - SSet.Subcomplex.Pairing.rankFunction 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RankNat
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) [P.IsRegular] : P.RankFunction ℕ - SSet.Subcomplex.Pairing.instNonemptyRankFunctionNat 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RankNat
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) [P.IsRegular] : Nonempty (P.RankFunction ℕ) - SSet.Subcomplex.Pairing.isRegular_iff_nonempty_rankFunction 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RankNat
{X : SSet} {A : X.Subcomplex} (P : A.Pairing) [P.IsProper] : P.IsRegular ↔ Nonempty (P.RankFunction ℕ) - SSet.Subcomplex.Pairing.RankFunction.Cell 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) (i : ι) : Type u - SSet.Subcomplex.Pairing.RankFunction.sigmaStdSimplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) (j : ι) : SSet - SSet.Subcomplex.Pairing.RankFunction.filtration 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) (i : ι) : X.Subcomplex - SSet.Subcomplex.Pairing.RankFunction.sigmaHorn 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] (j : ι) : SSet - SSet.Subcomplex.Pairing.RankFunction.Cell.dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (c : f.Cell i) : ℕ - SSet.Subcomplex.Pairing.RankFunction.Cell.s 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (self : f.Cell i) : ↑P.II - SSet.Subcomplex.Pairing.RankFunction.le_filtration 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) (i : ι) : A ≤ f.filtration i - SSet.Subcomplex.Pairing.RankFunction.filtration_monotone 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) : Monotone f.filtration - SSet.Subcomplex.Pairing.RankFunction.Cell.index 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (c : f.Cell i) [P.IsProper] : Fin (c.dim + 2) - SSet.Subcomplex.Pairing.RankFunction.m 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] (j : ι) : f.sigmaHorn j ⟶ f.sigmaStdSimplex j - SSet.Subcomplex.Pairing.RankFunction.Cell.mk 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (s : ↑P.II) (rank_s : f.rank s = i) : f.Cell i - SSet.Subcomplex.Pairing.RankFunction.Cell.rank_s 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (self : f.Cell i) : f.rank self.s = i - SSet.Subcomplex.Pairing.RankFunction.t 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] (j : ι) : f.sigmaHorn j ⟶ (f.filtration j).toSSet - SSet.Subcomplex.Pairing.RankFunction.instMonoM 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] (j : ι) : CategoryTheory.Mono (f.m j) - SSet.Subcomplex.Pairing.RankFunction.filtration_bot 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [OrderBot ι] : f.filtration ⊥ = A - SSet.Subcomplex.Pairing.RankFunction.Cell.horn 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (c : f.Cell i) [P.IsProper] : (SSet.stdSimplex.obj { len := c.dim + 1 }).Subcomplex - SSet.Subcomplex.Pairing.RankFunction.Cell.type₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (c : f.Cell j) : (SSet.Subcomplex.range (f.m j)).N - SSet.Subcomplex.Pairing.RankFunction.Cell.type₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (c : f.Cell j) : (SSet.Subcomplex.range (f.m j)).N - SSet.Subcomplex.Pairing.RankFunction.Cell.ext 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} {inst✝ : LinearOrder ι} {f : P.RankFunction ι} {i : ι} {x y : f.Cell i} (s : x.s = y.s) : x = y - SSet.Subcomplex.Pairing.RankFunction.Cell.ext_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} {inst✝ : LinearOrder ι} {f : P.RankFunction ι} {i : ι} {x y : f.Cell i} : x = y ↔ x.s = y.s - SSet.Subcomplex.Pairing.RankFunction.Cell.map 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (c : f.Cell i) [P.IsProper] : SSet.stdSimplex.obj { len := c.dim + 1 } ⟶ X - SSet.Subcomplex.Pairing.RankFunction.Cell.ιSigmaStdSimplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {j : ι} (c : f.Cell j) : SSet.stdSimplex.obj { len := c.dim + 1 } ⟶ f.sigmaStdSimplex j - SSet.Subcomplex.Pairing.RankFunction.instMonoιSigmaStdSimplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) {j : ι} (c : f.Cell j) : CategoryTheory.Mono c.ιSigmaStdSimplex - SSet.Subcomplex.Pairing.RankFunction.mapN 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] {j : ι} (x : (SSet.Subcomplex.range (f.m j)).N) : X.S - SSet.Subcomplex.Pairing.RankFunction.Cell.subcomplex_not_le_filtration 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {j : ι} (c : f.Cell j) : ¬(↑c.s).subcomplex ≤ f.filtration j - SSet.Subcomplex.Pairing.RankFunction.b 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] (j : ι) : f.sigmaStdSimplex j ⟶ (f.filtration (Order.succ j)).toSSet - SSet.Subcomplex.Pairing.RankFunction.Cell.ιSigmaHorn 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} [P.IsProper] {j : ι} (c : f.Cell j) : c.horn.toSSet ⟶ f.sigmaHorn j - SSet.Subcomplex.Pairing.RankFunction.Cell.mapHorn 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (c : f.Cell j) : c.horn.toSSet ⟶ (f.filtration j).toSSet - SSet.Subcomplex.Pairing.RankFunction.Cell.type₂_dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (c : f.Cell j) : (SSet.Subcomplex.Pairing.RankFunction.Cell.type₂ f c).dim = c.dim - SSet.Subcomplex.Pairing.RankFunction.instIsWellOrderContinuousFunctor 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [SuccOrder ι] [OrderBot ι] : ⋯.functor.IsWellOrderContinuous - SSet.Subcomplex.Pairing.RankFunction.Cell.type₁_dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (c : f.Cell j) : (SSet.Subcomplex.Pairing.RankFunction.Cell.type₁ f c).dim = c.dim + 1 - SSet.Subcomplex.Pairing.RankFunction.basicCell 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] (i : ι) (c : f.Cell i) : c.horn.toSSet ⟶ SSet.stdSimplex.obj { len := c.dim + 1 } - SSet.Subcomplex.Pairing.RankFunction.Cell.mapToSucc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} [P.IsProper] {j : ι} [SuccOrder ι] [NoMaxOrder ι] (c : f.Cell j) : SSet.stdSimplex.obj { len := c.dim + 1 } ⟶ (f.filtration (Order.succ j)).toSSet - SSet.Subcomplex.Pairing.RankFunction.Cell.preimage_filtration_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (c : f.Cell j) : (f.filtration j).preimage c.map = c.horn - SSet.Subcomplex.Pairing.RankFunction.Cell.subcomplex_not_le_image_horn 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (c : f.Cell i) [P.IsProper] : ¬(↑c.s).subcomplex ≤ c.horn.image c.map - SSet.Subcomplex.Pairing.RankFunction.iSup_filtration_iio 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [OrderBot ι] [SuccOrder ι] (m : ι) (hm : Order.IsSuccLimit m) : ⨆ i, f.filtration ↑i = f.filtration m - SSet.Subcomplex.Pairing.RankFunction.filtration_of_isSuccLimit 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [OrderBot ι] [SuccOrder ι] (i : ι) (hi : Order.IsSuccLimit i) : f.filtration i = ⨆ j, ⨆ (_ : j < i), f.filtration j - SSet.Subcomplex.Pairing.RankFunction.iSup_filtration 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [OrderBot ι] [SuccOrder ι] [NoMaxOrder ι] : ⨆ i, f.filtration i = ⊤ - SSet.Subcomplex.Pairing.RankFunction.mapN_type₂ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] {j : ι} (c : f.Cell j) : f.mapN (SSet.Subcomplex.Pairing.RankFunction.Cell.type₂ f c) = { dim := (↑c.s).dim, simplex := (↑c.s).simplex } - SSet.Subcomplex.Pairing.RankFunction.exists_or_of_range_m_N 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (s : (SSet.Subcomplex.range (f.m j)).N) : ∃ c, s = SSet.Subcomplex.Pairing.RankFunction.Cell.type₁ f c ∨ s = SSet.Subcomplex.Pairing.RankFunction.Cell.type₂ f c - SSet.Subcomplex.Pairing.RankFunction.subcomplex_le_filtration 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) {j : ι} (c : f.Cell j) {i : ι} (h : j < i) : (↑(P.p c.s)).subcomplex ≤ f.filtration i - SSet.Subcomplex.Pairing.RankFunction.Cell.ι_t 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} [P.IsProper] {j : ι} (c : f.Cell j) : CategoryTheory.CategoryStruct.comp c.ιSigmaHorn (f.t j) = SSet.Subcomplex.Pairing.RankFunction.Cell.mapHorn f c - SSet.Subcomplex.Pairing.RankFunction.isPullback 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] (j : ι) : CategoryTheory.IsPullback (f.t j) (f.m j) (SSet.Subcomplex.homOfLE ⋯) (f.b j) - SSet.Subcomplex.Pairing.RankFunction.isPushout 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] (j : ι) : CategoryTheory.IsPushout (f.t j) (f.m j) (SSet.Subcomplex.homOfLE ⋯) (f.b j) - SSet.Subcomplex.Pairing.RankFunction.relativeCellComplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [OrderBot ι] [NoMaxOrder ι] [WellFoundedLT ι] : HomotopicalAlgebra.RelativeCellComplex f.basicCell A.ι - SSet.Subcomplex.Pairing.RankFunction.Cell.range_map 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (c : f.Cell i) [P.IsProper] : SSet.Subcomplex.range c.map = (↑(P.p c.s)).subcomplex - SSet.Subcomplex.Pairing.RankFunction.Cell.mapToSucc_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} [P.IsProper] {j : ι} [SuccOrder ι] [NoMaxOrder ι] (c : f.Cell j) : CategoryTheory.CategoryStruct.comp c.mapToSucc (f.filtration (Order.succ j)).ι = c.map - SSet.Subcomplex.Pairing.RankFunction.Cell.image_horn_lt_subcomplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (c : f.Cell i) [P.IsProper] : c.horn.image c.map < (↑(P.p c.s)).subcomplex - SSet.Subcomplex.Pairing.RankFunction.Cell.ι_b 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] {j : ι} (c : f.Cell j) : CategoryTheory.CategoryStruct.comp c.ιSigmaStdSimplex (f.b j) = c.mapToSucc - SSet.Subcomplex.Pairing.RankFunction.filtration_succ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [SuccOrder ι] (i : ι) (hi : ¬IsMax i) : f.filtration (Order.succ i) = f.filtration i ⊔ ⨆ c, (↑(P.p c.s)).subcomplex - SSet.Subcomplex.Pairing.RankFunction.w 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] (j : ι) : CategoryTheory.CategoryStruct.comp (f.t j) (SSet.Subcomplex.homOfLE ⋯) = CategoryTheory.CategoryStruct.comp (f.m j) (f.b j) - SSet.Subcomplex.Pairing.RankFunction.filtration_def 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) (i : ι) : f.filtration i = A ⊔ ⨆ j, ⨆ (_ : j < i), ⨆ c, (↑(P.p c.s)).subcomplex - SSet.Subcomplex.Pairing.RankFunction.Cell.ι_t_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} [P.IsProper] {j : ι} (c : f.Cell j) {Z : SSet} (h : (f.filtration j).toSSet ⟶ Z) : CategoryTheory.CategoryStruct.comp c.ιSigmaHorn (CategoryTheory.CategoryStruct.comp (f.t j) h) = CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.Pairing.RankFunction.Cell.mapHorn f c) h - SSet.Subcomplex.Pairing.RankFunction.Cell.mapHorn_ι 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (c : f.Cell j) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.Pairing.RankFunction.Cell.mapHorn f c) (f.filtration j).ι = CategoryTheory.CategoryStruct.comp c.horn.ι c.map - SSet.Subcomplex.Pairing.RankFunction.Cell.mapToSucc_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} [P.IsProper] {j : ι} [SuccOrder ι] [NoMaxOrder ι] (c : f.Cell j) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp c.mapToSucc (CategoryTheory.CategoryStruct.comp (f.filtration (Order.succ j)).ι h) = CategoryTheory.CategoryStruct.comp c.map h - SSet.Subcomplex.Pairing.RankFunction.Cell.ι_m 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (c : f.Cell j) : CategoryTheory.CategoryStruct.comp c.ιSigmaHorn (f.m j) = CategoryTheory.CategoryStruct.comp c.horn.ι c.ιSigmaStdSimplex - SSet.Subcomplex.Pairing.RankFunction.Cell.ι_b_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] {j : ι} (c : f.Cell j) {Z : SSet} (h : (f.filtration (Order.succ j)).toSSet ⟶ Z) : CategoryTheory.CategoryStruct.comp c.ιSigmaStdSimplex (CategoryTheory.CategoryStruct.comp (f.b j) h) = CategoryTheory.CategoryStruct.comp c.mapToSucc h - SSet.Subcomplex.Pairing.RankFunction.mapN_type₁ 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] {j : ι} (c : f.Cell j) : f.mapN (SSet.Subcomplex.Pairing.RankFunction.Cell.type₁ f c) = { dim := (↑(P.p c.s)).dim, simplex := (↑(P.p c.s)).simplex } - SSet.Subcomplex.Pairing.RankFunction.w_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] (j : ι) {Z : SSet} (h : (f.filtration (Order.succ j)).toSSet ⟶ Z) : CategoryTheory.CategoryStruct.comp (f.t j) (CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.homOfLE ⋯) h) = CategoryTheory.CategoryStruct.comp (f.m j) (CategoryTheory.CategoryStruct.comp (f.b j) h) - SSet.Subcomplex.Pairing.RankFunction.Cell.ι_t_app 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} [P.IsProper] {j : ι} (c : f.Cell j) (x : SimplexCategoryᵒᵖ) : CategoryTheory.CategoryStruct.comp (c.ιSigmaHorn.app x) ((f.t j).app x) = (SSet.Subcomplex.Pairing.RankFunction.Cell.mapHorn f c).app x - SSet.Subcomplex.Pairing.RankFunction.Cell.image_face_index_compl 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (c : f.Cell i) [P.IsProper] : (SSet.stdSimplex.face {c.index}ᶜ).image c.map = (↑c.s).subcomplex - SSet.Subcomplex.Pairing.RankFunction.Cell.mapHorn_ι_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (c : f.Cell j) {Z : SSet} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (SSet.Subcomplex.Pairing.RankFunction.Cell.mapHorn f c) (CategoryTheory.CategoryStruct.comp (f.filtration j).ι h) = CategoryTheory.CategoryStruct.comp c.horn.ι (CategoryTheory.CategoryStruct.comp c.map h) - SSet.Subcomplex.Pairing.RankFunction.Cell.ι_b_app 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] {j : ι} (c : f.Cell j) (x : SimplexCategoryᵒᵖ) : CategoryTheory.CategoryStruct.comp (c.ιSigmaStdSimplex.app x) ((f.b j).app x) = c.mapToSucc.app x - SSet.Subcomplex.Pairing.RankFunction.Cell.ι_m_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (c : f.Cell j) {Z : SSet} (h : f.sigmaStdSimplex j ⟶ Z) : CategoryTheory.CategoryStruct.comp c.ιSigmaHorn (CategoryTheory.CategoryStruct.comp (f.m j) h) = CategoryTheory.CategoryStruct.comp c.horn.ι (CategoryTheory.CategoryStruct.comp c.ιSigmaStdSimplex h) - SSet.Subcomplex.Pairing.RankFunction.Cell.ι_t_app_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} [P.IsProper] {j : ι} (c : f.Cell j) (x : SimplexCategoryᵒᵖ) {Z : Type u} (h : (f.filtration j).toSSet.obj x ⟶ Z) : CategoryTheory.CategoryStruct.comp (c.ιSigmaHorn.app x) (CategoryTheory.CategoryStruct.comp ((f.t j).app x) h) = CategoryTheory.CategoryStruct.comp ((SSet.Subcomplex.Pairing.RankFunction.Cell.mapHorn f c).app x) h - SSet.Subcomplex.Pairing.RankFunction.Cell.ι_b_app_assoc 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] {j : ι} (c : f.Cell j) (x : SimplexCategoryᵒᵖ) {Z : Type u} (h : (f.filtration (Order.succ j)).toSSet.obj x ⟶ Z) : CategoryTheory.CategoryStruct.comp (c.ιSigmaStdSimplex.app x) (CategoryTheory.CategoryStruct.comp ((f.b j).app x) h) = CategoryTheory.CategoryStruct.comp (c.mapToSucc.app x) h - SSet.Subcomplex.Pairing.RankFunction.ιSigmaStdSimplex_jointly_surjective 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) {d : ℕ} {j : ι} (a : (f.sigmaStdSimplex j).obj (Opposite.op { len := d })) : ∃ c x, (CategoryTheory.ConcreteCategory.hom (c.ιSigmaStdSimplex.app (Opposite.op { len := d }))) x = a - SSet.Subcomplex.Pairing.RankFunction.ιSigmaHorn_jointly_surjective 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {d : ℕ} {j : ι} (a : (f.sigmaHorn j).obj (Opposite.op { len := d })) : ∃ c x, (CategoryTheory.ConcreteCategory.hom (c.ιSigmaHorn.app (Opposite.op { len := d }))) x = a - SSet.Subcomplex.Pairing.RankFunction.ιSigmaStdSimplex_eq_iff 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) {j : ι} {d : ℕ} (x : f.Cell j) (s : (SSet.stdSimplex.obj { len := x.dim + 1 }).obj (Opposite.op { len := d })) (y : f.Cell j) (t : (SSet.stdSimplex.obj { len := y.dim + 1 }).obj (Opposite.op { len := d })) : (CategoryTheory.ConcreteCategory.hom (x.ιSigmaStdSimplex.app (Opposite.op { len := d }))) s = (CategoryTheory.ConcreteCategory.hom (y.ιSigmaStdSimplex.app (Opposite.op { len := d }))) t ↔ ∃ (h : x = y), t = cast ⋯ s - SSet.Subcomplex.Pairing.RankFunction.range_homOfLE_app_union_range_b_app 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] (j : ι) (d : SimplexCategoryᵒᵖ) : Set.range ⇑(CategoryTheory.ConcreteCategory.hom ((SSet.Subcomplex.homOfLE ⋯).app d)) ⊔ Set.range ⇑(CategoryTheory.ConcreteCategory.hom ((f.b j).app d)) = Set.univ - SSet.Subcomplex.Pairing.RankFunction.Cell.map_app_objEquiv_symm_δ_index 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} {i : ι} (c : f.Cell i) [P.IsProper] : (CategoryTheory.ConcreteCategory.hom (c.map.app (Opposite.op { len := c.dim }))) (SSet.stdSimplex.objEquiv.symm (SimplexCategory.δ c.index)) = (↑c.s).simplex - SSet.Subcomplex.Pairing.RankFunction.Cell.ι_b_app_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} [P.IsProper] [SuccOrder ι] [NoMaxOrder ι] {j : ι} (c : f.Cell j) (x : SimplexCategoryᵒᵖ) (x✝ : (SSet.stdSimplex.obj { len := c.dim + 1 }).obj x) : (CategoryTheory.ConcreteCategory.hom ((f.b j).app x)) ((CategoryTheory.ConcreteCategory.hom (c.ιSigmaStdSimplex.app x)) x✝) = (CategoryTheory.ConcreteCategory.hom (c.mapToSucc.app x)) x✝ - SSet.Subcomplex.Pairing.RankFunction.Cell.type₂_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (c : f.Cell j) : (SSet.Subcomplex.Pairing.RankFunction.Cell.type₂ f c).simplex = (CategoryTheory.ConcreteCategory.hom (c.ιSigmaStdSimplex.app (Opposite.op { len := c.dim }))) (SSet.stdSimplex.objEquiv.symm (SimplexCategory.δ c.index)) - SSet.Subcomplex.Pairing.RankFunction.Cell.ι_t_app_apply 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] {f : P.RankFunction ι} [P.IsProper] {j : ι} (c : f.Cell j) (x : SimplexCategoryᵒᵖ) (x✝ : c.horn.toSSet.obj x) : (CategoryTheory.ConcreteCategory.hom ((f.t j).app x)) ((CategoryTheory.ConcreteCategory.hom (c.ιSigmaHorn.app x)) x✝) = (CategoryTheory.ConcreteCategory.hom ((SSet.Subcomplex.Pairing.RankFunction.Cell.mapHorn f c).app x)) x✝ - SSet.Subcomplex.Pairing.RankFunction.Cell.type₁_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex
{X : SSet} {A : X.Subcomplex} {P : A.Pairing} {ι : Type v} [LinearOrder ι] (f : P.RankFunction ι) [P.IsProper] {j : ι} (c : f.Cell j) : (SSet.Subcomplex.Pairing.RankFunction.Cell.type₁ f c).simplex = (CategoryTheory.ConcreteCategory.hom (c.ιSigmaStdSimplex.app (Opposite.op { len := c.dim + 1 }))) (SSet.stdSimplex.objEquiv.symm (CategoryTheory.CategoryStruct.id (Opposite.unop (Opposite.op { len := c.dim + 1 }))))
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