Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

(5.1) — conjugate pairs form a monotone relation: (x − x′ | y − y′) ≥ 0

Proved
MoreauProx.Characterization.conjugate_points_monotone

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

convex-analysismonotone-operatorsp2o-batch-p100bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let HHH be a real Hilbert space, f∈Γ0(H)f \in \Gamma_0(H)f∈Γ0​(H) and ggg its dual function. If x,yx, yx,y and x′,y′x', y'x′,y′ are two pairs of points conjugate with respect to fff and ggg, that is,

f(x)+g(y)=(x∣y),f(x′)+g(y′)=(x′∣y′),f(x) + g(y) = (x \mid y), \qquad f(x') + g(y') = (x' \mid y'),f(x)+g(y)=(x∣y),f(x′)+g(y′)=(x′∣y′),

then

(x−x′∣y−y′)≥0.(x - x' \mid y - y') \ge 0.(x−x′∣y−y′)≥0.

The relation "y∈∂f(x)y \in \partial f(x)y∈∂f(x)" is therefore monotone in the sense of Minty. Combined with Moreau's decomposition, this inequality yields the nonexpansiveness of prox⁡f\operatorname{prox}_fproxf​ (Proposition 5.b).

Formalization Note fff and ggg are EReal-valued, and the conjugacy equalities are equalities in EReal.

Preamble
import Mathlib
import Definitions.Def_MoreauProx_Characterization_GammaZero
open scoped InnerProductSpace
Formal statement
namespace MoreauProx.Characterization

theorem conjugate_points_monotone {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
    (f g : H → EReal) (hf : GammaZero f) (hg : g = conj f) (x y x' y' : H)
    (hxy : f x + g y = ((⟪x, y⟫_ℝ : ℝ) : EReal))
    (hxy' : f x' + g y' = ((⟪x', y'⟫_ℝ : ℝ) : EReal)) :
    0 ≤ ⟪x - x', y - y'⟫_ℝ := by sorry

end MoreauProx.Characterization
Source
Moreau, Proximité et dualité dans un espace hilbertien, Bull. Soc. Math. France 93 (1965), p. 281, §5.a, (5.1)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Let HHH be a real Hilbert space. Let f∈Γ0(H)f\in\Gamma_0(H)f∈Γ0​(H): fff never takes the value −∞-\infty−∞, is finite somewhere, has a convex real epigraph, and is lower semicontinuous. Let g=f∗g=f^*g=f∗, where f∗(y)=sup⁡x(⟨x,y⟩−f(x))f^*(y)=\sup_{x}(\langle x,y\rangle-f(x))f∗(y)=supx​(⟨x,y⟩−f(x)) in [−∞,+∞][-\infty,+\infty][−∞,+∞].

Suppose x,y,x′,y′∈Hx,y,x',y'\in Hx,y,x′,y′∈H satisfy

f(x)+g(y)=⟨x,y⟩andf(x′)+g(y′)=⟨x′,y′⟩,f(x)+g(y)=\langle x,y\rangle\quad\text{and}\quad f(x')+g(y')=\langle x',y'\rangle,f(x)+g(y)=⟨x,y⟩andf(x′)+g(y′)=⟨x′,y′⟩,

with the sums taken in [−∞,+∞][-\infty,+\infty][−∞,+∞] and equal to these real numbers. Then the statement asserts

⟨x−x′, y−y′⟩ ≥ 0.\langle x-x',\,y-y'\rangle\ \ge\ 0.⟨x−x′,y−y′⟩ ≥ 0.

Degenerate cases.

  • For x=x′x=x'x=x′ or y=y′y=y'y=y′ the conclusion is 0≥00\ge00≥0.
  • If no pair satisfies the hypotheses, the statement is vacuous.
  • If H={0}H=\{0\}H={0}, the conclusion is 0≥00\ge00≥0.
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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