Step 1: ρ(A)≤∥Ak∥1/k for every k. If Av=λv with v=0 (v complex) and ∣λ∣=ρ(A), then Akv=λkv, so ρ(A)k=ρ(Ak) (spectral mapping with p(x)=xk). For a *submultiplicative matrix norm induced by a vector norm*, ∥Ak∥≥ρ(Ak) since ∣Akv∣=∣λ∣k∣v∣ gives ∥Ak∥≥∣λ∣k. For a general submultiplicative norm that is not induced by a vector norm, use the equivalence of norms: ∥⋅∥≥c∥⋅∥op for some c>0, so ∥Ak∥1/k≥c1/kρ(A), and c1/k→1. Either way,
kliminf∥Ak∥1/k≥ρ(A).
Step 2: limsup≤ρ(A). Fix ε>0 and set B=A/(ρ(A)+ε). Then ρ(B)=ρ(A)+ερ(A)<1, so Bk→0 (previous problem), hence ∥Bk∥≤1 for all large k. Equivalently
∥Ak∥≤(ρ(A)+ε)kfor large k,so∥Ak∥1/k≤ρ(A)+ε.
Hence limsup∥Ak∥1/k≤ρ(A)+ε for every ε>0.
Conclusion. liminf≥ρ(A)≥limsup−ε for all ε; the limit exists and equals ρ(A).
Example. A=(0010) has ρ=0 and A2=0: ∥Ak∥1/k=0 for k≥2. For A=(0.9010.9), ∥A50∥1/50≈0.9⋅1.0… approaches 0.9 slowly.
Remark. As a corollary, ρ(A)=inf∥⋅∥∥A∥ over all operator norms: for each ε there is a norm with ∥A∥<ρ(A)+ε. This is the topological meaning of the spectral radius.