Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.1, p. 481 — the BCD iterates decrease f, stay in X⁰ and are bounded

Proved
TsengBCD.Stationary.run_mem_levelSet

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

block-coordinate-descentdescent-methodlevel-setp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let f:Rn1+⋯+nN→R∪{∞}f:\mathbb R^{n_1+\cdots+n_N}\to\mathbb R\cup\{\infty\}f:Rn1​+⋯+nN​→R∪{∞}, let x0x^0x0 satisfy f(x0)<∞f(x^0)<\inftyf(x0)<∞, and assume the level set X0={x:f(x)≤f(x0)}X^0=\{x: f(x)\le f(x^0)\}X0={x:f(x)≤f(x0)} is compact. Let {xr}\{x^r\}{xr} be any sequence generated by the BCD method (2)–(3) from x0x^0x0 with any choice of blocks. Then for every r=0,1,…r=0,1,\dotsr=0,1,…

f(xr+1)≤f(xr)andxr+1∈X0,f(x^{r+1})\le f(x^r)\qquad\text{and}\qquad x^{r+1}\in X^0,f(xr+1)≤f(xr)andxr+1∈X0,

and the sequence {xr}\{x^r\}{xr} is bounded.

This is the first step of the proof of Theorem 4.1: the method is a descent method, so its iterates are confined to the compact level set.

Formalization Note. Blocks are 0-based and s r is the block chosen at iteration r+1r+1r+1. Continuity of fff is not needed for this step and is not assumed; the existence half ("xr+1x^{r+1}xr+1 is defined") is the separate item argmin_attained.

Preamble
import Mathlib
import Definitions.Def_TsengBCD_Stationary_Setting
Formal statement
namespace TsengBCD.Stationary

open Filter Topology

theorem run_mem_levelSet {N : ℕ} {n : Fin N → ℕ} (f : X n → EReal) (x0 : X n)
    (hx0 : f x0 ≠ ⊤) (hcpt : IsCompact (levelSet f x0))
    (s : ℕ → Fin N) (x : ℕ → X n) (hx : x 0 = x0) (hrun : IsBCDRun f s x) :
    (∀ r, f (x (r + 1)) ≤ f (x r) ∧ x (r + 1) ∈ levelSet f x0) ∧
      Bornology.IsBounded (Set.range x) := by sorry

end TsengBCD.Stationary
Source
Tseng, Convergence of a block coordinate descent method for nondifferentiable minimization, J. Optim. Theory Appl. 109 (2001), p. 481, proof of Theorem 4.1, first two sentences
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