Character large sieve Created 2026-10-06 Updated 2026-10-07
For coefficients supported on consecutive integers,
The star restricts to primitive Dirichlet characters. Their finite Fourier transform of a primitive Dirichlet character has normalization of absolute value . Orthogonality of Dirichlet characters therefore bounds the weighted contribution for one modulus by . Sum over and use the exponential-sum large sieve on the distinct reduced fractions of denominators at most .
A suitable large sieve statement is the following. If are separated modulo one by at least and is supported on consecutive integers, then
The sharper classical constant also suffices, but is unnecessary for the requested bound. This is the exponential-sum large sieve.
Put , , and . By the orthogonality of roots of unity,
At most of these residue counts are nonzero. The Cauchy-Schwarz inequality gives , and the frequency contributes exactly . Thus, if ,
If for some prime, is empty and the result is immediate.
All fractions , , , are distinct reduced fractions. Their circular spacing is at least , because two distinct fractions of these denominators differ modulo one by at least . Apply the large sieve with and , and sum the preceding lower bounds:
For and a positive sieve denominator, division proves
When the denominator is zero this asserts no restriction; that degenerate case is interpreted as a vacuous bound.
For the least-nonresidue application, first establish the positive density of power-smooth integers. Fix , with an integer , and let tend to infinity. Choose ordered primes, with repetitions allowed, in the interval
Their product satisfies . Every number has , so is -smooth. By partial summation of the Prime number theorem, or the Mertens theorem for reciprocal primes,
The number of ordered representations is at least
because for .
This representation count must not be confused with a count of distinct integers. A number at most has at most prime factors in that interval, counted with multiplicity. There are therefore only a bounded number, depending on , of ordered -tuples which can occur as divisors of it; the cofactor is then fixed. Dividing by this bounded multiplicity proves
for a fixed and all sufficiently large .
Now work on a dyadic prime interval and let be the primes there with . Take and , so . Let be the -smooth integers at most . The density lemma gives for an absolute .
For each , every prime factor of a member of is at most and is smaller than . Hence it is a nonzero quadratic residue modulo . Multiplicativity of the Legendre symbol makes every member of a nonzero quadratic residue modulo . It therefore avoids all quadratic-nonresidue classes. In the sieve inequality set at exceptional primes and zero at every other prime up to . For odd , , so
Thus each dyadic interval has at most exceptional primes. The finitely many small intervals can be absorbed into this absolute bound. Summing the intervals up to proves the large-sieve logarithmic exceptional-prime bound for least quadratic nonresidues:
The least nonresidue is normally defined for odd primes; any convention at the prime two changes the count by at most one.
For coefficients supported on an interval of length , write and . The variance form of the large sieve states
The constant is absolute. One may take the explicit right side , by orthogonality of roots of unity and the exponential-sum large sieve proved in Question 2.
Take , , and the indicator function of the -smooth numbers up to . Applying the given smooth-number density with parameter gives
with a harmless adjustment of the constant for integer endpoints. If an odd prime has least quadratic nonresidue , then : a quadratic nonresidue always occurs among . Every prime factor of every selected smooth number is thus a nonzero quadratic residue modulo . By the multiplicativity of the Legendre symbol, every selected number is a nonzero quadratic residue modulo .
There are nonzero quadratic nonresidue classes, and on all of them. Their contribution to the variance is at least
If denotes the number of exceptional primes, the variance form of the large sieve, with , yields . Consequently
This is the bounded exceptional primes for least quadratic nonresidues argument. Using an interval of length is what matches the term; an interval of length would not give a bounded exceptional set.
The points are -spaced if their circular spacing satisfies for , where is distance to the nearest integer. Ordinary distance on the real line would be insufficient because the complex exponential is periodic.
Let and . Multiplication by this unit-modulus factor leaves unchanged and places the frequencies of in . Put . The permitted Sobolev–Gallagher inequality, in the form needed here, is
For , the arcs about the have disjoint interiors on the circle group. Summing and applying the Cauchy-Schwarz inequality gives
The Cauchy-Schwarz inequality here follows by expanding and minimizing over . For completeness, the finite-interval Parseval identities follow by expanding the squares: is one at and zero at every other integer . Thus and . We obtain the exponential-sum large sieve bound
If , there is at most one point, and the direct Cauchy-Schwarz inequality bound proves the same assertion.
For coefficients supported on an interval of consecutive integers, set and . Then
The orthogonality of roots of unity gives . The distinct fractions have circular spacing at least ; now apply the exponential-sum large sieve.