Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1 i) (3.3) — Cauchy decrease of the cubic model

Proved
AdaptiveCubic.Cauchy.lemma_3_1_i

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

cauchy-pointcubic-regularisationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R, x∈Rnx\in\mathbb R^nx∈Rn with gradient g=∇f(x)g=\nabla f(x)g=∇f(x), BBB a symmetric matrix and σ>0\sigma>0σ>0, and let mmm be the cubic model at xxx with these data. If the step sss satisfies the Cauchy condition (2.2), i.e. m(s)≤m(−αg)m(s)\le m(-\alpha g)m(s)≤m(−αg) for every α≥0\alpha\ge0α≥0, then

f(x)−m(s)≥∥g∥62 min⁡[∥g∥1+∥B∥, 12∥g∥σ],f(x)-m(s)\ge\frac{\|g\|}{6\sqrt2}\,\min\left[\frac{\|g\|}{1+\|B\|},\ \frac12\sqrt{\frac{\|g\|}{\sigma}}\right],f(x)−m(s)≥62​∥g∥​min[1+∥B∥∥g∥​, 21​σ∥g∥​​],

where ∥B∥\|B\|∥B∥ is the operator norm induced by the Euclidean norm.

This is the basic model decrease guaranteed by the Cauchy point; in particular m(s)<f(x)m(s)<f(x)m(s)<f(x) whenever g≠0g\neq0g=0, which is (2.7). The result is quoted from Part I of the paper (Lemma 2.1 there).

Formalization Note The statement concerns one iteration, so the index kkk is dropped. At g=0g=0g=0 the left-hand side is 000 and the inequality reads 0≤f(x)−m(s)0\le f(x)-m(s)0≤f(x)−m(s); it is not excluded. BBB is a continuous linear operator on EuclideanSpace ℝ (Fin n).

Preamble
import Mathlib
import Definitions.Def_AdaptiveCubic_Cauchy_IsARCRun

open scoped RealInnerProductSpace
Formal statement
namespace AdaptiveCubic.Cauchy

/-- Lemma 3.1 i), (3.3), p. 7 (Cartis, Gould & Toint, ARC Part II, preprint rev. 15 Sep 2009;
quoted from Part I, Lemma 2.1). For one iteration with iterate `x`, symmetric `B`, weight `σ > 0`
and a step `s` satisfying the Cauchy condition (2.2) (`m(s) ≤ m(−α g)` for all `α ≥ 0`):
`f(x) − m(s) ≥ (‖g‖ / (6√2)) · min(‖g‖ / (1 + ‖B‖), ½ √(‖g‖/σ))`, with `g = ∇f(x)`. -/
theorem lemma_3_1_i {n : ℕ} (f : EuclideanSpace ℝ (Fin n) → ℝ)
    (B : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n)) (hB : IsSelfAdjoint B)
    (σ : ℝ) (hσ : 0 < σ) (x s : EuclideanSpace ℝ (Fin n))
    (hcauchy : ∀ α : ℝ, 0 ≤ α → model f B σ x s ≤ model f B σ x (-(α • gradient f x))) :
    ‖gradient f x‖ / (6 * √2) *
        min (‖gradient f x‖ / (1 + ‖B‖)) (1 / 2 * √(‖gradient f x‖ / σ)) ≤
      f x - model f B σ x s := by sorry

end AdaptiveCubic.Cauchy
Source
Cartis, Gould & Toint, Adaptive cubic regularisation methods for unconstrained optimization. Part II, preprint rev. 15 Sep 2009 (UNamur), p. 7, Lemma 3.1 i), (3.3)
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