Research Archive

Luminary Research ArchiveIndependent scholarship

Luminary Portal

Research Article · Preprint Mathematics

Sharp Degree Bounds for Signed-Measure Certificates

Scott Schubr

  • Mathematics
  • Classical and Real Analysis
Primary subject
Mathematics
Paper type
Research Article
Manuscript stage
Preprint
Manuscript
Archived
Edition
1 · Permanent link

Overview

Abstract

We study how much polynomial degree can be required to detect an isolated negative atom of a signed measure by a negative square integral. Fix a gap d > 0, an exponential-moment rate c > 0, and C > exp(cd). Among measures μ = −δ₀ + ν with supp ν contained in {|x| ≥ d}, total variation ‖ν‖ ≤ R, and ∫ exp(c|x|) d|μ| ≤ 1 + CR, let D(R) be the worst least degree of a real polynomial P for which ∫ P² dμ < 0. We prove log D(R)/log R → π/(2cd), with the explicit-order upper bound D(R) = O(R^(π/(2cd)) log(2 + R)). A direct critical-weight approximation of a classical continuous Chebyshev window constructs one rational polynomial with negative square integral on the original measure, without evaluating its moments. Continuous dual Hahn laws give matching lower exponents while keeping all input budgets fixed. For finitely many isolated negative atoms we also recover a whole negative polynomial subspace with an explicit polynomial cost in inverse separation; the index is exact for a positive remainder and is a lower bound for a signed remainder. An exact infinite-support example has first negative degree 2 floor(R). The theorem determines the logarithmic growth exponent, not the optimal logarithmic factor, leading constant, or computational running time.

Keywords signed measures · polynomial certificates · moment positivity · approximation theory · Christoffel function · continuous dual Hahn polynomials

Scope of the work

Sharp logarithmic minimax degree exponent π/(2cd) for the fixed gap and exponential-variation class defined in Theorem 1.1, including signed remainders. Direct construction uses certified computable declared data and a known negative atom, without original-moment evaluation. The several-atom degree bound is sufficient: exact index k requires a positive remainder; signed remainders give at least k directions. No optimal collision exponent, bit-complexity bound, Riemann-theta sign theorem or original-coordinate Vámos derivative counterexample is asserted.

Reproduction notes

The complete nine-member ZIP contains the 11-page PDF, standalone LaTeX source, exact rational example data, three standard-library Python checkers, reader/build instructions, citation metadata and SHA-256 manifest. All three checkers pass normally and with Python -O; the isolated packaged-source rebuild agrees on all 11 pages of extracted text. Finite checks illustrate the exact example and cardinal index logic; the continuum degree estimates are proved analytically in the manuscript.

The manuscript

Read the paper

Open PDF

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 development, drafting, literature comparison and independent internal checks. The author is responsible for the statements and presentation. These checks are not external human refereeing or formal proof-assistant verification.

References and related publications

  1. Beckermann, Putinar, Saff and Stylianopoulos (2019), Perturbations of Christoffel–Darboux kernels. I: detection of outliers, arXiv v2
  2. Delgado, Fernández, Pérez and Piñar (2016), Multivariate orthogonal polynomials and modified moment functionals
  3. Bhattacharyya (2006), Phased Array Antennas, ISBN 9780471727576, pp. 38–40
  4. Bizeul and Klartag (2025), Polynomial approximation in L² with the double-sided exponential weight via complex analysis
  5. NIST Digital Library of Mathematical Functions, Sections 18.19, 18.23, 18.25 and 18.26
  6. Gessel and Zeng (2023), Moments of orthogonal polynomials and exponential generating functions
  7. Lasserre (2011), A new look at nonnegativity on closed sets and polynomial optimization
  8. Levin and Lubinsky (2007), Orthogonal polynomials for weights close to indeterminacy
  9. Li (2026), Sum-of-squares degree barriers for the reweighted-hinge method in robust halfspace learning: a Christoffel-function characterization, Sections 3.2 and 3.4, arXiv v1
  10. Lubinsky (2007), A survey of weighted polynomial approximation with exponential weights
  11. Schubr (2026), Polynomial Certificates for the Vámos Riesz Obstruction, edition 2
  12. Totik and Varga (2012), Non-symmetric fast decreasing polynomials and applications

A stable scholarly record

Cite this edition

Scott Schubr. (2026). Sharp Degree Bounds for Signed-Measure Certificates (Version 1). Luminary Research Archive. https://research.luminaryoddities.com/sharp-degree-bounds-signed-measure-certificates/v/1

BibTeX
@techreport{luminary_sharp_degree_bounds_signed_measure_certificates_v1,
  title = {Sharp Degree Bounds for Signed-Measure Certificates},
  author = {Scott Schubr},
  year = {2026},
  institution = {Luminary Research Archive},
  type = {Research Article},
  note = {Version 1},
  url = {https://research.luminaryoddities.com/sharp-degree-bounds-signed-measure-certificates/v/1}
}

Loading discussion…