Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.1, (2.13) — unsuccessful iterations are bounded by successful ones

Proved
AdaptiveCubic.FirstOrder.theorem_2_1

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

cubic-regularisationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1worst-case-complexity

Consider a run of ARC (Algorithm 2.1) with parameters γ2≥γ1>1\gamma_2\ge\gamma_1>1γ2​≥γ1​>1. For j≥0j\ge0j≥0 let Sj={k≤j:ρk≥η1}\mathcal S_j=\{k\le j:\rho_k\ge\eta_1\}Sj​={k≤j:ρk​≥η1​} and Uj={k≤j:ρk<η1}\mathcal U_j=\{k\le j:\rho_k<\eta_1\}Uj​={k≤j:ρk​<η1​} be the successful and the unsuccessful iterations up to jjj (2.9). Let γ3∈(0,1]\gamma_3\in(0,1]γ3​∈(0,1] and suppose (2.10): σk+1≥γ3σk\sigma_{k+1}\ge\gamma_3\sigma_kσk+1​≥γ3​σk​ for every very successful iteration k≤jk\le jk≤j. If σˉ>0\bar\sigma>0σˉ>0 satisfies σk≤σˉ\sigma_k\le\bar\sigmaσk​≤σˉ for all k≤j+1k\le j+1k≤j+1, then

∣Uj∣≤⌈−log⁡γ3log⁡γ1 ∣Sj∣+1log⁡γ1log⁡σˉσ0⌉.|\mathcal U_j|\le\left\lceil-\frac{\log\gamma_3}{\log\gamma_1}\,|\mathcal S_j|+\frac{1}{\log\gamma_1}\log\frac{\bar\sigma}{\sigma_0}\right\rceil.∣Uj​∣≤⌈−logγ1​logγ3​​∣Sj​∣+logγ1​1​logσ0​σˉ​⌉.

The weight is multiplied by at least γ1\gamma_1γ1​ on each unsuccessful iteration and by at least γ3\gamma_3γ3​ on each successful one, so an upper bound on σ\sigmaσ caps the number of unsuccessful iterations in terms of the successful ones. This converts a bound on successful iterations into a bound on all iterations.

Formalization Note The page assumes (2.12), σk≤σˉ\sigma_k\le\bar\sigmaσk​≤σˉ, only for k≤jk\le jk≤j. The proof bounds σj+1\sigma_{j+1}σj+1​ ((2.15)), and the printed statement is false for j=0j=0j=0 with iteration 000 unsuccessful and σˉ=σ0\bar\sigma=\sigma_0σˉ=σ0​ (∣U0∣=1>0|\mathcal U_0|=1>0∣U0​∣=1>0). The hypothesis is therefore posed for k≤j+1k\le j+1k≤j+1.

Preamble
import Mathlib
import Definitions.Def_AdaptiveCubic_Cauchy_IsARCRun

open scoped RealInnerProductSpace
Formal statement
namespace AdaptiveCubic.FirstOrder

/-- Theorem 2.1, (2.13), p. 5 (Cartis, Gould & Toint, ARC Part II, preprint rev. 15 Sep 2009).
For any fixed `j ≥ 0`, with `S_j` the successful and `U_j` the unsuccessful iterations `k ≤ j`
(2.9), assume (2.10) (`σ_{k+1} ≥ γ₃ σ_k` on every very successful `k ≤ j`, `γ₃ ∈ (0, 1]`) and let
`σ̄ > 0` bound `σ_k`. Then `|U_j| ≤ ⌈−(log γ₃ / log γ₁)|S_j| + (1/log γ₁) log(σ̄/σ₀)⌉`.

Correction: the page assumes (2.12) `σ_k ≤ σ̄` only for `k ≤ j`; the proof uses `σ_{j+1} ≤ σ̄`
((2.15) bounds `σ_{j+1}`), and the printed statement fails for `j = 0`, iteration `0` unsuccessful,
`σ̄ = σ₀`. The hypothesis is posed for `k ≤ j + 1`. -/
theorem theorem_2_1 {n : ℕ} (f : EuclideanSpace ℝ (Fin n) → ℝ) (γ₁ γ₂ η₁ η₂ : ℝ)
    (x s : ℕ → EuclideanSpace ℝ (Fin n)) (σ : ℕ → ℝ)
    (B : ℕ → EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n))
    (hrun : AdaptiveCubic.Cauchy.IsARCRun f γ₁ γ₂ η₁ η₂ x s σ B)
    (j : ℕ) (γ₃ : ℝ) (hγ₃ : 0 < γ₃) (hγ₃' : γ₃ ≤ 1)
    (h210 : ∀ k ≤ j, η₂ < AdaptiveCubic.Cauchy.rho f (B k) (σ k) (x k) (s k) → γ₃ * σ k ≤ σ (k + 1))
    (σbar : ℝ) (hσbar : 0 < σbar) (h212 : ∀ k ≤ j + 1, σ k ≤ σbar) :
    (((Finset.range (j + 1)).filter
        (fun k => AdaptiveCubic.Cauchy.rho f (B k) (σ k) (x k) (s k) < η₁)).card : ℤ) ≤
      ⌈-(Real.log γ₃ / Real.log γ₁) *
          (((Finset.range (j + 1)).filter
            (fun k => η₁ ≤ AdaptiveCubic.Cauchy.rho f (B k) (σ k) (x k) (s k))).card : ℝ) +
        1 / Real.log γ₁ * Real.log (σbar / σ 0)⌉ := by sorry

end AdaptiveCubic.FirstOrder
Source
Cartis, Gould & Toint, Adaptive cubic regularisation methods for unconstrained optimization. Part II, preprint rev. 15 Sep 2009 (UNamur), p. 5, Theorem 2.1, (2.13)
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