Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.3, (5) — Minty's characterization: M = {x̄ ∈ C | (Tx, x − x̄) ≥ 0 ∀ x ∈ C}

Proved
MartinetReg.VI.minty

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

hilbert-spaceminty-lemmamonotone-operatorp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1variational-inequality

Let HHH be a real Hilbert space, C⊆HC\subseteq HC⊆H convex, closed and bounded, and T:H→H′T:H\to H'T:H→H′ monotone and hemicontinuous on CCC. Let MMM be the solution set of the variational inequality (1). Then

M={xˉ∈C∣(Tx, x−xˉ)≥0  ∀x∈C}.M=\{\bar x\in C \mid (Tx,\, x-\bar x)\ge 0\ \ \forall x\in C\}.M={xˉ∈C∣(Tx,x−xˉ)≥0  ∀x∈C}.

In words: xˉ∈C\bar x\in Cxˉ∈C solves (Txˉ,x−xˉ)≥0(T\bar x, x-\bar x)\ge0(Txˉ,x−xˉ)≥0 for all x∈Cx\in Cx∈C if and only if (Tx,x−xˉ)≥0(Tx, x-\bar x)\ge0(Tx,x−xˉ)≥0 for all x∈Cx\in Cx∈C, where now the operator is evaluated at the variable point xxx.

The right-hand side is an intersection of weakly closed half-spaces with CCC; this is what lets the weak limit pass in the proof of Théorème 1.

Formalization Note. The paper derives (5) "des propriétés de monotonie et d'hémicontinuité" (citing [1]); we state it under the full standing hypotheses of §2.1 (Standing T C), which is the context of the paper. The free point of CCC is named yyy in Lean.

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

open Filter Topology

/-- §2.3, (5), p. 155: Minty's characterization of the solution set `M` of (1). -/
theorem minty {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
    (T : H → StrongDual ℝ H) (C : Set H) (hS : Standing T C) :
    solSet T C = {xbar | xbar ∈ C ∧ ∀ y ∈ C, 0 ≤ T y (y - xbar)} := 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.3, (5)
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