Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, (5.9)–(5.11), p. 14 — the coefficients (5.11) solve the Hermite interpolation conditions on [0,sk][0,s_k][0,sk​]

Proved
SlowConvergence.ARC.hermite_conditions

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​ be the quintic of the form (2.11) with c0,k=23(1/(k+1))1+3ηc_{0,k} = \tfrac23(1/(k+1))^{1+3\eta}c0,k​=32​(1/(k+1))1+3η, c1,k=−(1/(k+1))23+2ηc_{1,k} = -(1/(k+1))^{\frac23+2\eta}c1,k​=−(1/(k+1))32​+2η, c2,k=0c_{2,k}=0c2,k​=0 and c3,k,c4,k,c5,kc_{3,k}, c_{4,k}, c_{5,k}c3,k​,c4,k​,c5,k​ given by (5.11). Then for every k≥0k\ge0k≥0, with sk=(1/(k+1))13+ηs_k = (1/(k+1))^{\frac13+\eta}sk​=(1/(k+1))31​+η,

pk(0)=23(1k+1)1+3η,pk(sk)=0,(5.9)p_k(0) = \tfrac23\Big(\frac1{k+1}\Big)^{1+3\eta},\qquad p_k(s_k) = 0, \tag{5.9}pk​(0)=32​(k+11​)1+3η,pk​(sk​)=0,(5.9) pk′(0)=−(1k+1)23+2η,pk′(sk)=−(1k+2)23+2η,pk′′(0)=pk′′(sk)=0.(5.10)p_k'(0) = -\Big(\frac1{k+1}\Big)^{\frac23+2\eta},\qquad p_k'(s_k) = -\Big(\frac1{k+2}\Big)^{\frac23+2\eta},\qquad p_k''(0) = p_k''(s_k) = 0. \tag{5.10}pk′​(0)=−(k+11​)32​+2η,pk′​(sk​)=−(k+21​)32​+2η,pk′′​(0)=pk′′​(sk​)=0.(5.10)

These conditions make the glued function f4f_4f4​ twice continuously differentiable across the iterates, with the prescribed values, gradients and zero Hessians there.

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

/-- Cartis, Gould & Toint, preprint 15 Oct 2009, §5, (5.9)–(5.11), p. 14: the quintic `p_k` of the form
(2.11) with coefficients `c_{0,k} = ⅔(1/(k+1))^{1+3η}`, `c_{1,k} = −(1/(k+1))^{2/3+2η}`, `c_{2,k} = 0` and
(5.11) satisfies the interpolation conditions on `[0, s_k]`: for `0 < τ < 1` and every `k ≥ 0`,
(5.9) `p_k(0) = ⅔(1/(k+1))^{1+3η}`, `p_k(s_k) = 0`, and
(5.10) `p_k'(0) = −(1/(k+1))^{2/3+2η}`, `p_k'(s_k) = −(1/(k+2))^{2/3+2η}`, `p_k''(0) = p_k''(s_k) = 0`. -/
theorem hermite_conditions (τ : ℝ) (hτ0 : 0 < τ) (hτ1 : τ < 1) (k : ℕ) :
    p τ k 0 = 2 / 3 * (1 / ((k : ℝ) + 1)) ^ (1 + 3 * eta τ) ∧
      p τ k (sk τ k) = 0 ∧
      deriv (p τ k) 0 = -(1 / ((k : ℝ) + 1)) ^ (2 / 3 + 2 * eta τ) ∧
      deriv (p τ k) (sk τ k) = -(1 / ((k : ℝ) + 2)) ^ (2 / 3 + 2 * eta τ) ∧
      iteratedDeriv 2 (p τ k) 0 = 0 ∧
      iteratedDeriv 2 (p τ k) (sk τ k) = 0 := 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. 14, §5, (5.9)–(5.11); form (2.11), p. 4
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