Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

Spectrum of the unilateral shift

Example

Assume the Axiom of Choice (The Axiom of Choice). Let ℓ2=ℓ2(N0) be identified with L2 of the counting measure on N0={0,1,2,… } (ℓp is the Lp space of counting measure, Counting measure on an arbitrary set, Counting measure is a measure, Complex completeness, density, and inner product: the consumer interface), with coordinate vectors en, and let S be the unilateral shift

Sen:=en+1,extended linearly and by continuity to all of ℓ2.

Then S∈B(ℓ2) is an isometry, and

σ(S)=D‾,σp(S)=∅,σr(S)=σcp(S)=D,σc(S)=σap(S)=T,

where D={∣z∣<1}, D‾ its closure and T the unit circle (scalar spectrum in Spectrum and resolvent set in a Banach algebra, point/continuous/residual spectrum in Point continuous and residual spectrum, approximate point and compression spectrum in Approximate point and compression spectrum, all inside B(ℓ2) of Bounded operators form a Banach algebra, noncommutative in dimension at least two).

Facts & Assumptions

Given: The Axiom of Choice, the Hilbert space ℓ2=ℓ2(N0) with orthonormal coordinate vectors en, and the isometric coordinate shift Sen=en+1.

[L1]

Elements of ℓ2 are determined by their coordinates, almost-everywhere equality for the counting measure is pointwise equality, and ∥x∥22=∑n∣xn∣2; the inner product is ⟨x,y⟩=∑nxnyn‾ (ℓp is the Lp space of counting measure, Counting measure on an arbitrary set, Counting measure is a measure, Complex completeness, density, and inner product: the consumer interface).

[L2]

S is bounded with ∥S∥=1 and ∥Sx∥=∥x∥ for all x, so ∥(S−λ)x∥≥∥Sx∥−∣λ∣ ∥x∥=(1−∣λ∣)∥x∥ for ∣λ∣<1; an operator that is not bounded below is not invertible (A bounded operator that is bounded below, Spectrum and resolvent set in a Banach algebra, Bounded operators form a Banach algebra, noncommutative in dimension at least two).

[L3]

λ∈σp(S) means S−λ is not injective; λ∈σc(S) means injective with dense non-surjective range; λ∈σr(S) means injective with non-dense range; λ∈σap(S) means S−λ is not bounded below; λ∈σcp(S) means S−λ has non-dense range; and σ(S) is the set of non-invertible S−λ (Point continuous and residual spectrum, Approximate point and compression spectrum, Spectrum and resolvent set in a Banach algebra).

Verification

technique · direct
1.1L1L2algebra

Shift identities: (Sx)n=xn−1 for n≥1 and (Sx)0=0, so ∥Sx∥=∥x∥ and ∥S∥=1; moreover S−λ is injective for every λ: from (S−λ)x=0 the recursion xn−1=λxn gives x=0 for λ≠0 and Sx=0 gives x=0 for λ=0, since S is injective.

1.2L2algebra

Spectral containment: if ∣λ∣>1 then ∥S/λ∥<1 and S−λ=−λ(1−S/λ) is invertible by the Neumann series; if ∣λ∣<1 then ∥(S−λ)x∥≥(1−∣λ∣)∥x∥ by [L2], so S−λ is bounded below.

2.1step 1.1L1L3algebra

Non-density in the open disc: for ∣λ∣<1 the vector c:=(λ‾ n)n≥0 lies in ℓ2 and annihilates the range: for every x∈ℓ2, ⟨(S−λ)x,c⟩=∑nxn(cn+1‾−λcn‾)=∑nxn(λn+1−λλn)=0. So ran⁡(S−λ) is not dense for ∣λ∣<1, and σcp(S)⊇D.

2.2step 1.1L2L3algebra

Approximate eigenvectors on the circle: for ∣λ∣=1 and N≥1 put vN:=N−1/2∑k<Nλ−kek, a unit vector; since SvN=N−1/2∑k<Nλ−kek+1, the interior terms cancel in (S−λ)vN and only the two boundary terms survive, (S−λ)vN=N−1/2(λ−(N−1)eN−λe0), so ∥(S−λ)vN∥=2 N−1/2≤2N−1/2→0 and S−λ is not bounded below.

3.1step 2.1L1algebra

Density on the unit circle: if c⊥ran⁡(S−λ) then the same computation gives cn+1=λ‾cn for all n, that is, cn=λ‾ nc0. For ∣λ∣=1 this makes ∣cn∣=∣c0∣ for every n, so c∈ℓ2 forces c0=0 and the orthogonal complement is {0}: the range is dense there. For ∣λ∣<1, on the other hand, ∣cn∣=∣λ∣n∣c0∣ decays, the vector c=(λ‾ n)n≥0 is a nonzero element of ℓ2 orthogonal to the range, and the range is not dense — the non-density already computed in [step 2.1].

3.2step 1.1step 1.2step 2.1L3

Point spectrum empty and residual spectrum: injectivity is [step 1.1], so σp(S)=∅; for ∣λ∣<1 the range is non-dense by [step 2.1], so λ∈σr(S) and also λ∈σcp(S); for ∣λ∣>1 the operator is invertible by [step 1.2], so those points are outside every spectral set.

4.1step 1.2step 2.1step 3.1step 3.2step 2.2L3∎

Combining: σ(S)=D‾ because ∣λ∣>1 gives invertibility [step 1.2] and every ∣λ∣≤1 lies in σc(S) or σr(S) by [step 3.2] and [step 2.2]; σap(S)=T by [step 1.2] (bounded below inside the disc), [step 2.2] (on the circle) and [step 1.2] again (invertible, hence bounded below, outside); σc(S)=T because those points are injective with dense range [step 1.1, step 3.1] and non-surjective (else invertible); σr(S)=σcp(S)=D by [step 2.1], [step 3.1] and [step 3.2].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

36 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