OpenFrontiers
← Back to the index
OP-12116Status unassessedAnalysis

Uncertainty principle (AlphaEvolve problem 11)

Uncertainty principle (AlphaEvolve problem 11). Current research status is unassessed; the repository records AlphaEvolve’s result on this question.

Editorial MSC2020 classification. Original article codes and source evidence are recorded in the literature directory.

Licensed source statementAs of Repository at commit 8f44745 (2026-07-11); the repository records AlphaEvolve results, not current research statusSource & evidence ↓

Problem statement

Given a function f∈L1(R)f \in L^1(\mathbb{R}), set

A(f)≔inf⁡{r>0:f(x)≥0 for all ∣x∣≥r}.A(f) \coloneqq \inf \{r > 0: f(x) \geq 0 \hbox{ for all } |x| \geq r \}.

Let CC be the largest constant for which one has

A(f)A(f^)≥CA(f) A(\hat f) \geq C

for all even ff with f(0),f^(0)<0f(0), \hat f(0) < 0. Establish upper and lower bounds for CC that are as strong as possible.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

Repository result category: worse than record — AlphaEvolve did not reach the best known result. See Section 6.6 in "Mathematical Exploration and Discovery at Scale " paper: arXiv:2511.02864. Experiment notebook.

Progress & source assessment

Upper bounds for CC

Bound Source Date
0.3530.353 Goncalves-Oliveira e Silva-Steinerberger February 2016
0.328310.32831 Cohn-Goncalves December 2017
0.3215910.321591 Georgiev-Gómez-Serrano-Tao-Wagner [Colab 1] [Colab 2] 14 May 2025
0.31020.3102 Cohn-de Laat-Goncalves (unpublished) 2025

Lower bounds for CC

Bound Source Date
0.20250.2025 Goncalves-Oliveira e Silva-Steinerberger February 2016
References
  1. [1]Georgiev, Bogdan; Gómez-Serrano, Javier; Tao, Terence; Wagner, Adam Zsolt. Repository of problems accompanying “Mathematical exploration and discovery at scale” (arXiv:2511.02864), github.com/google-deepmind/alphaevolve_repository_of_problems (commit 8f44745, 11 July 2026). — Uncertainty principle (AlphaEvolve problem 11) linkApache-2.0 (repository license); problem pages reproduced with attribution.

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.