Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One-step conjugate-gradient energy contraction

Proved
VectorSpaceOpt.cg_energy_contraction

by wenxinzhang · Aug 25, 2026 · Mathlib 0df444a (Lean v4.33.1)

coercivityconjugate-gradientenergy-estimatelinear-contraction

Let xStar solve Q xStar = b, with Q self-adjoint and satisfying 0 < m ≤ M and the standard quadratic bounds. At any iteration whose search direction is nonzero, the guarded conjugate-gradient step contracts the quadratic error energy by the uniform factor 1 - m/M:

E(xn+1)≤(1−m/M)E(xn),E(x)=⟨x−x∗,Q(x−x∗)⟩.E(x_{n+1}) ≤ (1-m/M)E(x_n), \qquad E(x)=⟨x-x^*,Q(x-x^*)⟩.E(xn+1​)≤(1−m/M)E(xn​),E(x)=⟨x−x∗,Q(x−x∗)⟩.

This is the estimate at the top of printed p. 296. The active-step premise ensures both recurrence denominators are justified; after exact termination the total sequence stutters at a solution and needs no contraction division. The lemma is the quantitative bridge from the recurrence invariants to norm convergence.

Preamble
import Definitions.Def_VectorSpaceOpt_conjugate_gradient
Formal statement
namespace VectorSpaceOpt

/-- Equation at the top of p. 296: the one-step energy contraction. -/
theorem cg_energy_contraction
    {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
    (Q : H →L[ℝ] H) (b x₀ xStar : H) (m M : ℝ)
    (hm : 0 < m) (hmM : m ≤ M) (hxStar : Q xStar = b)
    (hself : IsRealSelfAdjoint Q) (hbounds : IsCoerciveBetween Q m M) :
    ∀ n : ℕ, (conjugateGradientIterate Q b x₀ n).p ≠ 0 →
      conjugateGradientEnergy Q xStar (conjugateGradientIterate Q b x₀ (n + 1)).x ≤
        (1 - m / M) *
          conjugateGradientEnergy Q xStar (conjugateGradientIterate Q b x₀ n).x := by
  sorry

end VectorSpaceOpt
Source
David G. Luenberger, Optimization by Vector Space Methods (Wiley, 1969), Chapter 10, §10.8, energy estimate in the proof of Theorem 1, printed pp. 295–296 (physical PDF pp. 313–314). Scan: https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf

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