Theorem A.1, (A.2) and (A.5), p. 206, at ε = 0 as used in the proof of Theorem 2.4 — CG conjugacy and Krylov spans
ProvedTruncNewton.NegCurv.theorem_A_1_eps_zeroLet be a symmetric linear operator on , let , and let be the conjugate gradient directions of the TNCG minor iteration for and (Steps 1–4, p. 194). Let and suppose that the curvature along every direction up to is positive:
Then the directions are mutually -conjugate and span the Krylov space of :
- (A.2) for , ;
- (A.5) , where denotes the linear span.
This is the part of the Hestenes–Stiefel relations of Theorem A.1 that the proof of Theorem 2.4 uses: conjugacy with positive curvature, and the identification of the directions' span with the Krylov space, are what let one pass from the CG run to the spectral statement of Theorem A.5.
Formalization Note The paper states Theorem A.1 under "Let " with hypothesis ; the proof of Theorem 2.4 applies (A.2) and (A.5) at , where that hypothesis reads , and this item states exactly that case. The page prints (A.5) as , with vectors on the left and on the right; this is a misprint, and the item states the correct (consistent with (A.23)). Symmetry of is the paper's standing setting ( is a Hessian). The other relations (A.3), (A.4), (A.6), (A.7) of Theorem A.1 are not part of this item.
import Mathlib import Definitions.Def_TruncNewton_NegCurv_Setting
namespace TruncNewton.NegCurv
theorem theorem_A_1_eps_zero {n : ℕ}
(H : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n)) (hH : IsSelfAdjoint H)
(g : EuclideanSpace ℝ (Fin n)) (k : ℕ)
(hcurv : ∀ i ≤ k, 0 < inner ℝ ((cg H g i).d) (H (cg H g i).d)) :
(∀ i j, i ≤ k → j ≤ k → i ≠ j → inner ℝ ((cg H g i).d) (H (cg H g j).d) = 0) ∧
Submodule.span ℝ ((fun i => (cg H g i).d) '' Set.Iic k) =
Submodule.span ℝ ((fun i => (H ^ i) g) '' Set.Iic k) := by sorry
end TruncNewton.NegCurv
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.