Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

CG obeys the Chebyshev A-norm bound in terms of the spectral condition number κ2(A)

Statement

Let A∈Mn(C) be Hermitian positive definite, let x∗ solve Ax=b, let em:=x∗−xm be the error in the mth exact-arithmetic CG iterate, let 0<λmin⁡≤λmax⁡ be the smallest and largest eigenvalues of A, and let

κ:=λmax⁡λmin⁡.

Then for every m≥0,

∥em∥A≤2(κ−1κ+1)m∥e0∥A.

Facts & Assumptions

Given: A Hermitian positive-definite matrix A, the exact solution x∗, the CG iterates xm, the errors em=x∗−xm, and the extremal eigenvalues 0<λmin⁡≤λmax⁡ of A.

[L1]

The mth CG iterate uniquely minimizes the A-norm of the error over x0+Km(A,r0) (CG is the Krylov Galerkin method, and the mth iterate uniquely minimizes the A-norm of the error over x0+Km(A,r0)).

[L3]

A normal endomorphism of a finite-dimensional complex inner-product space has an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).

Proof

technique · direct
1.1L1algebra

Every vector in x0+Km(A,r0) has the form x0+Az(A)e0 for some polynomial z of degree at most m−1, because r0=Ae0. Hence every attainable error has the form e0−Az(A)e0=p(A)e0, where p(0)=1 and deg⁡p≤m. By [L1], the actual CG error therefore satisfies ∥em∥A≤min⁡p(0)=1deg⁡p≤m∥p(A)e0∥A.

2.1L2L3step 1.1algebra

Since A is Hermitian, [L2] and [L3] give an orthonormal basis of eigenvectors, so A=UΛU∗ with U unitary and Λ=diag⁡(λ1,…,λn), where each λj>0. Writing U∗e0=c, one gets ∥p(A)e0∥A2=⟨Ap(A)e0,p(A)e0⟩=∑j=1nλj∣p(λj)∣2∣cj∣2≤max⁡λ∈[λmin⁡,λmax⁡]∣p(λ)∣2 ∥e0∥A2. Thus ∥em∥A≤min⁡p(0)=1deg⁡p≤mmax⁡λ∈[λmin⁡,λmax⁡]∣p(λ)∣ ∥e0∥A.

3.1step 2.1algebra∎

Let t(λ):=λmax⁡+λmin⁡−2λλmax⁡−λmin⁡,pm(λ):=Tm(t(λ))Tm ⁣(λmax⁡+λmin⁡λmax⁡−λmin⁡), where Tm is the mth Chebyshev polynomial. Then pm(0)=1, deg⁡pm=m, and ∣Tm(t)∣≤1 on [−1,1], so max⁡λ∈[λmin⁡,λmax⁡]∣pm(λ)∣≤1∣Tm ⁣(λmax⁡+λmin⁡λmax⁡−λmin⁡)∣. With κ=λmax⁡/λmin⁡, the denominator equals Tm((κ+1)/(κ−1)). For s>1, Tm(s)=(s+s2−1)m+(s−s2−1)m2≥(s+s2−1)m2, and at s=(κ+1)/(κ−1) one has 1s+s2−1=κ−1κ+1. Therefore max⁡λ∈[λmin⁡,λmax⁡]∣pm(λ)∣≤2(κ−1κ+1)m. Combining this polynomial with step 2.1 gives the stated bound.

Depends on

Used by

Dependency tree · two levels

13 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources