Habib Ammari, Jiayu Qiu
Resolves a 40-year-old named open problem in relativistic mathematical physics with a new, reusable two-center resolvent estimate, tempered by proof length, reliance on computer-checkable polynomial verifications and AI-assisted derivations.
We prove the concentration conjecture for the three-dimensional Dirac operator with mass and an attractive Coulomb potential generated by finitely many point charges. For a fixed total charge , the lowest eigenvalue in the spectral gap is at least , with equality precisely when all the charge is concentrated at one point. The critical one-center operator is understood as its distinguished extension. The result also extends to arbitrary nonnegative finite charge measures. The proof uses a strict two-center estimate for the weighted free Dirac resolvent and a Birman-Schwinger comparison. We establish the two-center estimate through an auxiliary axial operator, combining a zero-energy bound and a scalar resolvent estimate with a radial decomposition, an angular Schur complement, and exact polynomial inequalities.
Core Contribution. The paper claims to prove the concentration conjecture for 3D Dirac–Coulomb operators. This is an open problem posed by Klaus (1980) and formulated in general form by Esteban–Lewin–Séré, who discussed it in a survey of open problems. For fixed total charge G ≤ 1, the lowest in-gap eigenvalue of Dm − V is at least m√(1−G²), with equality only for a single point charge. The result extends to arbitrary finite nonnegative measures. The strategy has three parts. First, a Birman–Schwinger reduction at the atomic energy E_G, using monotonicity of the free resolvent. Second, a block-norm matrix argument that reduces the problem to a strict two-center estimate ‖w_B(D_m−E)⁻¹w_A‖ < m/κ for all separations. Third, a proof of that estimate by mapping singular values of the two-center weighted resolvent to eigenvalues of an auxiliary axial operator in prolate spheroidal coordinates. That operator's spectrum must avoid [−1,1]. This last step is the technical core.
Methodological Rigor. The architecture is logical and the reduction steps (Birman–Schwinger formula, Perron–Frobenius-type matrix argument, measure extension via Cauchy–Schwarz on cₘ(A,B)) look sound. The two-center estimate is proved in three regimes:
The mixture of elegant structure (exact anticommutation, ground-state factorizations) and brute-force polynomial verification is typical of a hard computational proof. Concerns:
The overall logic appears coherent and checkable in principle, but full correctness depends on the heavy computational pieces.
Potential Impact. Resolving a named open problem in relativistic quantum mechanics is significant for mathematical physics. The physical statement is that the "united atom" binds a relativistic electron most strongly. Technically, the paper provides:
The approach could potentially extend to related problems, such as the stronger monotonicity under nuclear contraction (explicitly left open), other dimensions, magnetic fields, or the many-body/Dirac–Fock setting. Direct real-world application is minimal. It is a pure mathematical-physics result, with no computational chemistry consequences beyond rigorous confirmation of numerics already supporting the conjecture.
Timeliness & Relevance. The conjecture has been open for over 40 years and was highlighted in recent surveys. It is a well-recognized open question in the Esteban–Lewin–Séré program. Interest in rigorous relativistic quantum chemistry is steady rather than surging. If the proof is verified, it is a notable milestone for the community.
Overall. If correct, this is a high-significance result within mathematical physics and spectral theory of Dirac operators. It solves a classical conjecture with a novel technical machinery. Its audience is narrow (math-phys, spectral theory, PDE), and the foundationality is moderate, driven by the two-center resolvent estimate.
Generated Oct 21, 2026
Resolves a 40-year-old named open problem in relativistic mathematical physics with a new, reusable two-center resolvent estimate, tempered by proof length, reliance on computer-checkable polynomial verifications and AI-assisted derivations.