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]

Tx,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 (TzI)=TzI (Hilbert-adjoint identities).

[A3]

u,vuv for all vectors u,v (Cauchy–Schwarz: x,yxy, with equality exactly for dependent pairs).

[A4]

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

[A5]

(ranS)=kerS and ranS=(kerS) for every bounded S (Kernel–range orthogonality for Hilbert adjoints).

[A6]

S={v:v,s=0 sS} and {0}=H (Orthogonality and the orthogonal complement).

[A7]

A Hilbert space is complete for its induced norm; z=Rez+iImz and z[0,+) means Imz0 or Rez<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 TB(H) and a scalar z outside [0,+).

1.1

For x=0 the lower bounds below are immediate. For x0 the number r:=Tx,x/x2 is real and nonnegative, so writing z=a+bi one has (TzI)x,x=rzx2 with rzb always and rz=r+aa when b=0 and a<0.

A1A7algebra
1.2

If (TzI)x=0 with x0, then testing against x and using the adjoint identity gives Tx,x=x,Tx=zx2; the left side is a nonnegative real number while z[0,+) makes zx2 non-real or negative, so ker(TzI)={0}.

A1A2A7algebra
2.1

If zR then (TzI)xImzx by the estimate and Cauchy–Schwarz, and the same lower bound with Rez holds when z is real and negative; in either case there is c>0 with (TzI)xcx, so TzI is injective. Its range is closed: if (TzI)xnu, the inequality makes (xn) Cauchy, completeness gives xnx, and boundedness gives (TzI)x=u.

step 1.1A3A7algebra
3.1

For such z the orthogonal complement of ran(TzI) is ker(TzI)={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(TzI)=H.

step 2.1step 1.2A2A5A6A8
4.1

Hence every z[0,+) lies in ρ(T): TzI 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 zIT. Thus σ(T)[0,+).

step 2.1step 3.1A4A7

Depends on

Used by

Dependency tree · two levels

40 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