Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 34, p. 44 — with λ_k = 4mk²/p: 1 − Σ_{k≥1} 2m/λ_k = 1 − Σ_{k≥1} p/(2k²) ≥ 1 − p

Proved
LSWCuttingPlane.ChasingZero.union_bound_sum

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1probability-boundseriesunion-bound

Let m≥1m\ge1m≥1 be an integer and p>0p>0p>0, and for k≥1k\ge1k≥1 put λk=4mk2p\lambda_k=\dfrac{4mk^2}{p}λk​=p4mk2​. Then the series ∑k≥12m/λk\sum_{k\ge1}2m/\lambda_k∑k≥1​2m/λk​ and ∑k≥1p/(2k2)\sum_{k\ge1}p/(2k^2)∑k≥1​p/(2k2) converge, and

1−∑k=1∞2mλk=1−∑k=1∞p2k2≥1−p.1-\sum_{k=1}^\infty\frac{2m}{\lambda_k}=1-\sum_{k=1}^\infty\frac{p}{2k^2}\ge1-p.1−k=1∑∞​λk​2m​=1−k=1∑∞​2k2p​≥1−p.

This is the arithmetic of the union bound that closes the proof of Theorem 34: if the kkk-th bad event has probability at most 2m/λk2m/\lambda_k2m/λk​, the probability that none occurs is at least 1−p1-p1−p.

Formalization Note The Lean sums run over k∈N={0,1,… }k\in\mathbb N=\{0,1,\dots\}k∈N={0,1,…} with k+1k+1k+1 in place of the paper's kkk, so they are exactly the paper's sums from k=1k=1k=1. The page writes the first sum with index iii ("∑i=1∞2m/λk\sum_{i=1}^\infty 2m/\lambda_k∑i=1∞​2m/λk​"), a typo for kkk.

Preamble
import Mathlib
import Definitions.Def_LSWCuttingPlane_ChasingZero_Setting
Formal statement
namespace LSWCuttingPlane.ChasingZero

/-- Proof of Theorem 34, p. 44, last display: with `λ_k = 4 m k² / p` (`k ≥ 1`),
`1 − ∑_{k≥1} 2m/λ_k = 1 − ∑_{k≥1} p/(2k²) ≥ 1 − p`, both series summable.
The summation index `k : ℕ` below stands for the paper's `k + 1`. -/
theorem union_bound_sum (m : ℕ) (hm : 0 < m) (p : ℝ) (hp : 0 < p) :
    let lam : ℕ → ℝ := fun k => 4 * (m : ℝ) * ((k : ℝ) + 1) ^ 2 / p
    Summable (fun k : ℕ => 2 * (m : ℝ) / lam k) ∧
      Summable (fun k : ℕ => p / (2 * ((k : ℝ) + 1) ^ 2)) ∧
      1 - ∑' k : ℕ, 2 * (m : ℝ) / lam k = 1 - ∑' k : ℕ, p / (2 * ((k : ℝ) + 1) ^ 2) ∧
      1 - p ≤ 1 - ∑' k : ℕ, p / (2 * ((k : ℝ) + 1) ^ 2) := by sorry

end LSWCuttingPlane.ChasingZero
Source
Lee, Sidford, Wong, A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization, arXiv:1508.04874v2, p. 44, proof of Theorem 34, last display
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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