Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6, p. 11 — OPT(q) ψ(type(q)) ≤ ALG(q) ψ(slab(q)) for every query with 1 ≤ type(q) ≤ k − 1

Proved
AdWordsMSVV.Tradeoff.lemma_6

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

adwordsonline-algorithmsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix k≥1k\ge1k≥1 slabs, a tradeoff function ψ\psiψ that is monotonically decreasing on {1,…,k}\{1,\dots,k\}{1,…,k}, an adwords instance with unit budgets and nonnegative bids cb,tc_{b,t}cb,t​, and a run σ\sigmaσ of the discrete algorithm with tradeoff function ψ\psiψ. Let τ\tauτ be any allocation (the "OPT" of the paper), and let qqq be the query at position ttt, which τ\tauτ assigns to bidder bbb. If the type of bbb at the end of the run satisfies 1≤type(b)≤k−11\le\mathrm{type}(b)\le k-11≤type(b)≤k−1, then

cb,t ψ(type(b))≤ALG(q) ψ(slab(q)),c_{b,t}\,\psi(\mathrm{type}(b))\le\mathrm{ALG}(q)\,\psi(\mathrm{slab}(q)),cb,t​ψ(type(b))≤ALG(q)ψ(slab(q)),

where ALG(q)\mathrm{ALG}(q)ALG(q) is the bid of the bidder to whom the run assigns qqq and slab(q)\mathrm{slab}(q)slab(q) is that bidder's active slab when qqq arrives.

The left side is OPT(q)ψ(type(q))\mathrm{OPT}(q)\psi(\mathrm{type}(q))OPT(q)ψ(type(q)) in the paper's notation. The inequality is the per-query comparison summed in Lemma 7.

Formalization Note The lemma uses no optimality of τ\tauτ, so it is stated for every allocation. Monotonicity of ψ\psiψ is assumed on the slab range {1,…,k}\{1,\dots,k\}{1,…,k} only.

Preamble
import Mathlib
import Definitions.Def_AdWordsMSVV_Tradeoff_Setting
Formal statement
namespace AdWordsMSVV.Tradeoff
theorem lemma_6 {N M : ℕ} (k : ℕ) (hk : 1 ≤ k) (ψ : ℕ → ℝ)
    (hψ : AntitoneOn ψ (Set.Icc 1 k))
    (bid : Fin N → Fin M → ℝ) (hbid : ∀ b t, 0 ≤ bid b t)
    (σ : Fin M → Option (Fin N)) (hσ : IsRun ψ k bid σ)
    (τ : Fin M → Option (Fin N)) (t : Fin M) (b : Fin N) (hτ : τ t = some b)
    (htype : 1 ≤ typeOf k bid σ b ∧ typeOf k bid σ b ≤ k - 1) :
    bid b t * ψ (typeOf k bid σ b) ≤ algRev bid σ t * ψ (slabQ k bid σ t) := by sorry
end AdWordsMSVV.Tradeoff
Source
Mehta, Saberi, Vazirani, Vazirani, AdWords and generalized on-line matching, J. ACM (2007), DOI 10.1145/1284320.1284321, p. 11, Lemma 6 (with the Definition of ALG(q), OPT(q), type and slab of a query, p. 11)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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