Theorems · Inductive type · algebraic topology
SSet.Subcomplex.Pairing.WeakRankFunction
{X : SSet} → {A : X.Subcomplex} → A.Pairing → (α : Type v) → [PartialOrder α] → Type (max u v)A weak rank function for a pairing is a function from the type (II) simplices to a partially ordered type which maps an ancestrality relation between simplices of the same dimension to a strict inequality.
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 34 from the axioms · uses propext, Quot.sound
- Assumes
- PartialOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- PartialOrderstatement · cited by 6,410
- SSetstatement · cited by 1,283
- SSet.Subcomplexstatement · cited by 461
- SSet.Subcomplex.Pairingstatement · cited by 117
Cited by17
Results whose statement or proof uses this declaration.
- SSet.Subcomplex.Pairing.WeakRankFunction.rankstatement and proof · cited by 3
- SSet.Subcomplex.PairingCore.weakRankFunctionEquivstatement and proof · cited by 2
- SSet.Subcomplex.Pairing.WeakRankFunction.isRegularstatement and proof · cited by 2
- SSet.Subcomplex.Pairing.WeakRankFunction.mk.injstatement · cited by 1
- SSet.Subcomplex.Pairing.WeakRankFunction.mk.noConfusionstatement · cited by 1
- SSet.Subcomplex.Pairing.RankFunction.toWeakRankFunctionstatement · cited by 1
- SSet.Subcomplex.Pairing.WeakRankFunction.ltstatement and proof · cited by 1
- SSet.Subcomplex.Pairing.WeakRankFunction.wf_ancestralRelstatement and proof · cited by 1
- SSet.Subcomplex.Pairing.isRegular_iff_nonempty_weakRankFunctionstatement and proof · cited by 1
- SSet.Subcomplex.Pairing.WeakRankFunction.mk.congr_simpstatement · cited by 0
- SSet.Subcomplex.Pairing.WeakRankFunction.mk.injEqstatement · cited by 0
- SSet.Subcomplex.Pairing.WeakRankFunction.mk.sizeOf_specstatement · cited by 0