Jurkat–Richert theorem

From testwiki
Jump to navigation Jump to search

Template:Short description The Jurkat–Richert theorem is a mathematical theorem in sieve theory. It is a key ingredient in proofs of Chen's theorem on Goldbach's conjecture.[1]Template:Rp It was proved in 1965 by Wolfgang B. Jurkat and Hans-Egon Richert.[2]

Statement of the theorem

This formulation is from Diamond & Halberstam.[3]Template:Rp Other formulations are in Jurkat & Richert,[2]Template:Rp Halberstam & Richert,[4]Template:Rp and Nathanson.[1]Template:Rp

Suppose A is a finite sequence of integers and P is a set of primes. Write Ad for the number of items in A that are divisible by d, and write P(z) for the product of the elements in P that are less than z. Write ω(d) for a multiplicative function such that ω(p)/p is approximately the proportion of elements of A divisible by p, write X for any convenient approximation to |A|, and write the remainder as

rA(d)=|Ad|ω(d)dX.

Write S(A,P,z) for the number of items in A that are relatively prime to P(z). Write

V(z)=pP,p<z(1ω(p)p).

Write ν(m) for the number of distinct prime divisors of m. Write F1 and f1 for functions satisfying certain difference differential equations (see Diamond & Halberstam[3]Template:Rp for the definition and properties).

We assume the dimension (sifting density) is 1: that is, there is a constant C such that for 2 ≤ z < w we have

zp<w(1ω(p)p)1(logwlogz)(1+Clogz).

(The book of Diamond & Halberstam[3] extends the theorem to dimensions higher than 1.) Then the Jurkat–Richert theorem states that for any numbers y and z with 2 ≤ zyX we have

S(A,P,z)XV(z)(F1(logylogz)+O((loglogy)3/4(logy)1/4))+m|P(z),m<y4ν(m)|rA(m)|

and

S(A,P,z)XV(z)(f1(logylogz)O((loglogy)3/4(logy)1/4))m|P(z),m<y4ν(m)|rA(m)|.

Notes

Template:Reflist