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 is a bounded positive operator on a nonzero complex Hilbert space, then .
Facts & Assumptions
is positive when is a real number in for every ; positivity is a condition on the values of the quadratic form and does not presuppose self-adjointness (Self-adjoint, positive, unitary and normal operators).
, and for a fixed the expansion of at 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 (Hilbert-adjoint identities).
for all vectors (Cauchy–Schwarz: , with equality exactly for dependent pairs).
exactly when is bijective with bounded inverse; is the complement of (Spectrum and resolvent of a bounded operator).
and for every bounded (Kernel–range orthogonality for Hilbert adjoints).
A Hilbert space is complete for its induced norm; and means or (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).
Countable Choice is the hypothesis of the adjoint and orthogonality suppliers used below (The Axiom of Countable Choice ()).
Proof
Given: A nonzero complex Hilbert space , a bounded positive operator and a scalar outside .
For the lower bounds below are immediate. For the number is real and nonnegative, so writing one has with always and when and .
If with , then testing against and using the adjoint identity gives ; the left side is a nonnegative real number while makes non-real or negative, so .
If then by the estimate and Cauchy–Schwarz, and the same lower bound with holds when is real and negative; in either case there is with , so is injective. Its range is closed: if , the inequality makes Cauchy, completeness gives , and boundedness gives .
For such the orthogonal complement of is , the vanishing being step 1.2 applied to the scalar , which also lies outside ; the closed range equals its closure, so .
Hence every lies in : is bijective with bounded inverse, and its inverse has norm at most by step 2.1; changing sign gives the bounded inverse of . Thus .
Depends on
- Self-adjoint, positive, unitary and normal operators
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Spectrum and resolvent of a bounded operator
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- Kernel–range orthogonality for Hilbert adjoints
- The Hilbert-space adjoint of a bounded operator
- Real and complex inner-product spaces and their induced length
- Hilbert-adjoint identities
- The operator norm as the least bound and as the unit-sphere or unit-ball supremum
- Hilbert space
- Orthogonality and the orthogonal complement
- Real and imaginary parts, complex conjugation, and modulus
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
- Theo Bühler and Dietmar Salamon, Functional Analysis, Lemma 5.49, printed pp.238–240 (standard reference, not scraped)
- Dana P. Williams, Lecture Notes on the Spectral Theorem, §4, pp.10–13 (standard reference, not scraped)