Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.3, proof of Theorem 3.8, p. 273 — the induction with γ_s = 2/(s + 1) gives δ_t ≤ 2βR²/(t + 1)

Proved
ConvexOptAlg.FrankWolfe.thm_3_8_induction

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

convex-optimizationfrank-wolfep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1recursion

Let β≥0\beta\ge0β≥0 and R∈RR\in\mathbb RR∈R, and let (δt)(\delta_t)(δt​) be a sequence of real numbers with

δ2≤β2R2andδs+1≤(1−2s+1)δs+β2(2s+1)2R2  for every s≥2.\delta_2\le\frac{\beta}{2}R^2\quad\text{and}\quad\delta_{s+1}\le\Bigl(1-\frac{2}{s+1}\Bigr)\delta_s+\frac{\beta}{2}\Bigl(\frac{2}{s+1}\Bigr)^2R^2\ \text{ for every } s\ge2 .δ2​≤2β​R2andδs+1​≤(1−s+12​)δs​+2β​(s+12​)2R2  for every s≥2.

Then for every t≥2t\ge2t≥2,

δt≤2βR2t+1.\delta_t\le\frac{2\beta R^2}{t+1}.δt​≤t+12βR2​.

This is the "simple induction using that γs=2/(s+1)\gamma_s=2/(s+1)γs​=2/(s+1)" that finishes the proof of Theorem 3.8 once the one-step recursion and the initialization are known. It is a statement about real sequences only.

Formalization Note The recursion is assumed only from s=2s=2s=2 on, since the induction starts at step 2. β≥0\beta\ge0β≥0 is the usual reading of "β-smooth"; without it the base case of the bound can fail.

Preamble
import Mathlib
Formal statement
namespace ConvexOptAlg.FrankWolfe

/-- Bubeck, arXiv:1405.4980v2, proof of Theorem 3.8, p. 273 ("A simple induction using that
`γ_s = 2/(s+1)` finishes the proof"): a real sequence with `δ₂ ≤ (β/2)R²` and
`δ_{s+1} ≤ (1 − γ_s)δ_s + (β/2)γ_s²R²`, `γ_s = 2/(s+1)`, for every `s ≥ 2` satisfies
`δ_t ≤ 2βR²/(t + 1)` for every `t ≥ 2`. -/
theorem thm_3_8_induction (δ : ℕ → ℝ) (β R : ℝ) (hβ : 0 ≤ β)
    (h2 : δ 2 ≤ β / 2 * R ^ 2)
    (hrec : ∀ s : ℕ, 2 ≤ s →
      δ (s + 1) ≤ (1 - 2 / ((s : ℝ) + 1)) * δ s + β / 2 * (2 / ((s : ℝ) + 1)) ^ 2 * R ^ 2)
    (t : ℕ) (ht : 2 ≤ t) :
    δ t ≤ 2 * β * R ^ 2 / ((t : ℝ) + 1) := by sorry

end ConvexOptAlg.FrankWolfe
Source
Bubeck, arXiv:1405.4980v2, §3.3, proof of Theorem 3.8, p. 273 ("A simple induction using that γ_s = 2/(s+1) finishes the proof")
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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