Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix A.1, pp. 20–21 — the three constraints on v(W₁ ∪ W₂)/OP̃T_t̂ are incompatible for ρ ≥ 4.75

Proved
BudgetClock.Monotone.incompatibility_A1

by mikedeng1 · Oct 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1real-inequality

Let t≥3t \ge 3t≥3 be an integer and ρ,α,β,u\rho, \alpha, \beta, uρ,α,β,u real numbers with

ρ≥4.75,α≥2t−22t−1+2,β≤32−12t−2,0≤u≤1.\rho \ge 4.75, \qquad \alpha \ge \frac{2^{t-2}}{2^{t-1}+2}, \qquad \beta \le \frac32 - \frac1{2^{t-2}}, \qquad 0 \le u \le 1.ρ≥4.75,α≥2t−1+22t−2​,β≤23​−2t−21​,0≤u≤1.

Then there is no real number xxx with

x>ρα−β,x>ρ(1−u)−β,x<2ρα+2β−ρu+ρ2t−22ρ−2.x > \rho\alpha - \beta, \qquad x > \rho(1-u) - \beta, \qquad x < \frac{2\rho\alpha + 2\beta - \rho u + \frac{\rho}{2^{t-2}}}{2\rho-2}.x>ρα−β,x>ρ(1−u)−β,x<2ρ−22ρα+2β−ρu+2t−2ρ​​.

In the proof of Theorem 1, t=t^t = \hat tt=t^, x=v(W1∪W2)/OPT~t^x = v(W_1 \cup W_2)/\widetilde{\mathrm{OPT}}_{\hat t}x=v(W1​∪W2​)/OPTt^​, α=v(W1)/OPT~t^\alpha = v(W_1)/\widetilde{\mathrm{OPT}}_{\hat t}α=v(W1​)/OPTt^​, β=v(R∣W1∪W2)/OPT~t^\beta = v(R \mid W_1 \cup W_2)/\widetilde{\mathrm{OPT}}_{\hat t}β=v(R∣W1​∪W2​)/OPTt^​, and the three inequalities are what follows from assuming that both v(W1)v(W_1)v(W1​) and v(W3)v(W_3)v(W3​) are below a 1/ρ1/\rho1/ρ fraction of the benchmark. Their incompatibility yields the factor 4.754.754.75.

Formalization Note The bound on β\betaβ uses Lemma 2's constant 1/2t−21/2^{t-2}1/2t−2; the appendix quotes 1/2t−11/2^{t-1}1/2t−1 once but substitutes 1/2t−21/2^{t-2}1/2t−2 in the computation that follows. All three inequalities are strict, as printed; at t=3t = 3t=3, ρ=4.75\rho = 4.75ρ=4.75, u=1−αu = 1 - \alphau=1−α and the extreme α,β\alpha, \betaα,β the lower and upper bounds coincide.

Preamble
import Mathlib
import Definitions.Def_NonmonotoneSubmod_Shared_Submodular
import Definitions.Def_BudgetClock_Monotone_Mechanism
Formal statement
namespace BudgetClock.Monotone

/-- Appendix A.1, pp. 20–21: for `t ≥ 3`, `ρ ≥ 4.75`, `α ≥ 2^{t−2}/(2^{t−1}+2)`,
`β ≤ 3/2 − 1/2^{t−2}` and `0 ≤ u ≤ 1`, no real `x` (the ratio `v(W_1 ∪ W_2)/OP̃T_t̂`) satisfies the three
constraints `x > ρα − β`, `x > ρ(1 − u) − β`, `x < (2ρα + 2β − ρu + ρ/2^{t−2})/(2ρ − 2)`. -/
theorem incompatibility_A1 (t : ℕ) (ht : 3 ≤ t) (ρ α β u x : ℝ) (hρ : 19 / 4 ≤ ρ)
    (hα : (2 : ℝ) ^ (t - 2) / ((2 : ℝ) ^ (t - 1) + 2) ≤ α)
    (hβ : β ≤ 3 / 2 - 1 / (2 : ℝ) ^ (t - 2)) (hu0 : 0 ≤ u) (hu1 : u ≤ 1) :
    ¬ (ρ * α - β < x ∧ ρ * (1 - u) - β < x ∧
        x < (2 * ρ * α + 2 * β - ρ * u + ρ / (2 : ℝ) ^ (t - 2)) / (2 * ρ - 2)) := by sorry

end BudgetClock.Monotone
Source
Balkanski et al., Deterministic Budget-Feasible Clock Auctions, arXiv:2107.09239v2, pp. 20–21, Appendix A.1, proof of Theorem 1 (the three constraints and their incompatibility)
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 14, 2026

    Confirmed by the mission captain (proposal self-audit).

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