Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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 (ACω)). Let X be a nonzero complex Banach space and let T∈B(X). Then every boundary point of the spectrum lies in the approximate point spectrum:

∂σ(T)  ⊆  σap(T)

(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 C.

Facts & Assumptions

Given: An assumed Axiom of Countable Choice, a nonzero complex Banach space X, a bounded T∈B(X) and a point λ∈∂σ(T).

[L1]

σ(T) is closed, so λ∈σ(T); and every neighbourhood of λ meets the resolvent set ρ(T)=C∖σ(T) (Spectrum and resolvent set in a Banach algebra, Spectrum is nonempty compact and norm bounded).

[L2]

For z∈ρ(T) the resolvent R(z):=(z−T)−1 is bounded, and 1=(z−T)R(z)=R(z)(z−T) (Spectrum and resolvent set in a Banach algebra).

[L3]

The invertible group of B(X) is open: if A is invertible and ∥A−B∥<1/∥A−1∥, then B is invertible (Invertible group is open and inversion is continuous). Here one may take A=T−λn, whose inverse is −R(λn) by [L2], and B=T−λ, for which ∥A−B∥=∣λn−λ∣.

[L4]

λ∈σap(T) exactly when T−λ is not bounded below; a bounded-below operator satisfies ∥(T−λ)x∥≥c∥x∥ for all x and some c>0 (A bounded operator that is bounded below, Approximate point and compression spectrum).

[L5]

The Axiom of Countable Choice is the standing hypothesis, used to select the unit vectors below (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1L1L5algebra

Since λ is a boundary point, for each n≥1 the disc {∣z−λ∣<1/n} meets ρ(T); Countable Choice selects λn∈ρ(T) with ∣λn−λ∣<1/n for every n; in particular λn→λ.

1.2L2L3L1algebra

First suppose that the resolvent norms are bounded along this sequence, say ∥R(λn)∥≤M for all n, and suppose M≥1. For n with ∣λn−λ∣<1/(2M) the operator T−λ=(T−λn)+(λn−λ)=(T−λn)(1−(λn−λ)R(λn)) is a product of invertible factors: the displayed identity holds because (T−λn)R(λn)=−1 by [L2], and the second factor is invertible by the Neumann series since ∥(λn−λ)R(λn)∥≤1/2<1. Hence T−λ would be invertible and λ∈ρ(T), contradicting λ∈σ(T).

2.1step 1.1step 1.2algebra

Consequently the norms ∥R(λn)∥ are unbounded; passing to a subsequence, which we relabel, we may assume ∥R(λn)∥→∞.

3.1step 2.1L5algebra

For each n the set of unit vectors x with ∥R(λn)x∥≥12∥R(λn)∥ is nonempty, because the operator norm is the supremum of ∥R(λn)x∥ over the unit sphere; Countable Choice selects such a unit vector xn for every n, and we set yn:=R(λn)xn/∥R(λn)xn∥, a unit vector.

4.1step 3.1L2algebra

Then ∥(T−λn)yn∥=∥xn∥/∥R(λn)xn∥≤2/∥R(λn)∥→0 and ∣λn−λ∣→0, so ∥(T−λ)yn∥≤∥(T−λn)yn∥+∣λn−λ∣→0 along unit vectors.

5.1step 4.1L4∎

By [L4] such a sequence rules out T−λ being bounded below with any constant c>0; hence λ∈σap(T). Since λ∈∂σ(T) was arbitrary, ∂σ(T)⊆σap(T).

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