Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.3(iii), pp. 541–542 — weighted telescoping estimate

Proved
ChenTeboullePMD.Rate.lemma_3_3_iii

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

bregman-functionconvergence-rateconvex-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-point

Under Lemma 3.2's standing assumptions, let σn=∑k=1nλk\sigma_n=\sum_{k=1}^n\lambda_kσn​=∑k=1n​λk​. For every n≥1n\ge1n≥1 and u∈C∩Sˉu\in C\cap\bar Su∈C∩Sˉ,

σn(f(xn)−f(u))≤Dψ(u,x0)−Dψ(u,xn)−∑k=1nλk−1σkDψ(xk,xk−1).\sigma_n\bigl(f(x^n)-f(u)\bigr) \le D_\psi(u,x^0)-D_\psi(u,x^n) -\sum_{k=1}^n\lambda_k^{-1}\sigma_k D_\psi(x^k,x^{k-1}).σn​(f(xn)−f(u))≤Dψ​(u,x0)−Dψ​(u,xn)−k=1∑n​λk−1​σk​Dψ​(xk,xk−1).

This is the weighted estimate that gives Theorem 3.4's rate after the nonnegative terms are removed.

Formalization Note The weights are exactly λk−1σk\lambda_k^{-1}\sigma_kλk−1​σk​; the sum uses a zero-based Lean range with k+1k+1k+1 as the paper index. The real inequality covers uuu in the effective domain, where the page's extended objective is finite. The space is finite dimensional and the run predicate supplies existing zone-valued iterates.

Preamble
import Mathlib
import Definitions.Def_BeckTeboulleMD_EMDA_Setting
import Definitions.Def_ChenTeboullePMD_Rate_Setting
Formal statement
namespace ChenTeboullePMD.Rate

open BeckTeboulleMD.EMDA

/-- Lemma 3.3(iii), pp. 541–542. -/
theorem lemma_3_3_iii {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
    [FiniteDimensional ℝ E]
    (S : Set E) (ψ : E → ℝ) (hψ : IsBregmanFunction S ψ)
    (C : Set E) (hCne : C.Nonempty) (hCconv : Convex ℝ C)
    (f : E → ℝ) (hf : ConvexOn ℝ C f)
    (hlsc : LowerSemicontinuous (extendTop C f))
    (hri : intrinsicInterior ℝ C ⊆ S)
    (lam : ℕ → ℝ) (hlam : ∀ k, 1 ≤ k → 0 < lam k)
    (x : ℕ → E) (hrun : IsPMDRun S C ψ f lam x) :
    ∀ n, 1 ≤ n → ∀ u ∈ C, u ∈ closure S →
      sigma lam n * (f (x n) - f u) ≤
        bregman ψ u (x 0) - bregman ψ u (x n) -
          ∑ k ∈ Finset.range n,
            (lam (k + 1))⁻¹ * sigma lam (k + 1) *
              bregman ψ (x (k + 1)) (x k) := by sorry

end ChenTeboullePMD.Rate
Source
Chen & Teboulle, Convergence analysis of a proximal-like minimization algorithm using Bregman functions, SIAM J. Optim. 3 (1993), pp. 541–542, Lemma 3.3(iii)
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