Derivation of the Analytic Expression for the Prime Number Theorem
Introduction
The Prime Number Theorem (PNT) provides a fundamental approximation for the distribution of prime numbers less than a given integer $ x $. It states that the number of primes less than $ x $, denoted $ \pi(x) $, is asymptotically equivalent to $ \frac{x}{\log x} $. This result, first conjectured by Gauss and later rigorously proven by Hadamard and de la Vallée Poussin in the 19th century, has profound implications in number theory. The analytic expression for the PNT involves the logarithmic integral function $ \text{li}(x) $, which is a more precise approximation of $ \pi(x) $ than the simple $ \frac{x}{\log x} $. The derivation of this expression relies on advanced techniques from complex analysis, including the functional equation of the Riemann zeta function and the Euler-Maclaurin formula. This article explores the mathematical foundations of the PNT’s analytic expression, focusing on the interplay between the zeta function, its zeros, and the asymptotic behavior of prime counting functions.
The Riemann Zeta Function and Its Functional Equation
The Riemann zeta function $ \zeta(s) $ is defined for complex numbers $ s $ with real part $ \Re(s) > 1 $ as $ \zeta(s) = \sum_{n=1}^{\infty} \frac{1}{n^s} $. Its functional equation, discovered by Riemann, relates $ \zeta(s) $ to $ \zeta(1-s) $:
$$
\zeta(s) = 2^s \pi^{s} \sin\left(\frac{\pi s}{2}\right) \frac{1}{\Gamma(s)}
$$
This equation connects the values of the zeta function at $ s $ and $ 1-s $, allowing for the extension of the zeta function to the entire complex plane. The functional equation is pivotal in the derivation of the PNT’s analytic expression, as it enables the evaluation of $ \zeta(s) $ at the critical line $ \Re(s) = 1 $, where the zeta function diverges.
Asymptotic Behavior of Prime Counting Functions
The prime counting function $ \pi(x) $ is closely related to the summatory function of the Möbius function $ \mu(n) $, which is defined as $ \sum_{n=1}^{x} \mu(n) $. The explicit formula for $ \pi(x) $ connects $ \pi(x) $ to the sum over the zeros of the zeta function:
$$
\pi(x) = \text{li}(x) - \frac{1}{2} \sum_{\rho} \frac{x^{\rho}}{\rho} + o\left(\frac{x^{1/2}}{\log x}\right)
$$
where $ \rho $ denotes the non-trivial zeros of $ \zeta(s) $. This formula incorporates the contributions of the zeros, which are critical for refining the asymptotic approximation of $ \pi(x) $. The term $ \text{li}(x) $, the logarithmic integral, serves as the leading term in the approximation, while the correction term accounts for the distribution of the zeros.
Derivation of the Analytic Expression
The analytic expression for the PNT is derived by combining the functional equation of the zeta function with the Euler-Maclaurin formula, which approximates sums of functions by integrating their values. The Euler-Maclaurin formula allows the evaluation of $ \text{li}(x) $ as a sum over the first few terms of the zeta function’s values, plus corrections from the derivatives of the function. For $ \zeta(s) $, the functional equation provides the necessary relationship between $ \zeta(s) $ and $ \zeta(1-s) $, enabling the extension of the zeta function to the critical line $ \Re(s) = 1 $.
The derivation proceeds as follows:
- Functional Equation Expansion: The functional equation of $ \zeta(s) $ is used to express $ \zeta(s) $ in terms of $ \zeta(1-s) $, allowing the evaluation of $ \zeta(s) $ at $ s = 1 $, where the zeta function diverges.
- Approximation via Euler-Maclaurin: The Euler-Maclaurin formula is applied to approximate the summatory function $ \sum_{n=1}^{x} \frac{1}{n^s} $, which is closely related to $ \text{li}(x) $. This involves expanding the sum into an integral and accounting for the