OAI/NumberTheory/Ostmann/Preliminaries/SummandSizeFiniteInequality.lean

GitHub source file

1 declarations, 0 contain sorry, 0 declared as axioms

The finite sieve/collision inequality underlying the square-root bounds

The prime set and the second sampling length are independent. This retains the freedom to choose a very long second prefix in the subpower bootstrap.

  1. theorem OAI.Ostmann.EventuallyPrimeSumset.summand_size_finite_inequality line 16