The Proximal Map Is One-Lipschitz
ProvedFunctionalInequalities.Analysis.lipschitzWith_proximalPoint_readableThis formalizes the nonexpansiveness property of the proximal map.
Let be a finite-dimensional real inner-product space and let be convex on all of . For the Lean definition proximalPoint f, the map is -Lipschitz:
Equivalently, proximalPoint f is LipschitzWith 1. This declaration supplies a global continuity estimate used by later almost-everywhere differentiability arguments.
Original Lean declaration header
Within namespace FunctionalInequalities.Analysis. Shown in its original module context. Proof omitted.
theorem lipschitzWith_proximalPoint {f : E → ℝ} (hconv : ConvexOn ℝ univ f) :
LipschitzWith 1 (proximalPoint f)
Module navigation
Module: Analysis/Convex/Proximal.
Supporting theorems: exists_subgradient_slope_le_inner_add.
Next: hasFDerivAt_half_sq_sub_moreau.
Source excerpt, lines 162–163 · Frozen source 408915f.
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_Convex_Proximal
open Set
variable {E : Type*}
variable [NormedAddCommGroup E] [InnerProductSpace ℝ E]
variable [FiniteDimensional ℝ E]
theorem FunctionalInequalities.Analysis.lipschitzWith_proximalPoint_readable {f : E → ℝ} (hconv : ConvexOn ℝ univ f) :
LipschitzWith 1 (proximalPoint f) := by sorry
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.