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.
Kato-Rellich theorem
Statement
Assume the Axiom of Choice. Work on a complex Hilbert space with inner product linear in the first variable. Let be self-adjoint and let be symmetric with and -bound less than one (Relative boundedness with respect to an operator). Then with domain is self-adjoint. If is merely essentially self-adjoint and is symmetric with and -bound less than one, then on is essentially self-adjoint and its closure is the self-adjoint operator obtained by applying the first part to and the graph-norm extension of to . If and is an admissible pair for with , then .
Facts & Assumptions
Relative boundedness supplies finite with and on . The graph norm is ; graph closure defines the operator closure. Relative boundedness with respect to an operator Unbounded linear operators: domain, graph and extension Densely defined, closed and closable operators, and cores
Symmetry is the identity on the domain; self-adjoint operators are closed and densely defined. A densely defined symmetric is self-adjoint if both ranges of equal for some . Nonreal points are resolvent points of a self-adjoint operator. The convention is . Symmetric, self-adjoint and essentially self-adjoint operators Range criterion for self-adjointness Resolvent of a self-adjoint operator: nonreal resolvents and the estimate Resolvent and spectrum of an unbounded operator
If a bounded operator has norm less than one, has a bounded inverse given by the Neumann series. Neumann series
On a nonzero , a self-adjoint has a regular PVM , domain , and , . Bounded integrals satisfy the norm bound and quadratic identity. Projections multiply by intersection; strong countable additivity holds. The Borel calculus has the product rule with domain , and the spectrum of is the set of for which every neighborhood has nonzero projection (apply its essential-range assertion to ). Spectral theorem for unbounded self-adjoint operators (PVM form) The unbounded PVM integral is densely defined, closed and normal Bounded borel pvm integral Projection valued measure Unbounded Borel functional calculus: domains, products, spectral mapping
AC supplies the spectral theorem's choices and directly supplies the countable witness choices used by the range/adjoint interfaces and by sequences approximating a fixed point in a graph closure. The Axiom of Choice
Proof
Given: the operators and admissible pair in the statement, with and .
If , all domains and graphs are zero and all conclusions hold directly. Otherwise use [A4]. For , , put . The bounds and show that maps into , that , and that . The product rule gives on and on , so this is . Thus when, for example, .
For any nonzero-space self-adjoint and real , the spectral-measure equivalence if and only if follows directly. If and has a nonzero projection, a nonzero in its range belongs to , has carried by , and satisfies , a contradiction. These increasing sets exhaust , so countable additivity gives zero projection. Conversely zero projection below gives for every in . Also if every real is a resolvent point, the essential-range characterization in [A4] supplies a zero-projection open neighborhood of each . The rational intervals contained in such neighborhoods form a countable cover of ; their union has zero projection by countable subadditivity of each . Therefore again . This does not require a finite spectral infimum or any resolvent-distance formula.
Put on exactly . For the identity holds on , since there. The first factor is boundedly invertible by [A3], and is bijective to . Hence both nonreal shifts of are onto. is symmetric by summing the two symmetry identities and densely defined because is dense. The range criterion makes self-adjoint. No second-resolvent identity with a previously closed is assumed.
Suppose and let . By step 1.2 is carried by . Define on that half-line and zero outside. For , and : for the ratio is monotone with its maximum at an endpoint or its limiting value ; for , decreases with since in that case. The spectral product rule shows , exactly as in step 1.1, and hence . Put . For every this last bound is strictly below one: if it equals (also when ); if it equals . The factorization of step 2.1 therefore proves that every real number is in , with bounded inverse . Apply step 1.2 to the already self-adjoint to obtain , the stated bound including its endpoint.
If is essentially self-adjoint, put . For each in choose in with and , using [A5]. The inequality in [A1] applied to makes Cauchy. Define as its limit. Two such approximations give the same limit by the same inequality applied to their difference. Approximating and and their linear combinations proves linearity, , and symmetry by passing to the limit in . It extends restricted to ; no extension of 's possibly larger domain is claimed. Step 2.1 makes self-adjoint. The inclusion and closedness give . Conversely the same approximating sequences satisfy , giving the reverse graph inclusion. This proves essential self-adjointness and the exact closure formula. If in this case, taking limits of its quadratic inequality gives ; step 3.1 then gives the bound for the closure and its restriction .
The choice use is exactly [A5]. The cases or are admitted by the same estimates and return the original lower bound. Dimension one requires no change. The strict hypothesis is used in the positive choice of and in ; no conclusion at is asserted. The endpoint is included by the zero-projection argument, without asserting that the spectrum is nonempty on the zero space.
Source notes
Teschl, Section 6.1, Lemma 6.3 and Theorem 6.4, printed pp.158–159 (PDF pp.169–170), supply the imaginary and real resolvent perturbation method. Signs here are computed for the library convention . The numerical bound is derived above directly from equation (6.3); the proof does not rely on a spectral-distance claim or endpoint continuity of a concave function.
Depends on
- Relative boundedness with respect to an operator
- Resolvent of a self-adjoint operator: nonreal resolvents and the estimate
- Range criterion for self-adjointness
- Neumann series
- Symmetric, self-adjoint and essentially self-adjoint operators
- Densely defined, closed and closable operators, and cores
- Resolvent and spectrum of an unbounded operator
- Unbounded linear operators: domain, graph and extension
- Unbounded Borel functional calculus: domains, products, spectral mapping
- Spectral theorem for unbounded self-adjoint operators (PVM form)
- Projection valued measure
- Bounded borel pvm integral
- The unbounded PVM integral is densely defined, closed and normal
- The Axiom of Choice
Used by
Dependency tree · two levels
61 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
- Gerald Teschl, Mathematical Methods in Quantum Mechanics, second edition (standard reference, not scraped)