Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3, p. 8 — the value of the LPs L and D tends to N/e as k → ∞

Proved
AdWordsMSVV.Tradeoff.lemma_3

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

adwordsfactor-revealing-lplimitsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix the number of bidders N≥0N\ge0N≥0. For each number of slabs kkk, let val(Lk)\mathrm{val}(L_k)val(Lk​) be the supremum of the objective of the factor-revealing LP LLL over its feasible set and val(Dk)\mathrm{val}(D_k)val(Dk​) the infimum of the objective of its dual DDD. Then

lim⁡k→∞val(Lk)=lim⁡k→∞val(Dk)=Ne.\lim_{k\to\infty}\mathrm{val}(L_k)=\lim_{k\to\infty}\mathrm{val}(D_k)=\frac Ne .k→∞lim​val(Lk​)=k→∞lim​val(Dk​)=eN​.

For BALANCE this gives the competitive ratio 1−1/e1-1/e1−1/e; for the tradeoff algorithm it supplies the N/eN/eN/e term in the proof of Theorem 8.

Formalization Note The values are a real sSup and sInf. For N≥0N\ge0N≥0 the feasible sets are nonempty (x=0x=0x=0, y=y∗y=y^*y=y∗) and the objectives are bounded on them, so both are attained values; for k≤1k\le1k≤1 the index range is empty and both values are 000, which does not affect the limit.

Preamble
import Mathlib
import Definitions.Def_AdWordsMSVV_Tradeoff_LP
Formal statement
namespace AdWordsMSVV.Tradeoff
theorem lemma_3 (N : ℕ) :
    Filter.Tendsto (fun k : ℕ => LValue k N) Filter.atTop (nhds ((N : ℝ) / Real.exp 1)) ∧
    Filter.Tendsto (fun k : ℕ => DValue k N) Filter.atTop (nhds ((N : ℝ) / Real.exp 1)) := 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. 8, Lemma 3
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