Equivalence of Definitions of Second Chebyshev Function

Definition 1 equivalent to Definition 2
The equivalence:
 * $\ds \sum_{k \ge 1} \sum_{p^k \mathop \le x} \ln p \equiv \sum_{1 \mathop \le n \mathop \le x} \map \Lambda n$

follows directly from the definition of the von Mangoldt function.

Definition 1 equivalent to Definition 3
If $x < 2$, then:
 * $\ds \sum_{k \ge 1} \sum_{p^k \mathop \le x} \ln p = \sum_{p \mathop \le x} \floor {\log_p x} \ln p = 0$

since the sums are empty.

So take $x \ge 2$.

Consider the sum:
 * $\ds \sum_{k \ge 1} \sum_{p^k \le x} \ln p$

This sum runs over the pairs of natural numbers $\tuple {k, p}$ such that $p$ is a prime number with $p^k \le x$.

Equivalently, for each prime $p$, we sum over the natural numbers $k$ with $p^k \le x$.

Since $p^k \le x$ implies that $p \le x$, such $k$ only exists if $p \le x$.

Note that for a fixed prime number $p$, we have $p^k \le x$ :
 * $k \ln p \le \ln x$

by Logarithm of Power and Logarithm is Strictly Increasing.

Since $p \ge 2$, this is equivalent to:
 * $\ds k \le \frac {\ln x} {\ln p} = \log_p x$

So, we can equivalently sum $\ln p$ over the pairs of natural numbers $\tuple {p, k}$ such that $p \le x$ is a prime number and $k \le \log_p x$.

That is:

for $x \ge 2$.

Hence:
 * $\ds \forall x \in \R: \sum_{k \ge 1} \sum_{p^k \mathop \le x} \ln p = \sum_{p \mathop \le x} \floor {\log_p x} \ln p$