この記事の日本語版はまだありません。英語版を表示しています。

Erdős Problem #996

Full solution by Boon Suan Ho with GPT-5.4 Pro (21 Apr 2026).

問題
Erdős problem #996 (analysis); current status: open
貢献
Boon Suan Ho with GPT-5.4 Pro · AI working with humans
検証
Listed in Tao's wiki
経緯
First AI contribution 2026-04-21 · wiki data as of 2026-06-30
出典
Problem page (erdosproblems.com)Tao's AI-contributions wiki
完全解Per Tao's AI-contributions wiki

The problem

Let n1<n2<⋯n_1<n_2<\cdots be a lacunary sequence of integers, and let f∈L2([0,1])f\in L^2([0,1]). Let fnf_n be the nnth partial sum of the Fourier series of f(x)f(x). Is there an absolute constant C>0C>0 such that, if

∥f−fn∥2≪1(log⁡log⁡log⁡n)C\| f-f_n\|_2 \ll \frac{1}{(\log\log\log n)^{C}}

then

lim⁡N→∞1N∑k≤Nf({αnk})=∫01f(x)dx\lim_{N\to\infty}\frac{1}{N}\sum_{k\leq N}f(\{\alpha n_k\})=\int_0^1 f(x)\mathrm{d}x

for almost every α\alpha?

Statement quoted from erdosproblems.com/996, maintained by Thomas Bloom. Original source: [Er64b]. Current status there: open.

AI contributions

As recorded in Terence Tao's wiki AI contributions to Erdős problems (data as of 30 Jun 2026). 🟢 full, 🟡 partial, ⚪ unverified, 🔴 incorrect.

Date Kind AI systems Humans Outcome
21 Apr, 2026 AI working with humans GPT-5.4 Pro Boon Suan Ho 🟢 Full solution

Caveats

The wiki's classifications are provisional and are not a benchmark. Many Erdős problems have never had a thorough literature review, so a result that looks new may later turn out to be known; some problems were also stated ambiguously or incorrectly. See the problem page for the full discussion.

∎