Alphabeta Math
LemmaStatement: 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.

Relations among the five spectral parts

Statement

Assume the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain). Let X be a nonzero complex Banach space and let TB(X), with the point, continuous and residual spectra of Point continuous and residual spectrum and the approximate point and compression spectra of Approximate point and compression spectrum. Then

  1. σp(T), σc(T) and σr(T) are pairwise disjoint and σp(T)σc(T)σr(T)=σ(T);
  2. σr(T)=σcp(T)σp(T) and σp(T)σap(T);
  3. σ(T)=σap(T)σcp(T).

The three classical parts are a partition of the spectrum; the approximate point and compression spectra cover it as well, but may overlap it and each other.

Facts & Assumptions

Given: An assumed Axiom of Dependent Choice, a nonzero complex Banach space X, a bounded TB(X) and λC; abbreviate Tλ:=TλIX.

[L1]

The three classical cases are exhaustive and exclusive for λσ(T): Tλ fails to be injective, or is injective with dense non-surjective range, or is injective with non-dense range (Point continuous and residual spectrum).

[L2]

λσap(T) when Tλ is not bounded below, and λσcp(T) when Tλ has non-dense range (Approximate point and compression spectrum).

[L3]

Under Dependent Choice, Tλ is bounded below if and only if it is injective with closed range (Under Dependent Choice, a bounded operator between Banach spaces is bounded below exactly when it is injective with closed range).

[L4]

λσ(T) exactly when Tλ is not invertible in B(X) (Spectrum and resolvent set in a Banach algebra).

[L5]

The Axiom of Dependent Choice is the standing hypothesis of the statement (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

Proof

technique · direct
1.1

If Tλ is not injective then it is not bounded below: a bounded-below Tλ satisfies cxTλx for c>0, so Tλx=0 forces x=0. Hence σp(T)σap(T), which is the second inclusion of claim 2.

L2L3L5algebra
1.2

If λσr(T) then, by definition, Tλ is injective with non-dense range. Hence λσcp(T) and λσp(T), so σr(T)σcp(T)σp(T). Conversely, if λσcp(T)σp(T), then Tλ has non-dense range and is injective, which is exactly λσr(T). Thus σr(T)=σcp(T)σp(T).

L1L2
1.3

If λσ(T) then Tλ is invertible, hence bounded below and of dense range; so λσap(T)σcp(T).

L2L4algebra
1.4

Claim 3, other inclusion: let λσ(T). If Tλ is not bounded below then λσap(T). If it is bounded below, then by [L3] it is injective with closed range; were the range also dense, closedness would give range =X, so Tλ would be bijective with bounded inverse, hence invertible, contradicting [L4]; therefore the range is not dense and λσcp(T).

L2L3L4
2.1

Claim 3, one inclusion: σap(T)σcp(T)σ(T) is the contrapositive of [step 1.3].

step 1.3
3.1

Claim 1: for λσ(T) the operator Tλ is not invertible by [L4]; by [L1] it falls into exactly one of the three classical cases, so the three sets are disjoint and their union is σ(T). The covering half of claim 3 is [step 1.4] and the reverse half is [step 2.1]; claim 2 consists of [step 1.1] and [step 1.2].

step 1.1step 1.2step 1.4step 2.1L1L4

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

19 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