An Euler product factors a Dirichlet series into local factors indexed by prime numbers. For a multiplicative arithmetic function and in a half-plane of absolute convergence,
For , logarithmic expansion of the Euler product reduces positivity to . At primes dividing the modulus the zeta contribution is positive by itself. If the last factor is bounded at the line-one point, a zero of the middle factor would outweigh the zeta pole and force this product to zero. This proves the relevant nonvanishing of Dirichlet L-functions on the line one.
For a finite set of primes choose , put , and let . Give each squarefree integer on these primes probability . Inclusion of each prime is represented by a Bernoulli random variable with parameter ; these are independent random variables, so . If this is at most with , the Markov inequality givesThis turns a full Euler product into a lower bound for the truncated normalizing sum of a Selberg sieve.
For a finite set of primes,expands as the sum of over positive integers whose prime factors are at most . It contains every term with , so these partial products dominate the harmonic series and diverge. Sinceuniformly for , convergence of would force convergence of the logarithms of these products, a contradiction.
For , the harmonic number exceeds . The finite Euler product over the primes at most contains every summand of this harmonic number. Taking logarithms and applying the geometric-series bound for the logarithmic remainder bounds the total remainder by , proving the displayed bound.
For every complex number with ,Applying this to each prime-power term in logarithms of Euler products proves thatfor and every completely multiplicative bounded by one.
Articles by others on the same topic
The Euler product formula is a representation of a function, particularly in number theory, which expresses a function as an infinite product over prime numbers. It is most famously used in relation to the Riemann zeta function, \( \zeta(s) \), for complex numbers \( s \) where the real part is greater than 1.