Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.2 (Minty), p. 3 — for continuous monotone F, solutions of (1.1) are the solutions of the dual VI

Proved
ProjReflGrad.Weak.lemma_2_2

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

mintymonotone-operatorp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1variational-inequality

Let HHH be a real inner product space, C⊆HC\subseteq HC⊆H convex, and F:H→HF:H\to HF:H→H continuous on CCC and monotone on CCC, i.e. ⟨F(x)−F(y),x−y⟩≥0\langle F(x)-F(y),x-y\rangle\ge0⟨F(x)−F(y),x−y⟩≥0 for all x,y∈Cx,y\in Cx,y∈C. Then x∗x^*x∗ is a solution of (1.1), that is x∗∈Cx^*\in Cx∗∈C and ⟨F(x∗),x−x∗⟩≥0\langle F(x^*),x-x^*\rangle\ge0⟨F(x∗),x−x∗⟩≥0 for all x∈Cx\in Cx∈C, if and only if x∗x^*x∗ solves

find x∈C such that ⟨F(y),y−x⟩≥0∀y∈C.\text{find }x\in C\text{ such that }\langle F(y),y-x\rangle\ge0\qquad\forall y\in C .find x∈C such that ⟨F(y),y−x⟩≥0∀y∈C.

The dual formulation is linear in xxx, which makes it stable under weak limits; it is how weak cluster points of the iterates are shown to be solutions.

Formalization Note. The paper takes F:C→HF:C\to HF:C→H; here FFF is defined on all of HHH and only its restriction to CCC is constrained. Convexity of CCC is the standing assumption of (1.1). Closedness and completeness are not needed and not assumed.

Preamble
import Mathlib
import Definitions.Def_ProjReflGrad_Weak_Setting
Formal statement
namespace ProjReflGrad.Weak

/-- Lemma 2.2 (Minty) (Malitsky 2015, p. 3): for `C` convex and `F` continuous and monotone on `C`,
`x*` solves (1.1) iff `x* ∈ C` and `⟨F(y), y - x*⟩ ≥ 0` for all `y ∈ C`. -/
theorem lemma_2_2 {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
    (C : Set H) (hCcv : Convex ℝ C) (F : H → H) (hcont : ContinuousOn F C)
    (hmono : ∀ x ∈ C, ∀ y ∈ C, 0 ≤ inner ℝ (F x - F y) (x - y)) (xs : H) :
    xs ∈ solSet C F ↔ xs ∈ C ∧ ∀ y ∈ C, 0 ≤ inner ℝ (F y) (y - xs) := by sorry

end ProjReflGrad.Weak
Source
Malitsky, Projected Reflected Gradient Methods for Monotone Variational Inequalities, arXiv:1502.04968v1, p. 3, Lemma 2.2 (Minty)
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