Skip to content

Erdős problem 996

Let n1<n2<n_1<n_2<\cdots be a lacunary sequence of integers and fL2([0,1])f\in L^2([0,1]) with nnth Fourier partial sum fnf_n. Is there an absolute constant C>0C>0 such that if ffn2(logloglogn)C\| f-f_n\|_2 \ll (\log\log\log n)^{-C} then 1NkNf({αnk})01f\frac{1}{N}\sum_{k\leq N}f(\{\alpha n_k\})\to\int_0^1 f for almost every α\alpha? A preprint answers this negatively via a dyadic spike-block counterexample.

Sources

Browse retained paths and inspect the exact material available for this Problem.

3 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

996.lean

Retained formal statement2 of 2

The following theorem is proved in [Ma66].

FormalConjectures/ErdosProblems/996.leanErdos996.erdos_996.variants.log210 linesExact file
∀ (C : ℝ),  0.5 < 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.logk) ^ C) →          ∀ᵐ (x : AddCircle 1),            Filter.Tendsto (fun N => (∑ kFinset.range N, ↑↑f (n kx)) / ↑N) Filter.atTop              (nhds (∫ (t : AddCircle 1), ↑↑f tAddCircle.haarAddCircle))
SolvedStatement only, no proof

Search problems.science

Find a Problem, Result, source, or page