Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 A be self-adjoint and let B be symmetric with D(A)⊆D(B) and A-bound less than one (Relative boundedness with respect to an operator). Then A+B with domain D(A) is self-adjoint. If A is merely essentially self-adjoint and B is symmetric with D(A)⊆D(B) and A-bound less than one, then A+B on D(A) is essentially self-adjoint and its closure is the self-adjoint operator obtained by applying the first part to A‾ and the graph-norm extension of B∣D(A) to D(A‾). If A≥γ and (a,b) is an admissible pair for B with a<1, then A+B≥γ−max⁡{a∣γ∣+b, b/(1−a)}.

Facts & Assumptions

[A1]

Relative boundedness supplies finite a,b≥0 with a<1 and ∥Bx∥≤a∥Ax∥+b∥x∥ on D(A). The graph norm is (∥x∥2+∥Ax∥2)1/2; 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

[A2]

Symmetry is the identity ⟨Tx,y⟩=⟨x,Ty⟩ on the domain; self-adjoint operators are closed and densely defined. A densely defined symmetric S is self-adjoint if both ranges of S±iμ equal H for some μ>0. Nonreal points are resolvent points of a self-adjoint operator. The convention is RT(z)=(z−T)−1. 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

[A3]

If a bounded operator C has norm less than one, I−C has a bounded inverse given by the Neumann series. Neumann series

[A4]

On a nonzero H, a self-adjoint T has a regular PVM E, domain {x:∫v2dEx<∞}, and ∥Tx∥2=∫v2dEx, ⟨Tx,x⟩=∫v dEx. 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 D(g(T))∩D((fg)(T)), and the spectrum of T is the set of v for which every neighborhood has nonzero projection (apply its essential-range assertion to f(v)=v). 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

[A5]

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

technique · direct

Given: the operators and admissible pair (a,b) in the statement, with 0≤a<1 and b≥0.

1.1A1A2A4given

If H={0}, all domains and graphs are zero and all conclusions hold directly. Otherwise use [A4]. For z=±iμ, μ>0, put rz(v)=(z−v)−1. The bounds ∣rz(v)∣≤1/μ and ∣vrz(v)∣≤1 show that rz(A) maps H into D(A), that ∥rz(A)∥≤1/μ, and that ∥Arz(A)∥≤1. The product rule gives (z−A)rz(A)=I on H and rz(A)(z−A)=I on D(A), so this is RA(z). Thus ∥BRA(z)∥≤a+b/μ<1 when, for example, μ=1+2b/(1−a).

1.2A4

For any nonzero-space self-adjoint T and real c, the spectral-measure equivalence T≥c if and only if E((−∞,c))=0 follows directly. If T≥c and Jn=[−(n+1),c−1/(n+1)] has a nonzero projection, a nonzero x in its range belongs to D(T), has Ex carried by Jn, and satisfies ⟨Tx,x⟩≤(c−1/(n+1))∥x∥2, a contradiction. These increasing sets exhaust (−∞,c), so countable additivity gives zero projection. Conversely zero projection below c gives ⟨Tx,x⟩=∫v dEx≥c∥x∥2 for every x in D(T). Also if every real t<c is a resolvent point, the essential-range characterization in [A4] supplies a zero-projection open neighborhood of each t. The rational intervals contained in such neighborhoods form a countable cover of (−∞,c); their union has zero projection by countable subadditivity of each Ex. Therefore again T≥c. This does not require a finite spectral infimum or any resolvent-distance formula.

2.1A1A2A3step 1.1

Put S=A+B on exactly D(A). For z=±iμ the identity z−S=(I−BRA(z))(z−A) holds on D(A), since RA(z)(z−A)x=x there. The first factor is boundedly invertible by [A3], and z−A is bijective D(A) to H. Hence both nonreal shifts of S are onto. S is symmetric by summing the two symmetry identities and densely defined because D(A) is dense. The range criterion makes S self-adjoint. No second-resolvent identity with a previously closed S is assumed.

3.1A1A3A4step 1.1step 2.1step 1.2

Suppose A≥γ and let λ+γ=d>0. By step 1.2 EA is carried by [γ,∞). Define r(v)=(−λ−v)−1 on that half-line and zero outside. For v≥γ, ∣r(v)∣≤1/d and ∣vr(v)∣≤max⁡(1,∣γ∣/d): for v≥0 the ratio v/(v+λ) is monotone with its maximum at an endpoint or its limiting value 1; for γ≤v<0, (−v)/(v+λ) decreases with v since λ>0 in that case. The spectral product rule shows r(A)=RA(−λ), exactly as in step 1.1, and hence ∥BRA(−λ)∥≤amax⁡(1,∣γ∣/d)+b/d. Put C=max⁡{a∣γ∣+b,b/(1−a)}. For every d>C this last bound is strictly below one: if d≥∣γ∣ it equals a+b/d<1 (also when b=0); if d<∣γ∣ it equals (a∣γ∣+b)/d<1. The factorization of step 2.1 therefore proves that every real number t<γ−C is in ρ(S), with bounded inverse RA(t)(I−BRA(t))−1. Apply step 1.2 to the already self-adjoint S to obtain S≥γ−C, the stated bound including its endpoint.

4.1A1A2A5step 2.1step 3.1

If A is essentially self-adjoint, put T=A‾. For each x in D(T) choose xn in D(A) with xn→x and Axn→Tx, using [A5]. The inequality in [A1] applied to xn−xm makes Bxn Cauchy. Define B~x as its limit. Two such approximations give the same limit by the same inequality applied to their difference. Approximating x and y and their linear combinations proves linearity, ∥B~x∥≤a∥Tx∥+b∥x∥, and symmetry by passing to the limit in ⟨Bxn,yn⟩=⟨xn,Byn⟩. It extends B restricted to D(A); no extension of B's possibly larger domain is claimed. Step 2.1 makes T+B~ self-adjoint. The inclusion A+B⊆T+B~ and closedness give A+B‾⊆T+B~. Conversely the same approximating sequences satisfy (A+B)xn→(T+B~)x, giving the reverse graph inclusion. This proves essential self-adjointness and the exact closure formula. If A≥γ in this case, taking limits of its quadratic inequality gives T≥γ; step 3.1 then gives the bound for the closure and its restriction A+B.

5.1A1A5step 1.1step 3.1step 4.1∎

The choice use is exactly [A5]. The cases B=0 or a=b=0 are admitted by the same estimates and return the original lower bound. Dimension one requires no change. The strict hypothesis a<1 is used in the positive choice of μ and in b/(1−a); no conclusion at a=1 is asserted. The endpoint γ−C 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 (z−A)−1. 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

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