Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3, p. 8 — the projection onto X* is constant along the segment from x̄ to x

Proved
NecoaraNG.Chain.proj_segment

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1projectionquasi-strong-convexity

Let X⊆RnX\subseteq\mathbb R^nX⊆Rn be convex, let fff be convex on XXX, and let X∗=arg⁡min⁡x∈Xf(x)X^*=\arg\min_{x\in X}f(x)X∗=argminx∈X​f(x) contain a point x∗x^*x∗. Let x∈Xx\in Xx∈X and let xˉ=[x]X∗\bar x=[x]_{X^*}xˉ=[x]X∗​ be a nearest point of X∗X^*X∗ to xxx. Then for every t∈[0,1]t\in[0,1]t∈[0,1], xˉ\bar xxˉ is also a nearest point of X∗X^*X∗ to xˉ+t(x−xˉ)\bar x+t(x-\bar x)xˉ+t(x−xˉ):

[xˉ+t(x−xˉ)]X∗=xˉfor all t∈[0,1].[\bar x+t(x-\bar x)]_{X^*}=\bar x\qquad\text{for all } t\in[0,1].[xˉ+t(x−xˉ)]X∗​=xˉfor all t∈[0,1].

This is the fact used in the proofs of Theorems 1 and 3: along the segment [xˉ,x][\bar x,x][xˉ,x] the projection onto the optimal set does not move, so (10) or (17) can be applied at every point of the segment with the same xˉ\bar xxˉ.

Formalization Note The conclusion is stated with the nearest-point predicate: xˉ∈X∗\bar x\in X^*xˉ∈X∗ and ∥xˉ+t(x−xˉ)−xˉ∥≤∥xˉ+t(x−xˉ)−z∥\|\bar x+t(x-\bar x)-\bar x\|\le\|\bar x+t(x-\bar x)-z\|∥xˉ+t(x−xˉ)−xˉ∥≤∥xˉ+t(x−xˉ)−z∥ for all z∈X∗z\in X^*z∈X∗. The hypotheses on XXX and fff are the paper's standing ones (they make X∗X^*X∗ convex); the closedness of XXX and the Lipschitz gradient are not needed and are omitted.

Preamble
import Mathlib
import Definitions.Def_NecoaraNG_Chain_Setting
Formal statement
namespace NecoaraNG.Chain

open scoped InnerProductSpace

/-- Projection invariance along the segment `[x̄, x]` (proof of Theorem 3, p. 8):
if `x̄ = [x]_{X*}` then `[x̄ + t (x - x̄)]_{X*} = x̄` for every `t ∈ [0, 1]`. -/
theorem proj_segment {n : ℕ} (X : Set (E n)) (hXconv : Convex ℝ X)
    (f : E n → ℝ) (hf : ConvexOn ℝ X f) (xstar : E n) (hxstar : xstar ∈ optSet X f) :
    ∀ x ∈ X, ∀ xbar, IsNearest (optSet X f) x xbar →
      ∀ t ∈ Set.Icc (0 : ℝ) 1, IsNearest (optSet X f) (xbar + t • (x - xbar)) xbar := by sorry

end NecoaraNG.Chain
Source
Necoara, Nesterov & Glineur, Linear convergence of first order methods for non-strongly convex optimization, arXiv:1504.06298v4, p. 8, proof of Theorem 3, sentence after the display
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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