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)nN 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:nN} 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 zIT 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 fC(σ(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:=supnλn< and the diagonal operator Tx=(λnxn) on 2(N;C).

1.1

The formula Tx=(λnxn) defines a linear bounded operator with Tx22=nλnxn2M2x22, so TM and Ten=λnen; moreover Tsupnλn=M because Ten=λn, so T=M.

A1A2
1.2

T is normal: Ty=(λnyn), since Tx,y=nλnxnyn=nxnλnyn, and therefore TT=TT is the diagonal operator with entries λn2.

A1algebra
2.1

σ(T)={λn}: if z{λn} then δ:=infnzλn>0, the diagonal operator S with entries 1/(zλn) is bounded with S1/δ, and S(zIT)=(zIT)S=I, so zρ(T); if z{λn} choose nk with λnkz, so (TzI)enk=λnkz0, whence TzI is not bounded below and lies in σ(T).

step 1.1step 1.2A2
3.1

For fC(σ(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.

step 2.1A3
4.1

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

step 2.1step 3.1A4

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