Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 2.4 — Cutoff bound hi≤2+2qlog⁡(1/bi)h_i\le 2+2q\log(1/b_i)hi​≤2+2qlog(1/bi​)

Proved
FairShareAlmostAll.Slack.Supplement.cutoff_bound

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

anyprice-sharefair-divisionp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1

Work under the standing assumptions of Section 2: n≥2n\ge2n≥2 agents, an integer q≥16q\ge16q≥16, total entitlement W≤1W\le1W≤1, entitlements bi≤1/q2b_i\le1/q^2bi​≤1/q2, a nonempty set N+N_+N+​ of active agents (those with positive APS target tit_iti​), and goods ordered so that every valuation is nonincreasing. The buckets C1,…,CHC_1,\dots,C_HC1​,…,CH​ have prescribed sizes wh=⌈q(1+1/q)h−1⌉w_h=\lceil q(1+1/q)^{h-1}\rceilwh​=⌈q(1+1/q)h−1⌉, and the cutoff hih_ihi​ of an active agent is the first full bucket h<Hh<Hh<H with ∣Ch∣≥q/bi|C_h|\ge q/b_i∣Ch​∣≥q/bi​, or HHH if there is none. Then every active agent iii satisfies

hi≤2+2qlog⁡(1/bi),h_i\le 2+2q\log(1/b_i),hi​≤2+2qlog(1/bi​),

with the natural logarithm.

The claim bounds how many buckets lie in an agent's head; it is used in the Markov-inequality step of Proposition 4.1, which conditions each certificate on configurations with small contribution to the jointly controlled sums.

Differences from the source:

  • encoding: ranks 1,…,m1,\dots,m1,…,m and buckets as rank intervals → goods Fin m and the live mission's published bucket, cutoff and active-set definitions; reason: the same objects under zero-based indexing, reused unchanged from the live mission
Preamble
import Mathlib
import Definitions.Def_AnyPriceShare_Bidding_Basic
import Definitions.Def_FairShareAlmostAll_Slack_FiniteAllocation
import Definitions.Def_FairShareAlmostAll_Slack_Instance
import Definitions.Def_FairShareAlmostAll_Slack_Buckets
Formal statement
namespace FairShareAlmostAll.Slack.Supplement

open FairShareAlmostAll.Slack AnyPriceShare.Bidding

theorem cutoff_bound {n m : ℕ} (X : Instance n m) (q : ℕ) (h : ConstructionAssumptions X q)
    (i : Fin n) (hi : i ∈ active X) :
    (cutoff X q i : ℝ) ≤ 2 + 2 * (q : ℝ) * Real.log (1 / X.entitlement i) := by sorry

end FairShareAlmostAll.Slack.Supplement
Source
Tomer Ezra, Tamar Garbuz, Fair Share Allocations for Almost All Agents, STOC 2027 submission #480 (October 2026), printed p. 9 (PDF p. 10), Claim 2.4; proof Appendix A, printed pp. 27–28 (PDF pp. 28–29); standing assumptions §2, printed p. 7 (PDF p. 8); source.pdf SHA256 c9f47a54f6a9e1568951e8e3845ff79c34d51d391a68fd697d37d8ba29cc7491

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