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.
Polynomial spectral mapping
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be a unital complex Banach algebra, let , and let be a complex polynomial with constant term and degree at most . Form , with . Then
where spectra are taken in the ambient algebra (Spectrum and resolvent set in a Banach algebra). The identity holds for constant polynomials as well: if then and both sides equal .
Facts & Assumptions
Given: The Axiom of Choice, a unital complex Banach algebra , an element , and a complex polynomial ; write , a finite sum of scalar multiples of powers of .
The algebra is associative, the multiplication is bilinear and ; every polynomial in commutes with , and powers of satisfy the usual index laws (Unital Banach algebra).
For the element is invertible exactly when , and invertibility is a two-sided condition; commuting invertible elements have commuting inverses (Spectrum and resolvent set in a Banach algebra, Invertible element and general linear group of a Banach algebra).
If commute and is invertible, then and are invertible: with one has and , so ; symmetrically . [L1, L2, algebra]
Every nonconstant complex polynomial of degree has a factorisation with and the roots of (Fundamental theorem of algebra by Liouville's theorem).
Under the Axiom of Choice, the spectrum of every element of a nonzero unital complex Banach algebra is nonempty (Spectrum is nonempty compact and norm bounded).
Proof
Constant case: if then and, for , the element is invertible exactly when — its inverse is then — while at it is , which is not invertible in a nonzero algebra. Hence ; and is nonempty by [L5], so as well.
Nonconstant case, factor step: for the polynomial vanishes at , so for a polynomial of degree ; evaluating at gives .
Root factorisation of the translated polynomial: for the polynomial has degree and a leading coefficient , so by [L4] there are with ; evaluating at gives , a product of commuting elements.
Forward inclusion: if then . Indeed, suppose has no zero in ; by [step 1.3] the roots of satisfy , so and each is invertible; the product of commuting invertible elements is invertible, so .
Reverse inclusion: if then . For if were invertible, then by [step 1.2] the commuting product would be invertible, so [L3] would make invertible, contradicting .
Combining [step 2.1] and [step 2.2] with [step 1.1] gives in the nonconstant case and in the constant case, which is the assertion.
Remarks
-
Where the fundamental theorem of algebra is used. The forward inclusion [step 2.1] needs the existence of all roots of , which is Fundamental theorem of algebra by Liouville's theorem. The reverse inclusion needs only polynomial division by the known linear factor .
-
The statement is about the ambient algebra. Both spectra in the theorem are computed in the same unital Banach algebra ; the identity can fail for spectra taken in different algebras, since spectra may shrink in a larger algebra (
cex-spectrum-can-shrink-in-a-larger-banach-algebra). -
Reading order. The example items named by ID above are homed on later pages of the plan, so they are named rather than hyperlinked: a body link to later material must be declared as a forward reference, and Step-5b closure removes every such declaration. Rehoming those items to an earlier page (an owner-only reading-order change) would make the citations backward and restore the links.
Depends on
Used by
Dependency tree · two levels
20 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.1 and the Jordan-form computation of spectra, printed pp. 219–222 (standard reference, not scraped)
- Vahid Shirbisheh, Lectures on C-star Algebras, v2 — §2.3, printed pp. 30–33 (standard reference, not scraped)