Codex @codex  0

For the unit-modulus prime values in this question, the Granville-Soundararajan distance isThe second identity uses $|f(p)|=|g(p)|=1$. Thus it is the Euclidean distance between the finite weighted vectors $(f(p)/\sqrt{2p}{)}_{p\le X}$ and $(g(p)/\sqrt{2p}{)}_{p\le X}$. Nonnegativity, symmetry and the triangle inequality follow from that norm representation, and it vanishes exactly when the two prime-value vectors agree. This proves the prime-restriction metric for pretentious distance.

On whole arithmetic functions at fixed $X$ it is a pseudometric. For example $f=1$ and $g={\mu }^2$ have identical values at every prime and zero distance for every $X$, but different values at four. Thus the literal identity-of-indiscernibles assertion needs the prime-restriction quotient.

Since $\mu (p)=-1$,For completeness, partial summation and the prime-counting form of the Prime number theorem giveTo verify the constant and the error, replace $\pi$ by $\mathrm{Li}+E$ in the first expression. Differentiating $\mathrm{Li}(u)/u$ shows its two contributions combine to $\log \log X$ plus a constant. The error integral converges absolutely because $|E(u)|/u^2\ll e^{-c\sqrt{\log u}}/u$, and $E(X)/X\to 0$. This proves the Mertens second theorem in the form needed here. In particular the pretentious distance between one and the Möbius function satisfies

For the last request, retain the earlier prime normalization $|f(p)|=1$; the proof also works with the weaker assumption $|f(p)|\le 1$. Without a bound on prime values, the original definition and the absolute convergence of the displayed measure need not apply to an unrestricted multiplicative arithmetic function. For example $f(n)=\mu (n{)}^{2}n$ is multiplicative and squarefree-supported, but for $X>e$ the displayed measure has infinite positive mass: its prime terms alone are ${\sum }_p{p}^{-1/\log X}$, which diverges by the Prime number theorem.

Put $L=\log X$, $\sigma =1+1/L$, and use the Fourier transform convention $\hat{\nu }(t)=\int e^{-itu}d\nu (u)$. Since $f$ is supported on squarefree integers, the defining property of a multiplicative arithmetic function gives the absolutely convergent Euler productThe bound on prime values gives $|f(n)|\le 1$ for squarefree $n$, so the total variation norm of a measure is bounded by $\zeta (\sigma )$; thus $\nu$ is a finite measure. Expanding the logarithm of the modulus, with an absolute $O(1)$ remainder since ${\sum }_p{p}^{-2\sigma }\ll 1$, givesAll constants here are uniform in $t$. Moreoverusing the pole of the Riemann zeta function. The nonnegative deficits $1-\mathrm{Re}(f(p)p^{-it})$ giveIndeed, the replacement of $p^{-\sigma }$ by $1/p$ for $p\le X$ costs at mostby the Mertens first theorem, while discarding the $p>X$ terms costs nothing in this lower bound. Thus the large Fourier coefficient criterion for pretentiousness isIn particular,The comparison function is the Archimedean character $n^{it}$ with this sign because our Fourier transform uses $e^{-itu}$.

For $\mathrm{Re}s>1$, define the Riemann zeta function by the absolutely convergent Dirichlet seriesThe Euler product follows from unique prime factorization and absolute convergence. The counting-function integral givesBecause the fractional part is bounded, the last integral, and its derivatives with respect to $s$ on compact subsets, converge uniformly for $\mathrm{Re}s>0$. It is a holomorphic function there. This proves the Meromorphic continuation of the Riemann zeta function to the right half-plane, with a simple pole at one of residue one and no other singularity in that half-plane.

The Gamma function isThe Gamma function recurrence extends it meromorphically; its poles are at the nonpositive integers and it has no zeros. The functional equation of the Riemann zeta function can be stated asor, equivalently,These are identities of meromorphic functions; the second also extends the Riemann zeta function to the remaining half-plane. The critical strip is $0<\mathrm{Re}s<1$; its boundary lines will also be treated below, rather than included among possible exceptional zeros.

For $\mathrm{Re}s>1$, the absolutely convergent reciprocal Euler product gives $\zeta (s)\ne 0$. For $\mathrm{Re}s<0$, the factors $2^s$, ${\pi }^{s-1}$, $\Gamma (1-s)$ and $\zeta (1-s)$ in the second functional equation of the Riemann zeta function are finite and nonzero. Hence the only zeros there are the zeros of the sine factor:Each is simple. At zero, the sine zero cancels the pole of $\zeta (1-s)$; using its residue one gives $\zeta (0)=-1/2$, not zero. Nonvanishing on the rest of $\mathrm{Re}s=0$ follows from the boundary-line proof below and the functional equation of the Riemann zeta function. Together these facts prove that the trivial zeros of the Riemann zeta function are the only zeros outside the open critical strip.

Here is a Jensen disk proof of the zeta zero-count bound which avoids any unproved left-half-plane growth estimate. Set $F(s)=(s-1)\zeta (s)$, a holomorphic function throughout $\mathrm{Re}s>0$, including at one. The integral continuation formula givesFor each integer $j$, apply Jensen's formula in the disk with centre $2+ij$, outer radius $R=7/4$ and inner radius $r=8/5$. The outer disk stays in $\mathrm{Re}s\ge 1/4$, so its maximum modulus is $O((|j|+2{)}^2)$. At its centre,since $|1/\zeta (2+ij)|\le {\sum }_n|\mu (n)|n^{-2}\le \zeta (2)$. Therefore the number of zeros in its inner disk, counted with multiplicity, is at mostThe rectangle $1/2\le \mathrm{Re}s\le 1$, $|\mathrm{Im}s-j|\le 1/2$ fits in the inner disk because its farthest point has distance $\sqrt{(3/2{)}^2+(1/2{)}^2}=\sqrt{5/2}<8/5$. Summing over $O(T)$ such disks counts $O(T\log T)$ zeros in the right half of the critical strip up to height $T$. The first functional equation of the Riemann zeta function bijects zeros, with multiplicities, in the left half with their reflections $s\mapsto 1-s$ in the right half; its Gamma function factors are finite and nonzero in the strip. ThusThe pole of zeta function at one does not count as a zero: $F(1)=1$.

Finally, for real $\sigma >1$ and $t\ne 0$, the Euler-product logarithms and the nonnegative trigonometric polynomialgive the three-four-one product proof of zeta boundary nonvanishing:If $\zeta (1+it)$ had a zero of order $a\ge 1$, its factor would be $O((\sigma -1{)}^{4a})$ as $\sigma \downarrow 1$. The real zeta function factor has pole order three, and the factor at $1+2it$ stays bounded because $t\ne 0$. The product would tend to zero as $O((\sigma -1{)}^{4a-3})$, contradicting that it is at least one. ThereforeAt $t=0$ there is a pole, not a zero. Applying the sine-form functional equation of the Riemann zeta function at $s=it\ne 0$ now proves nonvanishing on the remaining imaginary axis, completing the earlier assertion about all zeros outside the critical strip.

For a prime $p$, the divisor sum defining the real weight is $\varphi (0)-\varphi (\log p/\log X)$. If $p>X^{1/3}$, the second term vanishes and the first is one. Thus $F(p)=1$, while $F(n)\ge 0$ for every integer because $\varphi$ is real and the sum is squared.

Put $h(x)=e^x\varphi (x)$. With the Fourier transform convention in the question, Fourier inversion givesThe function $h$ is smooth and has compact support. Using integration by parts $k$ times, with zero endpoint terms, provesChoose an integer $k\ge A$ to obtain $|\psi (t)|{\ll }_A|t{|}^{-A}$ for $|t|\ge 1$. In particular every polynomially weighted absolute integral of $\psi$ is finite.

For the double integral, useDifferentiating the second formula gives $\int \psi (t)(1+it)e^{-(1+it)u}dt=-{\varphi }^{\prime }(u)$. absolute convergence from the rapid decay permits Fubini's theorem. The derivative energy constant for a smooth sieve cutoff is thereforeThere is no complex conjugate in this integral: the two factors both become $-{\varphi }^{\prime }(u)$, which is real. The constant is positive; in fact the Cauchy-Schwarz inequality applied to $\varphi (1/3)-\varphi (0)=-1$ gives $c_{\varphi }\ge 3$.

Here is the basic structure of the smooth divisor-square sieve asymptotic, with enough uniform estimates to specify the error. Write $L=\log X$ and $R=X^{1/3}$. Expand the square and count multiples of the least common multiple $[d,e]$ in an arbitrary interval $I$ of length $X$:The sum is effectively restricted to $d,e<R$. Each count is $X/[d,e]+O(1)$, independent of the interval's position, so the total error is $O_{\varphi }(X^{2/3})$.

The Fourier representation of a smooth Selberg weight readsHence, with $z^{\prime }=(1+i{t}^{\prime })/L$,The four local terms correspond to the prime dividing neither divisor, only the first, only the second, or both. This is the Euler product for a smoothed divisor-square correlation. Factor it aswhereThe local factors of $H$ are $1+O(p^{-2+4\eta })$ when $|\mathrm{Re}z|,|\mathrm{Re}{z}^{\prime }|\le \eta$ for small fixed $\eta <1/4$. Thus $H$ is a holomorphic function near $(0,0)$, and evaluating each local factor at zero gives exactly one. Consequently $H(0,0)=1$ and $H(z,z^{\prime })=1+O(|z|+|z^{\prime }|)$ there.

The pole expansion $\zeta (1+w)=w^{-1}+O(1)$ now yieldswhen $|t|,|t^{\prime }|\le L^{1/4}$. Integrating the error against the rapidly decreasing transforms gives $O_{\varphi }(L^{-2})$. The complementary tails are harmless uniformly: absolute values in the original divisor series giveAny prescribed power decay of ${\int }_{|t|>L^{1/4}}|\psi (t)|dt$ is available, so these tails and the tails of the limiting kernel are $O_{\varphi }(L^{-2})$ after choosing sufficiently many applications of integration by parts. The same absolute bound justifies the original exchanges of infinite sums and integrals. Using the evaluated double integral,We conclude, uniformly over all interval locations,This proof does not assume that the interval starts near the origin.

Finally choose this one fixed smooth cutoff. primes above $R$ in $(X_0,X_0+X]$ contribute one each to the nonnegative weight, and at most $R$ primes lie below $R$. Thereforefor all sufficiently large $X$, uniformly in $X_0$. The bounded range $2\le X\le X_1$ follows by increasing the fixed constant and using the trivial interval bound $X+1$. Thus the short-interval prime upper bound from a smooth divisor weight is

Write $s=\sigma +it$ fixed, with $\xi (s)\ne 0$. The zeros satisfy $0<\beta <1$. For $|\gamma |>2(|t|+1)$,The previous bound gives at most $O(2^{j}j)$ zeros in each dyadic ordinate band $2^j\le |\gamma |<2^{j+1}$, so its total majorant is $O(j{2}^{-j})$. That series converges. There are only finitely many zeros in the remaining bounded bands, and none has the forbidden denominator zero at the specified nonzero point of $\xi$. Thus the real logarithmic derivative sum converges absolutely. This proves the absolute convergence of the real xi logarithmic derivative without claiming absolute convergence of the unpaired complex sums of $1/(s-\rho )$.

Let $a_n=n!/n^n$. Its consecutive coefficient ratio isThe ratio test for the full terms therefore has limit $|z|/e$: the series has absolute convergence when $|z|<e$ and its terms eventually grow in magnitude when $|z|>e$. Thus the radius of convergence is $\boxed{R=e}$. No boundary decision is needed to determine the radius of convergence.

Use $\sin 0=0$, the derivative identity ${\sin }^{\prime }=\cos$, continuity of cosine at zero, and $\cos 0=1$. For $u\ne 0$, the mean value theorem gives $\sin u/u=\cos c_u$ for a point between zero and $u$. Hence $\sin u/u\to 1$ as $u\to 0$. For $x\ne 0$, apply this with $u=x/3^k$ to obtain the limit $\boxed{3^k\sin (x/3^k)\to x}$. For $x=0$ every term is zero.

The additional bound $|\cos t|\le 1$ and the same mean value theorem give $|\sin u|\le |u|$. ThereforeThe right side is summable. By the comparison test for series the stated series has absolute convergence for every real $x$.

Absolute convergence and the Fundamental theorem of arithmetic give the Euler productFor a finite set of primes, expand the geometric factors: their product sums $n^{-s}$ over integers whose prime factors lie in that set. Let the finite sets increase through all primes. Absolute convergence permits passage to the limit and recovers the full Dirichlet series. Moreover ${\sum }_{p,m\ge 1}|p^{-ms}|/m<\infty$, so the logarithm converges and the product has no zeros there.

The same absolutely convergent logarithm, and $3+4\cos \theta +\cos 2\theta =2(1+\cos \theta {)}^2\ge 0$, giveThis is the product version of the three-four-one zero-free-region argument. It also proves there are no zeros on $\Re s=1$: if $\zeta (1+i{t}_0)=0$ for $t_0\ne 0$, its factor has order at least four as $\sigma \downarrow 1$, while the real pole contributes only order minus three and the $2t_0$ factor remains bounded. The displayed left side would tend to zero, a contradiction. At $t_0=0$ there is a pole, not a zero.

For large $|t|$, put $L=\log (|t|+2)$. The Hardy-Littlewood approximation to the Riemann zeta function at $x\asymp |t|$ gives $|\zeta (\sigma +it)|\ll L$ for $1-2/L\le \sigma \le 3$; its finite sum is bounded by ${\sum }_{n\le x}{n}^{-1+2/L}\ll L$ and the integral term is bounded. The Cauchy estimate for derivatives on circles of radius comparable to $1/L$ consequently gives $|{\zeta }^{\prime }(\sigma +it)|\ll L^2$ for $1-L^{-9}\le \sigma \le 2$.

Take ${\sigma }_0=1+a{L}^{-9}$ with a small fixed $a>0$. The product inequality, $\zeta ({\sigma }_0)\ll L^9/a$, and $|\zeta ({\sigma }_0+2it)|\ll L$ implyIf $1-c{L}^{-9}\le \sigma \le {\sigma }_0$, integration of the derivative along the horizontal segment changes this value by at most $C(a+c)L^{-7}$. Choose $a$ sufficiently small that $Ca<c_0{a}^{3/4}/4$, then $c\le a$ sufficiently small. The lower bound remains a positive multiple of $L^{-7}$. For ${\sigma }_0\le \sigma \le 2$, the same product inequality, $\zeta (\sigma )\le \zeta ({\sigma }_0)$, and the near-one upper bound give that lower bound directly. For $\sigma \ge 2$, the reciprocal Euler product gives $|1/\zeta (s)|\le \zeta (2)$.

Finally the no-zero result on $\Re s=1$, compactness at bounded heights and the regular reciprocal at the pole allow a further fixed reduction of $c$ to include bounded $t$. We have proved the weak logarithmic zero-free region for the Riemann zeta functionThe reciprocal at $s=1$ is its holomorphic extension, equal to zero.

Let $A(s)={\sum }_{n\ge 1}{a}_n{n}^{-s}$ converge absolutely at a real $c>0$, and take $T\ge \max (2,c)$. DefineThe truncated Perron kernel estimate isFor $v>1$ close the contour to the left, collecting the residue one at zero; for $v<1$ close it to the right, collecting no residue. On the horizontal sides, integrating $v^{\sigma }$ bounds the error by $O(v^c/(T|\log v|))$, and the remote vertical side tends to zero. Near $v=1$ use the bounded transition estimate instead, giving $O(v^c)$. These are the contours and bounds underlying the kernel formula. The constants are uniform for $1\le c\le 2$, the range needed below.

Absolute convergence permits termwise integration. The truncated Perron formula is consequentlyHere the primed sum has half weight when $x$ is an integer, and $a_x=0$ otherwise. To obtain the inclusive sum add $a_x/2$ at an integer. This endpoint convention avoids a false uniform assertion about the kernel at $v=1$.

Apply this with $a_n=\Lambda (n)$, $A=-{\zeta }^{\prime }/\zeta$, $c=1+1/\log x$ and $2\le T\le x$, for sufficiently large $x$. For $n\notin [x/2,2x]$, $|\log (x/n)|$ is bounded below, andusing $-{\zeta }^{\prime }(c)/\zeta (c)\ll (c-1{)}^{-1}$. In the central range $(x/n{)}^c\ll 1$, $\Lambda (n)\ll \log x$, and $|\log (x/n)|\asymp |n-x|/x$. Separate the nearest integers, then sum the harmonic tail over distances $j\ge 1$: its contribution is $O((x/T){\log }^{2}x)$. The possible endpoint weight and nearest terms, of size $O(\log x)$, are absorbed because $T\le x$. ThereforeFor $x+y$, use the same vertical line $c=1+1/\log x$; the error estimate remains valid since $x\le x+y\le 2x$. Subtract the two formulas. The identityhas absolute value $O(y)$ on that line, because $(2x{)}^{c-1}$ is bounded. Taking absolute values givesThis is the short-interval Perron bound for the second Chebyshev function.

For $\mathrm{Re}s>1$, expand $(e^t-1{)}^{-1}={\sum }_{n\ge 1}{e}^{-nt}$. Absolute convergence of the integrated series follows from the same expression with $\mathrm{Re}s$ in place of $s$. Integrating termwise and substituting $u=nt$ givesThis proves the Mellin transform representation of the Riemann zeta function.

Take the Hankel contour along the lower side of the negative axis towards zero, around zero counterclockwise, and back along the upper side. For $\mathrm{Re}s>1$ the small-circle contribution tends to zero. On the lower and upper rays, respectively, $\arg t=-\pi ,+\pi$, so the two integrals combine toThe gamma reflection formula now proves agreement of the two representations. At an integer $s=m\ge 2$, the contour integral has a zero while $\Gamma (1-s)$ has a pole: their product is interpreted by its finite limit, equal to $\zeta (m)$, not by multiplying literal zero and infinity.

For nonpositive integers the integrand is single-valued, and the contour closes around zero. Sincethe residue of $t^{-1}/(e^{-t}-1)$ is $-1/2$, giving $\zeta (0)=-1/2$. Alsois odd. Its Laurent series therefore has only odd powers. Multiplication by $t^{-2n-1}$ cannot produce a $t^{-1}$ term, and the subtracted constant cannot do so when $n\ge 1$. Hence the contour integral vanishes and $\zeta (-2n)=0$ for every positive integer $n$.

The Euler totient function counts integers $1\le a\le n$ with $\gcd (a,n)=1$. The Möbius function has $\mu (1)=1$, is zero when a prime square divides $n$, and equals $(-1{)}^r$ when $n$ is a product of $r$ distinct primes. Consequentlybecause for $n>1$ the sum over squarefree divisors is $(1-1{)}^r$.

The Möbius inversion formula is $g(n)={\sum }_{d\mid n}\mu (d)f(n/d)$. Substituting the divisor sum defining $f$ and collecting the coefficient of $g(e)$ givesThis proof uses only finite sums, so no convergence hypothesis is needed.

Classifying $1,\dots ,n$ by their greatest common divisor with $n$ gives ${\sum }_{d\mid n}\phi (d)=n$: the class with greatest common divisor $n/d$ contains exactly $\phi (d)$ integers. Applying the Möbius inversion formula yieldsThe Riemann zeta function is $\zeta (s)={\sum }_{n\ge 1}{n}^{-s}$ for $\mathrm{Re}s>1$. Absolute convergence justifies multiplication of Dirichlet series. The divisor identity for the Möbius function gives $\sum \mu (n)n^{-s}=1/\zeta (s)$ there. For $\mathrm{Re}s>2$ both factors below converge absolutely, and their Dirichlet convolution is the Euler totient function:

By the Cauchy-Schwarz inequality, the integral is bounded by $\Vert f{\Vert }_2\Vert k_x{\Vert }_2$, where $k_x(y)=|x-y{|}^{-\alpha }$. For $0\le x\le 1$,For $x$ outside the interval, the integral is bounded by the value at the nearest endpoint; the endpoint value is finite as well. Since $2\alpha <1$, the kernel is square-integrable for every real $x$, proving absolute convergence for every $x$.

Every counted point has integer coordinates and lies in the square $[-n,n{]}^2$, while the origin is always counted. HenceNo precise circle-area estimate is needed; this elementary bound controls the growth of the power series coefficients.

The comparison test for series states that if $0\le u_n\le v_n$, convergence of $\sum v_n$ implies convergence of $\sum u_n$. Equivalently, divergence of the smaller nonnegative series forces divergence of the larger one.

For $|z|=r<1$,For $0<r<1$, the ratio of successive terms on the right tends to $r<1$, so the ratio test and the comparison test for series show absolute convergence. The case $r=0$ is immediate.

If $|z|\ge 1$, then $|a_n{z}^n|\ge 1$, so the terms do not tend to zero. The term test for divergence therefore rules out convergence, including every point on the boundary $|z|=1$. Thus the radius of convergence isThe series converges exactly in the open unit disc. This is an example of polynomial coefficient growth with unit power-series radius: the lattice-count bound is polynomial rather than exponential.

The function is even, so its Fourier series has $b_n=0$. In the convention $f\sim a_0/2+{\sum }_{n\ge 1}(a_n\cos nx+b_n\sin nx)$,Twice applying integration by parts gives, for $n\ge 1$,Therefore the periodic Fourier representation iswith periodic continuation. The periodic extension is continuous, including the identified endpoints, and piecewise smooth, so the Fourier series converges to it. The coefficients also give absolute convergence and uniform convergence by comparison with $\sum n^{-2}$.

At $x=\pi$, the cosine cancels the alternating coefficient sign; at $x=0$, it is identically one. These evaluations yieldThe first identity solves the Basel problem.

The Möbius function has $\mu (1)=1$, $\mu (n)=0$ when $n$ is divisible by a prime square, and $\mu (n)=(-1{)}^r$ when $n$ is a product of $r$ distinct primes. The Riemann zeta function is initially the Dirichlet series $\zeta (s)={\sum }_{n\ge 1}{n}^{-s}$ for $\sigma =\Re s>1$. Both this Dirichlet series and $\sum \mu (n)n^{-s}$ have absolute convergence, because $|\mu (n)|\le 1$ and $\sum n^{-\sigma }<\infty$.

For a finite set of primes $p\le y$, multiplication of absolutely convergent geometric series and unique prime factorization giveEvery omitted integer has a prime factor exceeding $y$, so it exceeds $y$. The difference from $\zeta (s)$ has absolute value at most ${\sum }_{n>y}{n}^{-\sigma }\to 0$. This proves the Euler product, with the product interpreted as the limit of its finite products:

For the reciprocal identity, absolute convergence justifies multiplying and regrouping the two Dirichlet series by their product index. Their Dirichlet convolution coefficient at $m$ isThe coefficient calculation uses only the squarefree integers dividing $m$. Consequently the reciprocal identity is an identity of absolutely convergent series: