Theorems · Definition · algebraic topology

SSet.Subcomplex.Pairing.RankFunction.Cell.map

{X : SSet} →
  {A : X.Subcomplex} →
    {P : A.Pairing} →
      {ι : Type v} →
        [inst : LinearOrder ι] →
          {f : P.RankFunction ι} →
            {i : ι} → (c : f.Cell i) → [P.IsProper] → SSet.stdSimplex.obj { len := c.dim + 1 } ⟶ X

The morphism Δ[c.dim + 1] ⟶ X corresponding to a cell of a rank function for a proper pairing of a subcomplex of X : SSet.

Defined in

Mathlib.AlgebraicTopology.SimplicialSet.AnodyneExtensions.RelativeCellComplex

Cited by

12 results in Mathlib

Foundations

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

Assumes

LinearOrderSSet.Subcomplex.Pairing.IsProper