Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(3.14), p. 180 — ‖d_k‖²/(g_kᵀd_k)² ≤ Σ_{i=1}^k 1/‖g_i‖²

Proved
DaiYuanCG.Conv.eq_3_14

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

conjugate-gradientdai-yuanp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R, σ<1\sigma<1σ<1, and let (xk,dk,αk)k≥1(x_k,d_k,\alpha_k)_{k\ge1}(xk​,dk​,αk​)k≥1​ be a non-terminating run of Algorithm 2.1 (standard Wolfe steps with constants δ,σ\delta,\sigmaδ,σ, and gk≠0g_k\neq0gk​=0 for every k≥1k\ge1k≥1). Then for every k≥1k\ge1k≥1

∥dk∥2(gkTdk)2≤∑i=1k1∥gi∥2.\frac{\|d_k\|^2}{(g_k^Td_k)^2}\le\sum_{i=1}^{k}\frac{1}{\|g_i\|^2}.(gkT​dk​)2∥dk​∥2​≤i=1∑k​∥gi​∥21​.

It follows from the recurrence (3.13) together with ∥d1∥2/(g1Td1)2=1/∥g1∥2\|d_1\|^2/(g_1^Td_1)^2=1/\|g_1\|^2∥d1​∥2/(g1T​d1​)2=1/∥g1​∥2. With gradients bounded away from zero, it bounds the reciprocal Zoutendijk terms linearly in kkk.

Formalization Note Assumption 3.1 and δ>0\delta>0δ>0 are not used and are dropped. The quotients are Lean divisions with nonzero denominators along the run.

Preamble
import Mathlib
import Definitions.Def_DaiYuanCG_Conv_Setting
Formal statement
namespace DaiYuanCG.Conv

theorem eq_3_14 {n : ℕ} (f : E n → ℝ) (δ σ : ℝ) (hσ1 : σ < 1)
    (x d : ℕ → E n) (α : ℕ → ℝ) (hrun : IsDYRun f δ σ x d α)
    (hnt : ∀ k, 1 ≤ k → gradient f (x k) ≠ 0) :
    ∀ k, 1 ≤ k → ‖d k‖ ^ 2 / inner ℝ (gradient f (x k)) (d k) ^ 2 ≤
      ∑ i ∈ Finset.Icc 1 k, 1 / ‖gradient f (x i)‖ ^ 2 := by sorry

end DaiYuanCG.Conv
Source
Dai and Yuan, A nonlinear conjugate gradient method with a strong global convergence property, SIAM J. Optim. 10 (1999), p. 180, (3.14), proof of Theorem 3.3
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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