Theorems · Definition · combinatorics
CompositionAsSet.boundaries
{n : ℕ} → CompositionAsSet n → Finset (Fin n.succ)Combinatorial viewpoint on a composition of n as consecutive integers {0, ..., n-1}
- Cited by
- 18 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- CompositionAsSetstatement and proof · cited by 26
Cited by21
Results whose statement or proof uses this declaration.
- CompositionAsSet.lengthproof · cited by 11
- CompositionAsSet.boundarystatement and proof · cited by 4
- CompositionAsSet.card_boundaries_eq_succ_lengthstatement · cited by 4
- CompositionAsSet.blocks_partial_sumstatement and proof · cited by 3
- CompositionAsSet.card_boundaries_posstatement · cited by 3
- CompositionAsSet.lt_lengthstatement · cited by 3
- CompositionAsSet.length_lt_card_boundariesstatement · cited by 2
- CompositionAsSet.zero_memstatement · cited by 2
- compositionAsSetEquivproof · cited by 1
- CompositionAsSet.boundaries_nonemptystatement · cited by 1
- CompositionAsSet.boundary_lengthstatement and proof · cited by 1
- CompositionAsSet.boundary_zerostatement and proof · cited by 1