How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Norm need not equal spectral radius
Statement refuted
Assume the Axiom of Choice (The Axiom of Choice). In with the Euclidean operator norm the matrix
has operator norm and spectral radius (Spectral radius). So the norm of an element of a unital Banach algebra need not equal its spectral radius.
Facts & Assumptions
Given: The Axiom of Choice, the algebra with the Euclidean operator norm, and the matrix acting on column vectors .
In the spectrum of a matrix is and the algebra is a unital Banach algebra with the operator norm (Spectrum in a finite-dimensional matrix algebra).
The spectral radius is , and it is defined under the Axiom of Choice (Spectral radius, Spectrum and resolvent set in a Banach algebra).
Counterexample
, so for every (operator norm on the Euclidean plane), with equality at ; hence .
, and , whose only zero is ; by [L1] the spectrum is .
By [L2] the spectral radius is ; hence the two quantities differ for this element.
Remarks
-
The witness is a nonzero nilpotent of minimal size. is the smallest nonzero nilpotent: its square vanishes and its norm is one, so the gap between norm and spectral radius is already visible on the unit sphere of the matrix algebra.
-
The spectral radius formula records the same gap asymptotically. equals for and for , and its limit is , in agreement with Spectral radius formula.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
14 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Theo Bühler and Dietmar A. Salamon, Functional Analysis — §5.2.2, printed p. 222 (standard reference, not scraped)