A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Dirichlet Series and L-Functions

Research Depth 83 in the knowledge graph I know this Set as goal
19topics build on this
390prerequisites beneath it
See this on the map →
Introduction to the Riemann Zeta FunctionPrimes in Arithmetic Progressions (Dirichlet's Theorem)
dirichlet-series l-functions analytic-number-theory

Core Idea

Dirichlet L-functions L(s, χ) = Σ χ(n)/ns generalize the Riemann zeta function for Dirichlet characters χ. They satisfy functional equations and have Euler products, enabling study of primes in arithmetic progressions and other structured subsets of integers.

Explainer

From the Riemann zeta function you already know that ζ(s) = Σ 1/ns encodes deep arithmetic information, particularly about primes, via its Euler product ζ(s) = Π (1 − p^−s)^−1. A Dirichlet series is any series of the form Σ a(n)/ns, and the zeta function is simply the case where a(n) = 1 for all n. The key insight of analytic number theory is to replace the constant sequence 1 with a richer arithmetic function — one that "sees" structure in the integers that 1 cannot detect.

A Dirichlet character χ mod q is a completely multiplicative, periodic function on the integers that is zero on integers sharing a common factor with q, and otherwise takes values that are roots of unity. The principal character χ₀ just assigns 1 to integers coprime to q and 0 otherwise, making L(s, χ₀) essentially ζ(s) with finitely many factors removed. Non-principal characters are the interesting ones: they "color" residues mod q differently, and the L-function L(s, χ) = Σ χ(n)/ns becomes a weighted zeta function that selectively picks up integers according to their residue class. Because χ is completely multiplicative, L(s, χ) also factors into an Euler product L(s, χ) = Π_p (1 − χ(p)p^−s)^−1, one factor per prime.

The reason Dirichlet introduced these objects was to prove that every arithmetic progression a, a+q, a+2q, … with gcd(a, q) = 1 contains infinitely many primes — a statement you cannot prove by the same direct argument used for primes overall. The key is to show L(1, χ) ≠ 0 for all non-principal characters, which requires complex analysis. Think of it as follows: if you take a formal "average" of L(s, χ) over all characters mod q, the multiplicativity and orthogonality of characters cause most prime contributions to cancel — except for primes in the specific residue class a mod q. Showing these L-functions are nonzero at s = 1 is the heart of Dirichlet's theorem.

Like the Riemann zeta function, L-functions satisfy functional equations that relate L(s, χ) to L(1 − s, χ̄) (where χ̄ is the conjugate character), allowing analytic continuation to the whole complex plane. The analogue of the Riemann Hypothesis — that the non-trivial zeros of L(s, χ) all lie on the line Re(s) = 1/2 — is known as the Generalized Riemann Hypothesis (GRH), and most of analytic number theory would become considerably sharper if it were proved. Every result you will encounter about primes in arithmetic progressions and residue structure ultimately traces back to the non-vanishing and zero distribution of these L-functions.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementProof by CasesProving by Cases and ExhaustionVacuous Truth and Trivial CasesProof by Cases (Proof by Exhaustion)Mathematical InductionDivisibility and Greatest Common DivisorThe Fundamental Theorem of ArithmeticDivisibility Theory (Formal Treatment)Fundamental Theorem of Arithmetic (Rigorous Proof)Arithmetic Functions and MultiplicativityDirichlet Series and L-FunctionsPrimes in Arithmetic Progressions (Dirichlet's Theorem)Distribution of PrimesIntroduction to the Riemann Zeta FunctionDirichlet Series and L-Functions

Longest path: 84 steps · 390 total prerequisite topics

Prerequisites (1)

Leads To (1)