Theorems · Definition · algebraic topology

SSet.Subcomplex.Pairing.RankFunction.mapN

{X : SSet} →
  {A : X.Subcomplex} →
    {P : A.Pairing} →
      {ι : Type v} →
        [inst : LinearOrder ι] →
          (f : P.RankFunction ι) →
            [inst_1 : P.IsProper] → [SuccOrder ι] → [NoMaxOrder ι] → {j : ι} → (SSet.Subcomplex.range (f.m j)).N → X.S

Given a rank function f : P.RankFunction ι for a proper pairing of a subcomplex of a simplicial set X, this is the simplex of X corresponding to an element in (Subcomplex.range (f.m j)).N.

Defined in

Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex

Cited by

4 results in Mathlib

Foundations

Depth 97 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

LinearOrderSSet.Subcomplex.Pairing.IsProperSuccOrderNoMaxOrder