Growing-Index Recovery and Tail Scales for Signed Measures
Loading original first page…
Abstract
We determine the minimax polynomial degree needed to recover a growing negative index of a signed measure. For a probability supported in a shrinking interval, let h_m be its degree-m monic squared norm and L = log(R/h_m). Fix a gap d > 0 from that entire interval and a tail rate c > 0. Under the Gaussian background budget with weight exp(cx²), the degree for recovering m+1 negative directions is asymptotic to L²/(8cd²). Under the separately specified full absolute-moment budget with weight exp(c|x|), its logarithm is asymptotic to πL/(2cd). Support concentration alone pays the growing-index costs, including for continuous and singular negative probabilities. Without a gap, a single negative atom and a background local mass bound of order Rr^q give matching recovery orders for uniformly superlinear tail scales and for x[log(e+x)]^β, with fixed β ≥ 0 and q > 0. Adaptive rational damping controls the full growing polynomial span; compact multipliers and a paid variable-rate expansion handle the gapless classes. Classical kernel and orthogonal-polynomial inputs are credited throughout.
Read the full paper in the original PDF.
Edition files
- main.pdf179.2 KiB · pdf
SHA-256
e8993564d75371bb915cbb11676af06d9d275b0609f5606962ac68e1451b77d2 - Growing_index_recovery_package.zip204.2 KiB · package
SHA-256
1ef508b048a07fce58cbd9122834c4f4e9a13160f86b7d619317e1ef8a5b367b
Available editions
Research details
- Subjects
- Mathematics · Classical and Real Analysis
- Keywords
- signed measures, polynomial certificates, growing negative index, Christoffel functions, tail scales, local concentration
- Manuscript date
- 2026-10-25
- Reader reuse
- No additional permission granted
Scope
Sharp growing-index minimax degree for arbitrary shrinking negative probabilities under a containing-interval gap and distinct Gaussian or full exponential moment budgets. Separate single-atom gapless classes have matching local-concentration orders under uniformly superlinear or fixed nonnegative logarithmically strengthened exponential tails.
Disclosures
ChatGPT Sol 6.1 supported argument development, literature discovery, proof checking and drafting. Scott Schubr is responsible for the mathematical content and attribution. The research was self-funded. The author owns Luminary Oddities and its Research Archive.
Reproduction
20-page searchable manuscript PDF and matching editable LaTeX sources are provided. README.md supplies build instructions. Finite mathematical verification programs accompany the source package.
References and related resources
- B. Beckermann, M. Putinar, E. B. Saff and N. Stylianopoulos, Perturbations of Christoffel–Darboux kernels. I: detection of outliers, arXiv:1812.06560v2 (2019). https://arxiv.org/abs/1812.06560v2.
- K. G. Ivanov and V. Totik, Fast decreasing polynomials, Constructive Approximation 6 (1990), 1–20. https://doi.org/10.1007/BF01891406.
- R. Koekoek and R. F. Swarttouw, The Askey-scheme of hypergeometric orthogonal polynomials and its q-analogue, report 98-17, Delft University of Technology, 1998. https://arxiv.org/abs/math/9602214.
- E. Levin and D. S. Lubinsky, Orthogonal polynomials for weights close to indeterminacy, Journal of Approximation Theory 147 (2007), 129–168. https://doi.org/10.1016/j.jat.2007.01.001.
- NIST Digital Library of Mathematical Functions, Chapter 18, especially Sections 18.12, 18.14, 18.18, 18.23 and 18.25. https://dlmf.nist.gov/18.
- S. Schubr, Collision geometry and concentration in polynomial sign recovery, Luminary Oddities, 2026. Permanent Archive link (https://research.luminaryoddities.com/geometry-concentration-polynomial-sign-recovery/v/2).
- S. Schubr, Sharp Degree Bounds for Signed-Measure Certificates, 2026. Permanent Archive link (https://research.luminaryoddities.com/sharp-degree-bounds-signed-measure-certificates/v/1).
- S. Schubr, Tail Decay and Collision Barriers for Polynomial Certificates, 2026. Permanent Archive link (https://research.luminaryoddities.com/tail-decay-collision-barriers-polynomial-certificates/v/1).
- G. Szegő, Orthogonal Polynomials, fourth edition, American Mathematical Society Colloquium Publications, vol. 23, 1975.
- V. Totik, Fast decreasing and orthogonal polynomials, in Recent Advances in Orthogonal Polynomials, Special Functions, and Their Applications, Contemporary Mathematics, vol. 578, American Mathematical Society, 2012. https://doi.org/10.1090/conm/578/11471.