Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6 — a strongly convex function has a unique minimizer on Q, with quadratic growth

Proved
PrimalDualSubgrad.DA.lemma_6

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1strong-convexity

Let QQQ be a nonempty closed convex set in a finite-dimensional real normed space EEE, and let ddd be continuous on QQQ and strongly convex on QQQ with convexity parameter σ>0\sigma > 0σ>0: for all x,y∈Qx, y \in Qx,y∈Q, α∈[0,1]\alpha \in [0,1]α∈[0,1], d(αx+(1−α)y)≤αd(x)+(1−α)d(y)−12σα(1−α)∥x−y∥2d(\alpha x + (1-\alpha)y) \le \alpha d(x) + (1-\alpha)d(y) - \frac12\sigma\alpha(1-\alpha)\|x-y\|^2d(αx+(1−α)y)≤αd(x)+(1−α)d(y)−21​σα(1−α)∥x−y∥2 (9.3). Then the problem min⁡x∈Qd(x)\min_{x \in Q} d(x)minx∈Q​d(x) (9.4) has a unique solution x∗x^*x∗, and for every x∈Qx \in Qx∈Q

d(x)≥d(x∗)+12σ∥x−x∗∥2.(9.5)d(x) \ge d(x^*) + \tfrac12 \sigma \|x - x^*\|^2. \qquad (9.5)d(x)≥d(x∗)+21​σ∥x−x∗∥2.(9.5)

The lemma makes the prox-center and the argmin map πβ\pi_\betaπβ​ well defined, and (9.5) applied to −⟨s,⋅⟩+βd-\langle s, \cdot\rangle + \beta d−⟨s,⋅⟩+βd is the quadratic growth used in Lemma 1 and Theorem 1.

Formalization Note Nonemptiness of QQQ and finite dimension of EEE are implicit on the page (the proof starts from a nonempty level set; EEE is finite-dimensional throughout the paper). The norm is arbitrary.

Preamble
import Mathlib
Formal statement
namespace PrimalDualSubgrad.DA

/-- Lemma 6 (p. 36). Let `Q` be a nonempty closed convex set in a finite-dimensional real normed
space and `d` a function continuous on `Q` and strongly convex on `Q` with parameter `σ > 0`
(Definition 1, (9.3)). Then `min_{x ∈ Q} d(x)` (9.4) has a unique solution `x*`, and
`d(x) ≥ d(x*) + σ/2 ‖x − x*‖²` for every `x ∈ Q` (9.5). -/
theorem lemma_6 {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    (Q : Set E) (d : E → ℝ) (σ : ℝ)
    (hQc : IsClosed Q) (hQconv : Convex ℝ Q) (hQne : Q.Nonempty)
    (hd : ContinuousOn d Q) (hσ : 0 < σ) (hsc : StrongConvexOn Q σ d) :
    (∃! xs : E, xs ∈ Q ∧ ∀ x ∈ Q, d xs ≤ d x) ∧
      ∀ xs ∈ Q, (∀ x ∈ Q, d xs ≤ d x) → ∀ x ∈ Q, d xs + σ / 2 * ‖x - xs‖ ^ 2 ≤ d x := by sorry

end PrimalDualSubgrad.DA
Source
Nesterov, Primal-dual subgradient methods for convex problems, Math. Program. 120 (2009), p. 36, Lemma 6 (with Definition 1, (9.3), (9.4))
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me