OAI/NumberTheory/CubicMoment/Estimates/HeightWindowCount.lean

GitHub source file

4 declarations, 0 contain sorry, 0 declared as axioms

A concrete finite height partition. Every nonzero window lies below the Fourier cap, and the number of windows costs only one logarithm.

  1. def OAI.CubicFirstMoment.heightWindowCount line 10
  2. lemma OAI.CubicFirstMoment.heightWindowCount_covers line 13
  3. lemma OAI.CubicFirstMoment.heightWindowCount_scale_bounds line 24
  4. theorem OAI.CubicFirstMoment.heightWindowCount_log_bound line 39