claimroutineinferred_dep
Uniform upper sieve on affine fibers
Bounds lattice points on an affine fiber with prime values by
uniform count of bad configurations
Claim·§6.6 A uniform sieve on each affine fiber·inside lemPrime patterns with controlled reduction orders
Statement (paper)
For each form index and each prime value of the th form, the number of with for which all other are primes is , uniformly in and independently of .
In plain English
Fix a form index and a prime value of the th form. The number of with for which all the other are prime is , uniformly in and independently of .
Why it's here
The condition cuts out a two-dimensional affine fibre of lattice points. The upper sieve (Lemma 6.3) is applied on that fibre to the other forms, and the lower bound on turns its main term into . The bound is uniform in and independent of , so the later claims can sum it over prime values to bound the number of bad configurations without any dependence on .
Classified routine:
Direct application of the paper's elementary upper sieve (Lemma 6.3) on a two-dimensional affine fibre, combined with the lower bound for G(Z) from the earlier claim; this is a standard Selberg/Brun-type upper-bound sieve argument.
Uses
Used by
Sources
PaperOpen
- Section
- §6.6 A uniform sieve on each affine fiber
- Page
- —
- Label
—- Line
sections/06-primes.tex:615
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Uniform upper sieve on affine fibers" rests on pri:upper-sieve
- infoinferred_depoutline: "Uniform upper sieve on affine fibers" rests on claim-pri-pattern-4