Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

Functional calculus for a diagonal operator

Example

Assume AC. Let (λn)n∈N be a bounded complex sequence and let T be the diagonal operator Ten=λnen on ℓ2(N;C), where (en) is the standard orthonormal basis. Then σ(T)={λn:n∈N}‾ and f(T)en=f(λn)en for every continuous f on σ(T).

Facts & Assumptions

[A1]

ℓ2(N;C) is the space of square-summable families with ⟨x,y⟩=∑nxnyn‾; the vectors en form an orthonormal family with ⟨x,en⟩=xn, and the space is complete, hence a Hilbert space (Square-summable families on an arbitrary index set and the space ℓ2(I), A Hilbert space with a given orthonormal basis is ℓ2 of the index set, Orthonormal families, complete orthonormal systems and Hilbert bases, Hilbert space).

[A2]

z∈ρ(T) exactly when zI−T is bijective with bounded inverse; a bounded operator that is not bounded below has no bounded inverse (Spectrum and resolvent of a bounded operator, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[A3]

For normal T with a nonzero eigenvector x satisfying Tx=λx, one has λ∈σ(T) and, for every f∈C(σ(T)), f(T)x=f(λ)x (Continuous functional calculus properties, Continuous functional calculus for bounded normal operators).

[A4]

AC is the hypothesis of the calculus supplier (The Axiom of Choice).

Verification

technique · direct

Given: A bounded complex sequence (λn) with M:=sup⁡n∣λn∣<∞ and the diagonal operator Tx=(λnxn) on ℓ2(N;C).

1.1A1A2

The formula Tx=(λnxn) defines a linear bounded operator with ∥Tx∥22=∑n∣λnxn∣2≤M2∥x∥22, so ∥T∥≤M and Ten=λnen; moreover ∥T∥≥sup⁡n∣λn∣=M because ∥Ten∥=∣λn∣, so ∥T∥=M.

1.2A1algebra

T is normal: T∗y=(λn‾yn), since ⟨Tx,y⟩=∑nλnxnyn‾=∑nxnλnyn‾, and therefore T∗T=TT∗ is the diagonal operator with entries ∣λn∣2.

2.1step 1.1step 1.2A2

σ(T)={λn}‾: if z∉{λn}‾ then δ:=inf⁡n∣z−λn∣>0, the diagonal operator S with entries 1/(z−λn) is bounded with ∥S∥≤1/δ, and S(zI−T)=(zI−T)S=I, so z∈ρ(T); if z∈{λn}‾ choose nk with λnk→z, so ∥(T−zI)enk∥=∣λnk−z∣→0, whence T−zI is not bounded below and lies in σ(T).

3.1step 2.1A3

For f∈C(σ(T)) and each n, the basis vector en is an eigenvector of the normal operator T at λn∈σ(T), so f(T)en=f(λn)en.

4.1step 2.1step 3.1A4∎

Hence σ(T)={λn}‾ and the calculus acts diagonally on the standard basis, as asserted.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

57 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