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 TB(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 TB(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):=(zT)1 is bounded, and 1=(zT)R(z)=R(z)(zT) (Spectrum and resolvent set in a Banach algebra).

[L3]

The invertible group of B(X) is open: if A is invertible and AB<1/A1, 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 AB=λnλ.

[L4]

λσap(T) exactly when Tλ is not bounded below; a bounded-below operator satisfies (Tλ)xcx 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.1

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

L1L5algebra
1.2

First suppose that the resolvent norms are bounded along this sequence, say R(λn)M for all n, and suppose M1. 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).

L2L3L1algebra
2.1

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

step 1.1step 1.2algebra
3.1

For each n the set of unit vectors x with R(λn)x12R(λ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.

step 2.1L5algebra
4.1

Then (Tλn)yn=xn/R(λn)xn2/R(λn)0 and λnλ0, so (Tλ)yn(Tλn)yn+λnλ0 along unit vectors.

step 3.1L2algebra
5.1

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).

step 4.1L4

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