First low-rank bound at zero offset
ProvedStableVotingDistortion.Lemma9Reduction.firstLowCorrectionBudgetFor each released LP mass from 0.06 to 0.64 and each rank from zero to lambda, the zero-offset primitive term and the positive-part correction sum to at most lambda.
Preamble
import Definitions.Def_StableVotingDistortion_Lemma9ReleasedData
Formal statement
namespace StableVotingDistortion.Lemma9Reduction
open Set PaperMiddle PaperCurve PaperBox
theorem firstLowCorrectionBudget {p x : ℝ} (hp : p ∈ Icc (3/50:ℝ) (16/25)) (hx : x ∈ Icc (0:ℝ) PaperCurve.lam) :
entry PaperMiddle.Knot.beta p * J score (1-p) +
max (entry PaperMiddle.Knot.eta p * score x + x - PaperCurve.lam) 0 ≤ PaperCurve.lam := by sorry
end StableVotingDistortion.Lemma9ReductionSource
STOC submission, Section 6, Lemma 9, original released certificate, SHA-256 6a04e0dafad717b2cb646d23a8faca4a7ba7930aba032af6dc6724427b9006e7.