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.
Boundary of spectrum lies in approximate point spectrum
Statement
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()). Let be a nonzero complex Banach space and let . Then every boundary point of the spectrum lies in the approximate point spectrum:
(spectrum as in Spectrum and resolvent set in a Banach algebra, approximate point spectrum as in Approximate point and compression spectrum). The boundary is taken in .
Facts & Assumptions
Given: An assumed Axiom of Countable Choice, a nonzero complex Banach space , a bounded and a point .
is closed, so ; and every neighbourhood of meets the resolvent set (Spectrum and resolvent set in a Banach algebra, Spectrum is nonempty compact and norm bounded).
For the resolvent is bounded, and (Spectrum and resolvent set in a Banach algebra).
The invertible group of is open: if is invertible and , then is invertible (Invertible group is open and inversion is continuous). Here one may take , whose inverse is by [L2], and , for which .
exactly when is not bounded below; a bounded-below operator satisfies for all and some (A bounded operator that is bounded below, Approximate point and compression spectrum).
The Axiom of Countable Choice is the standing hypothesis, used to select the unit vectors below (The Axiom of Countable Choice ()).
Proof
Since is a boundary point, for each the disc meets ; Countable Choice selects with for every ; in particular .
First suppose that the resolvent norms are bounded along this sequence, say for all , and suppose . For with the operator is a product of invertible factors: the displayed identity holds because by [L2], and the second factor is invertible by the Neumann series since . Hence would be invertible and , contradicting .
Consequently the norms are unbounded; passing to a subsequence, which we relabel, we may assume .
For each the set of unit vectors with is nonempty, because the operator norm is the supremum of over the unit sphere; Countable Choice selects such a unit vector for every , and we set , a unit vector.
Then and , so along unit vectors.
By [L4] such a sequence rules out being bounded below with any constant ; hence . Since was arbitrary, .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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, printed pp. 219–221 (standard reference, not scraped)
- Vahid Shirbisheh, Lectures on C-star Algebras, v2 — §2.3, printed pp. 30–33 (standard reference, not scraped)