Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Spectrum of a self adjoint operator is real

Statement

Assume Countable Choice. If T is a bounded self-adjoint operator on a nonzero complex Hilbert space, then σ(T)⊆R, and ∥(T−zI)x∥≥∣Im⁡z∣ ∥x∥ for every z∉R and every x∈H.

Facts & Assumptions

[A1]

A scalar λ lies in the resolvent set ρ(T) exactly when λI−T is bijective with bounded inverse; σ(T) is the complement of ρ(T) (Spectrum and resolvent of a bounded operator).

[A2]

For a self-adjoint T one has ⟨Tx,y⟩=⟨x,Ty⟩ for all x,y, and consequently ⟨Tx,x⟩ is real; the adjoint is conjugate-linear, so (T−zI)∗=T−z‾I (Self-adjoint, positive, unitary and normal operators, Hilbert-adjoint identities).

[A3]

A Hilbert space is complete for its induced norm (Hilbert space).

[A4]

For z∈C the numbers Re⁡z and Im⁡z are real with z=Re⁡z+iIm⁡z, z‾=Re⁡z−iIm⁡z, and z∉R exactly when Im⁡z≠0 (Real and imaginary parts, complex conjugation, and modulus).

[A5]

For every bounded S one has (ran⁡S)⊥=ker⁡S∗ and ran⁡S‾=(ker⁡S∗)⊥ (Kernel–range orthogonality for Hilbert adjoints).

[A6]

S⊥={v:⟨v,s⟩=0 for all s∈S} and {0}⊥=H; a vector orthogonal to every vector of a set spanning a dense subspace is zero (Orthogonality and the orthogonal complement).

[A7]

Countable Choice is the hypothesis under which the adjoint, orthogonality and completeness suppliers are stated, and ∥S∥≤C means ∥Sx∥≤C∥x∥ for every x (The Axiom of Countable Choice (ACω), The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

Proof

technique · direct

Given: A nonzero complex Hilbert space H and a bounded self-adjoint T∈B(H), and a scalar z=a+bi with a=Re⁡z, b=Im⁡z.

1.1A2A4algebra

Since T∗=T, zI is normal and (T−zI)∗(T−zI)=(T−aI)2+b2I, so for every x the expansion of ⟨(T−zI)∗(T−zI)x,x⟩ gives ∥(T−zI)x∥2=∥(T−aI)x∥2+b2∥x∥2≥b2∥x∥2.

1.2A2A4algebra

If b≠0 and (T−z‾I)x=0 for some x≠0, then testing against x gives ⟨Tx,x⟩=z‾∥x∥2; the left side is real by self-adjointness while z‾∉R because b≠0, so no such x exists and ker⁡(T−z‾I)={0}.

2.1step 1.1A3A7algebra

If b≠0 then ∥(T−zI)x∥≥∣b∣ ∥x∥ for every x, so T−zI is injective and its range is closed: from (T−zI)xn→y the estimate makes (xn) Cauchy, hence convergent to some x with (T−zI)x=y.

3.1step 2.1step 1.2A5A6

If b≠0 then (ran⁡(T−zI))⊥=ker⁡(T−zI)∗=ker⁡(T−z‾I)={0}, and since the range is closed it equals its own closure, so ran⁡(T−zI)=ran⁡(T−zI)‾=H.

4.1step 2.1step 3.1A1∎

For z∉R the operator T−zI is therefore bijective, and for y=(T−zI)x the lower bound gives ∥(T−zI)−1y∥=∥x∥≤∣b∣−1∥y∥, so the inverse is bounded and z∈ρ(T); hence σ(T)⊆R.

Depends on

Dependency tree · 2 levels

Sources