is_cake_allocation
def
An allocation of the cake [0, 1] among n agents is a measurable partition of [0, 1] into n bundles C i.
Statement
def is_cake_allocation (n : ℕ) (C : Fin n → Set ℝ) : Prop
- Defined in
- arXiv:2610.19733 Section 2
- Verified
- 23 Oct 2026
- Axioms
- none listed
- Used by 3
- equal_length_proportional_cake_suffix_volumeIn any equal-length proportional cake allocation C : Fin n → Set ℝ for n ≥ 1 under the identical valuation profile where each agent values…
- equal_length_proportional_cake_prefix_volumeIn any equal-length proportional cake allocation C : Fin n → Set ℝ for n ≥ 1 under the identical valuation profile where each agent values…
- equal_length_proportional_cake_cutting_cut_complexity_lbFor every integer n ≥ 1, if C : Fin n → Set ℝ is an equal-length proportional cake allocation among n agents under the identical valuation…
Read back from the Lean
A definition stating that a family of sets C : Fin n → Set ℝ is a cake allocation of the interval [0, 1] among n agents if and only if:
1. For every i : Fin n, C i is a measurable set (with respect to the standard Borel σ-algebra on ℝ);
2. For every pair i, j : Fin n, if i ≠ j, then C i and C j are disjoint (i.e., C i ∩ C j = ∅); and
3. The union ⋃ i : Fin n, C i is equal to the closed interval [0, 1].
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A cake allocation of `[0, 1]` for `n` agents is a measurable partition of `[0, 1]`. -/ def is_cake_allocation (n : ℕ) (C : Fin n → Set ℝ) : Prop := (∀ i : Fin n, MeasurableSet (C i)) ∧ (∀ i j : Fin n, i ≠ j → Disjoint (C i) (C j)) ∧ (⋃ i : Fin n, C i) = Set.Icc 0 1