Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lipschitz estimate for FλF_\lambdaFλ​: ∥Fλ(y1)−Fλ(y2)∥≤[α+(λ2β2+2λ(αβ−δ)+1+α2−2γ)1/2]∥y1−y2∥\|F_\lambda(y^1)-F_\lambda(y^2)\|\le[\alpha+(\lambda^2\beta^2+2\lambda(\alpha\beta-\delta)+1+\alpha^2-2\gamma)^{1/2}]\|y^1-y^2\|∥Fλ​(y1)−Fλ​(y2)∥≤[α+(λ2β2+2λ(αβ−δ)+1+α2−2γ)1/2]∥y1−y2∥

Proved
ChanPangGQVI.Contraction.lipschitz_estimate

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

lipschitzp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1projectionvariational-inequality

Work in Rn\mathbb R^nRn with the Euclidean norm and inner product. Let K~\tilde KK~ be a nonempty closed convex set, and let m,f:Rn→Rnm,f:\mathbb R^n\to\mathbb R^nm,f:Rn→Rn satisfy, for all x,yx,yx,y,

  1. ∥m(x)−m(y)∥≤α∥x−y∥\|m(x)-m(y)\|\le\alpha\|x-y\|∥m(x)−m(y)∥≤α∥x−y∥ and ∥f(x)−f(y)∥≤β∥x−y∥\|f(x)-f(y)\|\le\beta\|x-y\|∥f(x)−f(y)∥≤β∥x−y∥ (Lipschitz continuity with constants α,β\alpha,\betaα,β);
  2. (x−y)T(f(x)−f(y))≥δ∥x−y∥2(x-y)^T(f(x)-f(y))\ge\delta\|x-y\|^2(x−y)T(f(x)−f(y))≥δ∥x−y∥2 and (x−y)T(m(x)−m(y))≥γ∥x−y∥2(x-y)^T(m(x)-m(y))\ge\gamma\|x-y\|^2(x−y)T(m(x)−m(y))≥γ∥x−y∥2 (strong monotonicity with constants δ,γ\delta,\gammaδ,γ).

Let K(x)=m(x)+K~K(x)=m(x)+\tilde KK(x)=m(x)+K~ and Fλ(x)=PK(x)(x−λf(x))F_\lambda(x)=P_{K(x)}(x-\lambda f(x))Fλ​(x)=PK(x)​(x−λf(x)). Then for every λ>0\lambda>0λ>0 and all vectors y1,y2y^1,y^2y1,y2,

∥Fλ(y1)−Fλ(y2)∥≤[α+(λ2β2+2λ(αβ−δ)+(1+α2−2γ))1/2] ∥y1−y2∥.\|F_\lambda(y^1)-F_\lambda(y^2)\|\le\Bigl[\alpha+\bigl(\lambda^2\beta^2+2\lambda(\alpha\beta-\delta)+(1+\alpha^2-2\gamma)\bigr)^{1/2}\Bigr]\,\|y^1-y^2\| .∥Fλ​(y1)−Fλ​(y2)∥≤[α+(λ2β2+2λ(αβ−δ)+(1+α2−2γ))1/2]∥y1−y2∥.

This is the quantitative core of Theorem 5.3: FλF_\lambdaFλ​ is Lipschitz with the bracketed constant, which is below 111 exactly under the step-size condition of Theorem 5.3.

Formalization Note No sign conditions are imposed on α,β,γ,δ\alpha,\beta,\gamma,\deltaα,β,γ,δ, as in the paper, and the step-size condition of Theorem 5.3 is not assumed. The square root is Real.sqrt; for n≥1n\ge1n≥1 the radicand is nonnegative under the hypotheses (it bounds a squared ratio of norms), so this is the paper's square root; for n=0n=0n=0 both sides vanish.

Preamble
import Mathlib
import Definitions.Def_ChanPangGQVI_Contraction_ProjectionMap

open scoped RealInnerProductSpace
Formal statement
namespace ChanPangGQVI.Contraction

/-- Chan and Pang 1982, §5, proof of Theorem 5.3, last display (p. 221). Under the hypotheses of
Theorem 5.3 (`K̃` nonempty, closed and convex; `m`, `f` Lipschitz with constants `α`, `β` and
strongly monotone with constants `γ`, `δ`, all in the Euclidean norm and inner product), for
every `λ > 0` and all vectors `y¹`, `y²`,
`‖F_λ(y¹) - F_λ(y²)‖ ≤ [α + (λ²β² + 2λ(αβ - δ) + (1 + α² - 2γ))^{1/2}] ‖y¹ - y²‖`.
The condition on `λ` of Theorem 5.3 is not assumed. The radicand is nonnegative whenever
`n ≥ 1` (it bounds a squared norm ratio), so `Real.sqrt` is the paper's square root. -/
theorem lipschitz_estimate {n : ℕ}
    (m f : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n))
    (Ktil : Set (EuclideanSpace ℝ (Fin n)))
    (hK_ne : Ktil.Nonempty) (hK_closed : IsClosed Ktil) (hK_convex : Convex ℝ Ktil)
    (α β γ δ : ℝ)
    (hm_lip : ∀ x y, ‖m x - m y‖ ≤ α * ‖x - y‖)
    (hf_lip : ∀ x y, ‖f x - f y‖ ≤ β * ‖x - y‖)
    (hf_mono : ∀ x y, δ * ‖x - y‖ ^ 2 ≤ ⟪x - y, f x - f y⟫)
    (hm_mono : ∀ x y, γ * ‖x - y‖ ^ 2 ≤ ⟪x - y, m x - m y⟫)
    (lam : ℝ) (hlam : 0 < lam) (y₁ y₂ : EuclideanSpace ℝ (Fin n)) :
    ‖Flam m f Ktil lam y₁ - Flam m f Ktil lam y₂‖ ≤
      (α + Real.sqrt (lam ^ 2 * β ^ 2 + 2 * lam * (α * β - δ) + (1 + α ^ 2 - 2 * γ))) *
        ‖y₁ - y₂‖ := by sorry

end ChanPangGQVI.Contraction
Source
Chan and Pang, The generalized quasi-variational inequality problem, Math. Oper. Res. 7 (1982), p. 221, §5, proof of Theorem 5.3, last display
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me