In mathematics, the Bauer–Fike theorem is a standard result in the perturbation theory of the eigenvalue of a complex-valued diagonalizable matrix. In its substance, it states an absolute upper bound for the deviation of one perturbed matrix eigenvalue from a properly chosen eigenvalue of the exact matrix. Informally speaking, what it says is that the sensitivity of the eigenvalues is estimated by the condition number of the matrix of eigenvectors.
The theorem was proved by Friedrich L. Bauer and C. T. Fike in 1960.
In what follows we assume that:
- A ∈ Cn,n is a diagonalizable matrix;
- V ∈ Cn,n is the non-singular eigenvector matrix such that A = VΛV −1, where Λ is a diagonal matrix.
- If X ∈ Cn,n is invertible, its condition number in p-norm is denoted by κp(X) and defined by:
The Bauer–Fike Theorem
- Bauer–Fike Theorem. Let μ be an eigenvalue of A + δA then there exists λ ∈ σ(A) such that:
Proof. We can suppose μ ∉ σ(A), otherwise take λ = μ and the result is trivially true since κp(V) ≥ 1. Since μ is an eigenvalue of A + δA, we have det(A + δA − μI) = 0 and so
However our assumption, μ ∉ σ(A), implies that: det(Λ − μI) ≠ 0 and therefore we can write:
This reveals −1 to be an eigenvalue of
Since all p-norms are consistent matrix norms we have |λ| ≤ ||A||p where λ is an eigenvalue of A. In this instance this gives us:
But (Λ − μI)−1 is a diagonal matrix, the p-norm of which is easily computed:
An Alternate Formulation
The theorem can also be reformulated to better suit numerical methods. In fact, dealing with real eigensystem problems, one often has an exact matrix A, but knows only an approximate eigenvalue-eigenvector couple, (λa, va ) and needs to bound the error. The following version comes in help.
- Bauer–Fike Theorem (Alternate Formulation). Let (λa, va ) be an approximate eigenvalue-eigenvector couple, and r = Ava − λava. Then there exists λ ∈ σ(A) such that:
Proof. We can suppose λa ∉ σ(A), otherwise take λ = λa and the result is trivially true since κp(V) ≥ 1. So (A − λaI)−1 exists, so we can write:
since A is diagonalizable; taking the p-norm of both sides, we obtain:
is a diagonal matrix and its p-norm is easily computed:
A Relative Bound
Both formulations of Bauer–Fike theorem yield an absolute bound. The following corollary is useful whenever a relative bound is needed:
- Corollary. Suppose A is invertible and that μ is an eigenvalue of A + δA. Then there exists λ ∈ σ(A) such that:
Note. ||A−1δA|| can be formally viewed as the relative variation of A, just as |λ − μ|/ is the relative variation of λ.
Proof. Since μ is an eigenvalue of A + δA and det(A) ≠ 0, by multiplying by −A−1 from left we have:
If we set:
then we have:
which means that 1 is an eigenvalue of Aa + (δA)a, with v as an eigenvector. Now, the eigenvalues of Aa are μ/, while it has the same eigenvector matrix as A. Applying the Bauer–Fike theorem to Aa + (δA)a with eigenvalue 1, gives us:
The Case of Normal Matrices
so that κ2(V) = 1. The Bauer–Fike theorem then becomes:
Or in alternate formulation:
which obviously remains true if A is a Hermitian matrix. In this case, however, a much stronger result holds, known as the Weyl's theorem on eigenvalues. In the hermitian case on can also restate the Bauer–Fike theorem in the form that the map A ↦ σ(A) that maps a matrix to its spectrum is a Non-expansive function with respect to the Hausdorff distance on the set of compact subsets of C.
- F. L. Bauer and C. T. Fike. Norms and exclusion theorems. Numer. Math. 2 (1960), 137–141.
- S. C. Eisenstat and I. C. F. Ipsen. Three absolute perturbation bounds for matrix eigenvalues imply relative bounds. SIAM Journal on Matrix Analysis and Applications Vol. 20, N. 1 (1998), 149–158