Simon 2000 #9: bounded excess charge
- Slug:
simon-ionization-excess - List: Simon 2000 #9 (Coulomb energies); 1984 10(a) if useful
- Solver: GPT-6 Astra (2026-09-07); earlier runs credited in README.
- Status: dent of the printed leading 1.1185 and the notebook leading 1.1006. Same HPS chain: for . Exact claim and falsifier: q14/CLAIM.md. Ionization conjecture open.
- Area: Mathematical physics / many-body Schrödinger
- Sources: Simon 2000 #9; Simon 1984 10(a),(d); Lewin, charged quantum particles
- Started: 2026-08-27
In general
A nucleus of charge and electrons has Hamiltonian
on the fermionic space. Write for the bottom of the spectrum. Binding means . Let (Simon) or (Nam, HPS) be the largest such . Zhislin proved binding whenever . Lieb proved . The ionization conjecture, Simon 2000 problem 9, asks for a -independent bound on the excess .
Wikipedia is only a map. The published record is on arXiv.
Precise statement
Prove that stays bounded as , or give a verified finite improvement of a published non-asymptotic upper bound on .
The 1984 companion 10(a) asks for monotonicity of the ionization energy in . A certified range where that inequality holds is useful; it is not a substitute for a bound on the excess.
Published record (fetched 2026-08-27)
-
Lieb, Phys. Rev. A 29 (1984): for all (fermions or bosons).
-
Nam, arXiv:1009.2367v3: for fermions; equivalently with .
-
Hundertmark–Pattakos–Schulz, arXiv:2504.18487v1: for all , and the sharper
with . Also for .
-
Lieb–Sigal–Simon–Thirring: . Fefferman–Seco and Seco–Sigal–Solovej: .
-
Solovej, arXiv:math-ph/0012026: the ionization conjecture holds in Hartree–Fock.
-
Bosonic atoms: (Benguria–Lieb, Solovej, Baumgartner).
After 2026-08-27
The same HPS Section 7 chain, with Lieb’s on the Prop. 2.5 range and the exact in , gives
and the simplified
Also for . This beats the printed remainders 3.90, 4, and 2.96. It does not beat the leading 1.1185. Replay: problems/simon-ionization-excess/compute/q1/run_all.sh.
is replayed (Hylleraas , plus Lieb). That uniqueness is already in Lieb 1984.
A later search (same day) replayed HPS v1, Nam, Lieb, and
Benguria–González-Brantes arXiv:2511.07582v1
( for , bosonic / statistics-
independent). That paper does not beat for fermions.
Two-shell dipoles make the HPS radialization form negative for
every tested , so cannot be used. Lieb remains the
best integer envelope at . A compact-aspect lower
bound (aspect ) is certified and does not
replace Theorem 2.2. A claimed lift was withdrawn. Replay:
problems/simon-ionization-excess/compute/q2/run_all.sh.
A third search the same day lifts the aspect- compact bound to every radial probability in HPS (4.1): mass-stationarity on a used support of aspect forces , and every atomic measure reduces to one of those two classes. Truncation plus spherical-shell approximation extends the bound. The same Section 7 chain with this gives
and
This beats the printed leading . It does not use the
aspect- number as an unrestricted bound, and it
does not restore the withdrawn . Finite- integers and
stay residue. Replay:
problems/simon-ionization-excess/compute/q3/run_all.sh.
A fourth search the same day keeps the mass-opt dichotomy and tightens the compact class: mid-radius faces at aspect with bins certify (target ). The cut still exceeds that . The same Section 7 chain gives
and
This beats q3's and the printed . The unrestricted
leading sits below the aspect- class-only number ;
that class-only figure is not used as a bound. stays
withdrawn. Finite- integers and stay residue. Replay:
problems/simon-ionization-excess/compute/q4/run_all.sh.
A fifth search the same day keeps the mass-opt dichotomy at aspect and raises the mid-radius bin count to . Faces certify (target ). The cut still exceeds that . The same Section 7 chain gives
and
This beats q4's , q3's , and the printed .
with the mass-opt cut cannot beat and is residue.
stays withdrawn. Finite- integers and stay
residue. Replay:
problems/simon-ionization-excess/compute/q5/run_all.sh.
A sixth search the same day keeps the mass-opt dichotomy at aspect and raises the mid-radius bin count to . Faces certify (target ). The cut still exceeds that . The same Section 7 chain gives
and
This beats q5's , q4's , q3's , and the
printed . with the mass-opt cut cannot beat
and is residue. stays withdrawn. Finite-
integers and stay residue. Replay:
problems/simon-ionization-excess/compute/q6/run_all.sh.
A seventh search the same day keeps the mass-opt dichotomy at aspect and raises the mid-radius bin count to . Faces certify (target ). The cut still exceeds that . The same Section 7 chain gives
and
This beats q6's , q5's , q4's , q3's
, and the printed . with the mass-opt
cut cannot beat and is residue. stays
withdrawn. Finite- integers and stay residue.
Replay:
problems/simon-ionization-excess/compute/q7/run_all.sh.
An eighth search the same day keeps the mass-opt dichotomy at aspect and raises the face target on the mid-radius matrix from to . Faces certify (target ). The cut still exceeds that . The same Section 7 chain gives
and
This beats q7's , q6's , q5's , q4's
, q3's , and the printed . with
the mass-opt cut cannot beat and is residue.
stays withdrawn. Finite- integers and stay
residue. Replay:
problems/simon-ionization-excess/compute/q8/run_all.sh.
A ninth search the same day keeps the mass-opt dichotomy at aspect and raises the mid-radius bin count to . Faces certify (target ). The cut still exceeds that . The same Section 7 chain gives
and
This beats q8's , q7's , q6's , q5's
, q4's , q3's , and the printed .
with the mass-opt cut cannot beat and is
residue. stays withdrawn. Finite- integers and
stay residue. Replay:
problems/simon-ionization-excess/compute/q9/run_all.sh.
A tenth search the same night keeps the mass-opt dichotomy at aspect and raises the mid-radius bin count to . Faces certify (target ). The cut still exceeds that . The same Section 7 chain gives
and
This beats q9's , q8's , q7's , q6's
, q5's , q4's , q3's , and the
printed . with the mass-opt cut cannot beat
and is residue. stays withdrawn. Finite-
integers and stay residue. Replay:
problems/simon-ionization-excess/compute/q10/run_all.sh.
An eleventh search the next morning keeps the mass-opt dichotomy at aspect and raises the mid-radius bin count to . Faces certify (target ). The cut still exceeds that . The same Section 7 chain gives
and
This beats q10's , q9's , q8's , q7's
, q6's , q5's , q4's , q3's
, and the printed . with the mass-opt
cut cannot beat and is residue. stays
withdrawn. Finite- integers and stay residue.
Replay:
problems/simon-ionization-excess/compute/q11/run_all.sh.
A twelfth search the same day keeps the mass-opt dichotomy at
aspect and starts mid-radius bins, target
. SLSQP predicts printed if faces
certify. The dump of faces was stopped with the
slowest shard at about . Scanned faces stay copositive
and stays above ; the rest of the mask
space was not enumerated. Incomplete search is not a bound.
Printed leading stays . with the mass-opt cut
cannot beat and is leftover. Finite- integers and
stay leftover. Replay:
problems/simon-ionization-excess/compute/q12/run_all.sh.
A thirteenth search finishes at the same split with a Gray-code enumerator in place of the incomplete mask dump. Faces , copositive, residual skips, . Compact , , cut . The same Section 7 chain gives
and
This beats q11's , q10's , q9's , q8's
, q7's , q6's , q5's , q4's
, q3's , and the printed .
with the mass-opt cut cannot beat and is leftover.
stays withdrawn. Finite- integers and
stay leftover. Replay:
problems/simon-ionization-excess/compute/q13/run_all.sh.
2026-09-07 — rational matrix certificates
Two independent finite verifiers establish
This is the inequality in q14/CLAIM.md. A raised target on 37 rational bins proves . Python verifies a positive-definite matrix and its entrywise nonnegative remainder with exact rational arithmetic. Rust checks a separate Gram witness using outward integer intervals. The same mass-stationary cut at aspect ten extends the compact result, and each implementation independently checks the HPS constants. The proof and replay require no earlier face-enumeration certificate. The leading 1.1005 improves q13's 1.1006 and HPS's printed 1.1185; bounded excess remains open.
Replay: problems/simon-ionization-excess/compute/q14/run_all.sh.
What would count as a new bound
The 2026-09-12 attempt with 40 bins stopped before numerical search and produced no new certificate. The bound above remains unchanged; see q15/CLAIM.md for the unproved target.
A verified inequality that strictly improves a published record, with a replayable certificate. Examples: a leading coefficient below for all large ; a remainder strictly below the printed or on the HPS range; for a universal ; a unique exact for some that the published inequalities do not already settle.
What does not count
An incomplete variational or DFT search is not a lower bound. Restating HPS Proposition 2.5 is not a new bound. Hartree–Fock or DFT tables are heuristics. Simon 2000 #9 remains open unless the excess is shown bounded.