Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.1 — the monotone variational inequality (1) on a bounded closed convex set has a solution

Proved
MartinetReg.VI.exists_solution

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

existencehilbert-spacemonotone-operatorp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1variational-inequality

Let HHH be a real Hilbert space, C⊆HC\subseteq HC⊆H a nonempty, convex, closed and bounded set, and T:H→H′T:H\to H'T:H→H′ monotone and hemicontinuous on CCC. Then the variational inequality (1) has at least one solution: there exists xˉ∈C\bar x\in Cxˉ∈C with

(Txˉ, x−xˉ)≥0∀x∈C,(T\bar x,\, x-\bar x)\ge 0\qquad\forall x\in C ,(Txˉ,x−xˉ)≥0∀x∈C,

i.e. the solution set MMM is nonempty.

The paper cites this (Lions–Stampacchia, [1]) right after stating (1); the proof of Lemme 1 relies on it when it picks an arbitrary xˉ∈M\bar x\in Mxˉ∈M.

Formalization Note. The paper states "(1) a, au moins, une solution" under the hypotheses of §2.1; we state it with the additional hypothesis that CCC is nonempty, which is implicit in the paper (the claim is false for C=∅C=\emptysetC=∅). H′H'H′ is StrongDual ℝ H and (φ,y)(\varphi,y)(φ,y) is φ y; the standing hypotheses are bundled in Standing T C.

Preamble
import Mathlib
import Definitions.Def_MartinetReg_VI_Setting
Formal statement
namespace MartinetReg.VI

open Filter Topology

/-- §2.1, after (1), p. 155: the variational inequality (1) has at least one solution
(C nonempty is implicit in the paper). -/
theorem exists_solution {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
    (T : H → StrongDual ℝ H) (C : Set H) (hS : Standing T C) (hne : C.Nonempty) :
    (solSet T C).Nonempty := by sorry

end MartinetReg.VI
Source
Martinet, Régularisation d'inéquations variationnelles par approximations successives, R.I.R.O. 4(R-3) (1970), p. 155, §2.1, after (1) (citing Lions–Stampacchia, C.P.A.M. XX (1967) 493–519)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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