OAI/NumberTheory/CubicMoment/Estimates/SparseLateSupport.lean

GitHub source file

3 declarations, 0 contain sorry, 0 declared as axioms

A literal sparse-support count: primary numbers containing a large squarefree divisor made from small primes occupy a power-saving fraction of a norm ball. The multiple count is the proved Eisenstein lattice bound.

  1. def OAI.CubicFirstMoment.sparseLateSupport line 15
  2. lemma OAI.CubicFirstMoment.divisible_union_card line 20
  3. theorem OAI.CubicFirstMoment.sparseLateSupport_card_saving line 35