Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, (3.5) — c1∥gk∥/∥dk∥≤cos⁡θk≤c2∥gk∥/∥dk∥c_1\|g_k\|/\|d_k\| \le \cos\theta_k \le c_2\|g_k\|/\|d_k\|c1​∥gk​∥/∥dk​∥≤cosθk​≤c2​∥gk​∥/∥dk​∥ for methods with ∣βk∣≤βkFR|\beta_k| \le \beta_k^{FR}∣βk​∣≤βkFR​

Proved
NonlinCG.FRBound.cos_theta_bounds

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

conjugate-gradientfletcher-reevesnonlinear-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Under the hypotheses of Lemma 3.1 — Assumptions 2.1, a method of the form (1.2)–(1.3) with ∣βk∣≤βkFR|\beta_k| \le \beta_k^{FR}∣βk​∣≤βkFR​ for k≥2k \ge 2k≥2, steplengths satisfying (2.17) with 0<σ2<120 < \sigma_2 < \tfrac120<σ2​<21​, and no vanishing gradient — there are positive constants c1c_1c1​ and c2c_2c2​ such that for every k≥1k \ge 1k≥1

c1 ∥gk∥∥dk∥  ≤  cos⁡θk  ≤  c2 ∥gk∥∥dk∥,(3.5)c_1\,\frac{\|g_k\|}{\|d_k\|} \;\le\; \cos\theta_k \;\le\; c_2\,\frac{\|g_k\|}{\|d_k\|}, \tag{3.5}c1​∥dk​∥∥gk​∥​≤cosθk​≤c2​∥dk​∥∥gk​∥​,(3.5)

where cos⁡θk=−⟨gk,dk⟩/(∥gk∥ ∥dk∥)\cos\theta_k = -\langle g_k, d_k\rangle/(\|g_k\|\,\|d_k\|)cosθk​=−⟨gk​,dk​⟩/(∥gk​∥∥dk​∥) (2.1).

Thus, for the Fletcher–Reeves method or any method with ∣βk∣≤βkFR|\beta_k| \le \beta_k^{FR}∣βk​∣≤βkFR​, cos⁡θk\cos\theta_kcosθk​ is proportional to ∥gk∥/∥dk∥\|g_k\|/\|d_k\|∥gk​∥/∥dk​∥. The left inequality, combined with the Zoutendijk condition, is what turns a bound on the growth of ∥dk∥\|d_k\|∥dk​∥ into convergence in Theorem 3.2.

Formalization Note The paper states existence of c1,c2c_1, c_2c1​,c2​; its derivation from (2.1) and (3.2) gives c1=(1−2σ2)/(1−σ2)c_1 = (1-2\sigma_2)/(1-\sigma_2)c1​=(1−2σ2​)/(1−σ2​) and c2=1/(1−σ2)c_2 = 1/(1-\sigma_2)c2​=1/(1−σ2​), but the statement asserts existence only. The constants may depend on σ2\sigma_2σ2​ but are uniform in kkk. The hypothesis gk≠0g_k \ne 0gk​=0 is that of Lemma 3.1 (the paper divides by ∥gk∥\|g_k\|∥gk​∥). Global C1C^1C1 from (1.1), finite-dimensional real inner product space, indices from 111, positive steplengths, as in the definition file.

Preamble
import Mathlib
import Definitions.Def_NonlinCG_FRBound_Setting
Formal statement
namespace NonlinCG.FRBound

/-- Display (3.5) (Gilbert–Nocedal, INRIA RR-1268, §3, p. 7): under the hypotheses of Lemma 3.1
there are positive constants `c₁, c₂` with `c₁ ‖g_k‖/‖d_k‖ ≤ cos θ_k ≤ c₂ ‖g_k‖/‖d_k‖` for all
`k ≥ 1`. -/
theorem cos_theta_bounds {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
    [FiniteDimensional ℝ E] (f : E → ℝ) (hf : ContDiff ℝ 1 f) (β α : ℕ → ℝ) (x d : ℕ → E)
    (σ₂ : ℝ) (hA : Assumptions21 f (x 1)) (hrun : IsCGRun f β α x d)
    (hβ : ∀ k ≥ 2, |β k| ≤ betaFR f x k)
    (hσ : 0 < σ₂ ∧ σ₂ < 1 / 2)
    (hls : ∀ k ≥ 1,
      |inner ℝ (gradient f (x k + α k • d k)) (d k)| ≤ -σ₂ * inner ℝ (g f x k) (d k))
    (hg : ∀ k ≥ 1, g f x k ≠ 0) :
    ∃ c₁ c₂ : ℝ, 0 < c₁ ∧ 0 < c₂ ∧ ∀ k ≥ 1,
      c₁ * (‖g f x k‖ / ‖d k‖) ≤ cosTheta f x d k ∧
      cosTheta f x d k ≤ c₂ * (‖g f x k‖ / ‖d k‖) := by sorry

end NonlinCG.FRBound
Source
Gilbert & Nocedal, Global convergence properties of conjugate gradient methods for optimization, INRIA Rapport de Recherche 1268 (June 1990), HAL inria-00075291v1, §3, (3.5), p. 7
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