Finite exposure partitions
Lax342547.PartitionLists · concepts/Lax342547/PartitionLists.lean · lax-342547
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
A distinct ordering splits into disjoint exposed and remaining index sets, with their exact union and tail cardinality.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax342547.SmallExposure |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Finite exposure partitions |
| 6 | type: lemma |
| 7 | --- |
| 8 | A distinct ordering splits into disjoint exposed and remaining index sets, with their exact union and tail cardinality. |
| 9 | -/ |
| 10 | |
| 11 | namespace Lax342547.PartitionLists |
| 12 | |
| 13 | |
| 14 | |
| 15 | axiom take_drop_disjoint {ι : Type} [DecidableEq ι] (l : List ι) (hl : l.Nodup) (t : ℕ) : |
| 16 | Disjoint (l.take t).toFinset (l.drop t).toFinset |
| 17 | |
| 18 | axiom take_drop_union {ι : Type} [DecidableEq ι] (l : List ι) (t : ℕ) : |
| 19 | (l.take t).toFinset ∪ (l.drop t).toFinset = l.toFinset |
| 20 | |
| 21 | axiom take_drop_card {ι : Type} [DecidableEq ι] (l : List ι) (hl : l.Nodup) |
| 22 | (b : ℕ) (hb : b ≤ l.length) : (l.drop (l.length-b)).toFinset.card = b |
| 23 | |
| 24 | end Lax342547.PartitionLists |
| 25 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments