Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, proof, Claim (3): the algorithm produces an almost feasible dual solution

Proved
BJNAdAuctions.Basic.almost_dual_feasible

by mikedeng1 · Sep 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

ad-auctionsonline-algorithmsp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1primal-dual

Let R>0R > 0R>0 be such that b(i,j)≤R B(i)b(i,j) \le R\,B(i)b(i,j)≤RB(i) for all i,ji, ji,j, and run the Allocation Algorithm with c=(1+R)1/Rc = (1+R)^{1/R}c=(1+R)1/R and any tie-breaking rule. Then for every buyer iii, with yyy the final packing vector and spent(i)\mathrm{spent}(i)spent(i) the total amount charged to iii:

  1. the bids allocated to iii exceed its budget by at most one bid,
∑j=1mb(i,j) y(i,j)  ≤  B(i)+max⁡jb(i,j);\sum_{j=1}^m b(i,j)\,y(i,j) \;\le\; B(i) + \max_{j} b(i,j);j=1∑m​b(i,j)y(i,j)≤B(i)+jmax​b(i,j);
  1. the profit extracted from iii is at least a (1−R)(1-R)(1−R) fraction of them,
spent(i)  ≥  (1−R)∑j=1mb(i,j) y(i,j).\mathrm{spent}(i) \;\ge\; (1-R) \sum_{j=1}^m b(i,j)\,y(i,j).spent(i)≥(1−R)j=1∑m​b(i,j)y(i,j).

This is the third claim of the proof of Theorem 1: the run's yyy is feasible for the packing LP up to one bid per buyer, and the revenue loses at most a factor 1−R1 - R1−R against its packing value.

Formalization Note max⁡jb(i,j)\max_j b(i,j)maxj​b(i,j) is ⨆ j, inst.b i j over the finite type Fin m; for m=0m = 0m=0 it is 000, which is also the value of the left-hand side.

Preamble
import Mathlib
import Definitions.Def_BJNAdAuctions_Basic_Instance
import Definitions.Def_BJNAdAuctions_Basic_AllocationAlgorithm
Formal statement
namespace BJNAdAuctions.Basic

/-- Theorem 1, proof, Claim (3) in quantitative form (pp. 7–8): with `c = (1 + R)^(1/R)`, where
every bid is at most `R` times its buyer's budget, each buyer `i` receives allocated bids
`∑_j b(i, j) y(i, j)` of total at most `B(i) + max_j b(i, j)`, and the amount charged to `i` is at
least `(1 - R) ∑_j b(i, j) y(i, j)`. -/
theorem almost_dual_feasible {I : Type*} [Fintype I] [Nonempty I] {m : ℕ} (inst : Instance I m)
    (R : ℝ) (hR : 0 < R) (hbR : ∀ i j, inst.b i j ≤ R * inst.B i)
    (sel : (I → ℝ) → Fin m → I) (i : I) :
    ∑ j, inst.b i j * (run inst ((1 + R) ^ (1 / R)) sel).y i j ≤ inst.B i + (⨆ j, inst.b i j) ∧
    (1 - R) * ∑ j, inst.b i j * (run inst ((1 + R) ^ (1 / R)) sel).y i j ≤
      (run inst ((1 + R) ^ (1 / R)) sel).spent i := by sorry

end BJNAdAuctions.Basic
Source
Buchbinder, Jain & Naor, Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue, ESA 2007, DOI 10.1007/978-3-540-75520-3_24, pp. 7-8, Theorem 1, proof, Claim (3) and the inequalities closing its proof
Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 2, 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