# Gelfand's Formula. $r(T)=\lim_{n \to\infty}\sqrt[n]{\|T^{n}\|}$

Can you indicate me a material where I cand find the proof of Gelfand's Formula. I heard that there is a proof with polynomials.

Gelfand's Formula :

If $T \in B(X)$ then: $$r(T)=\lim_{n \to\infty}\sqrt[n]{\|T^{n}\|}$$

-

## 1 Answer

I do not know of any proof using just polynomials. All the proofs I have seen involve complex analysis to a certain extent, either Laurent series expansions, Liouville's theorem, or Hadamard's Theorem.

I am pretty sure that most books on functional analysis which cover Banach spaces and/or Banach algebras will contain a proof, for example:

G. F. Simmons - Introduction to Topology and Modern Analysis - page 312 in my (old) edition.

Riesz and Nagy - Functional Analysis - section 149 (page 425 in my Dover edition).

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 2, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8505398035049438, "perplexity_flag": "head"}