AlexKontorovich/PrimeNumberTheoremAnd
Source indexedtheorem · leanprover/lean4:v4.32.0
WeakPNT_character
PrimeNumberTheoremAnd.Wiener · PrimeNumberTheoremAnd/Wiener.lean:3912 to 3948
Source documentation
\section{The prime number theorem in arithmetic progressions}
Exact Lean statement
@[blueprint "WeakPNT-character"
(title := "WeakPNT-character")
(statement := /--
If $q ≥ 1$ and $a$ is coprime to $q$, and $\mathrm{Re} s > 1$, we have
$$
\sum_{n: n = a\ (q)} \frac{\Lambda(n)}{n^s} = - \frac{1}{\varphi(q)} \sum_{\chi\ (q)}
\overline{\chi(a)} \frac{L'(s,\chi)}{L(s,\chi)}.$$
-/)
(proof := /--
From the Fourier inversion formula on the multiplicative group $(\Z/q\Z)^\times$, we have
$$ 1_{n=a\ (q)} = \frac{\varphi(q)}{q} \sum_{\chi\ (q)} \overline{\chi(a)} \chi(n).$$
On the other hand, from standard facts about L-series we have for each character $\chi$ that
$$
\sum_{n} \frac{\Lambda(n) \chi(n)}{n^s} = - \frac{L'(s,\chi)}{L(s,\chi)}.$$
Combining these two facts, we obtain the claim.
-/)
(latexEnv := "lemma")]
theorem WeakPNT_character
{q a : ℕ} (hq : q ≥ 1) (ha : Nat.Coprime a q) (ha' : a < q) {s : ℂ} (hs : 1 < s.re) :
LSeries (fun n ↦ if n % q = a then Λ n else 0) s =
- (∑' χ : DirichletCharacter ℂ q,
((starRingEnd ℂ) (χ a) * ((deriv (LSeries (fun n:ℕ ↦ χ n)) s)) /
(LSeries (fun n:ℕ ↦ χ n) s))) / (Nat.totient q : ℂ)Complete declaration
Lean source
Full Lean sourceLean 4
@[blueprint "WeakPNT-character" (title := "WeakPNT-character") (statement := /-- If $q ≥ 1$ and $a$ is coprime to $q$, and $\mathrm{Re} s > 1$, we have $$ \sum_{n: n = a\ (q)} \frac{\Lambda(n)}{n^s} = - \frac{1}{\varphi(q)} \sum_{\chi\ (q)} \overline{\chi(a)} \frac{L'(s,\chi)}{L(s,\chi)}.$$ -/) (proof := /-- From the Fourier inversion formula on the multiplicative group $(\Z/q\Z)^\times$, we have $$ 1_{n=a\ (q)} = \frac{\varphi(q)}{q} \sum_{\chi\ (q)} \overline{\chi(a)} \chi(n).$$ On the other hand, from standard facts about L-series we have for each character $\chi$ that $$ \sum_{n} \frac{\Lambda(n) \chi(n)}{n^s} = - \frac{L'(s,\chi)}{L(s,\chi)}.$$ Combining these two facts, we obtain the claim. -/) (latexEnv := "lemma")]theorem WeakPNT_character {q a : ℕ} (hq : q ≥ 1) (ha : Nat.Coprime a q) (ha' : a < q) {s : ℂ} (hs : 1 < s.re) : LSeries (fun n ↦ if n % q = a then Λ n else 0) s = - (∑' χ : DirichletCharacter ℂ q, ((starRingEnd ℂ) (χ a) * ((deriv (LSeries (fun n:ℕ ↦ χ n)) s)) / (LSeries (fun n:ℕ ↦ χ n) s))) / (Nat.totient q : ℂ) := by have : NeZero q := ⟨by omega⟩ convert vonMangoldt.LSeries_residueClass_eq ((ZMod.isUnit_iff_coprime a q).mpr ha) hs using 1 · congr with n have : n % q = a ↔ (n : ZMod q) = a := by rw [ZMod.natCast_eq_natCast_iff', Nat.mod_eq_of_lt ha'] simp [this] split_ifs <;> simp [*] · rw [div_eq_inv_mul, neg_mul_comm, tsum_fintype] congr 3 with χ rw [DirichletCharacter.deriv_LFunction_eq_deriv_LSeries _ hs, DirichletCharacter.LFunction_eq_LSeries _ hs, mul_div] congr 2 rw [starRingEnd_apply, MulChar.star_apply', MulChar.inv_apply_eq_inv', ← ZMod.coe_unitOfCoprime a ha, ZMod.inv_coe_unit, map_units_inv]