Bounds for the sign uncertainty constant in dimension one

A mix of human-written and AI-generated textHuman understanding: all partsmath.CA — Classical Analysis and ODEsmath.FA — Functional Analysismath.NA — Numerical Analysis

Contributed by Tejasvi Singh Tomar ↗

Version 1 / Nov 15, 2026 / CC BY 4.0

Abstract

Bourgain, Clozel and Kahane proved that a nonzero even real function ff on R\mathbb{R} with ff and f^\widehat{f} integrable, f(0)≤0f(0)\le0 and f^(0)≤0\widehat{f}(0)\le0 cannot have ff and f^\widehat{f} both nonnegative outside an arbitrarily small neighborhood of the origin. The sharp constant in this sign uncertainty principle is A+(1)A_+(1), the infimum of A(f)A(f^)\sqrt{A(f)A(\widehat{f})} over all such ff, where A(f)A(f) is the radius beyond which ff is nonnegative; its square is the constant of Problem 6.11 in the list of Georgiev, Gómez-Serrano, Tao and Wagner. We prove 0.5502<A+(1)≤0.55090.5502<A_+(1)\le0.5509, improving the previous bounds 0.45≤A+(1)≤0.30890.45\le A_+(1)\le\sqrt{0.3089}; in particular A+(1)<0.555A_+(1)<0.555, as conjectured by Gonçalves, Oliveira e Silva and Ramos. The lower bound comes from a weight in the spirit of the summation formulas of Cohn and Gonçalves, built from Gaussians and cosines and corrected near the origin by an approximate solution of a Fredholm integral equation, and the upper bound from an explicit self-dual combination of Gaussians. The numerical inequalities in both proofs are verified in ball arithmetic, and the bounds 0.5502≤A+(1)≤0.55090.5502\le A_+(1)\le0.5509 also have formal proofs in Lean 4.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716092

References

  1. A. Novikov et al., AlphaEvolve: A coding agent for scientific and algorithmic discovery , arXiv:2506.13131v1, 2025.arXiv
  2. J. Bourgain, L. Clozel and J.-P. Kahane, Principe d'Heisenberg et fonctions positives , Ann. Inst. Fourier (Grenoble) 60 (2010), 1215--1232.
  3. M. Carneiro, Lean4Lean: Verifying a typechecker for Lean, in Lean , arXiv:2403.14064v3, 2025.arXiv
  4. S. Chung, W. Du and W. J. Wesley, Autonomous mathematical discovery in an open-world multi-agent environment , arXiv:2608.23691v2, 2026.arXiv
  5. H. Cohn and F. Gonçalves, An optimal uncertainty principle in twelve dimensions via modular forms , Invent. Math. 217 (2019), 799--831; we cite the numbering of arXiv:1712.04438v3.arXiv
  6. The FLINT team, FLINT: Fast Library for Number Theory , version 3.6.0, https://flintlib.org.link
  7. B. Georgiev, J. Gómez-Serrano, T. Tao and A. Z. Wagner, Mathematical exploration and discovery at scale , arXiv:2511.02864v3, 2025; published as Mathematical discovery and exploration can be done at scale , Proc. Natl. Acad. Sci. USA 123 (2026), no. 40, e2536158123. Problem and table numbers refer to the arXiv version.arXiv
  8. F. Gonçalves, D. Oliveira e Silva and J. P. G. Ramos, New sign uncertainty principles , Discrete Anal. (2023), Paper No. 9, 46 pp.
  9. F. Gonçalves, D. Oliveira e Silva and J. P. G. Ramos, On regularity and mass concentration phenomena for the sign uncertainty principle , J. Geom. Anal. 31 (2021), 6080--6101; we cite the numbering of arXiv:2003.10765v2.arXiv
  10. F. Gonçalves, D. Oliveira e Silva and S. Steinerberger, Hermite polynomials, linear flows on the torus, and an uncertainty principle for roots , J. Math. Anal. Appl. 451 (2017), 678--711.
Show all 17 referencesShow fewer references
  1. Q. Huangfu and J. A. J. Hall, Parallelizing the dual revised simplex method , Math. Program. Comput. 10 (2018), 119--142.
  2. F. Johansson, Arb: efficient arbitrary-precision midpoint-radius interval arithmetic , IEEE Trans. Comput. 66 (2017), 1281--1292.
  3. L. de Moura and S. Ullrich, The Lean 4 theorem prover and programming language , in: Automated Deduction -- CADE 28, Lecture Notes in Comput. Sci. 12699 , Springer, 2021, 625--635.
  4. The mathlib Community, The Lean mathematical library , in: Proc. 9th ACM SIGPLAN Int. Conf. Certified Programs and Proofs (CPP 2020), 2020, 367--381.
  5. C. Bailey, nanoda_lib , a type checker for Lean 4, https://github.com/ammkrn/nanoda_lib.link
  6. L. Schork and J. Gondzio, Implementation of an interior point method with basis preconditioning , Math. Program. Comput. 12 (2020), 603--635.
  7. L. N. Trefethen, Approximation Theory and Approximation Practice , SIAM, Philadelphia, 2013.

Version history

  1. v1 · 10 pagesSubmitted by Tejasvi Singh TomarPublished on Zenodo: https://doi.org/10.5281/zenodo.23716092CurrentNov 15, 2026