Research Article · Preprint Mathematics
Tail Decay and Collision Barriers for Polynomial Certificates
- Primary subject
- Mathematics
- Subject subfields
- Classical and Real Analysis
- Paper type
- Research Article
- Manuscript stage
- Preprint
- Manuscript
- Archived
- Edition
- 1 · Permanent link
Overview
Abstract
We study the degree at which polynomial square integrals recover all isolated negative atoms of a real signed measure. Fix the number of atoms k ≥ 2, their separation from the remainder d > 0, and a Gaussian moment rate c > 0. For normalized atomic weights 1/k, remainder variation at most R, and a fixed Gaussian moment budget, the worst degree for recovering k negative directions is asymptotic to [log(R/Δ^{2(k−1)})]²/(8cd²) as the minimum atom separation Δ tends to zero, allowing arbitrary jointly varying R ≥ 1. The upper bound uses classical Laguerre estimates and Lagrange cardinals; a vanishing-jet subspace gives the matching lower bound. For an exponential rather than Gaussian budget, the same obstruction shows that the collision power in an earlier sufficient bound is necessary on the logarithmic scale, for every fixed k. For every weaker tail exp(c|x|^p), 0 < p < 1, we give a fixed-budget positive background that hides an isolated negative atom from every polynomial square above an explicit contrast, and extend this construction to compact negative measures. The classical kernel, orthogonal-polynomial and Stieltjes-class ingredients are credited explicitly; the conclusions concern degree and negative index, not computational complexity.
Keywords polynomial certificates · signed measures · negative inertia · Christoffel functions · Laguerre polynomials · moment problems
Scope of the work
Fixed k and fixed budget parameters. The sharp Gaussian joint limit requires Δ → 0, with arbitrary R ≥ 1, normalized masses 1/k and a background-only Gaussian absolute-moment budget. The exponential result determines a logarithmic power. Subexponential masking is an explicit existence theorem. No growing-k uniformity, optimal general-tail classification, runtime bound or physical-theta/RH conclusion.
Reproduction notes
The source package contains the complete LaTeX manuscript, standard-library Python exact finite controls, reader instructions, citation metadata and SHA-256 manifest. Run python verify_finite_controls.py and python -O verify_finite_controls.py. Finite controls illustrate original moment-matrix and vanishing-jet identities; the manuscript supplies the asymptotic and all-degree proofs.
The manuscript
Read the paper
The complete manuscript, as published in this edition.
If the reader is unavailable on your device, open or download the PDF directly.
Author disclosures
AI tools assisted mathematical exploration, drafting, proof checking and reproducibility-code development. Scott Schubr is the author. Internal AI checks are not external human refereeing or formal proof verification.
References and related publications
- Schubr, Sharp Degree Bounds for Signed-Measure Certificates
- NIST Digital Library of Mathematical Functions
- Delgado et al., modified moment functionals
- Beckermann et al., perturbations of Christoffel-Darboux kernels
- Lin, Recent developments on the moment problem
- Kleiber, generalized lognormal distribution and Stieltjes moment problem
A stable scholarly record
Cite this edition
Scott Schubr. (2026). Tail Decay and Collision Barriers for Polynomial Certificates (Version 1). Luminary Research Archive. https://research.luminaryoddities.com/tail-decay-collision-barriers-polynomial-certificates/v/1
BibTeX
@techreport{luminary_tail_decay_collision_barriers_polynomial_certificates_v1,
title = {Tail Decay and Collision Barriers for Polynomial Certificates},
author = {Scott Schubr},
year = {2026},
institution = {Luminary Research Archive},
type = {Research Article},
note = {Version 1},
url = {https://research.luminaryoddities.com/tail-decay-collision-barriers-polynomial-certificates/v/1}
}Loading discussion…