Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Footnote 2 — under (2.2), strong convexity in ∥⋅∥1\|\cdot\|_1∥⋅∥1​ forces σ≤1\sigma\le1σ≤1

Proved
NesterovRCD.Constrained.footnote2

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

convex-optimizationcoordinate-descentp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1strong-convexity

Let RN=Rn1×⋯×Rnn\mathbb R^N=\mathbb R^{n_1}\times\cdots\times\mathbb R^{n_n}RN=Rn1​×⋯×Rnn​ with n≥1n\ge1n≥1 and every ni≥1n_i\ge1ni​≥1, each block carrying a Euclidean norm ∥⋅∥(i)\|\cdot\|_{(i)}∥⋅∥(i)​ (3.4). Let f:RN→Rf:\mathbb R^N\to\mathbb Rf:RN→R have a coordinate-wise Lipschitz gradient (2.2) with constants Li>0L_i>0Li​>0, and let fff be strongly convex in the norm ∥h∥12=∑iLi∥h(i)∥(i)2\|h\|_1^2=\sum_iL_i\|h^{(i)}\|_{(i)}^2∥h∥12​=∑i​Li​∥h(i)∥(i)2​ of (3.5) with convexity parameter σ>0\sigma>0σ>0 (3.1). Then

σ≤1.\sigma\le1 .σ≤1.

In the proof of Theorem 5 this guarantees that β=2σ/(1+σ)\beta=2\sigma/(1+\sigma)β=2σ/(1+σ) lies in [0,1][0,1][0,1] and that the contraction factor 1−2σn(1+σ)1-\frac{2\sigma}{n(1+\sigma)}1−n(1+σ)2σ​ of (4.6) is nonnegative.

Formalization Note The paper's blocks are Rni\mathbb R^{n_i}Rni​ with ni≥1n_i\ge1ni​≥1; Lean states this as nontriviality of every block space. It cannot be dropped: if every block were the zero space, every σ\sigmaσ would satisfy the hypotheses. Indices are Fin n, 0-based.

Preamble
import Mathlib
import Definitions.Def_NesterovRCD_HighProb_Basic
import Definitions.Def_NesterovRCD_Constrained_UCDM
Formal statement
namespace NesterovRCD.Constrained

variable {n : ℕ} {E : Fin n → Type*} [∀ i, NormedAddCommGroup (E i)] [∀ i, InnerProductSpace ℝ (E i)]
  [∀ i, FiniteDimensional ℝ (E i)]

theorem footnote2 (hn : 0 < n) [∀ i, Nontrivial (E i)] (f : NesterovRCD.Sublinear.Blocks E → ℝ) (L : Fin n → ℝ)
    (hL : NesterovRCD.Sublinear.CoordLipschitz f L) (σ : ℝ) (hσ : 0 < σ) (hsc : NesterovRCD.HighProb.StronglyConvexW f L 1 σ) :
    σ ≤ 1 := by sorry

end NesterovRCD.Constrained
Source
Nesterov, Efficiency of coordinate descent methods on huge-scale optimization problems, CORE Discussion Paper 2010/2, p. 14, footnote 2) (to the proof of Theorem 5)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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