Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix B.3, pp. 14–15 — explicit minimizer and minimum of F^t

Proved
CompositeLB.DetSmooth.xstar_closed_form

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

convex-optimizationfinite-sumlower-boundoracle-complexityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1prox-oracle

For m≥2m\ge2m≥2, 1≤t≤k+11\le t\le k+11≤t≤k+1, and orthonormal v0,…,vkv_0,\ldots,v_kv0​,…,vk​, let xt∗=a∑r=0t−1(1−(r+1)/(t+1))vrx_t^*=a\sum_{r=0}^{t-1}(1-(r+1)/(t+1))v_rxt∗​=a∑r=0t−1​(1−(r+1)/(t+1))vr​. This point minimizes FtF^tFt over the entire Euclidean space, and

Ft(xt∗)=−a2⌊m/2⌋8m(1−1t+1).F^t(x_t^*)=-\frac{a^2\lfloor m/2\rfloor}{8m}\left(1-\frac1{t+1}\right).Ft(xt∗​)=−8ma2⌊m/2⌋​(1−t+11​).

This is the value comparison used to obtain the explicit optimization gap. The quadratic ignores directions orthogonal to its displayed span, so the theorem asserts that xt∗x_t^*xt∗​ is a minimizer, without claiming uniqueness.

Preamble
import Mathlib
import Definitions.Def_CompositeLB_DetSmooth_Construction
Formal statement
namespace CompositeLB.DetSmooth

/-- Appendix B.3, pp. 14–15: `xstarT` minimizes the quadratic `F^t` and has
the displayed minimum value. Orthogonal directions make minimizers nonunique. -/
theorem xstar_closed_form {m d k : ℕ} (a : ℝ) (v : ℕ → CompositeLB.DetLip.E d)
    (t : ℕ) (hm : 2 ≤ m) (ht : 1 ≤ t) (htk : t ≤ k + 1)
    (hv : Orthonormal ℝ (fun r : Fin (k + 1) => v (r : ℕ))) :
    (∀ y : CompositeLB.DetLip.E d, Fsum m a v t (xstarT a v t) ≤ Fsum m a v t y) ∧
    Fsum m a v t (xstarT a v t) =
      -(a ^ 2 * ((m / 2 : ℕ) : ℝ) / (8 * (m : ℝ))) *
        (1 - 1 / ((t : ℝ) + 1)) := by sorry

end CompositeLB.DetSmooth
Source
Woodworth & Srebro, arXiv:1605.08003v3, Appendix B.3, p. 14, final display, and p. 15, first two displays
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