Proof of Theorem 4, (A.5)–(A.6) — breakpoint utility representation
ProvedInfFisher.Linear.utility_set_eq_breakpointsconvex-optimizationfair-divisionfisher-marketp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
For normalized linear valuations on with intercepts , membership in the feasible utility set is equivalent to nonnegative utilities and the existence of intermediate breakpoints in whose interval utility formulas dominate each coordinate:
This is the first breakpoint reformulation in the proof of Theorem 4, immediately before the introduction of the auxiliary variables in (A.6). The displayed inequalities themselves force the breakpoints into order under the stated valuation assumptions.
Formalization Note Lean buyer uses endpoints ; excludes the inconsistent zero buyer endpoint case.
Preamble
import Mathlib import Definitions.Def_InfFisher_Linear_Setting
Formal statement
namespace InfFisher.Linear
open MeasureTheory
/-- Gao–Kroer, proof of Theorem 4, (A.5)–(A.6): a breakpoint description of `U`. -/
theorem utility_set_eq_breakpoints {n : ℕ} (hn : 0 < n) (c d : ℕ → ℝ)
(hnorm : ∀ i < n, c i / 2 + d i = 1)
(hd : ∀ i j, i ≤ j → j < n → d j ≤ d i)
(hd2 : d 0 ≤ 2) (hd0 : 0 ≤ d (n - 1)) :
∀ u : Fin n → ℝ,
u ∈ feasUtil (volume.restrict (Set.Icc (0 : ℝ) 1)) (linVal c d n) ↔
(∀ i, 0 ≤ u i) ∧
∃ a : ℕ → ℝ,
a 0 = 0 ∧ a n = 1 ∧
(∀ k, 1 ≤ k → k ≤ n - 1 → 0 ≤ a k ∧ a k ≤ 1) ∧
∀ i : Fin n,
u i ≤ c i.val / 2 * (a (i.val + 1) ^ 2 - a i.val ^ 2) +
d i.val * (a (i.val + 1) - a i.val) := by sorry
end InfFisher.Linear
Source
Gao & Kroer, Infinite-Dimensional Fisher Markets and Tractable Fair Division, arXiv:2010.03025v5, proof of Theorem 4, (A.5)–(A.6), pp. a10–a11 (PDF 45–46)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.