Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 9, p. 15 — Σ_{j=1}^{N} min{1, Σ_{i=1}^{j} 1/(N−i+1)} ≤ (1 − 1/e + δ)N for all large N

Proved
AdWordsMSVV.LowerBound.harmonic_sum_bound

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

adwordsasymptoticsharmonic-numbersp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

For every δ>0\delta > 0δ>0 there is N0N_0N0​ such that for every N≥N0N \ge N_0N≥N0​,

∑j=1Nmin⁡{1, ∑i=1j1N−i+1}≤(1−1e+δ)N.\sum_{j=1}^{N}\min\Big\{1,\ \sum_{i=1}^{j}\frac{1}{N-i+1}\Big\} \le \Big(1-\frac1e+\delta\Big)N.j=1∑N​min{1, i=1∑j​N−i+11​}≤(1−e1​+δ)N.

This is the analytic step of the proof of Theorem 9: summing the per-bidder bounds over the NNN positions gives at most a (1−1/e)(1-1/e)(1−1/e) fraction of the optimum NNN, up to a lower-order error.

Formalization Note The paper writes "at most N(1−1/e)N(1-1/e)N(1−1/e)". Taken literally this is false for every NNN (at N=1N=1N=1 the sum is 111; the excess over N(1−1/e)N(1-1/e)N(1−1/e) tends to about 0.3160.3160.316), so the bound is stated asymptotically with a slack δN\delta NδN; no explicit error term is asserted, since the paper gives none.

Preamble
import Mathlib
import Definitions.Def_AdWordsMSVV_LowerBound_Setting
Formal statement
namespace AdWordsMSVV.LowerBound

open Finset

theorem harmonic_sum_bound :
    ∀ δ : ℝ, 0 < δ → ∃ N₀ : ℕ, ∀ N : ℕ, N₀ ≤ N →
      ∑ j ∈ Icc 1 N, min 1 (∑ i ∈ Icc 1 j, 1 / ((N : ℝ) - i + 1))
        ≤ (1 - Real.exp (-1) + δ) * N := by sorry

end AdWordsMSVV.LowerBound
Source
Mehta, Saberi, Vazirani, Vazirani, AdWords and generalized on-line matching, J. ACM (2007), DOI 10.1145/1284320.1284321, p. 15, proof of Theorem 9, last paragraph, second sentence
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