Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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 positive operator is nonnegative

Statement

Assume Countable Choice. If T is a bounded positive operator on a nonzero complex Hilbert space, then σ(T)⊆[0,+∞).

Facts & Assumptions

[A1]

T is positive when ⟨Tx,x⟩ is a real number in [0,+∞) for every x; positivity is a condition on the values of the quadratic form and does not presuppose self-adjointness (Self-adjoint, positive, unitary and normal operators).

[A2]

⟨T∗x,y⟩=⟨x,Ty⟩, and for a fixed w the expansion of ⟨Tx,x⟩ at x+ty uses the linear/conjugate-linear inner-product conventions (The Hilbert-space adjoint of a bounded operator, Real and complex inner-product spaces and their induced length). The adjoint algebra laws give (T−zI)∗=T∗−z‾I (Hilbert-adjoint identities).

[A3]

∣⟨u,v⟩∣≤∥u∥ ∥v∥ for all vectors u,v (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[A4]

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

[A5]

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

[A6]

S⊥={v:⟨v,s⟩=0 ∀s∈S} and {0}⊥=H (Orthogonality and the orthogonal complement).

[A7]

A Hilbert space is complete for its induced norm; z=Re⁡z+iIm⁡z and z∉[0,+∞) means Im⁡z≠0 or Re⁡z<0 (Hilbert space, Real and imaginary parts, complex conjugation, and modulus, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[A8]

Countable Choice is the hypothesis of the adjoint and orthogonality suppliers used below (The Axiom of Countable Choice (ACω)).

Proof

technique · direct

Given: A nonzero complex Hilbert space H, a bounded positive operator T∈B(H) and a scalar z outside [0,+∞).

1.1A1A7algebra

For x=0 the lower bounds below are immediate. For x≠0 the number r:=⟨Tx,x⟩/∥x∥2 is real and nonnegative, so writing z=a+bi one has ∣⟨(T−zI)x,x⟩∣=∣r−z∣ ∥x∥2 with ∣r−z∣≥∣b∣ always and ∣r−z∣=r+∣a∣≥∣a∣ when b=0 and a<0.

1.2A1A2A7algebra

If (T∗−zI)x=0 with x≠0, then testing against x and using the adjoint identity gives ⟨Tx,x⟩=⟨x,T∗x⟩=z‾∥x∥2; the left side is a nonnegative real number while z∉[0,+∞) makes z‾∥x∥2 non-real or negative, so ker⁡(T∗−zI)={0}.

2.1step 1.1A3A7algebra

If z∉R then ∥(T−zI)x∥≥∣Im⁡z∣ ∥x∥ by the estimate and Cauchy–Schwarz, and the same lower bound with ∣Re⁡z∣ holds when z is real and negative; in either case there is c>0 with ∥(T−zI)x∥≥c∥x∥, so T−zI is injective. Its range is closed: if (T−zI)xn→u, the inequality makes (xn) Cauchy, completeness gives xn→x, and boundedness gives (T−zI)x=u.

3.1step 2.1step 1.2A2A5A6A8

For such z the orthogonal complement of ran⁡(T−zI) is ker⁡(T∗−z‾I)={0}, the vanishing being step 1.2 applied to the scalar z‾, which also lies outside [0,+∞); the closed range equals its closure, so ran⁡(T−zI)=H.

4.1step 2.1step 3.1A4A7∎

Hence every z∉[0,+∞) lies in ρ(T): T−zI is bijective with bounded inverse, and its inverse has norm at most 1/c by step 2.1; changing sign gives the bounded inverse of zI−T. Thus σ(T)⊆[0,+∞).

Depends on

Dependency tree · 2 levels

Sources