Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 7 with §2 (2.11)–(2.14), p. 4 — pkp_kpk​ meets the Hermite conditions at αk=1\alpha_k = 1αk​=1

Proved
SlowConvergence.Newton.hermite_p_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, η=τ/(4−2τ)\eta = \tau/(4-2\tau)η=τ/(4−2τ), μk=(1/(k+1))12+η\mu_k = (1/(k+1))^{\frac12+\eta}μk​=(1/(k+1))21​+η, and let pkp_kpk​ be the quintic (2.11) with the coefficients of p. 4 and (2.14) in the case αk=1\alpha_k = 1αk​=1. Then for every k≥0k \ge 0k≥0

pk(0)=12(1k+1)1+2η,pk(μk)=0,(2.12)p_k(0) = \tfrac12\Big(\frac1{k+1}\Big)^{1+2\eta},\qquad p_k(\mu_k) = 0, \tag{2.12}pk​(0)=21​(k+11​)1+2η,pk​(μk​)=0,(2.12) pk′(0)=−(1k+1)12+η,pk′(μk)=−(1k+2)12+η,(2.13)p_k'(0) = -\Big(\frac1{k+1}\Big)^{\frac12+\eta},\qquad p_k'(\mu_k) = -\Big(\frac1{k+2}\Big)^{\frac12+\eta}, \tag{2.13}pk′​(0)=−(k+11​)21​+η,pk′​(μk​)=−(k+21​)21​+η,(2.13) pk′′(0)=pk′′(μk)=1.p_k''(0) = p_k''(\mu_k) = 1 .pk′′​(0)=pk′′​(μk​)=1.

These are the conditions that make the piecewise function f2,1f_{2,1}f2,1​ (equal to pkp_kpk​ on the kkk-th interval, shifted by the next knot value) twice continuously differentiable on [0,∞)[0,\infty)[0,∞), with the values (3.9), slopes −μk-\mu_k−μk​ and curvature 111 at the knots required by (3.3)–(3.4).

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.11)–(2.15), p. 4, in the case `α_k = 1` used
for `f_{2,1} = f_1` in §3, p. 7: the quintic `p_k` with coefficients `c_{0,k}, c_{1,k}, c_{2,k}` and
(2.14) satisfies the Hermite conditions on `[0, µ_k]`:
`p_k(0) = ½(1/(k+1))^{1+2η}`, `p_k(µ_k) = 0` (2.12), `p_k'(0) = −(1/(k+1))^{1/2+η}`,
`p_k'(µ_k) = −(1/(k+2))^{1/2+η}` (2.13), and `p_k''(0) = p_k''(µ_k) = 1`. -/
theorem hermite_p_conditions (τ : ℝ) (hτ0 : 0 < τ) (hτ1 : τ < 1) (k : ℕ) :
    p τ k 0 = 1 / 2 * (1 / ((k : ℝ) + 1)) ^ (1 + 2 * eta τ) ∧
      p τ k (mu τ k) = 0 ∧
      deriv (p τ k) 0 = -((1 / ((k : ℝ) + 1)) ^ (1 / 2 + eta τ)) ∧
      deriv (p τ k) (mu τ k) = -((1 / ((k : ℝ) + 2)) ^ (1 / 2 + eta τ)) ∧
      deriv (deriv (p τ k)) 0 = 1 ∧
      deriv (deriv (p τ k)) (mu τ k) = 1 := 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. 7, §3 (f_{2,1} = f_1 with α_k = 1); p. 4, §2, (2.11)–(2.14)
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