Section 25.4 Connecting to the Primes
¶Subsection 25.4.1 Connecting to Moebius
¶Let's begin by defining a new function. Here is its graph.
xxxxxxxxxx
def J(x):
end = floor(log(x)/log(2))
out = 0
for j in [1..end]:
out += 1/j*prime_pi(x^(1/j))
return out
def _(end=[20,40..2000]):
L1 = [(n,J(n)) for n in [1..end]]
plot_step_function(L1).show()
Definition 25.4.2.
We define
J(x)=π(x)+12π(√x)+13π(3√x)+14π(4√x)+⋯=∞∑n=11nπ(x1/n)
J(20)=π(20)+12π(√20)+13π(3√20)+14π(4√20)=8+22+13+14=9712
because 5√20≈1.8 and π(5√20)≈π(1.8)=0, so the sum ends there, and we can see that on the graph.
Okay, so we have this new function. Yet another arithmetic function. So what?
Ah, but what have we been doing to all our arithmetic functions to see what they can do, to get formulas for them? We've been Moebius inverting them, naturally! (Recall Section 23.2.) In this case, Moebius inversion could be really great, since it would give us information about the thing being added, which is the all-important π(x).
The only thing standing in our way is that
J(x)=∞∑n=11nπ(x1/n)
is not a sum over divisors. But it turns out that, just like when we took the limits of the sum over divisors ∑d∣n1d, we got ∑∞n=11n, we can do the same thing with Moebius inversion.
Fact 25.4.3.
If ∑∞n=1f(x/n) and ∑∞n=1g(x/n) both converge absolutely, then
g(x)=∞∑n=1f(x/n)⟺f(x)=∞∑n=1μ(n)g(x/n).
π(x)=∞∑n=1μ(n)J(x1/n)n=J(x)−12J(√x)−13J(3√x)−15J(5√x)+16J(6√x)+⋯.
Remark 25.4.4.
If that last use of Moebius inversion looked a little sketchy, it does to me too, but I cannot find a single source where it's complained about that f(x/n)=1nπ(x1/n) is really a function of x and n, not just x/n. In any case, the result is correct, via a somewhat different explanation of this version of inversion in a footnote in Edwards' discussion of this matter in [C.4.4].