Erdős problem 996
Let be a lacunary sequence of integers and with th Fourier partial sum . Is there an absolute constant such that if then for almost every ? A preprint answers this negatively via a dyadic spike-block counterexample.
Sources
FormalConjectures/ErdosProblems/
996.lean
Retained formal statement
Does there exists a positive constant C such that for all f ∈ L²[0,1] and all lacunary sequences n, if ‖f - fₖ‖₂ = O(1 / log log log k ^ C), then for almost every x, lim ∑ k ∈ Finset.range N, f (n k • x)) / N = ∫ t, f t ∂t?
sorry ↔ ∃ C, 0 < C ∧ ∀ (f : ↥(MeasureTheory.Lp ℂ 2 AddCircle.haarAddCircle)) (n : ℕ → ℕ), IsLacunary n → ((fun k => (MeasureTheory.eLpNorm (Erdos996.fourierPartial f k) 2 AddCircle.haarAddCircle).toReal) =O[Filter.atTop] fun k => 1 / Real.log (Real.log (Real.log ↑k)) ^ C) → ∀ᵐ (x : AddCircle 1), Filter.Tendsto (fun N => (∑ k ∈ Finset.range N, ↑↑f (n k • x)) / ↑N) Filter.atTop (nhds (∫ (t : AddCircle 1), ↑↑f t ∂AddCircle.haarAddCircle))OpenStatement only, no proof