arXiv:2610.09698
Spurious zero-dispersion continua in full $(2,q)$-positivity: A linear hierarchy-depth lower bound from an exactly solvable counting operator
Maho Nakata
Abstract
Variational two-particle reduced-density-matrix methods impose hierarchies of semidefinite constraints. We ask whether a fixed level of such a hierarchy can recover even an elementary many-fermion spectrum, using the dispersion test, in which a value is accepted as an eigenvalue when the minimized dispersion vanishes. For an exactly solvable operator that counts fermions in one half of the spin orbitals, whose spectrum consists of integers, we determine the complete set of accepted values at every level of the full hierarchy of particle-hole semidefinite constraints. Besides the integers, this set contains an entire interval of noninteger values unless the hierarchy level grows linearly with the particle number, and we give the exact threshold. The proof constructs explicit pseudo reduced density matrices that are diagonal in the occupation basis, obtained by continuing the occupation probabilities of a fixed-particle-number state to a noninteger particle number. Classical semidefinite constraints on occupation correlations, supplemented by nonnegative occupation-pattern probabilities, suffice to establish fermionic positivity. For this counting model the two relaxations have the same dispersion zero set, not necessarily the same feasible states, and a converse argument shows that no other false eigenvalues occur. The limitation is specific to the hierarchy: two-body inequalities that encode the integer spectrum would remove every false value but are not generated at a fixed level. We also verify that the full semidefinite constraints and their complete projection onto two-particle reduced-density-matrix space are equivalent in finite dimensions, so that the result applies equally to the polar formulation.
AI Summary
The paper asks how deep fermionic reduced-density-matrix positivity hierarchies must be to recover a spectrum using the dispersion test: accept $\lambda$ when the relaxed minimum of $(K-\lambda)^2$ is zero. It studies $N$ fermions in $2N$ orbitals, with $K$ counting particles in one half; the exact spectrum is $\{0,\ldots,N\}$. For full particle–hole positivity through order $2\le q\le N$, it determines the accepted set exactly as $\{0,\ldots,q-2\}\cup[q-1,N-q+1]\cup\{N-q+2,\ldots,N\}$. Thus noninteger zero-dispersion values persist whenever $N\ge2q-1$, and exact spectral recovery requires $q\ge\lceil(N+2)/2\rceil$. At $N=2q-1$, the half-integer $\lambda=q-1/2$ has relaxed dispersion zero but exact dispersion $1/4$. The construction uses occupation-diagonal pseudo-RDMs obtained by interpolating fixed-occupation ensembles to noninteger shell populations. A phase-average decomposition transfers known classical Boolean sum-of-squares positivity, supplemented by nonnegative occupation-pattern probabilities, to every fermionic particle–hole block. Conversely, zero dispersion forces moments through order $q$ to equal powers of $\lambda$; falling-factorial positivity excludes all remaining values. A finite-dimensional projection–polar equivalence extends the result to complete $(2,q)$-positivity. The limitation is hierarchy-specific: adding $N$ two-body integer-spectrum inequalities makes the dispersion energy exact. Correct recovery of the zero set alone does not imply exact dispersion energies. The model is symmetric and exactly solvable; small one-body perturbations retain low-dispersion valleys at fixed size, but survival of exact false zeros and robustness uniform in $N$ are not established.
GPT-6 Astra (OpenAI) and Claude Opus 5.5 (Anthropic) were used to assist with literature search and English-language drafting, and as aids in the course of the research.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.