Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Resolvent of a self-adjoint operator: nonreal resolvents and the estimate

Statement

Assume Countable Choice. Let T be a self-adjoint operator on H. Then every nonreal number belongs to ρ(T): CRρ(T). More precisely, for z=a+ib with a,bR, b0, and every xD(T), (Tz)x2=(Ta)x2+b2x2, and consequently RT(z)1/Imz. In particular σ(T)R.

Facts & Assumptions

[A1]

T=T; thus D(T) is dense, TT, and T is closed, T being closed (Symmetric, self-adjoint and essentially self-adjoint operators, The adjoint is well defined, closed, and reverses inclusions).

[A2]

For xD(T) one has Tx,y=x,Ty whenever yD(T), and Tx,x is a real number: it equals x,Tx=Tx,x (Symmetric, self-adjoint and essentially self-adjoint operators, Real and complex inner-product spaces and their induced length).

[A3]

For zC the identity ran(Tz)=ker(Tz)=ker(Tz) holds (The adjoint is well defined, closed, and reverses inclusions, [A1]).

[A4]

If M is a linear subspace of a Hilbert space, then M=M (The double orthogonal complement of a subspace is its closure, Orthogonality and the orthogonal complement).

[A5]

zρ(T) means that zT is a bijection of D(T) onto H with bounded inverse, and then RT(z) is the operator norm of that inverse (Resolvent and spectrum of an unbounded operator, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

Proof

technique · direct

Given: Countable Choice, a self-adjoint operator T on H, and a number z=a+ib with b0.

1.1

For xD(T), expanding (Tz)x2=(Tz)x,(Tz)x gives Tx2zTx,xzx,Tx+z2x2; by [A2] the two middle terms combine to 2aTx,x, so (Tz)x2=Tx22aTx,x+z2x2.

A2
2.1

Adding and subtracting a2x2 and using z2a2=b2, step 1.1 becomes (Tz)x2=(Ta)x2+b2x2.

step 1.1algebra
3.1

By step 2.1, (Tz)xbx for every xD(T); in particular Tz is injective and its range is closed: if (Tz)xny, then (xn) is Cauchy, hence xnx for some xH and Txnzx+y, and closedness of T gives xD(T) and Tx=zx+y, that is y=(Tz)x.

A1step 2.1
4.1

Also by [A3] applied to z, ran(Tz)=ker(Tz), and step 2.1 with z replaced by z shows Tz is injective, so the kernel is {0}. Hence the closed range of step 3.1 satisfies ran(Tz)=ran(Tz)=(ran(Tz))=H.

A3A4step 2.1step 3.1
5.1

By steps 3.1 and 4.1 the map zT:D(T)H is a bijection, and step 2.1 gives (zT)1yb1y for every yH: applying step 2.1 to x=(zT)1y yields y2=(Ta)x2+b2x2b2x2. Thus zρ(T) and RT(z)1/Imz by [A5].

A5step 2.1step 3.1step 4.1
6.1

Since z was an arbitrary nonreal number, CRρ(T), that is, σ(T)R; the identity and the bound of the statement are steps 2.1 and 5.1.

step 2.1step 5.1

Depends on

Used by

Dependency tree · two levels

34 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