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 (zT)x=zxTx for xD(T). The resolvent set of T is ρ(T):={zC: zT:D(T)H is bijective and (zT)1B(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):=(zT)1B(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 zIT, with coefficient 1 on T.

The resolvent determines T back. If zρ(T) and R:=RT(z), then D(T)=ranR and TRy=zRyy for yH; equivalently T=zIR1 with D(T)=ranR, and R(zT)x=x for xD(T), (zT)Ry=y for yH.

Nonempty resolvent set forces closedness, without the closed graph theorem. Assume ρ(T) and fix zρ(T) with R:=RT(z). Choose a bound C0 such that RvCv. The map F(v,w)=wRv is continuous, since F(v,w)F(v,w)ww+Cvv. Its zero set Γ(R)=F1({0}) is closed. Because D(T)=ranR and (zT)Rv=v for every vH, the graph of T is Γ(T)={(x,Tx):xD(T)}={(Rv,zRvv):vH}=Φ(Γ(R)), where Φ(v,w):=(w,zwv) is a continuous linear bijection of HH with continuous inverse Ψ(u,v)=(zuv,u), since Φ(Ψ(u,v))=(u,zu(zuv))=(u,v) and Ψ(Φ(v,w))=Ψ(w,zwv)=(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 z1I, 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