Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.1, p. 481 — on a compact level set where f is continuous, each block minimization (2) is attained

Proved
TsengBCD.Stationary.argmin_attained

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

attainmentblock-coordinate-descentlevel-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∪{∞} never take the value −∞-\infty−∞, let f(x0)<∞f(x^0)<\inftyf(x0)<∞, assume X0={x:f(x)≤f(x0)}X^0=\{x: f(x)\le f(x^0)\}X0={x:f(x)≤f(x0)} is compact and fff is continuous at every point of X0X^0X0. Then for every y∈X0y\in X^0y∈X0 and every block kkk there is a∈Rnka\in\mathbb R^{n_k}a∈Rnk​ with

f(y1,…,yk−1,a,yk+1,…,yN)≤f(y1,…,yk−1,b,yk+1,…,yN)for all b∈Rnk.f(y_1,\dots,y_{k-1},a,y_{k+1},\dots,y_N)\le f(y_1,\dots,y_{k-1},b,y_{k+1},\dots,y_N)\qquad\text{for all } b\in\mathbb R^{n_k}.f(y1​,…,yk−1​,a,yk+1​,…,yN​)≤f(y1​,…,yk−1​,b,yk+1​,…,yN​)for all b∈Rnk​.

This is the statement "xr+1x^{r+1}xr+1 is defined" in the induction of the proof of Theorem 4.1: whichever block is chosen, the minimization (2) has a solution, so the BCD method can always proceed.

Formalization Note. "f is continuous on X0X^0X0" is formalized as continuity of fff, as a map into R∪{∞}\mathbb R\cup\{\infty\}R∪{∞}, at every point of X0X^0X0 (see the goal theorem for why); for this step continuity of the restriction to X0X^0X0 would already suffice.

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

open Filter Topology

theorem argmin_attained {N : ℕ} {n : Fin N → ℕ} (f : X n → EReal) (hbot : ∀ x, f x ≠ ⊥)
    (x0 : X n) (hx0 : f x0 ≠ ⊤) (hcpt : IsCompact (levelSet f x0))
    (hcont : ∀ y ∈ levelSet f x0, ContinuousAt f y) :
    ∀ y ∈ levelSet f x0, ∀ k : Fin N, ∃ a : EuclideanSpace ℝ (Fin (n k)),
      ∀ b : EuclideanSpace ℝ (Fin (n k)),
        f (Function.update y k a) ≤ f (Function.update y k b) := 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 sentence ("x^{r+1} is defined")
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