Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, p. 14 — ϕk∈(0,1)\phi_k\in(0,1)ϕk​∈(0,1) for all k≥0k\ge0k≥0

Proved
SlowConvergence.ARC.phi_mem

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, η=12(23−2τ−23)\eta = \tfrac12\big(\tfrac2{3-2\tau}-\tfrac23\big)η=21​(3−2τ2​−32​), μ=23+2η\mu = \tfrac23+2\etaμ=32​+2η and

ϕk=(k+1)μ[(1k+1)μ−(1k+2)μ].\phi_k = (k+1)^\mu\Big[\Big(\frac1{k+1}\Big)^\mu - \Big(\frac1{k+2}\Big)^\mu\Big].ϕk​=(k+1)μ[(k+11​)μ−(k+21​)μ].

Then 0<ϕk<10 < \phi_k < 10<ϕk​<1 for every k≥0k\ge0k≥0.

This bounds the coefficients (5.11) of the Hermite pieces uniformly in kkk.

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, p. 14: "The definition of φ_k implies that
φ_k ∈ (0, 1) for all k ≥ 0", where `φ_k = (k+1)^µ[(1/(k+1))^µ − (1/(k+2))^µ]` and `µ = 2/3 + 2η`. -/
theorem phi_mem (τ : ℝ) (hτ0 : 0 < τ) (hτ1 : τ < 1) (k : ℕ) :
    0 < phi τ k ∧ phi τ k < 1 := 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, after (5.11)
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