Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Eqs. (3.8)–(3.10) — curvature bounds for the correction pairs

Proved
StochQuasiNewton.SQN.curvature_pair_bounds

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

bfgscurvaturep2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1quasi-newton

Let f1,…,fNf_1,\dots,f_Nf1​,…,fN​ be C2C^2C2 functions on Rn\mathbb R^nRn, let 0<λ0<\lambda0<λ, 0<Λ0<\Lambda0<Λ, and suppose that every subsampled Hessian with bHb_HbH​ samples satisfies λI≺∇2FSH(w)≺ΛI\lambda I\prec\nabla^2F_{\mathcal S_H}(w)\prec\Lambda IλI≺∇2FSH​​(w)≺ΛI for all www (Assumption 1(2), Eq. (3.3)). Let SH\mathcal S_HSH​ be a sample with ∣SH∣=bH|\mathcal S_H|=b_H∣SH​∣=bH​, let wˉ∈Rn\bar w\in\mathbb R^nwˉ∈Rn, let s≠0s\neq0s=0, and let y=∇2FSH(wˉ) sy=\nabla^2F_{\mathcal S_H}(\bar w)\,sy=∇2FSH​​(wˉ)s as in (3.8). Then

λ∥s∥2≤yTs≤Λ∥s∥2andλ≤∥y∥2yTs≤Λ.\lambda\|s\|^2\le y^Ts\le\Lambda\|s\|^2\qquad\text{and}\qquad\lambda\le\frac{\|y\|^2}{y^Ts}\le\Lambda .λ∥s∥2≤yTs≤Λ∥s∥2andλ≤yTs∥y∥2​≤Λ.

These are the curvature bounds (3.9) and (3.10) for the correction pairs of the SQN method; they bound the scaling Bt(0)B_t^{(0)}Bt(0)​ and each rank-two term of the L-BFGS update in the proof of Lemma 3.1.

Formalization Note The statement is for an arbitrary nonzero sss and arbitrary point wˉ\bar wwˉ; in the paper s=sj=wˉj−wˉj−1s=s_j=\bar w_j-\bar w_{j-1}s=sj​=wˉj​−wˉj−1​ and wˉ=wˉj\bar w=\bar w_jwˉ=wˉj​.

Preamble
import Mathlib
import Definitions.Def_StochQuasiNewton_SQN_FiniteSum

open scoped RealInnerProductSpace
Formal statement
namespace StochQuasiNewton.SQN

/-- Eqs. (3.8)–(3.10): if every subsampled Hessian with `b_H` samples satisfies
`λ I ≺ ∇²F_{S_H}(w) ≺ Λ I` (3.3) with `0 < λ` and `0 < Λ`, then a correction pair `y = ∇²F_{S_H}(w̄) s` with `s ≠ 0`
satisfies `λ ‖s‖² ≤ yᵀs ≤ Λ ‖s‖²` (3.9) and `λ ≤ ‖y‖² / (yᵀs) ≤ Λ` (3.10). -/
theorem curvature_pair_bounds {n N : ℕ} (f : Fin N → EuclideanSpace ℝ (Fin n) → ℝ)
    (hf : ∀ i, ContDiff ℝ 2 (f i)) (lam Lam : ℝ) (hlam : 0 < lam) (hLam : 0 < Lam) (bH : ℕ)
    (hHess : ∀ SH : Finset (Fin N), SH.card = bH → ∀ w : EuclideanSpace ℝ (Fin n),
      StrictLoewnerBounds lam Lam (subsampledHessian f SH w))
    (SH : Finset (Fin N)) (hSH : SH.card = bH) (wbar s y : EuclideanSpace ℝ (Fin n))
    (hs : s ≠ 0) (hy : y = subsampledHessian f SH wbar s) :
    (lam * ‖s‖ ^ 2 ≤ ⟪y, s⟫ ∧ ⟪y, s⟫ ≤ Lam * ‖s‖ ^ 2) ∧
      (lam ≤ ‖y‖ ^ 2 / ⟪y, s⟫ ∧ ‖y‖ ^ 2 / ⟪y, s⟫ ≤ Lam) := by sorry

end StochQuasiNewton.SQN
Source
Byrd, Hansen, Nocedal, Singer, A Stochastic Quasi-Newton Method for Large-Scale Optimization, SIAM J. Optim. 26(2) (2016), p. 1015, Eqs. (3.8)–(3.10)
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me