Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 — the unit-step projected displacement is at most max(1,β) times the β-step one

Proved
NestedSA.NASA.lemma_1

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

convex-analysisp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1projection

Let X⊆RnX\subseteq\mathbb R^nX⊆Rn be closed and convex, ΠX\Pi_XΠX​ the Euclidean projection onto XXX, and yˉ(x,z,β)=ΠX(x−1βz)\bar y(x,z,\beta)=\Pi_X(x-\frac1\beta z)yˉ​(x,z,β)=ΠX​(x−β1​z) the solution of subproblem (2.5). For every x∈Xx\in Xx∈X, every z∈Rnz\in\mathbb R^nz∈Rn and every β>0\beta>0β>0,

∥yˉ(x,z,1)−x∥≤max⁡(1,β) ∥yˉ(x,z,β)−x∥.\|\bar y(x,z,1)-x\|\le\max(1,\beta)\,\|\bar y(x,z,\beta)-x\|.∥yˉ​(x,z,1)−x∥≤max(1,β)∥yˉ​(x,z,β)−x∥.

The lemma compares the step of the subproblem at an arbitrary regularization β\betaβ with the unit-regularization step that enters the optimality measure VVV; it is what turns a bound on the algorithm's steps into a bound on VVV.

Preamble
import Mathlib
import Definitions.Def_SpectralProjGrad_Shared_IsProjOnto
import Definitions.Def_NestedSA_NASA_Basic
Formal statement
namespace NestedSA.NASA

/-- Lemma 1, (2.11) (p. 7): for a closed convex `X ⊆ ℝⁿ` with Euclidean projection `P`, every `x ∈ X`, every
`z ∈ ℝⁿ` and every `β > 0`, `‖ȳ(x, z, 1) − x‖ ≤ max(1, β) ‖ȳ(x, z, β) − x‖`, where `ȳ(x, z, β) = Π_X(x − β⁻¹z)`. -/
theorem lemma_1 {n : ℕ} (X : Set (EuclideanSpace ℝ (Fin n))) (hX_cl : IsClosed X) (hX_cvx : Convex ℝ X)
    (P : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n))
    (hP : SpectralProjGrad.Shared.IsProjOnto X P)
    (x : EuclideanSpace ℝ (Fin n)) (hx : x ∈ X) (z : EuclideanSpace ℝ (Fin n)) (β : ℝ) (hβ : 0 < β) :
    ‖ybar P x z 1 - x‖ ≤ max 1 β * ‖ybar P x z β - x‖ := by sorry

end NestedSA.NASA
Source
Ghadimi, Ruszczyński, Wang, A Single Time-Scale Stochastic Approximation Method for Nested Stochastic Optimization, arXiv:1812.01094v2, p. 7, Lemma 1, (2.11)
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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