Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(3.21) — the subproblem step satisfies ⟨z,d⟩ + β‖d‖² ≤ 0

Proved
NestedSA.NASA.eq_3_21

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∈Xx\in Xx∈X, z∈Rnz\in\mathbb R^nz∈Rn, β>0\beta>0β>0, and let d=yˉ(x,z,β)−xd=\bar y(x,z,\beta)-xd=yˉ​(x,z,β)−x be the step of subproblem (2.5), where 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). Then

⟨z,d⟩+β∥d∥2≤0.\langle z,d\rangle+\beta\|d\|^2\le0.⟨z,d⟩+β∥d∥2≤0.

This consequence of the optimality condition of (2.5) gives η(x,z)≤0\eta(x,z)\le0η(x,z)≤0 on XXX, hence W≥0W\ge0W≥0, and the bound β∥d∥≤∥z∥\beta\|d\|\le\|z\|β∥d∥≤∥z∥ used in Proposition 1.

Preamble
import Mathlib
import Definitions.Def_SpectralProjGrad_Shared_IsProjOnto
import Definitions.Def_NestedSA_NASA_Basic

open scoped RealInnerProductSpace
Formal statement
namespace NestedSA.NASA

/-- (3.21) (p. 11, proof of Lemma 4): for a closed convex `X` with Euclidean projection `P`, every `x ∈ X`, every
`z` and every `β > 0`, the step `d = ȳ(x, z, β) − x` satisfies `⟨z, d⟩ + β‖d‖² ≤ 0`. -/
theorem eq_3_21 {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 < β) :
    ⟪z, ybar P x z β - x⟫ + β * ‖ybar P x z β - x‖ ^ 2 ≤ 0 := by sorry

end NestedSA.NASA
Source
Ghadimi, Ruszczyński, Wang, A Single Time-Scale Stochastic Approximation Method for Nested Stochastic Optimization, arXiv:1812.01094v2, §3, proof of Lemma 4, (3.21), p. 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