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 attractive perturbation has at most one negative eigenvalue
Statement
Assume the Axiom of Choice and Countable Choice. On let with domain , let for a constant , and let . Define , using the first-variable-linear pairing. The self-adjoint rank-one perturbation has a negative eigenvalue exactly when There is at most one such eigenvalue. More precisely, it exists exactly when , where ; equality is the threshold case and yields no negative eigenvalue.
Statement references
Facts & Assumptions
Given: Choice, , , the multiplication operator , and as in the Statement.
The rank-one resolvent theorem says is an eigenvalue exactly when , with a one-dimensional eigenspace (Rank-one resolvent and bound-state equation).
Multiplication by is self-adjoint on its maximal domain, has the real-multiplier self-adjointness interface (Real multiplication operators and free plus bounded-potential Schrödinger operators).
For radial nonnegative functions on , Lebesgue integration reduces to (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma).
Monotone convergence and dominated convergence hold for the integrals used to analyze (Monotone convergence for the integral, Dominated convergence).
A continuous real function on a closed interval takes each value between its endpoint values (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and ).
Choice is the hypothesis of the rank-one resolvent input (The Axiom of Choice).
Countable Choice is assumed by the and polar-coordinate interfaces (The Axiom of Countable Choice ()).
Proof
Given: [A1], [A2], [F1]–[F4], , and .
By [F2], is self-adjoint. If , multiplication by is a bounded inverse of : it is bounded by , and puts its range in . Therefore . For , [F3] gives ; the unit vectors lie in and satisfy . If , then , a contradiction. Thus .
By [F3], For , the rank-one scalar in [F1] is By [F1] and step 1.1, its zeros in correspond exactly to negative eigenvalues, each with multiplicity one.
If , then everywhere; since , integration gives . On any compact interval , the integrands are bounded by , so dominated convergence [F4] gives continuity of there. Also , hence as .
The integrands for increase pointwise to as . Monotone convergence [F4] gives . Since step 3.1 makes strictly decreasing in , its limit as equals this supremum. By [F3],
The function is continuous and strictly increasing on by step 3.1, with endpoint limits and by steps 3.1 and 4.1. When , the endpoint limits give finite with ; [F5] on gives a positive zero, unique by strict increase. If , then for every by step 3.1 and the endpoint limit in step 4.1; because , this gives , so no positive zero exists. Therefore a positive zero exists exactly when . By step 2.1 and [F1], these zeros correspond exactly to negative eigenvalues.
Depends on
Rank-one resolvent and bound-state equation
Real multiplication operators and free plus bounded-potential Schrödinger operators
Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma
Monotone convergence for the integral
Dominated convergence
Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and
The Axiom of Choice
The Axiom of Countable Choice ()