Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.4, p. 12 — along every run 0 < λ_n ≤ λ̄ and τ_n ∈ (0, 1]

Proved
ProjReflGrad.Adaptive.lam_le_lamBar

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

adaptive-step-sizep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1variational-inequality

Let HHH be a real Hilbert space, C⊆HC \subseteq HC⊆H closed and convex, F:H→HF : H \to HF:H→H LLL-Lipschitz with L>0L > 0L>0, α∈(0,2−1)\alpha \in (0, \sqrt2 - 1)α∈(0,2​−1), λ−1>0\lambda_{-1} > 0λ−1​>0 and λˉ>0\bar\lambda > 0λˉ>0. For every run (xn,yn,λn,τn)(x_n, y_n, \lambda_n, \tau_n)(xn​,yn​,λn​,τn​) of Algorithm 4.2 and every n≥0n \ge 0n≥0,

0<λn≤λˉand0<τn≤1.0 < \lambda_n \le \bar\lambda \qquad\text{and}\qquad 0 < \tau_n \le 1.0<λn​≤λˉand0<τn​≤1.

The proof of Theorem 4.4 recalls that λˉ\bar\lambdaλˉ is an upper bound of (λn)(\lambda_n)(λn​); positivity of λn\lambda_nλn​ and τn∈(0,1]\tau_n \in (0,1]τn​∈(0,1] are what the step rule (4.1) and Lemma 4.2 presuppose at every step.

Formalization Note This item states only the upper bound and positivity. The paper also asserts that α/L\alpha/Lα/L is a lower bound of (λn)(\lambda_n)(λn​) "from Lemma 4.2"; that claim is not stated here (see the mission description).

Preamble
import Mathlib
import Definitions.Def_ProjReflGrad_Adaptive_Setting
Formal statement
namespace ProjReflGrad.Adaptive

/-- Proof of Theorem 4.4 (Malitsky 2015, p. 12): along every run of Algorithm 4.2 the step sizes
satisfy `0 < λ_n ≤ λ̄` and the reflection weights satisfy `τ_n ∈ (0, 1]`. -/
theorem lam_le_lamBar {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
    (C : Set H) (hCcl : IsClosed C) (hCcv : Convex ℝ C) (F : H → H) (L : ℝ)
    (hL : 0 < L) (hC3 : ProjReflGrad.Weak.IsLipschitzMap F L)
    (α lamInit lamBar : ℝ) (hα0 : 0 < α) (hα1 : α < Real.sqrt 2 - 1) (hlamInit : 0 < lamInit)
    (hlamBar : 0 < lamBar) (x y : ℕ → H) (lam tau : ℕ → ℝ)
    (hrun : IsAdaptiveRun C F α lamInit lamBar x y lam tau) :
    ∀ n, 0 < lam n ∧ lam n ≤ lamBar ∧ 0 < tau n ∧ tau n ≤ 1 := by sorry

end ProjReflGrad.Adaptive
Source
Malitsky, Projected Reflected Gradient Methods for Monotone Variational Inequalities, arXiv:1502.04968v1, p. 12, proof of Theorem 4.4
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