Dirichlet's Theorem on primes in arithmetic progression #
The goal of this file is to prove Dirichlet's Theorem: If q
is a positive natural number
and a : ZMod q
is invertible, then there are infinitely many prime numbers p
such that
(p : ZMod q) = a
.
This will be done in the following steps:
- Some auxiliary lemmas on infinite products and sums
- Results on the von Mangoldt function restricted to a residue class
- (TODO) Results on its L-series and an auxiliary function related to it
- (TODO) Derivation of Dirichlet's Theorem
Auxiliary statements #
An infinite product or sum over a function supported in prime powers can be written as an iterated product or sum over primes and natural numbers.
The L-series of the von Mangoldt function restricted to a residue class #
The von Mangoldt function restricted to the residue class a
mod q
.
Equations
- ArithmeticFunction.vonMangoldt.residueClass a = {n : ℕ | ↑n = a}.indicator fun (x : ℕ) => ArithmeticFunction.vonMangoldt x
Instances For
We can express ArithmeticFunction.vonMangoldt.residueClass
as a linear combination
of twists of the von Mangoldt function with Dirichlet charaters.
We can express ArithmeticFunction.vonMangoldt.residueClass
as a linear combination
of twists of the von Mangoldt function with Dirichlet charaters.
The L-series of the von Mangoldt function restricted to the residue class a
mod q
with a
invertible in ZMod q
is a linear combination of logarithmic derivatives of
L-functions of the Dirichlet characters mod q
(on re s > 1
).