Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.2 — disjoint deletion losses of a qqq-partitioning valuation are at most max⁡{1,L/q}f(S)\max\{1,L/q\}f(S)max{1,L/q}f(S)

Proved
SubadditiveMMS580.Amplification.Supplement.lemma_4_2

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

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

Let q≥2q\ge2q≥2, let f∈Qqf\in\mathcal Q_qf∈Qq​, let L≥0L\ge0L≥0 be an integer, and let B1,…,BLB_1,\dots,B_LB1​,…,BL​ be pairwise disjoint (possibly empty) subsets of a set S⊆MS\subseteq MS⊆M. Then

∑ℓ=1L(f(S)−f(S∖Bℓ))≤max⁡{1,L/q} f(S).\sum_{\ell=1}^{L}\big(f(S)-f(S\setminus B_\ell)\big)\le\max\{1,L/q\}\,f(S).ℓ=1∑L​(f(S)−f(S∖Bℓ​))≤max{1,L/q}f(S).

The bound controls the total loss a donor suffers over separately evaluated transfers in the proofs of Propositions 4.3 and 4.4.

Differences from the source:

  • 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
  • encoding: valuations vi:2M→R≥0v_i : 2^M \to \mathbb R_{\ge 0}vi​:2M→R≥0​, normalized and monotone → real set functions on Finset (Fin m) with the published IsNormalized and IsMonotone predicates; reason: normalization and monotonicity give nonnegativity, so the instances are the same
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.2 (Li–Sun, STOC 2027 submission #580, p. 21): for an integer `L ≥ 0`, `f ∈ Q_q`
(`q ≥ 2`) and pairwise disjoint subsets `B_1, …, B_L` of a set `S ⊆ M`,
`∑_ℓ (f(S) − f(S \ B_ℓ)) ≤ max {1, L/q} · f(S)`. -/
theorem lemma_4_2 {m : ℕ} (q : ℕ) (hq : 2 ≤ q) (f : Finset (Fin m) → ℝ)
    (hf : IsQPartitioning q f) (L : ℕ) (S : Finset (Fin m)) (B : Fin L → Finset (Fin m))
    (hdisj : ∀ k l : Fin L, k ≠ l → Disjoint (B k) (B l)) (hsub : ∀ l, B l ⊆ S) :
    ∑ l : Fin L, (f S - f (S \ B l)) ≤ max 1 ((L : ℝ) / q) * f S := 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.2, p. 21 (PDF p. 21)

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