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.

Birman–Schwinger principle for bounded compactly supported potentials

Statement

Assume the Axiom of Choice and Countable Choice. Let W:R3→[0,∞) be measurable, essentially bounded, and zero almost everywhere outside a compact set S. Put s(x)=W(x) almost everywhere. On L2=L2(R3;C), let Ms,MW:L2→L2 be the multiplication operators (Msf)(x)=s(x)f(x) and (MWf)(x)=W(x)f(x), interpreted as almost-everywhere classes. These are bounded nonnegative self-adjoint operators with Ms2=MW and ∥Ms∥2,∥MW∥≤∥W∥L∞. Let H0=−Δ be the free Laplacian with domain D(H0)=W2,2(R3;C), and set H=H0−MW on D(H0). For κ>0 define Kκ=Ms(H0+κ2I)−1Ms. Then H is self-adjoint and bounded below, and Kκ is positive, self-adjoint, and compact, with integral kernel s(x)e−κ∣x−y∣4π∣x−y∣s(y). The eigenspaces at −κ2 for H and at 1 for Kκ are linearly isomorphic. Moreover, the finite number of eigenvalues of H strictly below −κ2, counted with multiplicity, equals the finite number of eigenvalues of Kκ strictly greater than 1, counted with multiplicity.

Facts & Assumptions

Given: Choice and Countable Choice, W and κ as in the Statement, and the dimensionless convention H0=−Δ.

[A1]

The free operator has form domain W1,2, form q0[u]=∥∇u∥22, and operator domain W2,2 (Free Laplacian form domain and realization).

[F1]

A bounded symmetric perturbation preserves self-adjointness on D(H0). The form perturbation clause of the closed-form representation theorem makes qH(u,v)=q0(u,v)−⟨Msu,Msv⟩ closed and semibounded on W1,2; its proof identifies its representing operator and its full square-root spectral form (Kato-Rellich theorem, Semibounded closed-form representation and perturbation).

[F2]

For κ>0, Rκ=(H0+κ2)−1 has kernel Gκ(x−y)=e−κ∣x−y∣/(4π∣x−y∣) and is positive (Yukawa kernel of the free resolvent in three dimensions).

[F3]

A self-adjoint semibounded operator's form is the spectral integral of λ against its spectral measure; its spectral projections on disjoint Borel sets are orthogonal, and bounded spectral intervals lie in the form domain (Spectral theorem for unbounded self-adjoint operators (PVM form), Unbounded Borel functional calculus: domains, products, spectral mapping).

[F4]

Positive compact self-adjoint operators have an orthonormal eigenbasis off their kernel; their spectral subspace for eigenvalues greater than 1 is finite dimensional, and its dimension counts those eigenvalues with multiplicity (Spectral theorem for compact self adjoint operators).

[F5]

Every square-integrable kernel on R3×R3 defines a bounded compact integral operator on L2(R3) (L^2 kernel operators and Hilbert-Schmidt operators on R^3, L^2 kernel operators are bounded and compact).

[F6]

A point belongs to the essential spectrum exactly when every open interval around it has an infinite-rank spectral projection (Discrete and essential spectrum of a self-adjoint operator).

[F7]

The form min-max values of a semibounded self-adjoint operator are its ordered eigenvalues below the bottom of its essential spectrum, counted with multiplicity (Form min-max below the essential spectrum).

[A2]

Choice and Countable Choice are the hypotheses required by the cited representation and spectral results (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

Proof

Given: [A1], [A2], and the potential, operators, and parameter in the Statement.

1.1A1A2F1algebra

Write M=∥W∥L∞. The multiplication operators MW and Ms are bounded, nonnegative, and self-adjoint, with ∥MW∥≤M and ∥Ms∥2≤M. Since H0≥0, Kato–Rellich makes H=H0−MW self-adjoint on D(H0)=W2,2, and H≥−MI. On W1,2 define qH(u,v)=q0(u,v)−⟨Msu,Msv⟩. The perturbation has form bound a=0, b=M, because ⟨Msu,Msu⟩=⟨MWu,u⟩≤M∥u∥22; hence [F1] makes qH closed and bounded below by −M.

2.1A1F1F3step 1.1algebra

Let H~ be the self-adjoint operator representing qH from [F1]. For u∈W2,2 and v∈W1,2, the free-form identity [A1] and ⟨Msu,Msv⟩=⟨MWu,v⟩ give qH(u,v)=⟨(H0−MW)u,v⟩. Thus H⊆H~; self-adjointness gives H~⊆H∗=H, so H~=H. The representation theorem's square-root identity on the full form domain, with shift M+1, and [F3] then identify qH with the spectral form of H.

2.2F2F5step 1.1algebra

The resolvent convolution formula in [F2] gives, for a.e. x, (Kκf)(x)=s(x)∫Gκ(x−y)s(y)f(y) dy; thus the displayed function is the integral kernel of Kκ. If S is a compact set outside which W=0 almost everywhere and M=∥W∥∞, then ∬∣s(x)Gκ(x−y)s(y)∣2 dx dy≤M2∣S∣∫S−S∣Gκ(z)∣2 dz<∞, because S−S is bounded and the ∣z∣−1 singularity of Gκ is square-integrable locally in three dimensions. This is an L2 kernel, so [F5] makes its integral operator Kκ Hilbert–Schmidt and compact.

3.1A1F2step 2.2algebra

In the Fourier representation of [A1], Rκ=(H0+κ2I)−1=F2∗M(4π2∣ξ∣2+κ2)−1F2. The multiplier is real, strictly positive, and bounded by κ−2; its positive square root is the bounded self-adjoint multiplier Rκ1/2=F2∗M(4π2∣ξ∣2+κ2)−1/2F2. Consequently Kκ=(MsRκ1/2)(MsRκ1/2)∗, so it is positive and self-adjoint.

4.1F2step 3.1algebra

If Hu=−κ2u, then (H0+κ2I)u=MWu. Put f=Msu. If f=0, invertibility of H0+κ2I forces u=0; hence a nonzero eigenvector gives f≠0 and Kκf=MsRκMs(Msu)=MsRκMWu=Msu=f. Conversely, if Kκf=f with f≠0, set u=RκMsf. Then Msu=Kκf=f, so (H0+κ2I)u=Msf=Ms2u=MWu and Hu=−κ2u. These maps are inverse because RκMWu=u for an eigenvector and MsRκMsf=f for a 1-eigenvector; therefore the eigenspaces are isomorphic.

4.2A1F3step 2.1step 3.1algebra

Let A=(H0+κ2I)1/2, which maps W1,2 bijectively onto L2 by [A1] and Fourier calculus, and put T=MsA−1. Then TT∗=Kκ. The compactness of Kκ implies T is compact: for finite-rank spectral projections Pn of Kκ increasing to its support, ∥(I−Pn)T∥2=∥(I−Pn)Kκ(I−Pn)∥⟶0, so T is an operator-norm limit of the finite-rank maps PnT. Hence C=T∗T is positive compact. For v=Au, u∈W1,2, the exact form identity is qH[u]+κ2∥u∥2=∥v∥2−∥Tv∥2=⟨(I−C)v,v⟩. The maps u↦v and v↦A−1v are inverse bijections.

5.1F3F4step 4.2algebra

The maximal dimension of a linear subspace on which the right side of the form identity in step 4.2 is strictly negative equals rank⁡EC((1,∞)): that spectral subspace is negative for I−C, and any subspace of larger dimension contains a nonzero vector orthogonal to it, where the spectral integral of 1−C is nonnegative. By [F4], this rank is the number of eigenvalues of C above 1, with multiplicity.

6.1F3F4F6F7step 5.1algebra∎

The same maximal negative dimension equals rank⁡EH((−∞,−κ2)) by [F3]: the spectral range below the threshold is supported in [−M,−κ2) by step 1.1, so it lies in the form domain and is strictly negative for the shifted form. Any larger subspace has a nonzero vector in its orthogonal complement, where the shifted form is nonnegative. Step 5.1 makes this rank finite; its finite-dimensional spectral range therefore consists of eigenvectors, so its dimension is the number of eigenvalues of H below −κ2, counted with multiplicity. No essential spectral point lies strictly below −κ2: a sufficiently small interval around any such point has finite-rank projection as a subprojection of EH((−∞,−κ2)), contrary to [F6]. Hence the essential threshold is at least −κ2 (or +∞), and [F7] identifies the same count with the form min-max levels strictly below the cutoff. Finally, T maps each positive eigenspace of C=T∗T bijectively onto the same-eigenvalue eigenspace of Kκ=TT∗, with inverse μ−1T∗ at eigenvalue μ>0. Thus the number above 1 for C equals that for Kκ, proving the asserted count.

Depends on

Dependency tree · 2 levels

Sources