Proposition 3.a — the proximal objective ½‖u − z‖² + f(u) has a strict minimum
ProvedMoreauProx.Characterization.prox_strict_minimumLet be a real Hilbert space and . For every the function
has a strict minimum: there is such that for every .
This is what makes the proximal point well defined for every and every : the strict minimum gives both existence and uniqueness of the minimizer.
Formalization Note Values are computed in EReal; the strict inequality is required against every other point, which is stronger than the existence of a minimizer.
import Mathlib import Definitions.Def_MoreauProx_Characterization_GammaZero open scoped InnerProductSpace
namespace MoreauProx.Characterization
theorem prox_strict_minimum {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
(f : H → EReal) (hf : GammaZero f) (z : H) :
∃ x : H, ∀ u : H, u ≠ x →
((‖x - z‖ ^ 2 / 2 : ℝ) : EReal) + f x < ((‖u - z‖ ^ 2 / 2 : ℝ) : EReal) + f u := by sorry
end MoreauProx.Characterization
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be a real Hilbert space: a complete real inner product space. Let belong to , meaning that never takes the value , is finite at some point, has a convex real epigraph , and is lower semicontinuous. Let .
The statement asserts that there exists such that
with the strict inequality taken in .
So is the unique strict minimizer of . When has more than one point, the strict inequality against any forces the left side to be below , so is finite.
Degenerate case. If , there is no . The statement then holds trivially with and says nothing about .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.