erdős #996
Let be a lacunary sequence of integers, and let . Let be the th partial sum of the Fourier series of . Is there an absolute constant such that, ifthenfor almost every ?
Worked, still open.
analysis · open · formalized (Lean) · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Erdős posed essentially this question in his 1964 paper and wrote that he *expected* one might be able to replace a (log log)-type hypothesis by a **(log log log)**-type hypothesis, but he “was not able to decide this.” ([Numdam][1])
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗formal
AMS 42 · open (literature)
theorem erdos_996 : answer(sorry) ↔
∃ (C : ℝ), 0 < C ∧ ∀ (f : Lp ℂ 2 (haarAddCircle (T := 1))) (n : ℕ → ℕ),
IsLacunary n →
(fun k => (eLpNorm (fourierPartial f k) 2 (haarAddCircle (T := 1))).toReal) =O[atTop]
(fun k => 1 / (log (log (log k))) ^ C)
→
∀ᵐ x, Tendsto (fun N => (∑ k ∈ .range N, f (n k • x)) / N) atTop
(𝓝 (∫ t, f t ∂haarAddCircle))formal-conjectures/996.lean ↗status
open