Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.3 — choices from an additive lower bound: v~=λz/z(M)\tilde v=\lambda z/z(M)v~=λz/z(M) with threshold λ(β−w(H)+∥z∥∞)/z(M)\lambda(\beta-w(H)+\|z\|_\infty)/z(M)λ(β−w(H)+∥z∥∞​)/z(M)

Open
SubadditiveMMS580.Amplification.Supplement.lemma_5_3

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

fair-divisionp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1reservation-theorem

Let β>0\beta>0β>0, let www be nonnegative additive coefficients on MMM with w(S)≤v(S)w(S)\le v(S)w(S)≤v(S) for every S⊆MS\subseteq MS⊆M, and let H⊆MH\subseteq MH⊆M satisfy w(H)<βw(H)<\betaw(H)<β. Let zzz be nonnegative coefficients with z(g)≤w(g)z(g)\le w(g)z(g)≤w(g) for every ggg, z(g)=0z(g)=0z(g)=0 on HHH, and z(M)>0z(M)>0z(M)>0. For every λ>0\lambda>0λ>0 let

v~=λzz(M),τ=λ β−w(H)+∥z∥∞z(M).\tilde v=\frac{\lambda z}{z(M)},\qquad \tau=\lambda\,\frac{\beta-w(H)+\|z\|_\infty}{z(M)}.v~=z(M)λz​,τ=λz(M)β−w(H)+∥z∥∞​​.

Then v~(M)=λ\tilde v(M)=\lambdav~(M)=λ and (H,v~,τ)(H,\tilde v,\tau)(H,v~,τ) satisfies condition (16) for vvv and β\betaβ: for every B⊆M∖HB\subseteq M\setminus HB⊆M∖H, v~(B)>τ−∥v~∥∞\tilde v(B)>\tau-\|\tilde v\|_\inftyv~(B)>τ−∥v~∥∞​ implies v(H∪B)≥βv(H\cup B)\ge\betav(H∪B)≥β.

It produces the reserving choices used in §5.4 for the proof of Theorem 1.3.

Differences from the source:

  • generalization: v a valuation (normalized, monotone, ℝ≥0-valued) → v an arbitrary real set function; reason: Lemma 5.3 uses only w ≤ v and additivity of w; every source valuation is such a set function
Preamble
import Mathlib
import Definitions.Def_SubadditiveMMS580_Amplification_Supplement_Reservation
import Definitions.Def_MultiAllocToAlloc_Subadditive_Valuation
import Definitions.Def_MultiAllocToAlloc_Subadditive_Allocation

open MultiAllocToAlloc.Subadditive MeasureTheory
Formal statement
namespace SubadditiveMMS580.Amplification.Supplement

/-- Lemma 5.3 (Li–Sun, STOC 2027 submission #580, p. 33): let `β > 0`, let `w ≤ v` be a
nonnegative additive lower bound on `M`, and let `H ⊆ M` satisfy `w(H) < β`. Let `z ≤ w` be
nonnegative additive coefficients supported outside `H` with `z(M) > 0`. For every `λ > 0`, with
`ṽ = λ z / z(M)` and `τ = λ (β − w(H) + ‖z‖∞) / z(M)`, we have `ṽ(M) = λ` and `(H, ṽ, τ)`
satisfies (16). -/
theorem lemma_5_3 {m : ℕ} (β : ℝ) (hβ : 0 < β) (v : Finset (Fin m) → ℝ) (w : Fin m → ℝ)
    (hw : ∀ g, 0 ≤ w g) (hwv : ∀ S : Finset (Fin m), ∑ g ∈ S, w g ≤ v S)
    (H : Finset (Fin m)) (hH : ∑ g ∈ H, w g < β)
    (z : Fin m → ℝ) (hz : ∀ g, 0 ≤ z g) (hzw : ∀ g, z g ≤ w g) (hzH : ∀ g ∈ H, z g = 0)
    (hzpos : 0 < ∑ g, z g) (lam : ℝ) (hlam : 0 < lam) :
    (∑ g, lam * z g / ∑ g', z g') = lam ∧
    SatisfiesReservation v β
      ⟨H, fun g => lam * z g / ∑ g', z g',
        lam * (β - ∑ g ∈ H, w g + supNorm z) / ∑ g', z g'⟩ := by sorry

end SubadditiveMMS580.Amplification.Supplement
Source
Bo Li, Ankang Sun, Toward Constant-Factor Maximin Share Guarantees for Subadditive Valuations, STOC 2027 submission #580 (October 2026), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/580.pdf, sha256 7de124b5706e9e49301a281a1eb418a8ae32d04bf4cf0941b969cc3cde85e485, Lemma 5.3, p. 33 (PDF p. 33)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me