Suppose for . If and the real Selberg weights vanish unless and , then
Optimizing the main quadratic form gives , where
up to the harmless replacement of by under the alternative convention that denotes the level of the least common multiples.
For all interval origins , the number of multiples of any in is with an absolute error bound. The Selberg sieve diagonalization minimizes , subject to , at . The optimal Selberg weights have modulus at most one, so the total remainder is . Restoring the at most small primes gives . Take and use the Selberg sieve denominator asymptotic. The resulting is independent of .
Sieve an interval of length by the prime two and the primes congruent to three modulo four, with local densities . Take and . The truncated Euler-product lower bound, the Mertens first theorem and the reciprocal-prime sum in residue class one modulo four give . The interval counts have bounded remainders, whose sum is by the summatory bound for three to the prime omega. Hence the number surviving is , uniformly in the location of the interval.
For
define
The optimizing Selberg weights are
for dividing , and zero otherwise. They satisfy and diagonalize the main quadratic form to .
Put . As a Dirichlet convolution, , where is a multiplicative arithmetic function with , , and for . The local sums are one, so . The series converges, since the prime-local errors are . Consequently by the harmonic number estimate . This identifies the leading constant in the one-dimensional Selberg upper-bound sieve.
Put , and , where is a multiplicative arithmetic function supported on squarefree integers. For squarefree integers ,
Thus the quadratic form is . Möbius inversion gives . On the permitted squarefree integers, the constraint becomes . The Cauchy-Schwarz inequality yields , where over those integers; equality holds at .
For real coefficients supported on permitted divisors up to , put . Then is an upper bound for the indicator function of numbers free of the forbidden prime factors. Its support has . If the coefficients vanish on non-squarefree integers and satisfy , then : each prime factor of occurs in , in , or in both.
Let on permitted squarefree integers. The Selberg sieve weights have
The numerator is the total weight of the distinct integers with and : multiplicativity gives . They are a subset of the terms in .
For an integer polynomial and squarefree , let count the roots of modulo . The Chinese remainder theorem makes multiplicative, and
Thus and define a sieve distribution.
For the polynomial , take and at odd primes. On odd squarefree integers, the summand is at least . Put and . The weight of odd pairs is . The pairs for which is not squarefree, is not squarefree, or each have weight at most . Indeed, the weighted count of multiples of an odd is . Moreover,
Hence the odd coprime squarefree pairs have weight at least . Their products are squarefree, and counts all ordered coprime factorizations of . This proves the displayed lower bound needed for the Selberg upper-bound sieve.
For , every odd prime has two forbidden residue classes. Use Selberg sieve weights supported on odd squarefree integers . Their main quadratic form is , where . The truncated Euler-product lower bound applied to primes up to gives : the mean logarithmic divisor size is , by the Mertens first theorem, and the full product is , by the Mertens second theorem. The optimal Selberg weights have modulus at most one, so the remainder is at most . The finitely many possible pairs with contribute . Thus the count is , proving the bound.
For distinct natural numbers ,
Exclude the fixed primes dividing some so that the polynomial has exactly roots modulo every remaining prime, then apply the Selberg upper-bound sieve with level .
For a product of finitely many admissible linear forms, first omit a fixed finite set of locally obstructing primes. Apply the Buchstab identity at a large fixed , and bound each removed term by the Selberg upper-bound sieve. The convergent tail leaves a positive proportion with no prime divisor in . Their distinct prime divisors below are finite in number, while those above number at most , producing infinitely many almost-prime values.
If is smooth and supported on and , Fourier inversion gives
Expanding the square of the resulting Möbius-weighted divisor sum turns its mean value into an Euler product controlled by zeta functions near their pole at one.
For a real smooth cutoff supported on with , define . Its sum over any interval of length is , uniformly in the interval location. Here is the derivative energy constant for a smooth sieve cutoff. Expanding the square yields an interval-counting error and an Euler product for a smoothed divisor-square correlation; its zeta function pole provides the main term. Every prime exceeding has weight one, giving the short-interval prime upper bound from a smooth divisor weight.
For , the series has local factor . Dividing by the displayed zeta function ratio leaves a holomorphic function near zero with . The local factor of is , where , , , and equals one exactly at zero. With , the zeta function poles produce the kernel that determines the smooth divisor-square sieve asymptotic.
Write . The double integral equals the displayed constant. Express the denominator as a Laplace integral and each differentiated Fourier factor as , then use Fubini's theorem. For a real cutoff the resulting square is positive even though the Fourier transform factors have no complex conjugation. The Cauchy-Schwarz inequality and , give .
For , a smooth Selberg divisor weight of level equals one on every prime in . Its second moment can be expressed through an Euler product whose zeta-factor bound contributes after integration against rapidly decreasing Fourier transforms. Consequently

Ancestors (8)

  1. Selberg sieve
  2. Upper-bound sieve
  3. Sieve theory
  4. Analytic number theory
  5. Number theory
  6. Area of mathematics
  7. Mathematics
  8. Home

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.