The is the sum ζ(s)=1+1/2s+1/3s+1/4s+⋯ This chapter treats it for real numbers s only: when the sum has a value, and why it equals a product over the .
The sum
Fix a real number s and add up 1/ns over the whole numbers n=1,2,3,… For s=2 the terms are 1,1/4,1/9,1/16,…, and the sum is 1.6449… ( showed it is exactly π2/6). The larger s is, the faster the terms shrink.
For s=1 the terms are 1,1/2,1/3,1/4,… They shrink, but too slowly: the sum of the first N terms is about lnN+0.577, which grows without bound. This is the harmonic series, and it has no finite sum.
The dividing line is s=1. To see why, compare each term with an area. The term 1/ns is the area of a rectangle of width 1 and height 1/ns. Place that rectangle on the interval from n−1 to n. The curve y=1/xs is decreasing, so on that interval it lies above the rectangle, and the area under the curve is larger:
ns1≤∫n−1nxsdx
Add this up over n=N+1,N+2,… The intervals join up into everything to the right of N:
n>N∑ns1≤∫N∞xsdx=s−1N1−swhen s>1
So for s>1 the terms after the N-th add up to at most N1−s/(s−1), which shrinks to 0 as N grows. The sum converges.
Placing each rectangle one step to the right, on the interval from n to n+1, puts it above the curve and gives the opposite inequality: the terms from the N-th on add up to at least the same . For s≤1 that integral is infinite, so the sum is too. The two bounds differ by less than a single term, so the integral is also a good estimate of what the remaining terms add up to.
So ζ(s) is defined, for now, only for s>1.
Lab 2.1 adding up the first N terms of 1/ns
the curve y = 1/xsrectangles of height 1/ns for the terms after the N-th
sum of the first n termsdashed line: ζ(s), when s > 1
Top: the next ten terms after the N-th, each drawn as a rectangle of width 1. They fit under the curve, so their total area is less than the area under the curve. Bottom: the running total. Its horizontal axis is the number of terms, on a . For s>1 the curve levels off at ζ(s). For s≤1 it keeps climbing: at s=1 it is a straight line on this scale, because the sum grows like lnn.
Near s=1
As s decreases toward 1 the sum grows without bound. The integral above with N=1 says how: ζ(s) is close to 1/(s−1). More precisely, ζ(s)−1/(s−1) tends to 0.5772…, a number called .
Lab 2.2 ζ(s) for real s > 1
ζ(s)1/(s − 1) + 0.5772
Hover to read values. Near s=1 the two curves coincide. For large s the sum is barely more than its first term, so ζ(s) approaches 1.
The product over primes
Recall the geometric series: for ∣x∣<1, 1+x+x2+x3+⋯=1/(1−x). Put x=1/2s:
1−2−s1=1+2s1+4s1+8s1+⋯ This is the part of the zeta sum that runs over the powers of 2.
Do the same for 3 and multiply the two series together:
Each product of a term from the first bracket and a term from the second is 1/ns for n=2a3b, and each such n occurs once. The numbers 5, 7, 10, 11, … are missing because they have a prime factor other than 2 and 3. Include a factor for every prime, and every whole number appears exactly once, because every whole number is a product of primes in exactly one way. This is Euler's product formula:
ζ(s)=pprime∏1−p−s1for s>1
Lab 2.3 the product over the primes up to P
product over the primes up to xdashed line: ζ(s)
Each prime multiplies the product by a factor slightly larger than 1, and the steps rise toward ζ(s). The last readout counts the numbers from 1 to 100 whose prime factors are all at most P: those are the terms of the sum that the truncated product already contains.
Three consequences
ζ(s) is never 0 for s>1. Every factor of the product is greater than 1.
There are infinitely many primes. If there were finitely many, the product would have a finite value at s=1. But as s decreases to 1 the sum grows without bound.
The weights of chapter 1 appear. Take the logarithm of the product, lnζ(s)=−p∑ln(1−p−s), and differentiate:
−ζ(s)ζ′(s)=n∑nsΛ(n) Here Λ(n)=lnp if n is a power of the prime p, and 0 otherwise.
The left side is built from ζ alone. The right side is a sum over with the same weights that define ψ(x). Exercise 2 derives it.
Things to try
In Lab 2.1, set s=1 and raise N. Each factor of 10 in N adds the same amount, about 2.3=ln10.
Set s=1.1. The sum converges, to about 10.58, but after 10,000 terms it has not reached 7. Compare the "still missing" readout with the bound next to it.
In Lab 2.3, set s=2 and P = 2, 3, 5. The product is 4/3, then 3/2, then 25/16. Watch how many of the numbers up to 100 are covered.
Lower s toward 1.1. Many more primes are needed for the product to come close.
Exercises
Multiply out the for s=2 using only the primes 2 and 3, and compare with ζ(2)≈1.645.Solution
1−411⋅1−1/91=(4/3)(9/8)=1.5. Multiplied out, this is the sum of 1/n2 over the numbers n whose only prime factors are 2 and 3. The missing 0.145 comes from every n divisible by a larger prime.
Derive −ζ(s)ζ′(s)=n∑nsΛ(n) from the Euler product.Solution
Start from lnζ(s)=−p∑ln(1−p−s) and differentiate: ζ(s)ζ′(s)=−p∑lnp⋅1−p−sp−s=−p∑lnp⋅(p−s+p−2s+p−3s+⋯) The second step is the geometric series. The term p−ks is 1/ns for n=pk, with coefficient lnp=Λ(n).
Use the integral estimate to say how many terms are needed to get ζ(2) to within 0.001, and ζ(1.1) to within 0.001.Solution
The missing tail is about N1−s/(s−1). For s=2 that is 1/N, so N≈1,000. For s=1.1 it is 10⋅N−0.1, which is below 0.001 only when N>1040. Close to s=1 the sum converges, but far too slowly to compute by adding terms.
Check your understanding
The terms 1/n shrink to 0, yet the harmonic series has no finite sum. What decides whether ∑1/ns converges?
Whether the terms tend to 0
How fast they shrink: the tail behaves like ∫dx/xs, which is finite only for s>1
Whether s is a whole number
Terms tending to 0 is necessary but not enough. At s=1 the first N terms add up to about lnN, which is unbounded.
The product using only the primes 2 and 3 is, multiplied out, a sum of 1/ns over which n?
All n up to 3
The multiples of 2 or 3
The n with no prime factor other than 2 and 3: 1, 2, 3, 4, 6, 8, 9, 12, …
Each term of the expanded product is 1/(2a3b)s. 10 is a multiple of 2 but is missing, because it also needs the prime 5.
How does the product formula show there are infinitely many primes?
With finitely many primes the product would stay finite as s→1, but the sum grows without bound there
The product has infinitely many factors by definition
It does not; that needs a separate argument
Sum and product are equal for every s>1. A finite product of the factors 1/(1−p−s) tends to a finite number as s→1, while the sum behaves like 1/(s−1). This was Euler's proof.