Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

Rank-one resolvent and bound-state equation

Statement

Assume the Axiom of Choice. Let H0 be a self-adjoint operator on a complex Hilbert space H, with inner product linear in its first variable and inf⁡σ(H0)>−∞. Let g∈H, λ∈R, and define Pg:H→H by Pgf=⟨f,g⟩g. Put Hλ=H0+λPg on D(Hλ)=D(H0) and R0(z)=(H0−zI)−1. Then Hλ is self-adjoint. For every z∈ρ(H0) such that dλ(z):=1+λ⟨R0(z)g,g⟩≠0, one has z∈ρ(Hλ) and Rλ(z):=(Hλ−zI)−1=R0(z)−λR0(z)PgR0(z)1+λ⟨R0(z)g,g⟩. For real E<inf⁡σ(H0) and g≠0, E is an eigenvalue of Hλ if and only if dλ(E)=0; in that case the eigenspace is one-dimensional.

Facts & Assumptions

Given: The self-adjoint lower-semibounded operator H0, its domain, g∈H, real λ, and the rank-one map Pg defined in the Statement.

[A1]

The resolvent set consists of those z for which H0−zI:D(H0)→H is bijective with bounded inverse; for self-adjoint H0, each real E<inf⁡σ(H0) belongs to the resolvent set (Resolvent and spectrum of an unbounded operator, Resolvent of a self-adjoint operator: nonreal resolvents and the estimate).

[F1]

Kato–Rellich: a symmetric perturbation with relative operator bound less than one preserves self-adjointness on the original operator domain (Kato-Rellich theorem).

[F2]

Cauchy–Schwarz gives ∣⟨f,g⟩∣≤∥f∥∥g∥, and the inner product is linear in its first argument (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs, Real and complex inner-product spaces and their induced length).

[A2]

Kato–Rellich assumes the Axiom of Choice; the self-adjoint resolvent input assumes Countable Choice. The stated AC hypothesis supplies the latter: for any sequence (Xn)n∈N of nonempty sets, apply AC to F={Xn:n∈N} to obtain a choice function c; then f(n)=c(Xn)∈Xn for every n, which is Countable Choice (The Axiom of Choice).

Proof

Given: [A1], [A2], Pgf=⟨f,g⟩g, and the operators in the Statement.

1.1A2F1F2given

For every f∈H, [F2] gives ∥Pgf∥=∣⟨f,g⟩∣∥g∥≤∥g∥2∥f∥. Also ⟨Pgf,h⟩=⟨f,g⟩⟨g,h⟩=⟨f,Pgh⟩, so Pg is bounded and self-adjoint, including g=0. Thus λPg is symmetric on D(H0) with relative bound zero; [F1] implies that Hλ is self-adjoint on D(H0).

1.2A1givenalgebra

Fix z∈ρ(H0) and write R0=R0(z), m=⟨R0g,g⟩, and X=R0Pg. Then Xf=⟨f,g⟩R0g and X2f=⟨f,g⟩⟨R0g,g⟩R0g=mXf; hence X2=mX. If d=1+λm≠0, direct multiplication gives (I+λX)−1=I−λX/d.

2.1step 1.2A1algebra

Define S=(I−λX/d)R0. Its range is contained in D(H0). Since PgR0Pg=mPg, on D(H0) one has S(Hλ−zI)=(I−λX/d)(I+λX)=I. On H one has (Hλ−zI)S=I−λPgR0/d+λPgR0−λ2mPgR0/d=I, using d=1+λm. Thus S is a bounded two-sided inverse from H onto D(Hλ), and its expansion is the stated resolvent formula.

3.1A1step 1.1step 1.2algebra∎

Let E<inf⁡σ(H0) be real. By [A1], R0(E) exists. If Hλu=Eu with u≠0, then u=−λ⟨u,g⟩R0(E)g. The coefficient ⟨u,g⟩ cannot be zero, because that would give u=0; applying ⟨⋅,g⟩ therefore yields 1+λ⟨R0(E)g,g⟩=0. Conversely, if this scalar is zero, then u=R0(E)g≠0 and (Hλ−EI)u=g+λ⟨R0(E)g,g⟩g=0. Every eigenvector satisfies the same scalar-multiple formula for R0(E)g, so the eigenspace is one-dimensional.

Depends on

Dependency tree · 2 levels

Sources