PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
[parent] proof of Gelfand spectral radius theorem (Proof)

For any $\epsilon>0$ , consider the matrix $$ \tilde{A}=(\rho(A)+\epsilon)^{-1}A $$ Then, obviously, $$ \rho(\tilde{A}) = \frac{\rho(A)}{\rho(A)+\epsilon}<1 $$ and, by a well-known result on convergence of matrix powers, $$ \lim_{k \to \infty}\tilde{A}^k=0. $$ That means, by sequence limit definition, a natural number $N_1\in \mathbf{N}$ exists such that $$ \forall k\geq N_1 \Rightarrow \|\tilde{A}^k\| < 1 $$ which in turn means: $$ \forall k\geq N_1 \Rightarrow \|A^k\| < (\rho(A)+\epsilon)^k $$ or $$ \forall k\geq N_1 \Rightarrow \|A^k\|^{1/k} < (\rho(A)+\epsilon). $$

Let's now consider the matrix $$ \check{A}=(\rho(A)-\epsilon)^{-1}A $$ Then, obviously, $$ \rho(\check{A}) = \frac{\rho(A)}{\rho(A)-\epsilon}>1 $$ and so, by the same convergence theorem,$\|\check{A}^k\|$ is not bounded. This means a natural number $N_2\in \mathbf{N}$ exists such that $$ \forall k\geq N_2 \Rightarrow \|\check{A}^k\|>1 $$ which in turn means: $$ \forall k\geq N_2 \Rightarrow \|A^k\| > (\rho(A)-\epsilon)^k $$ or $$ \forall k\geq N_2 \Rightarrow \|A^k\|^{1/k} > (\rho(A)-\epsilon). $$ Taking $N:=max(N_1,N_2)$ and putting it all together, we obtain: $$ \forall \epsilon>0, \exists N\in\mathbb{N}: \forall k\geq N \Rightarrow \rho(A)-\epsilon < \|A^k\|^{1/k} < \rho(A)+\epsilon $$ which, by definition, is $$ \lim_{k \to \infty}\|A^k\|^{1/k} = \rho(A).\,\,\square $$

Actually, in case the norm is self-consistent, the proof shows more than the thesis; in fact, using the fact that $|\lambda|\leq\rho(A)$ , we can replace in the limit definition the left lower bound with the spectral radius itself and write more precisely: $$ \forall \epsilon>0, \exists N\in\mathbb{N}: \forall k\geq N \Rightarrow \rho(A) \leq \|A^k\|^{1/k} < \rho(A)+\epsilon $$ which, by definition, is $$ \lim_{k \to \infty}\|A^k\|^{1/k} = \rho(A)^+. $$




"proof of Gelfand spectral radius theorem" is owned by Andrea Ambrosio.
(view preamble | get metadata)

View style:


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: spectral radius, lower bound, proof, norm, bounded, theorem, natural number, limit, sequence, powers, matrix

This is version 4 of proof of Gelfand spectral radius theorem, born on 2005-11-06, modified 2006-09-11.
Object id is 7469, canonical name is ProofOfGelfandSpectralRadiusTheorem.
Accessed 1687 times total.

Classification:
AMS MSC34L05 (Ordinary differential equations :: Ordinary differential operators :: General spectral theory)

Pending Errata and Addenda
None.
[ View all 3 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add example | add (any)