Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, p. 13 — η(τ)=2τ/(9−6τ)>0\eta(\tau) = 2\tau/(9-6\tau) > 0η(τ)=2τ/(9−6τ)>0 and (5.4) gives (5.1): ∣gk∣=(1/(k+1))2/(3−2τ)|g_k| = (1/(k+1))^{2/(3-2\tau)}∣gk​∣=(1/(k+1))2/(3−2τ)

Proved
SlowConvergence.ARC.gradient_formula

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

lower-boundp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1worst-case-complexity

Let 0<τ<10<\tau<10<τ<1 and η=12(23−2τ−23)\eta = \tfrac12\big(\tfrac2{3-2\tau} - \tfrac23\big)η=21​(3−2τ2​−32​). Then

η=2τ9−6τ>0,23+2η=23−2τ,\eta = \frac{2\tau}{9-6\tau} > 0, \qquad \frac23 + 2\eta = \frac2{3-2\tau},η=9−6τ2τ​>0,32​+2η=3−2τ2​,

and the prescribed gradients gk=−(1/(k+1))23+2ηg_k = -(1/(k+1))^{\frac23+2\eta}gk​=−(1/(k+1))32​+2η of (5.4) satisfy (5.1):

∣gk∣=(1k+1)23−2τfor all k≥0.|g_k| = \Big(\frac1{k+1}\Big)^{\frac2{3-2\tau}} \qquad\text{for all } k\ge0 .∣gk​∣=(k+11​)3−2τ2​for all k≥0.

This is the rate that, through the iteration count, makes ARC need about ϵ−3/2+τ\epsilon^{-3/2+\tau}ϵ−3/2+τ iterations.

Formalization Note The paper says "for any τ>0\tau>0τ>0"; the construction needs τ<1\tau<1τ<1, which is assumed here as everywhere in the mission.

Preamble
import Mathlib
import Definitions.Def_SlowConvergence_ARC_Data
Formal statement
namespace SlowConvergence.ARC

/-- Cartis, Gould & Toint, preprint 15 Oct 2009, §5, p. 13: "where now η = η(τ) def= ½(2/(3 − 2τ) − 2/3)
= 2τ/(9 − 6τ) > 0. Observe that (5.4) gives (5.1) by construction." For `0 < τ < 1`,
`η = 2τ/(9 − 6τ) > 0`, `2/3 + 2η = 2/(3 − 2τ)`, and the prescribed gradients `g_k` of (5.4) satisfy
(5.1): `|g_k| = (1/(k+1))^{2/(3−2τ)}` for all `k ≥ 0`. -/
theorem gradient_formula (τ : ℝ) (hτ0 : 0 < τ) (hτ1 : τ < 1) :
    eta τ = 2 * τ / (9 - 6 * τ) ∧ 0 < eta τ ∧ 2 / 3 + 2 * eta τ = 2 / (3 - 2 * τ) ∧
      ∀ k : ℕ, |gk τ k| = (1 / ((k : ℝ) + 1)) ^ (2 / (3 - 2 * τ)) := by sorry

end SlowConvergence.ARC
Source
Cartis, Gould & Toint, On the complexity of steepest descent, Newton's and regularized Newton's methods, preprint 15 Oct 2009, p. 13, §5, (5.1), (5.4) and η(τ)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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