Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 4.2, pp. 9–10 — the step rule λ(y, τ) is at least α/L

Proved
ProjReflGrad.Adaptive.stepCap_ge

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

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

Let F:H→HF : H \to HF:H→H be LLL-Lipschitz with L>0L > 0L>0 and let α>0\alpha > 0α>0. Let λ(⋅,⋅)\lambda(\cdot,\cdot)λ(⋅,⋅) be the step rule (4.1) for the previous data yn−1y_{n-1}yn−1​, τn−1≥0\tau_{n-1} \ge 0τn−1​≥0, λn−1\lambda_{n-1}λn−1​ and cap λˉ\bar\lambdaλˉ. If λn−1≥α/L\lambda_{n-1} \ge \alpha/Lλn−1​≥α/L and λˉ≥α/L\bar\lambda \ge \alpha/Lλˉ≥α/L, then for every y∈Hy \in Hy∈H and every τ∈(0,1]\tau \in (0, 1]τ∈(0,1]

λ(y,τ)≥αL.\lambda(y, \tau) \ge \frac{\alpha}{L}.λ(y,τ)≥Lα​.

This is the first claim of the proof of Lemma 4.2, used there to show that τn′=α/(λn−1L)\tau'_n = \alpha/(\lambda_{n-1}L)τn′​=α/(λn−1​L) satisfies (4.3).

Formalization Note The two hypotheses λn−1≥α/L\lambda_{n-1} \ge \alpha/Lλn−1​≥α/L and λˉ≥α/L\bar\lambda \ge \alpha/Lλˉ≥α/L are made explicit. The first is the induction hypothesis of the paper's argument ("Then λ0≥α/L\lambda_0 \ge \alpha/Lλ0​≥α/L and hence by induction"); the second is the reading of "some large λˉ>0\bar\lambda > 0λˉ>0" (Algorithm 4.2, step 1) that this argument needs. Neither is assumed in the goal theorem.

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

/-- Proof of Lemma 4.2 (Malitsky 2015, pp. 9–10): for an `L`-Lipschitz `F`, `λ(y, τ) ≥ α/L` for all
`y`, `y_{n-1}` and `τ ∈ (0, 1]`, provided `λ_{n-1} ≥ α/L` (the induction hypothesis) and
`λ̄ ≥ α/L` (the reading of "some large `λ̄`" the proof uses). -/
theorem stepCap_ge {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] (F : H → H) (L : ℝ) (hL : 0 < L)
    (hC3 : ProjReflGrad.Weak.IsLipschitzMap F L) (α lamBar : ℝ) (hα : 0 < α) (yp y : H) (taup lamp tau : ℝ)
    (htaup : 0 ≤ taup) (htau : tau ∈ Set.Ioc 0 1) (hlamp : α / L ≤ lamp)
    (hbar : α / L ≤ lamBar) :
    α / L ≤ stepCap F α lamBar yp taup lamp y tau := by sorry

end ProjReflGrad.Adaptive
Source
Malitsky, Projected Reflected Gradient Methods for Monotone Variational Inequalities, arXiv:1502.04968v1, pp. 9–10, proof of Lemma 4.2
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