Siegel–Walfisz theorem
E871402
The Siegel–Walfisz theorem is a result in analytic number theory that gives strong uniform estimates for the distribution of prime numbers in arithmetic progressions with relatively small moduli.
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
result in number theory
ⓘ
theorem in analytic number theory ⓘ |
| appearsIn | advanced textbooks on analytic number theory ⓘ |
| appliesTo | reduced residue classes modulo q ⓘ |
| assumes | Generalized Riemann Hypothesis is not required ⓘ |
| concerns |
asymptotic formula for π(x;q,a)
ⓘ
error terms independent of the residue class a ⓘ prime numbers in arithmetic progressions with small moduli ⓘ uniformity over all reduced residue classes a modulo q ⓘ |
| context | distribution of primes in residue classes ⓘ |
| dealsWith |
distribution of prime numbers
ⓘ
primes in arithmetic progressions ⓘ |
| ensures | uniformity in the modulus for primes in arithmetic progressions ⓘ |
| errorTermType | O(x exp(-c√(log x))) for some c > 0, uniformly in q up to (log x)^A ⓘ |
| field | analytic number theory ⓘ |
| gives | strong uniform estimates for primes in arithmetic progressions ⓘ |
| givesBound | error term that is smaller than any fixed power of log x ⓘ |
| hasConsequence | primes are evenly distributed among coprime residue classes for small moduli ⓘ |
| historicalPeriod | 20th century mathematics ⓘ |
| implies | equidistribution of primes among reduced residue classes modulo q for small q ⓘ |
| involves |
Euler's totient function φ(q)
ⓘ
logarithmic functions of x ⓘ |
| isToolFor |
bounding primes in specific congruence classes
ⓘ
results on primes represented by polynomials with congruence conditions ⓘ |
| language | mathematical analysis ⓘ |
| namedAfter |
Arnold Walfisz
NERFINISHED
ⓘ
Carl Ludwig Siegel NERFINISHED ⓘ |
| quantifies | error term in the prime number theorem for arithmetic progressions ⓘ |
| relatedTo |
Bombieri–Vinogradov theorem
NERFINISHED
ⓘ
Dirichlet's theorem on arithmetic progressions NERFINISHED ⓘ Generalized Riemann Hypothesis NERFINISHED ⓘ zero-free region for Dirichlet L-functions ⓘ |
| requires | bounds on character sums ⓘ |
| statesRoughly | π(x;q,a) is x/(φ(q) log x) with a very small uniform error for q ≤ (log x)^A ⓘ |
| strengthens | non-uniform versions of the prime number theorem in arithmetic progressions ⓘ |
| strongerThan | classical prime number theorem for arithmetic progressions for small moduli ⓘ |
| subjectArea | prime number theory ⓘ |
| typeOfResult | uniform distribution theorem ⓘ |
| typicalFormulationInvolves | arbitrary constant A > 0 controlling the size of the modulus GENERATED ⓘ |
| usedIn |
applications in additive number theory
ⓘ
proofs about primes in short intervals in arithmetic progressions ⓘ sieve methods ⓘ |
| uses |
Dirichlet L-functions
NERFINISHED
ⓘ
analytic properties of Dirichlet characters ⓘ zero-free regions for L-functions ⓘ |
| validFor | moduli q up to a fixed power of log x ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.