Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 478, remark after (3) — bounded level set and lsc f: X⁰ is compact and each block minimization (2) is attained

Proved
TsengBCD.Hemivariate.argmin_attained

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

block-coordinate-descentcompactnesslower-semicontinuousp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let f:Rn1+⋯+nN→[−∞,∞]f:\mathbb R^{n_1+\cdots+n_N}\to[-\infty,\infty]f:Rn1​+⋯+nN​→[−∞,∞] be lower semicontinuous and let x0x^0x0 be a point such that 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 bounded. Then X0X^0X0 is compact, and for every y∈X0y\in X^0y∈X0 and every block k∈{1,…,N}k\in\{1,\dots,N\}k∈{1,…,N} the block minimization

min⁡xkf(y1,…,yk−1,xk,yk+1,…,yN)\min_{x_k} f(y_1,\dots,y_{k-1},x_k,y_{k+1},\dots,y_N)xk​min​f(y1​,…,yk−1​,xk​,yk+1​,…,yN​)

is attained.

This is the remark that makes the BCD method well defined: every iterate stays in X0X^0X0, so step (2) always has a minimizer.

Formalization Note. The page's "fff is lsc on X0X^0X0" is read as lower semicontinuity of fff on the whole space, which Assumption B3 provides for f=f0+∑kfkf=f_0+\sum_k f_kf=f0​+∑k​fk​. Lower semicontinuity of the restriction to X0X^0X0 alone would not make X0X^0X0 closed. The remark is general, so the statement is for an arbitrary fff.

Preamble
import Mathlib
import Definitions.Def_TsengBCD_Hemivariate_Setting
Formal statement
namespace TsengBCD.Hemivariate

open Filter Topology

theorem argmin_attained {N : ℕ} {n : Fin N → ℕ} (f : TsengBCD.Stationary.X n → EReal) (x0 : TsengBCD.Stationary.X n)
    (hbdd : Bornology.IsBounded (TsengBCD.Stationary.levelSet f x0)) (hlsc : LowerSemicontinuous f) :
    IsCompact (TsengBCD.Stationary.levelSet f x0) ∧
      ∀ y ∈ TsengBCD.Stationary.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.Hemivariate
Source
Tseng, Convergence of a block coordinate descent method for nondifferentiable minimization, J. Optim. Theory Appl. 109 (2001), p. 478, §2, remark after (3)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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