The numerical bootstrap for quantum mechanics tests a candidate state's positivity only against sums of squares, whereas every physical state assigns nonnegative expectation to every pointwise nonnegative polynomial. In one dimension the two coincide; in two or more they do not. Whether this gap is realized depends sharply on which constraint set is imposed. For the stationary bootstrap, which imposes <[H,O]> = 0 and is the relaxation appropriate to thermal and mixed states, we exhibit a two-dimensional quartic double well and a moment vector that satisfies every level-three stationary constraint exactly, has a positive definite moment matrix, and yet assigns a negative expectation to a polynomial nonnegative on R^2; it is therefore the moment sequence of no state. All data are rational, and every step is verified in exact arithmetic. For the eigenstate bootstrap, which additionally imposes = E, the same search finds no violation in any of five settings spanning two, three and five degrees of freedom and truncation levels three and four, tested against complete families of separating polynomials. The single exception occurs at a truncation so low that only one eigenstate constraint survives, and the theory presented here accounts for it. We identify the mechanism: the eigenstate constraints bound the high momentum moments, otherwise unbounded on the feasible set, and it is those unbounded directions that reach the region between the two cones. Finally, under the reflection symmetries of a typical potential the relevant obstruction is copositivity rather than nonnegativity, which, for the quartic witnesses available at the lowest truncation, places the first possible failure at five degrees of freedom. We conjecture that the eigenstate constraints imply an Archimedean-type bound on the momentum moments, and formulate the corresponding tightness statement.
The eigenstate quantum-mechanical bootstrap can converge to the physical moment set while remaining nonexact at every finite order. We prove this for a one-dimensional quasi-exactly solvable sextic oscillator at explicitly known eigenvalues, including excited levels. At every finite order, the lower and upper bounds on
u2 remain strictly below and above its physical value, even after adjoining arbitrary finite polynomial Gram tests and all eigenstate-annihilator relations visible in the retained moment space. Hence neither side of the centered observable admits a finite sum-of-squares certificate modulo the eigenstate annihilator. The gap persists under any finite set of additional localizing constraints whose weights are strictly positive on polynomial vectors. We then prove convergence for polynomial Schrödinger operators satisfying explicit sum-of-squares confinement and derivative bounds. The eigenstate relations give moment estimates uniform in the truncation order; these yield a regular Schrödinger representation supported on the prescribed eigenspace. Finally, a four-mode extension combines this fixed-observable obstruction with feasible position moments having no positive representing measure at every finite order. At level three, this construction yields nonphysical feasible points with strictly positive definite moment matrices.
The many-body bootstrap certifies ground-state properties by minimizing energy over correlators constrained only by positivity, without any variational wavefunction. Its cost, however, grows exponentially with the size of the operators involved, placing the long-range string correlators that diagnose topological phases out of reach. We overcome this by treating string operators as primary objects: bare and endpoint-dressed strings satisfy a closed operator algebra with one another and with local words, yielding a semidefinite program whose cost grows only polynomially with string length. A single computation then yields estimates of string correlators of all lengths. Rigorous two-sided bounds are obtained for each target string once the ground-state energy is pinned within a window. When benchmarked against density-matrix renormalization group computations on the cluster Ising and spin
−1 Heisenberg chains, the method certifies the nonlocal string order of the cluster and Haldane phases directly from the Hamiltonian. Our rigorous certification of string order parameters reveal that the sharpness of the bounds is set by which operators enter the calculation, not by their length alone. By exploiting algebraic closure of strings and local words, our framework lifts spatially extended observables into polynomially tractable bootstrap variables, opening up a route to wavefunction-free certification of nonlocal order in quantum many-body systems.
We give exact rational certificates for two results in the bipartite Bell scenario with three two-outcome measurements per party. First, the maximum of the
I3322 (Froissart) functional over the almost-quantum set -- the
1+AB level of the Navascues-Pironio-Acin (NPA) hierarchy -- is certified to lie between
0.2514708838 and
0.2514709016 (width
<2×10−8), in the normalization with classical bound
0 and quantum maximum
≈0.2508754; to our knowledge no value for this landmark had been published. Second, we exhibit a single exact rational behavior
T∗ carrying certificates in both directions: a rational moment matrix proving
T∗ almost-quantum, and a rational dual object proving that every NPA level-2 completion of
T∗ requires slack at least
q=4.5934×10−4, so that
T∗ is not quantum. The strict inclusion
Q⊊Q~ in the minimal three-setting scenario is thereby established end-to-end with no reliance on floating-point computation. Anatomically, the witness is locally quantum: all nine of its
2×2 correlator subtables pass the Tsirelson-Landau-Masanes criterion, so its non-quantumness is irreducibly a three-setting phenomenon, concentrated in ordering-dependent pseudo-moments coupling each party's third setting to the other's first two; the level-2 certificate is equivalently an exact sum-of-squares identity that any quantum state values nonnegatively and the witness is forced to value at
−q. The certificates follow the rational rounding-projection-lifting programme recently developed for noncommutative optimization; for NPA moment matrices in canonical form the required projection reduces to a per-moment uniform shift, making certification essentially free at these sizes, and we work the programme in both the feasibility and infeasibility directions on one witness. Machine-checkable certificates and verifiers requiring only the Python standard library accompany the paper. Files in this record: the paper (PDF); exact rational certificates for both theorems (i3322_1AB_certificate.json, i3322_level2_infeasibility_certificate.json); standalone verifiers requiring only the Python 3 standard library (verify_i3322_certificate.py, verify_level2_certificate.py); and the generating scripts (certify_landmark.py, certify_level2.py). See README_ancillary.txt for which artifact proves which theorem and how to run the verifiers. v2: corrects the mechanism attribution in Sec. 5 (anatomy) and adds the archive reference to Data Availability; theorems, certificates, and verifiers unchanged.
ARCHANGEL develops a constructive mathematical framework for the common realization of positive matrix moments, compatibility testing across directional data, and rigorous certification of operator-valued responses. Its principal contributions connect matrix inequalities, constrained realization theory, spectral geometry, semidefinite certification, and finite-dimensional quantum tomography. The central result is a necessary-and-sufficient common-realization criterion within a specified finite positive Gaussian model class. Under explicit kernel and positive-curvature assumptions, the construction determines whether complete joint moment data admit one realization satisfying a prescribed spectral cutoff constraint. It provides an explicit extremizer attaining the resolvent lower bound Lₐ = Q(Q + aR)⁺Q simultaneously for every positive parameter a. The auxiliary dimension is minimal and equals rank(Q); in the three-direction, ten-dimensional formulation, at most 30 auxiliary modes are required. A particularly distinctive result is an exact rational counterexample to the inference from separate directional feasibility to joint realizability. Every real direction individually passes its optimized feasibility test, yet no single common realization satisfies all directional constraints together. The obstruction survives every compatible complex completion of the unmeasured imaginary entries. This establishes a precise limitation of reconstructing a shared system from separately successful directional tests. Additional results include: Sharp directional coverage bounds. A general coverage parameter quantifies how much finite directional testing can underestimate the largest response. The optimal missed-peak factor is 4/3 for planar trigonal sampling and 3/2 even when every direction in all three coordinate planes is tested. Sharp reconstruction stability. Three planar trigonal measurements reconstruct the complete quadratic directional operator, with an optimal 5/3 amplification factor for uniformly bounded measurement errors. Ten-dimensional holonomy certification. Two Weyl transformations detect every nonscalar component of a Hermitian response operator. A sharp Hilbert–Schmidt robustness inequality has the golden ratio as its optimal constant. Exact continuum positivity certification. A planar operator-valued trigonometric inequality is reduced to a finite semidefinite feasibility problem using matrix Fejér–Riesz factorization. For the ten-dimensional code, the degree-one certificate uses a 20 × 20 block matrix. Explicit tomography and combined bounds. A construction using 100 preparations reconstructs any ten-dimensional Hermitian response. Combining spatial reconstruction with holonomy contrasts gives a sharp joint certification inequality. The mathematical value lies in distinguishing independently compatible observations from data that admit one shared realization, constructing extremal realizations with minimal auxiliary dimension, and replacing incomplete sampling arguments with quantitative or exact certificates. These questions are relevant to matrix moment problems, inverse spectral modelling, constrained system identification, and quantum response certification. The release includes a 95-page compendium, complete proofs, five preserved research studies, correction and theorem indexes, reproducible Python code, three synthetic figures, and 32 passing computational verification groups. Exact arguments establish the continuum statements; numerical calculations provide supplementary consistency checks. Status and scope: The stated finite-matrix problems are resolved under their explicit assumptions. The work is an AI-assisted theory and methods contribution using established tools, including Schur complements, Weyl operator methods, and matrix polynomial factorization. External peer review and a comprehensive literature-priority assessment remain outstanding. No experimental validation is claimed.