Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Resolvent and spectrum of an unbounded operator

Definition

Let H be a complex Hilbert space and T a linear operator on H with domain D(T). Write (z−T)x=zx−Tx for x∈D(T). The resolvent set of T is ρ(T):={z∈C: z−T:D(T)→H is bijective and (z−T)−1∈B(H)}, where B(H) is the space of bounded everywhere defined operators on H (A bounded linear operator between normed spaces); the spectrum is σ(T):=C∖ρ(T). For z∈ρ(T) the bounded operator RT(z):=(z−T)−1∈B(H) is the resolvent of T at z. This is the library convention used throughout the page, matching the bounded resolvent of Spectrum and resolvent of a bounded operator: the shift is zI−T, with coefficient −1 on T.

The resolvent determines T back. If z∈ρ(T) and R:=RT(z), then D(T)=ran⁡R and TRy=zRy−y for y∈H; equivalently T=zI−R−1 with D(T)=ran⁡R, and R(z−T)x=x for x∈D(T), (z−T)Ry=y for y∈H.

Nonempty resolvent set forces closedness, without the closed graph theorem. Assume ρ(T)≠∅ and fix z∈ρ(T) with R:=RT(z). Choose a bound C≥0 such that ∥Rv∥≤C∥v∥. The map F(v,w)=w−Rv is continuous, since ∥F(v,w)−F(v′,w′)∥≤∥w−w′∥+C∥v−v′∥. Its zero set Γ(R)=F−1({0}) is closed. Because D(T)=ran⁡R and (z−T)Rv=v for every v∈H, the graph of T is Γ(T)={(x,Tx):x∈D(T)}={(Rv,zRv−v):v∈H}=Φ(Γ(R)), where Φ(v,w):=(w,zw−v) is a continuous linear bijection of H⊕H with continuous inverse Ψ(u,v)=(zu−v,u), since Φ(Ψ(u,v))=(u,zu−(zu−v))=(u,v) and Ψ(Φ(v,w))=Ψ(w,zw−v)=(v,w). A homeomorphism carries closed sets to closed sets, so Γ(T) is closed and T is closed. No closed graph theorem and hence no choice principle is used here.

For the zero operator on a nonzero H, ρ(0)=C∖{0}: the nonzero shifts have inverse z−1I, whereas the zero shift is not bijective. If H={0}, every shift is the unique bijection of the zero space, so ρ(T)=C and σ(T)=∅.

Depends on

Used by

Dependency tree · two levels

20 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