Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 3.3 — ∥∇Ωf(⋅)∥\|\nabla_\Omega f(\cdot)\|∥∇Ω​f(⋅)∥ is lower semicontinuous on Ω\OmegaΩ

Proved
CalamaiMore.ActiveSet.projGrad_norm_lsc

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

lower-semicontinuityp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1projected-gradient

Let Ω\OmegaΩ be a nonempty closed convex subset of a finite-dimensional real inner product space EEE, and let f:E→Rf : E \to \mathbb{R}f:E→R be continuously differentiable on Ω\OmegaΩ. Then the map

x↦∥∇Ωf(x)∥x \mapsto \|\nabla_\Omega f(x)\|x↦∥∇Ω​f(x)∥

is lower semicontinuous on Ω\OmegaΩ: for every sequence {xk}⊆Ω\{x_k\} \subseteq \Omega{xk​}⊆Ω converging to x∈Ωx \in \Omegax∈Ω, ∥∇Ωf(x)∥≤lim inf⁡k∥∇Ωf(xk)∥\|\nabla_\Omega f(x)\| \le \liminf_k \|\nabla_\Omega f(x_k)\|∥∇Ω​f(x)∥≤liminfk​∥∇Ω​f(xk​)∥.

The projected gradient itself need not be continuous, since the tangent cone jumps when the point reaches a new face of Ω\OmegaΩ; lower semicontinuity of its norm is what survives, and it is what shows that the limit of a sequence with ∥∇Ωf(xk)∥→0\|\nabla_\Omega f(x_k)\| \to 0∥∇Ω​f(xk​)∥→0 is stationary.

Formalization Note Lower semicontinuity on Ω\OmegaΩ is Mathlib's LowerSemicontinuousOn, i.e. relative to Ω\OmegaΩ.

Preamble
import Mathlib
import Definitions.Def_CalamaiMore_ActiveSet_projGrad
Formal statement
namespace CalamaiMore.ActiveSet

/-- Calamai–Moré, Lemma 3.3 (p. 104): for `Ω` nonempty closed convex and `f` continuously
differentiable on `Ω`, the map `x ↦ ‖∇_Ω f(x)‖` is lower semicontinuous on `Ω`. -/
theorem projGrad_norm_lsc {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
    [FiniteDimensional ℝ E]
    (Ω : Set E) (hΩne : Ω.Nonempty) (hΩc : IsClosed Ω) (hΩcv : Convex ℝ Ω)
    (f : E → ℝ) (hfd : ∀ x ∈ Ω, DifferentiableAt ℝ f x) (hfc : ContinuousOn (gradient f) Ω) :
    LowerSemicontinuousOn (fun y => ‖projGrad f Ω y‖) Ω := by sorry

end CalamaiMore.ActiveSet
Source
Calamai & Moré, Projected gradient methods for linearly constrained problems, Math. Programming 39 (1987), p. 104, Lemma 3.3
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

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