Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.1(c), pp. 482–483 — unique block minima force z¹ = z² = ⋯ = z^{T−1}

Proved
TsengBCD.Stationary.part_c_windows_eq

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

block-coordinate-descentcoordinatewise-minimump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1unique-minimum

Let f:Rn1+⋯+nN→R∪{∞}f:\mathbb R^{n_1+\cdots+n_N}\to\mathbb R\cup\{\infty\}f:Rn1​+⋯+nN​→R∪{∞}, T≥0T\ge 0T≥0, and let z1,…,zTz^1,\dots,z^Tz1,…,zT be points and s1,…,sTs^1,\dots,s^Ts1,…,sT blocks such that:

  1. fff has at most one minimum in xkx_kxk​ for k=s2,…,sT−1k=s^2,\dots,s^{T-1}k=s2,…,sT−1;
  2. zj∈dom⁡fz^j\in\operatorname{dom}fzj∈domf for j=1,…,Tj=1,\dots,Tj=1,…,T;
  3. (7) f(zj)≤f(zj+(0,…,dsj,…,0))f(z^j)\le f(z^j+(0,\dots,d_{s^j},\dots,0))f(zj)≤f(zj+(0,…,dsj​,…,0)) for all dsjd_{s^j}dsj​, j=1,…,Tj=1,\dots,Tj=1,…,T, and zkj=zkj−1z^j_k=z^{j-1}_kzkj​=zkj−1​ for all k≠sjk\ne s^jk=sj, j=2,…,Tj=2,\dots,Tj=2,…,T;
  4. (8) f(zj−1)≤f(zj−1+(0,…,dsj,…,0))f(z^{j-1})\le f(z^{j-1}+(0,\dots,d_{s^j},\dots,0))f(zj−1)≤f(zj−1+(0,…,dsj​,…,0)) for all dsjd_{s^j}dsj​, j=2,…,Tj=2,\dots,Tj=2,…,T.

Then

zj−1=zjfor j=2,…,T−1,z^{j-1}=z^j\qquad\text{for } j=2,\dots,T-1,zj−1=zjfor j=2,…,T−1,

so z1=z2=⋯=zT−1z^1=z^2=\cdots=z^{T-1}z1=z2=⋯=zT−1.

In the proof of Theorem 4.1(c), (7) and (8) say that dsj↦f(zj+(0,…,dsj,…,0))d_{s^j}\mapsto f(z^j+(0,\dots,d_{s^j},\dots,0))dsj​↦f(zj+(0,…,dsj​,…,0)) attains its minimum both at 000 and at zsjj−1−zsjjz^{j-1}_{s^j}-z^j_{s^j}zsjj−1​−zsjj​; uniqueness of the minimum point collapses the window, and the cluster point is then a coordinatewise minimum point.

Formalization Note. Stated about the points zjz^jzj and blocks sjs^jsj alone, with (7), (8) as hypotheses; limit_chain produces them from a BCD run. A minimum point of a block section is a point of its effective domain (see the definitions item), which is why zj∈dom⁡fz^j\in\operatorname{dom}fzj∈domf is a hypothesis here; in the theorem it follows from (6).

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

open Filter Topology

theorem part_c_windows_eq {N : ℕ} {n : Fin N → ℕ} (f : X n → EReal) (T : ℕ)
    (zs : ℕ → X n) (ss : ℕ → Fin N)
    (huniq : ∀ j, 2 ≤ j → j ≤ T - 1 → AtMostOneMinIn f (ss j))
    (hfin : ∀ j, 1 ≤ j → j ≤ T → f (zs j) ≠ ⊤)
    (h7 : ∀ j, 1 ≤ j → j ≤ T → ∀ d : EuclideanSpace ℝ (Fin (n (ss j))),
      f (zs j) ≤ f (zs j + Pi.single (ss j) d))
    (h7' : ∀ j, 2 ≤ j → j ≤ T → ∀ k : Fin N, k ≠ ss j → zs j k = zs (j - 1) k)
    (h8 : ∀ j, 2 ≤ j → j ≤ T → ∀ d : EuclideanSpace ℝ (Fin (n (ss j))),
      f (zs (j - 1)) ≤ f (zs (j - 1) + Pi.single (ss j) d)) :
    ∀ j, 2 ≤ j → j ≤ T - 1 → zs (j - 1) = zs j := by sorry

end TsengBCD.Stationary
Source
Tseng, Convergence of a block coordinate descent method for nondifferentiable minimization, J. Optim. Theory Appl. 109 (2001), pp. 482–483, proof of Theorem 4.1(c)
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