Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 3.1 — the projected gradient is a steepest descent direction

Proved
CalamaiMore.Convergence.projGrad_properties

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

p2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1projected-gradientstationary-pointtangent-cone

Let Ω\OmegaΩ be a nonempty closed convex subset of a finite-dimensional real inner product space EEE, f:E→Rf : E \to \mathbb Rf:E→R continuously differentiable on Ω\OmegaΩ, x∈Ωx \in \Omegax∈Ω, T(x)T(x)T(x) the tangent cone of Ω\OmegaΩ at xxx and ∇Ωf(x)\nabla_\Omega f(x)∇Ω​f(x) the projected gradient. Then:

  1. −⟨∇f(x),∇Ωf(x)⟩=∥∇Ωf(x)∥2-\langle \nabla f(x), \nabla_\Omega f(x) \rangle = \|\nabla_\Omega f(x)\|^2−⟨∇f(x),∇Ω​f(x)⟩=∥∇Ω​f(x)∥2;
  2. the minimum below is attained and
min⁡{⟨∇f(x),v⟩:v∈T(x), ∥v∥≤1}=−∥∇Ωf(x)∥;\min\{\langle \nabla f(x), v \rangle : v \in T(x),\ \|v\| \le 1\} = -\|\nabla_\Omega f(x)\|;min{⟨∇f(x),v⟩:v∈T(x), ∥v∥≤1}=−∥∇Ω​f(x)∥;
  1. xxx is a stationary point of min⁡{f(z):z∈Ω}\min\{f(z) : z \in \Omega\}min{f(z):z∈Ω} if and only if ∇Ωf(x)=0\nabla_\Omega f(x) = 0∇Ω​f(x)=0.

Part 2 shows that ∇Ωf(x)\nabla_\Omega f(x)∇Ω​f(x) is a steepest descent direction for fff relative to Ω\OmegaΩ; part 3 makes ∥∇Ωf(x)∥\|\nabla_\Omega f(x)\|∥∇Ω​f(x)∥ a measure of stationarity.

Formalization Note The minimum of part 2 is stated as IsLeast of the set of values ⟨∇f(x),v⟩\langle\nabla f(x), v\rangle⟨∇f(x),v⟩, which asserts attainment.

Preamble
import Mathlib
import Definitions.Def_CalamaiMore_Convergence_projGrad
import Definitions.Def_CalamaiMore_Shared_IsStationaryPoint
Formal statement
namespace CalamaiMore.Convergence

/-- Calamai–Moré, Lemma 3.1 (p. 102): (a) `-⟨∇f(x), ∇_Ω f(x)⟩ = ‖∇_Ω f(x)‖²`;
(b) `min {⟨∇f(x), v⟩ : v ∈ T(x), ‖v‖ ≤ 1} = -‖∇_Ω f(x)‖` (the minimum is attained);
(c) `x` is a stationary point iff `∇_Ω f(x) = 0`. -/
theorem projGrad_properties {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) Ω)
    (x : E) (hx : x ∈ Ω) :
    -inner ℝ (gradient f x) (projGrad f Ω x) = ‖projGrad f Ω x‖ ^ 2 ∧
    IsLeast {r : ℝ | ∃ v ∈ CalamaiMore.Shared.tangentCone Ω x, ‖v‖ ≤ 1 ∧ r = inner ℝ (gradient f x) v}
      (-‖projGrad f Ω x‖) ∧
    (CalamaiMore.Shared.IsStationaryPoint f Ω x ↔ projGrad f Ω x = 0) := by sorry

end CalamaiMore.Convergence
Source
Calamai & Moré, Projected gradient methods for linearly constrained problems, Math. Programming 39 (1987), p. 102, Lemma 3.1
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