Loogle!
Result
Found 73 declarations mentioning SSet.S.simplex.
- SSet.S.simplex ๐ Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (self : X.S) : X.obj (Opposite.op { len := self.dim }) - SSet.S.cast_simplex_rfl ๐ Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (s : X.S) : (s.cast โฏ).simplex = s.simplex - SSet.S.ext_iff' ๐ Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (s t : X.S) : s = t โ โ (h : s.dim = t.dim), (s.cast h).simplex = t.simplex - SSet.S.equivElements_apply_snd ๐ Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (s : X.S) : (SSet.S.equivElements s).snd = s.simplex - SSet.S.equivElements_symm_apply_simplex ๐ Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (aโ : CategoryTheory.Functor.Elements X) : (SSet.S.equivElements.symm aโ).simplex = aโ.snd - SSet.S.equivOfIso_apply ๐ Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X Y : SSet} (e : X โ Y) (s : X.S) : (SSet.S.equivOfIso e) s = { dim := s.dim, simplex := (CategoryTheory.ConcreteCategory.hom (e.hom.app (Opposite.op { len := s.dim }))) s.simplex } - SSet.S.equivOfIso_symm_apply ๐ Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X Y : SSet} (e : X โ Y) (s : Y.S) : (SSet.S.equivOfIso e).symm s = { dim := s.dim, simplex := (CategoryTheory.ConcreteCategory.hom (e.inv.app (Opposite.op { len := s.dim }))) s.simplex } - SSet.S.opEquiv_apply ๐ Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (x : X.op.S) : SSet.S.opEquiv x = { dim := x.dim, simplex := SSet.opObjEquiv x.simplex } - SSet.S.le_iff ๐ Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} {s t : X.S} : s โค t โ โ f, (CategoryTheory.ConcreteCategory.hom (X.map f.op)) t.simplex = s.simplex - SSet.S.opEquiv_symm_apply ๐ Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (y : X.S) : SSet.S.opEquiv.symm y = { dim := y.dim, simplex := SSet.opObjEquiv.symm y.simplex } - SSet.N.mk' ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (toS : X.S) (nonDegenerate : toS.simplex โ X.nonDegenerate toS.dim) : X.N - SSet.N.nonDegenerate ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (self : X.N) : self.simplex โ X.nonDegenerate self.dim - SSet.N.mk_simplex ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {n : โ} (x : X.obj (Opposite.op { len := n })) (hx : x โ X.nonDegenerate n) : (SSet.N.mk x hx).simplex = x - SSet.N.mk'_surjective ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (s : X.N) : โ t, โ (ht : t.simplex โ X.nonDegenerate t.dim), s = { toS := t, nonDegenerate := ht } - SSet.S.map_toNฯ_op_apply ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (x : X.S) : (CategoryTheory.ConcreteCategory.hom (X.map x.toNฯ.op)) x.toN.simplex = x.simplex - SSet.S.subcomplex_eq_of_epi ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (x y : X.S) (f : { len := x.dim } โถ { len := y.dim }) [CategoryTheory.Epi f] (hf : (CategoryTheory.ConcreteCategory.hom (X.map f.op)) y.simplex = x.simplex) : x.subcomplex = y.subcomplex - SSet.S.subcomplex_map_le ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (x y : X.S) (f : { len := x.dim } โถ { len := y.dim }) (hf : (CategoryTheory.ConcreteCategory.hom (X.map f.op)) y.simplex = x.simplex) : x.subcomplex โค y.subcomplex - SSet.S.existsUnique_toNฯ ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {x : X.S} {y : X.N} (hy : x.toN = y) : โ! f, CategoryTheory.Epi f โง (CategoryTheory.ConcreteCategory.hom (X.map f.op)) y.simplex = x.simplex - SSet.N.orderIsoOfIso_apply ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X Y : SSet} (e : X โ Y) (x : X.N) : (SSet.N.orderIsoOfIso e) x = SSet.N.mk ((CategoryTheory.ConcreteCategory.hom (e.hom.app (Opposite.op { len := x.dim }))) x.simplex) โฏ - SSet.N.le_iff_exists_mono ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} {x y : X.N} : x โค y โ โ f, โ (_ : CategoryTheory.Mono f), (CategoryTheory.ConcreteCategory.hom (X.map f.op)) y.simplex = x.simplex - SSet.N.orderIsoOfIso_symm_apply ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X Y : SSet} (e : X โ Y) (y : Y.N) : (RelIso.symm (SSet.N.orderIsoOfIso e)) y = SSet.N.mk ((CategoryTheory.ConcreteCategory.hom (e.inv.app (Opposite.op { len := y.dim }))) y.simplex) โฏ - SSet.N.opEquiv_apply ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (x : X.op.N) : SSet.N.opEquiv x = SSet.N.mk (SSet.opObjEquiv x.simplex) โฏ - SSet.N.opEquiv_symm_apply ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplices
{X : SSet} (y : X.N) : (RelIso.symm SSet.N.opEquiv) y = SSet.N.mk (SSet.opObjEquiv.symm y.simplex) โฏ - SSet.relativeCellComplexCellsEquiv_symm_apply_k_simplex ๐ Mathlib.AlgebraicTopology.SimplicialSet.Skeleton
{X : SSet} (s : X.N) : (SSet.relativeCellComplexCellsEquiv.symm s).k.simplex = s.simplex - SSet.Subcomplex.N.eq_iff_sMk_eq ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (x y : A.N) : x = y โ { dim := x.dim, simplex := x.simplex } = { dim := y.dim, simplex := y.simplex } - SSet.Subcomplex.N.mk' ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (toN : X.N) (notMem : toN.simplex โ A.obj (Opposite.op { len := toN.dim })) : A.N - SSet.Subcomplex.N.notMem ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (self : A.N) : self.simplex โ A.obj (Opposite.op { len := self.dim }) - SSet.Subcomplex.N.mk_simplex ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} {n : โ} (x : X.obj (Opposite.op { len := n })) (hx : x โ X.nonDegenerate n) (hx' : x โ A.obj (Opposite.op { len := n })) : (SSet.Subcomplex.N.mk x hx hx').simplex = x - SSet.Subcomplex.N.mk'_surjective ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {A : X.Subcomplex} (s : A.N) : โ t, โ (ht : t.simplex โ A.obj (Opposite.op { len := t.dim })), s = { toN := t, notMem := ht } - SSet.Subcomplex.existsN ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonDegenerateSimplicesSubcomplex
{X : SSet} {n : โ} (s : X.obj (Opposite.op { len := n })) {A : X.Subcomplex} (hs : s โ A.obj (Opposite.op { len := n })) : โ x f, CategoryTheory.Epi f โง (CategoryTheory.ConcreteCategory.hom (X.map f.op)) x.simplex = s - SSet.S.IsUniquelyCodimOneFace.ฮด_index ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X : SSet} {x y : X.S} (hxy : x.IsUniquelyCodimOneFace y) {d : โ} (hd : x.dim = d) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.ฮด X (hxy.index hd))) (y.cast โฏ).simplex = (x.cast hd).simplex - SSet.S.IsUniquelyCodimOneFace.existsUnique_ฮด_cast_simplex ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X : SSet} {x y : X.S} (hxy : x.IsUniquelyCodimOneFace y) {d : โ} (hd : x.dim = d) : โ! i, (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.ฮด X i)) (y.cast โฏ).simplex = (x.cast hd).simplex - SSet.S.IsUniquelyCodimOneFace.ฮด_eq_iff ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X : SSet} {x y : X.S} (hxy : x.IsUniquelyCodimOneFace y) {d : โ} (hd : x.dim = d) (i : Fin (d + 2)) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.ฮด X i)) (y.cast โฏ).simplex = (x.cast hd).simplex โ i = hxy.index hd - SSet.S.IsUniquelyCodimOneFace.unique ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X : SSet} {x y : X.S} (hxy : x.IsUniquelyCodimOneFace y) {d : โ} (hd : x.dim = d) (f : { len := d } โถ { len := d + 1 }) [CategoryTheory.Mono f] (hf : (CategoryTheory.ConcreteCategory.hom (X.map f.op)) (y.cast โฏ).simplex = (x.cast hd).simplex) : f = SimplexCategory.ฮด (hxy.index hd) - SSet.S.IsUniquelyCodimOneFace.of_iso ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X : SSet} {x y : X.S} (hxy : x.IsUniquelyCodimOneFace y) {Y : SSet} (e : X โ Y) : { dim := x.dim, simplex := (CategoryTheory.ConcreteCategory.hom (e.hom.app (Opposite.op { len := x.dim }))) x.simplex }.IsUniquelyCodimOneFace { dim := y.dim, simplex := (CategoryTheory.ConcreteCategory.hom (e.hom.app (Opposite.op { len := y.dim }))) y.simplex } - SSet.S.IsUniquelyCodimOneFace.iff_of_iso ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X Y : SSet} (e : X โ Y) (x y : X.S) : { dim := x.dim, simplex := (CategoryTheory.ConcreteCategory.hom (e.hom.app (Opposite.op { len := x.dim }))) x.simplex }.IsUniquelyCodimOneFace { dim := y.dim, simplex := (CategoryTheory.ConcreteCategory.hom (e.hom.app (Opposite.op { len := y.dim }))) y.simplex } โ x.IsUniquelyCodimOneFace y - SSet.S.IsUniquelyCodimOneFace.index_of_iso ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.IsUniquelyCodimOneFace
{X : SSet} {x y : X.S} (hxy : x.IsUniquelyCodimOneFace y) {Y : SSet} (e : X โ Y) {d : โ} (hd : x.dim = d) : โฏ.index hd = hxy.index hd - SSet.N.map_monoOfLE ๐ Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {x y : X.N} (h : x โค y) : (CategoryTheory.ConcreteCategory.hom (X.map (SSet.N.monoOfLE h).op)) y.simplex = x.simplex - SSet.N.existsUnique_of_le ๐ Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {x y : X.N} (h : x โค y) : โ! f, CategoryTheory.Mono f โง (CategoryTheory.ConcreteCategory.hom (X.map f.op)) y.simplex = x.simplex - SSet.N.monoOfLE_eq_iff ๐ Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {x y : X.N} (h : x โค y) (g : { len := x.dim } โถ { len := y.dim }) [CategoryTheory.Mono g] : SSet.N.monoOfLE h = g โ (CategoryTheory.ConcreteCategory.hom (X.map g.op)) y.simplex = x.simplex - SSet.N.stdSimplex_map_monoOfLE_yonedaEquiv_symm_simplex ๐ Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {x y : X.N} (h : x โค y) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.map (SSet.N.monoOfLE h)) (SSet.yonedaEquiv.symm y.simplex) = SSet.yonedaEquiv.symm x.simplex - SSet.N.stdSimplex_map_monoOfLE_yonedaEquiv_symm_simplex_assoc ๐ Mathlib.AlgebraicTopology.SimplicialSet.Nonsingular
{X : SSet} [X.Nonsingular] {x y : X.N} (h : x โค y) {Z : SSet} (hโ : X โถ Z) : CategoryTheory.CategoryStruct.comp (SSet.stdSimplex.map (SSet.N.monoOfLE h)) (CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm y.simplex) hโ) = CategoryTheory.CategoryStruct.comp (SSet.yonedaEquiv.symm x.simplex) hโ - SSet.Subcomplex.PairingCore.typeโ_simplex ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) (s : h.ฮน) : (h.typeโ s).simplex = h.simplex s - SSet.Subcomplex.PairingCore.typeโ_simplex ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.PairingCore
{X : SSet} {A : X.Subcomplex} (h : A.PairingCore) (s : h.ฮน) : (h.typeโ s).simplex = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.ฮด X (h.index s))) (h.simplex s) - 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.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.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.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.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 })))) - SSet.iSup_subcomplexOfSimplex_prod_eq_top ๐ Mathlib.AlgebraicTopology.SimplicialSet.FiniteProd
(Xโ Xโ : SSet) : โจ xโ, โจ xโ, (SSet.Subcomplex.ofSimplex xโ.simplex).prod (SSet.Subcomplex.ofSimplex xโ.simplex) = โค - SSet.prodStdSimplex.pairingCore_simplex ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} (k : Fin (m + 1)) (n : โ) (s : SSet.prodStdSimplex.pairingCore.Typeโ k n) : (SSet.prodStdSimplex.pairingCore k n).simplex s = (s.x.cast โฏ).simplex - SSet.prodStdSimplex.pairingCore.IsTypeโ.ฮด_simplex ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hx : SSet.prodStdSimplex.pairingCore.IsTypeโ x) {d : โ} (hd : x.dim = d) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.ฮด (CategoryTheory.MonoidalCategoryStruct.tensorObj (SSet.stdSimplex.obj { len := m + 1 }) (SSet.stdSimplex.obj { len := n })) (SSet.prodStdSimplex.pairingCore.min x hd).castSucc)) (hx.simplex hd) = (x.cast hd).simplex - SSet.prodStdSimplex.pairingCore.IsIndex.ฮด_simplex ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : โ} {hd : x.dim = d + 1} {l : Fin (d + 1)} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : hl.ฮด.simplex = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.ฮด (CategoryTheory.MonoidalCategoryStruct.tensorObj (SSet.stdSimplex.obj { len := m + 1 }) (SSet.stdSimplex.obj { len := n })) l.castSucc)) (x.cast hd).simplex - SSet.prodStdSimplex.pairingCore.IsIndex.eq_of_isTypeโ_ฮด ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : โ} {hd : x.dim = d + 1} {l : Fin (d + 1)} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) {u : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} (hu : SSet.prodStdSimplex.pairingCore.IsTypeโ u) (i : Fin (d + 2)) (hu' : { dim := u.dim, simplex := u.simplex } = { dim := d, simplex := (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.ฮด (CategoryTheory.MonoidalCategoryStruct.tensorObj (SSet.stdSimplex.obj { len := m + 1 }) (SSet.stdSimplex.obj { len := n })) i)) (x.cast hd).simplex }) : i = l.castSucc โจ i = l.succ - SSet.prodStdSimplex.pairingCore.IsIndex.simplex_fst_castSucc ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : โ} {hd : x.dim = d} {l : Fin d} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : (x.cast hd).simplex.1 l.castSucc = k.castSucc - SSet.prodStdSimplex.pairingCore.IsIndex.simplex_fst_succ ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : โ} {hd : x.dim = d} {l : Fin d} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : (x.cast hd).simplex.1 l.succ = k.succ - SSet.prodStdSimplex.pairingCore.simplex_fst_le_castSucc_iff ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : โ} (hd : x.dim = d) (i : Fin (d + 1)) : (x.cast hd).simplex.1 i โค k.castSucc โ i < SSet.prodStdSimplex.pairingCore.min x hd - SSet.prodStdSimplex.pairingCore.IsIndex.simplex_fst_le_castSucc_iff ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : โ} {hd : x.dim = d} {l : Fin d} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) (i : Fin (d + 1)) : (x.cast hd).simplex.1 i โค k.castSucc โ i < l.succ - SSet.prodStdSimplex.pairingCore.IsIndex.succ_le_simplex_fst_iff ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : โ} {hd : x.dim = d} {l : Fin d} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) (i : Fin (d + 1)) : k.succ โค (x.cast hd).simplex.1 i โ l.succ โค i - SSet.prodStdSimplex.pairingCore.mem_finset_iff ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : โ} (hd : x.dim = d) (l : Fin (d + 1)) : l โ SSet.prodStdSimplex.pairingCore.finset x hd โ (x.cast hd).simplex.1 l = k.succ - SSet.prodStdSimplex.pairingCore.simplex_fst_min ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : โ} (hd : x.dim = d) : (x.cast hd).simplex.1 (SSet.prodStdSimplex.pairingCore.min x hd) = k.succ - SSet.prodStdSimplex.pairingCore.mem_range_right ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : โ} (hd : x.dim = d) (i : Fin (n + 1)) : i โ Set.range โ(x.cast hd).simplex.2 - SSet.prodStdSimplex.pairingCore.IsTypeโ.ฯ_castSucc ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : โ} (hd : x.dim = d) : SSet.prodStdSimplex.pairingCore.IsTypeโ.ฯ x hd (SSet.prodStdSimplex.pairingCore.min x hd).castSucc = (k.castSucc, (x.cast hd).simplex.2 (SSet.prodStdSimplex.pairingCore.min x hd)) - SSet.prodStdSimplex.pairingCore.mem_range_left ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : โ} (hd : x.dim = d) (i : Fin (m + 2)) (hi : i โ k.castSucc) : i โ Set.range โ(x.cast hd).simplex.1 - SSet.prodStdSimplex.objEquiv_apply_snd' ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : โ} (hd : x.dim = d) (i : Fin (d + 1)) : (x.cast hd).simplex.2 i = (x.cast hd).simplex.2 i - SSet.prodStdSimplex.pairingCore.IsIndex.simplex_snd_succ ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} {x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N} {d : โ} {hd : x.dim = d} {l : Fin d} (hl : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ) : (x.cast hd).simplex.2 l.succ = (x.cast hd).simplex.2 l.castSucc - SSet.prodStdSimplex.objEquiv_apply_fst' ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : โ} (hd : x.dim = d) (i : Fin (d + 1)) : (x.cast hd).simplex.1 i = (x.cast hd).simplex.1 i - SSet.prodStdSimplex.pairingCore.isIndex_succ ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : โ} (hd : x.dim = d) (l : Fin d) : SSet.prodStdSimplex.pairingCore.IsIndex x hd l.succ โ (x.cast hd).simplex.1 l.castSucc = k.castSucc โง (x.cast hd).simplex.1 l.succ = k.succ โง (x.cast hd).simplex.2 l.succ = (x.cast hd).simplex.2 l.castSucc - SSet.prodStdSimplex.pairingCore.IsTypeโ.ฯ_succAbove ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : โ} (hd : x.dim = d) (i : Fin (d + 1)) : SSet.prodStdSimplex.pairingCore.IsTypeโ.ฯ x hd ((SSet.prodStdSimplex.pairingCore.min x hd).castSucc.succAbove i) = (SSet.prodStdSimplex.objEquiv (x.cast hd).simplex) i - SSet.prodStdSimplex.pairingCore.IsTypeโ.ฯ_of_ne ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : โ} (hd : x.dim = d) (i : Fin (d + 2)) (hi : i โ (SSet.prodStdSimplex.pairingCore.min x hd).castSucc) : SSet.prodStdSimplex.pairingCore.IsTypeโ.ฯ x hd i = (SSet.prodStdSimplex.objEquiv (x.cast hd).simplex) ((SSet.prodStdSimplex.pairingCore.min x hd).predAbove i) - SSet.prodStdSimplex.pairingCore.IsTypeโ.ฯ_of_lt ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : โ} (hd : x.dim = d) (i : Fin (d + 2)) (hi : i < (SSet.prodStdSimplex.pairingCore.min x hd).castSucc) : SSet.prodStdSimplex.pairingCore.IsTypeโ.ฯ x hd i = (SSet.prodStdSimplex.objEquiv (x.cast hd).simplex) (i.castPred โฏ) - SSet.prodStdSimplex.pairingCore.IsTypeโ.ฯ_of_gt ๐ Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.UnionProd
{m : โ} {k : Fin (m + 1)} {n : โ} (x : ((SSet.horn (m + 1) k.castSucc).unionProd (SSet.boundary n)).N) {d : โ} (hd : x.dim = d) (i : Fin (d + 2)) (hi : (SSet.prodStdSimplex.pairingCore.min x hd).castSucc < i) : SSet.prodStdSimplex.pairingCore.IsTypeโ.ฯ x hd i = (SSet.prodStdSimplex.objEquiv (x.cast hd).simplex) (i.pred โฏ) - SSet.coconeN'_ฮน_app ๐ Mathlib.AlgebraicTopology.SimplicialSet.NonsingularColimit
(X : SSet) [X.Nonsingular] (s : X.N) : X.coconeN'.ฮน.app s = SSet.yonedaEquiv.symm s.simplex
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 69fae59