Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2 (2.17), p. 5, at αk=1\alpha_k = 1αk​=1 — ∣pk′′(t)∣≤1+150∣ϕk∣≤151|p_k''(t)| \le 1 + 150|\phi_k| \le 151∣pk′′​(t)∣≤1+150∣ϕk​∣≤151 on [0,μk][0, \mu_k][0,μk​]

Proved
SlowConvergence.Newton.p_second_deriv_bound

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

hermite-interpolationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1worst-case-complexity

Let 0<τ<10 < \tau < 10<τ<1 and let pkp_kpk​, μk\mu_kμk​ and ϕk=−ψk\phi_k = -\psi_kϕk​=−ψk​ be as in the case αk=1\alpha_k = 1αk​=1 of §2. Then for every k≥0k \ge 0k≥0 and every t∈[0,μk]t \in [0, \mu_k]t∈[0,μk​]

∣pk′′(t)∣  ≤  1+150 ∣ϕk∣  ≤  151.|p_k''(t)| \;\le\; 1 + 150\,|\phi_k| \;\le\; 151 .∣pk′′​(t)∣≤1+150∣ϕk​∣≤151.

The last bound is 1+150max⁡[1,αˉ]/α‾1 + 150\max[1,\bar\alpha]/\underline\alpha1+150max[1,αˉ]/α​ of (2.17) with α‾=αˉ=1\underline\alpha = \bar\alpha = 1α​=αˉ=1.

This is the uniform bound on the second derivative of the first-coordinate function f2,1f_{2,1}f2,1​, half of the statement that f2f_2f2​ has a uniformly bounded Hessian (p. 8).

Formalization Note Only the outer inequalities of the printed chain (2.17) are stated. Its middle line, 2∣c2,k∣+6∣c3,k∣μk+12∣c4,k∣μk2+20∣c5,k∣μk3≤1+150∣ϕk∣2|c_{2,k}| + 6|c_{3,k}|\mu_k + 12|c_{4,k}|\mu_k^2 + 20|c_{5,k}|\mu_k^3 \le 1 + 150|\phi_k|2∣c2,k​∣+6∣c3,k​∣μk​+12∣c4,k​∣μk2​+20∣c5,k​∣μk3​≤1+150∣ϕk​∣, is not true as printed (by (2.14) the left side equals 1+168∣ϕk∣1 + 168|\phi_k|1+168∣ϕk​∣), but the bound ∣pk′′(t)∣≤1+150∣ϕk∣|p_k''(t)| \le 1 + 150|\phi_k|∣pk′′​(t)∣≤1+150∣ϕk​∣ itself holds.

Preamble
import Mathlib
import Definitions.Def_SlowConvergence_Newton_Data
import Definitions.Def_SlowConvergence_Newton_Pieces

open scoped RealInnerProductSpace
Formal statement
namespace SlowConvergence.Newton

/-- Cartis, Gould & Toint, preprint 15 Oct 2009, §2, (2.17), p. 5, in the case `α_k = 1` used for
`f_{2,1} = f_1` (§3, p. 7): for all `k ≥ 0` and all `t ∈ [0, µ_k]`,
`|p_k''(t)| ≤ 1 + 150|φ_k| ≤ 1 + 150 max[1, ᾱ]/α̲`, and with `α_k ≡ 1` (so `α̲ = ᾱ = 1`) the last
bound is `151`.

Formalization Note: only the outer inequalities of the printed chain are stated; the middle line
`2|c_{2,k}| + 6|c_{3,k}|µ_k + 12|c_{4,k}|µ_k² + 20|c_{5,k}|µ_k³ ≤ 1 + 150|φ_k|` is not true as printed
(the left side equals `1 + 168|φ_k|`), but the end-to-end bound is. -/
theorem p_second_deriv_bound (τ : ℝ) (hτ0 : 0 < τ) (hτ1 : τ < 1) (k : ℕ) :
    (∀ t ∈ Set.Icc (0 : ℝ) (mu τ k), |deriv (deriv (p τ k)) t| ≤ 1 + 150 * |phi τ k|) ∧
      1 + 150 * |phi τ k| ≤ 151 := by sorry

end SlowConvergence.Newton
Source
Cartis, Gould & Toint, On the complexity of steepest descent, Newton's and regularized Newton's methods, preprint 15 Oct 2009, p. 5, §2, (2.17); used at α_k = 1 in §3, pp. 7–8
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