Orthogonality of Dirichlet characters
ProvedFamousTheorems.dirichlet_character_orthogonalityOrthogonality of Dirichlet characters. Let , and let be an integral domain containing enough roots of unity. Then for every with ,
where runs over all Dirichlet characters modulo with values in .
This is the orthogonality relation for Dirichlet characters, in the variable . It lets one pick out an arithmetic progression by averaging over characters. That is the key device in Dirichlet's theorem on primes in arithmetic progressions.
Formalization note. Mathlib's DirichletCharacter.sum_characters_eq_zero. "Enough roots of unity" is HasEnoughRootsOfUnity R (Monoid.exponent (ZMod n)ˣ): contains a primitive root of unity whose order is the exponent of . This guarantees that there are characters with values in . For not a unit, every is .
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem dirichlet_character_orthogonality (R : Type*) [CommRing R] {n : ℕ} [NeZero n] [HasEnoughRootsOfUnity R (Monoid.exponent (ZMod n)ˣ)]
[IsDomain R] {a : ZMod n} (ha : a ≠ 1) : ∑ χ : DirichletCharacter R n, χ a = 0 := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `DirichletCharacter.sum_characters_eq_zero`. Proof here reduces to that Mathlib result.