Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.5 — from aggregate value losses to potential losses

Open
SubadditiveMMS580.Amplification.Supplement.lemma_4_5

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

concavityfair-divisionp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1q-partitioning

Let α>0\alpha>0α>0 and let f:[0,∞)→[0,∞)f:[0,\infty)\to[0,\infty)f:[0,∞)→[0,∞) be nondecreasing, zero on [0,α][0,\alpha][0,α] and concave on [α,∞)[\alpha,\infty)[α,∞). Suppose that

f(x)≤1−αx(α<x≤2α),2f(x)−f(x−α)≤1(x≥2α).(13)f(x)\le1-\frac{\alpha}{x}\quad(\alpha<x\le2\alpha),\qquad 2f(x)-f(x-\alpha)\le1\quad(x\ge2\alpha).\tag{13}f(x)≤1−xα​(α<x≤2α),2f(x)−f(x−α)≤1(x≥2α).(13)
  1. Let vvv be a normalized monotone valuation on a finite set MMM and L≥0L\ge0L≥0 an integer. For every S⊆MS\subseteq MS⊆M and pairwise disjoint B1,…,BL⊆SB_1,\dots,B_L\subseteq SB1​,…,BL​⊆S with
∑ℓ=1L[v(S)−v(S∖Bℓ)]≤v(S)\sum_{\ell=1}^L\big[v(S)-v(S\setminus B_\ell)\big]\le v(S)ℓ=1∑L​[v(S)−v(S∖Bℓ​)]≤v(S)

we have

∑ℓ=1L[f(v(S))−f(v(S∖Bℓ))]≤1.\sum_{\ell=1}^L\big[f(v(S))-f(v(S\setminus B_\ell))\big]\le1.ℓ=1∑L​[f(v(S))−f(v(S∖Bℓ​))]≤1.
  1. In particular, the last conclusion holds for every v∈Qqv\in\mathcal Q_qv∈Qq​ (q≥2q\ge2q≥2), every L≤qL\le qL≤q and all pairwise disjoint B1,…,BL⊆SB_1,\dots,B_L\subseteq SB1​,…,BL​⊆S, without the aggregate hypothesis.

With the potential ψα\psi_\alphaψα​ of (9) this yields the donor-loss bound (11) used in Proposition 4.4.

Differences from the source:

  • encoding: f : [0,∞) → [0,∞) → f : ℝ → ℝ, nonnegative, monotone, zero and concave only on the stated subsets of [0,∞); reason: f is only evaluated at values of v, which are nonnegative; its values on negative reals are irrelevant
  • encoding: v : 2^M → ℝ≥0 normalized and monotone → a real set function with IsNormalized and IsMonotone; reason: these imply nonnegativity, so the instances are the same
  • encoding: partitions (C1,…,Ct)∈Π(S,t)(C_1,\dots,C_t)\in\Pi(S,t)(C1​,…,Ct​)∈Π(S,t) into t≤qt\le qt≤q nonempty groups (Definition 2.1) → 1 ≤ t ≤ q and C : Fin t → Finset (Fin m) with nonempty, pairwise disjoint members whose union is S; reason: the same ordered partitions
Preamble
import Mathlib
import Definitions.Def_SubadditiveMMS580_Amplification_Supplement_Partitioning
import Definitions.Def_MultiAllocToAlloc_Subadditive_Valuation
import Definitions.Def_MultiAllocToAlloc_Subadditive_Allocation
import Definitions.Def_LittleCharity_MMS_Setting

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

/-- Lemma 4.5 (Li–Sun, STOC 2027 submission #580, p. 28): let `α > 0` and let `f`, on `[0, ∞)`,
be nonnegative, nondecreasing, zero on `[0, α]` and concave on `[α, ∞)`, with
`f(x) ≤ 1 − α/x` for `α < x ≤ 2α` and `2f(x) − f(x − α) ≤ 1` for `x ≥ 2α` (13). Then for every
normalized monotone `v`, every `L ≥ 0` and pairwise disjoint `B_1, …, B_L ⊆ S` with
`∑_ℓ [v(S) − v(S \ B_ℓ)] ≤ v(S)`, `∑_ℓ [f(v(S)) − f(v(S \ B_ℓ))] ≤ 1`; in particular this
holds for `v ∈ Q_q` and `L ≤ q` without the aggregate hypothesis. -/
theorem lemma_4_5 (α : ℝ) (hα : 0 < α) (f : ℝ → ℝ)
    (hnonneg : ∀ x : ℝ, 0 ≤ x → 0 ≤ f x) (hmono : MonotoneOn f (Set.Ici 0))
    (hzero : ∀ x ∈ Set.Icc 0 α, f x = 0) (hconc : ConcaveOn ℝ (Set.Ici α) f)
    (h13a : ∀ x : ℝ, α < x → x ≤ 2 * α → f x ≤ 1 - α / x)
    (h13b : ∀ x : ℝ, 2 * α ≤ x → 2 * f x - f (x - α) ≤ 1) :
    (∀ {m : ℕ} (v : Finset (Fin m) → ℝ), IsNormalized v → IsMonotone v →
      ∀ (L : ℕ) (S : Finset (Fin m)) (B : Fin L → Finset (Fin m)),
        (∀ k l : Fin L, k ≠ l → Disjoint (B k) (B l)) → (∀ l, B l ⊆ S) →
        ∑ l : Fin L, (v S - v (S \ B l)) ≤ v S →
        ∑ l : Fin L, (f (v S) - f (v (S \ B l))) ≤ 1) ∧
    (∀ {m : ℕ} (q : ℕ), 2 ≤ q → ∀ v : Finset (Fin m) → ℝ, IsQPartitioning q v →
      ∀ (L : ℕ), L ≤ q → ∀ (S : Finset (Fin m)) (B : Fin L → Finset (Fin m)),
        (∀ k l : Fin L, k ≠ l → Disjoint (B k) (B l)) → (∀ l, B l ⊆ S) →
        ∑ l : Fin L, (f (v S) - f (v (S \ B l))) ≤ 1) := 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 4.5, p. 28 (PDF p. 28)

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