A norm on Mn is a matrix norm when it is submultiplicative,
∥AB∥≤∥A∥⋅∥B∥
Every induced norm ∥A∥∥⋅∥,∥⋅∥ is a matrix norm.
If ∥⋅∥ is a matrix norm and S is invertible, ∥A∥S=∥S−1AS∥ is a matrix norm.
Spectral Radius and Norms
For all A∈Mn and any matrix norm, ρ(A)≤∥A∥.
Proof Let x be an eigenvector of an eigenvalue λ of max modulus, and B:=[x∣x∣⋯∣x]∈Mn. Then
∣λ∣∥B∥=∥λB∥=∥[Ax∣⋯∣Ax]∥=∥AB∥≤∥A∥∥B∥
and ∥B∥=0.
Conversely, for all ε>0 there is a matrix norm ∥⋅∥ on Mn with ∥A∥≤ρ(A)+ε.
Proof Let A=SJS−1 and D=diag(ε,ε2,…,εn). D−1JD has the eigenvalues on the diagonal and ε instead of 1 above it, so its max column sum is at most ρ(A)+ε. Using the matrix norm ∥⋅∥1,1 with SD,
∥A∥(1,1),SD=∥(SD)−1A(SD)∥1,1=∥D−1JD∥1,1≤ρ(A)+ε
Powers of a Matrix
For A∈Mn,
k→∞limAk=0⟺ρ(A)<1
Proof
(⇐) If ρ(A)<1 there is a matrix norm on Mn with ∥A∥<1. Then ∥Ak−0∥≤∥A∥k→0.
(⇒) If Ak→0, then for any eigenpair λ,x, as k→∞, λkx=Akx→0, so ∣λ∣<1.
Gelfand For any matrix norm ∥⋅∥,
k→∞lim∥Ak∥1/k=ρ(A)
Proof
ρ(A)k=ρ(Ak)≤∥Ak∥, so ρ(A)≤∥Ak∥1/k.
For ε>0, ρ(ρ(A)+ε1A)<1, so (ρ(A)+ε1A)k→0.
So there is M such that for all k≥M, (ρ(A)+ε1A)k<1.
So for all such k, ∥Ak∥≤(ρ(A)+ε)k, i.e. ∥Ak∥1/k≤ρ(A)+ε.
Neumann Series
An NLS is complete iff all absolutely convergent series converge.
If ∥⋅∥ is a matrix norm and ∥B∥<1, then I−B is invertible and
(I−B)−1=i=0∑∞Bi
Proof The series converges absolutely since ∥Bi∥≤∥B∥i, and
(I−B)i=0∑NBi=I−BN+1,∥BN+1∥≤∥B∥N+1→0
Equivalently, if ∥I−A∥<1 then
A−1=i=0∑∞(I−A)i
Condition Number
A vector norm ∥⋅∥′ is compatible with a matrix norm ∥⋅∥ when ∥Ax∥′≤∥A∥∥x∥′.