Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(4.11), p. 23 — any f with gradient (4.11) lies in S(1, 25)

Proved
IQCAlg.HeavyBall.grad_in_S

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

counterexamplelipschitz-gradientp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strong-convexity

Let f:R→Rf:\mathbb R\to\mathbb Rf:R→R be differentiable with f′(x)=∇f(x)f'(x)=\nabla f(x)f′(x)=∇f(x) for every xxx, where ∇f\nabla f∇f is the piecewise-linear map (4.11):

∇f(x)={25xx<1,x+241≤x<2,25x−24x≥2.\nabla f(x)=\begin{cases}25x & x<1,\\ x+24 & 1\le x<2,\\ 25x-24 & x\ge 2.\end{cases}∇f(x)=⎩⎨⎧​25xx+2425x−24​x<1,1≤x<2,x≥2.​

Then f∈S(1,25)f\in S(1,25)f∈S(1,25): fff is continuously differentiable, strongly convex with parameter m=1m=1m=1, and its derivative is Lipschitz with constant L=25L=25L=25.

This is the claim "It is easy to check that ∇f(x)\nabla f(x)∇f(x) is continuous and monotone, and so f∈S(m,L)f\in S(m,L)f∈S(m,L) with m=1m=1m=1 and L=25L=25L=25" of Section 4.6. It shows that the counterexample function lies in the class for which the Heavy-ball tuning of Proposition 1 would be expected to work.

Formalization Note fff is any antiderivative of (4.11) (they differ by constants); the hypothesis is HasDerivAt f (gradF x) x at every point.

Preamble
import Mathlib
import Definitions.Def_IQCAlg_HeavyBall_Setting
Formal statement
namespace IQCAlg.HeavyBall

/-- (4.11) claim, p. 23: every `f : ℝ → ℝ` whose derivative is the gradient (4.11) lies in
`S(1, 25)`. -/
theorem grad_in_S (f : ℝ → ℝ) (hf : ∀ x : ℝ, HasDerivAt f (gradF x) x) :
    InSmL1 f 1 25 := by sorry

end IQCAlg.HeavyBall
Source
Lessard, Recht & Packard, Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints, arXiv:1408.3595v7, p. 23, (4.11) and the sentence after it
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