Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, (3.9)–(3.10), pp. 7–8 — the knot values and the pieces p_k, q_k are nonnegative, so f2f_2f2​ is bounded below by zero

Proved
SlowConvergence.Newton.bounded_below

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1worst-case-complexity

Let 0<τ<10 < \tau < 10<τ<1 and η=τ/(4−2τ)\eta = \tau/(4-2\tau)η=τ/(4−2τ). Define the knot values of the two coordinate functions by (3.9) and (3.10):

f2,1([x0]1)=12ζ(1+2η),f2,1([xk+1]1)=f2,1([xk]1)−12(1k+1)1+2η,f_{2,1}([x_0]_1) = \tfrac12\zeta(1+2\eta),\qquad f_{2,1}([x_{k+1}]_1) = f_{2,1}([x_k]_1) - \tfrac12\Big(\frac1{k+1}\Big)^{1+2\eta},f2,1​([x0​]1​)=21​ζ(1+2η),f2,1​([xk+1​]1​)=f2,1​([xk​]1​)−21​(k+11​)1+2η, f2,2([x0]2)=12ζ(2),f2,2([xk+1]2)=f2,2([xk]2)−12(1k+1)2.f_{2,2}([x_0]_2) = \tfrac12\zeta(2),\qquad f_{2,2}([x_{k+1}]_2) = f_{2,2}([x_k]_2) - \tfrac12\Big(\frac1{k+1}\Big)^{2}.f2,2​([x0​]2​)=21​ζ(2),f2,2​([xk+1​]2​)=f2,2​([xk​]2​)−21​(k+11​)2.

Then for every k≥0k \ge 0k≥0:

  1. f2,1([xk]1)≥0f_{2,1}([x_k]_1) \ge 0f2,1​([xk​]1​)≥0 and f2,2([xk]2)≥0f_{2,2}([x_k]_2) \ge 0f2,2​([xk​]2​)≥0;
  2. fk=f2,1([xk]1)+f2,2([xk]2)f_k = f_{2,1}([x_k]_1) + f_{2,2}([x_k]_2)fk​=f2,1​([xk​]1​)+f2,2​([xk​]2​), where fkf_kfk​ is the prescribed value (3.3);
  3. consequently fk≥0f_k \ge 0fk​≥0;
  4. the Hermite pieces are nonnegative on their intervals: pk(t)≥0p_k(t) \ge 0pk​(t)≥0 for t∈[0,μk]t \in [0,\mu_k]t∈[0,μk​] and qk(t)≥0q_k(t) \ge 0qk​(t)≥0 for t∈[0,1]t \in [0,1]t∈[0,1], where pkp_kpk​ is the quintic (2.11) with coefficients (2.14) at αk=1\alpha_k = 1αk​=1 and qkq_kqk​ the quintic of pp. 7–8.

Since f2([x]1,[x]2)=pk([x]1−[xk]1)+f2,1([xk+1]1)+qj([x]2−j)+f2,2([xj+1]2)f_2([x]_1,[x]_2) = p_k([x]_1 - [x_k]_1) + f_{2,1}([x_{k+1}]_1) + q_j([x]_2 - j) + f_{2,2}([x_{j+1}]_2)f2​([x]1​,[x]2​)=pk​([x]1​−[xk​]1​)+f2,1​([xk+1​]1​)+qj​([x]2​−j)+f2,2​([xj+1​]2​) on the cell [[xk]1,[xk+1]1]×[j,j+1][[x_k]_1,[x_{k+1}]_1] \times [j, j+1][[xk​]1​,[xk+1​]1​]×[j,j+1], items 1 and 4 give f2≥0f_2 \ge 0f2​≥0 on the whole nonnegative quadrant where the page builds f2f_2f2​.

Each knot value is a tail of a convergent zeta series, which is why the decreasing sequence of function values stays above zero; this is the step "f2f_2f2​ is bounded below by zero" of the example.

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, §3, (3.9)–(3.10), p. 7 and p. 8: "The fact that f_2 is
bounded below by zero results from (3.10) and the fact that ζ(2) = π²/6." For `0 < τ < 1` and every
`k ≥ 0`, the knot values `f_{2,1}([x_k]_1)` of (3.9) and `f_{2,2}([x_k]_2)` of (3.10) are nonnegative,
they add up to the prescribed value `f_k` of (3.3), and hence `f_k ≥ 0`. Moreover the pieces are
nonnegative on their intervals, `p_k ≥ 0` on `[0, µ_k]` and `q_k ≥ 0` on `[0, 1]`, so that
`f_2([x]_1, [x]_2) = p_k([x]_1 − [x_k]_1) + f_{2,1}([x_{k+1}]_1) + q_j([x]_2 − j) + f_{2,2}(j + 1) ≥ 0`
everywhere on the nonnegative quadrant where the page builds `f_2`. -/
theorem bounded_below (τ : ℝ) (hτ0 : 0 < τ) (hτ1 : τ < 1) (k : ℕ) :
    0 ≤ f21knot τ k ∧ 0 ≤ f22knot k ∧ fk τ k = f21knot τ k + f22knot k ∧ 0 ≤ fk τ k ∧
      (∀ t ∈ Set.Icc (0 : ℝ) (mu τ k), 0 ≤ p τ k t) ∧
      (∀ t ∈ Set.Icc (0 : ℝ) 1, 0 ≤ q k t) := 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, (3.9)–(3.10); p. 8, §3; (3.3), p. 6
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