Rearrangement of summations in series expansion of $-log(zeta(s))$
$begingroup$
This is a step in Titchmarsh's The theory of Riemann Zeta functions pg 2 of Chpt 1 eq 1.13 which I do not find obvious, though I can prove it directly. Assume $sigma=Re(s)>1$.
Denote by $pi(x)$ the number of primes $leq x$. Consider the following summation which is basically $-log(zeta(s))$.
begin{align} sum_{ngeq 2}a_n &:=sum_{ngeq 2}(pi(n)-pi(n-1))logleft(1-tfrac{1}{n^s}right) \ &=sum_{ngeq 2}pi(n)left(logleft(1-tfrac{1}{n^s}right)-logleft(1-tfrac{1}{(n+1)^s}right)right)\&:=sum_{ngeq 2}b_nend{align} Rearrangement is allowed because $log(1-n^{-s})sim n^{-sigma}$ and $pi(n)leq n $
$textbf{Q:}$ Why is this obvious? I considered $$|a_n-b_n|=left|-pi(n-1)logleft(1-tfrac{1}{n^s}right)+pi(n)logleft(1-tfrac{1}{(n+1)^s}right)right|.$$ Add and subtract term $pi(n-1)log(1-frac{1}{(n+1)^s})$ and use triangle inequality to see $$|a_n-b_n|leq n^{-sigma}+left|pi(n-1)left(logleft(1-tfrac{1}{(1+n)^s}right)-logleft(1-tfrac{1}{n^s}right)right)right|.$$ The second term is bounded by order $n^{-2sigma}$. Hence I have tail controlled. However this does not directly yield equality but says tail can be arbitrarily controlled.
real-analysis complex-analysis number-theory riemann-zeta
$endgroup$
add a comment |
$begingroup$
This is a step in Titchmarsh's The theory of Riemann Zeta functions pg 2 of Chpt 1 eq 1.13 which I do not find obvious, though I can prove it directly. Assume $sigma=Re(s)>1$.
Denote by $pi(x)$ the number of primes $leq x$. Consider the following summation which is basically $-log(zeta(s))$.
begin{align} sum_{ngeq 2}a_n &:=sum_{ngeq 2}(pi(n)-pi(n-1))logleft(1-tfrac{1}{n^s}right) \ &=sum_{ngeq 2}pi(n)left(logleft(1-tfrac{1}{n^s}right)-logleft(1-tfrac{1}{(n+1)^s}right)right)\&:=sum_{ngeq 2}b_nend{align} Rearrangement is allowed because $log(1-n^{-s})sim n^{-sigma}$ and $pi(n)leq n $
$textbf{Q:}$ Why is this obvious? I considered $$|a_n-b_n|=left|-pi(n-1)logleft(1-tfrac{1}{n^s}right)+pi(n)logleft(1-tfrac{1}{(n+1)^s}right)right|.$$ Add and subtract term $pi(n-1)log(1-frac{1}{(n+1)^s})$ and use triangle inequality to see $$|a_n-b_n|leq n^{-sigma}+left|pi(n-1)left(logleft(1-tfrac{1}{(1+n)^s}right)-logleft(1-tfrac{1}{n^s}right)right)right|.$$ The second term is bounded by order $n^{-2sigma}$. Hence I have tail controlled. However this does not directly yield equality but says tail can be arbitrarily controlled.
real-analysis complex-analysis number-theory riemann-zeta
$endgroup$
add a comment |
$begingroup$
This is a step in Titchmarsh's The theory of Riemann Zeta functions pg 2 of Chpt 1 eq 1.13 which I do not find obvious, though I can prove it directly. Assume $sigma=Re(s)>1$.
Denote by $pi(x)$ the number of primes $leq x$. Consider the following summation which is basically $-log(zeta(s))$.
begin{align} sum_{ngeq 2}a_n &:=sum_{ngeq 2}(pi(n)-pi(n-1))logleft(1-tfrac{1}{n^s}right) \ &=sum_{ngeq 2}pi(n)left(logleft(1-tfrac{1}{n^s}right)-logleft(1-tfrac{1}{(n+1)^s}right)right)\&:=sum_{ngeq 2}b_nend{align} Rearrangement is allowed because $log(1-n^{-s})sim n^{-sigma}$ and $pi(n)leq n $
$textbf{Q:}$ Why is this obvious? I considered $$|a_n-b_n|=left|-pi(n-1)logleft(1-tfrac{1}{n^s}right)+pi(n)logleft(1-tfrac{1}{(n+1)^s}right)right|.$$ Add and subtract term $pi(n-1)log(1-frac{1}{(n+1)^s})$ and use triangle inequality to see $$|a_n-b_n|leq n^{-sigma}+left|pi(n-1)left(logleft(1-tfrac{1}{(1+n)^s}right)-logleft(1-tfrac{1}{n^s}right)right)right|.$$ The second term is bounded by order $n^{-2sigma}$. Hence I have tail controlled. However this does not directly yield equality but says tail can be arbitrarily controlled.
real-analysis complex-analysis number-theory riemann-zeta
$endgroup$
This is a step in Titchmarsh's The theory of Riemann Zeta functions pg 2 of Chpt 1 eq 1.13 which I do not find obvious, though I can prove it directly. Assume $sigma=Re(s)>1$.
Denote by $pi(x)$ the number of primes $leq x$. Consider the following summation which is basically $-log(zeta(s))$.
begin{align} sum_{ngeq 2}a_n &:=sum_{ngeq 2}(pi(n)-pi(n-1))logleft(1-tfrac{1}{n^s}right) \ &=sum_{ngeq 2}pi(n)left(logleft(1-tfrac{1}{n^s}right)-logleft(1-tfrac{1}{(n+1)^s}right)right)\&:=sum_{ngeq 2}b_nend{align} Rearrangement is allowed because $log(1-n^{-s})sim n^{-sigma}$ and $pi(n)leq n $
$textbf{Q:}$ Why is this obvious? I considered $$|a_n-b_n|=left|-pi(n-1)logleft(1-tfrac{1}{n^s}right)+pi(n)logleft(1-tfrac{1}{(n+1)^s}right)right|.$$ Add and subtract term $pi(n-1)log(1-frac{1}{(n+1)^s})$ and use triangle inequality to see $$|a_n-b_n|leq n^{-sigma}+left|pi(n-1)left(logleft(1-tfrac{1}{(1+n)^s}right)-logleft(1-tfrac{1}{n^s}right)right)right|.$$ The second term is bounded by order $n^{-2sigma}$. Hence I have tail controlled. However this does not directly yield equality but says tail can be arbitrarily controlled.
real-analysis complex-analysis number-theory riemann-zeta
real-analysis complex-analysis number-theory riemann-zeta
edited Dec 27 '18 at 1:56
Kenny Wong
19.1k21441
19.1k21441
asked Dec 27 '18 at 0:52
user45765user45765
2,6702724
2,6702724
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The point is that
$$ left| sum_{n = 2}^N b_n - sum_{n = 2}^N a_n right| = left| pi (N) log left(1 - tfrac{1}{(N + 1)^s} right) right| leq CN^{1 - sigma}$$
for some constant $C > 0$, and for sufficient large $N$.
Since $1 - sigma < 0$, we have
$$ lim_{N to infty} left| sum_{n = 2}^N b_n - sum_{n = 2}^N a_n right| = 0.$$
So since $sum_{n = 2}^infty a_n$ converges, it must be true that $sum_{n = 2}^infty b_n$ converges too, and
$ sum_{n = 2}^infty b_n = sum_{n = 2}^infty a_n$.
$endgroup$
$begingroup$
Maybe this is a dumb question. Was this arrangement obvious at first sight? It is clear that it is natural to manipulate sum in that manner though it might not converge.
$endgroup$
– user45765
Dec 27 '18 at 1:20
$begingroup$
@user45765 I had to stare at it for a bit...
$endgroup$
– Kenny Wong
Dec 27 '18 at 1:21
$begingroup$
I see. Thanks alot.
$endgroup$
– user45765
Dec 27 '18 at 1:22
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3053475%2frearrangement-of-summations-in-series-expansion-of-log-zetas%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The point is that
$$ left| sum_{n = 2}^N b_n - sum_{n = 2}^N a_n right| = left| pi (N) log left(1 - tfrac{1}{(N + 1)^s} right) right| leq CN^{1 - sigma}$$
for some constant $C > 0$, and for sufficient large $N$.
Since $1 - sigma < 0$, we have
$$ lim_{N to infty} left| sum_{n = 2}^N b_n - sum_{n = 2}^N a_n right| = 0.$$
So since $sum_{n = 2}^infty a_n$ converges, it must be true that $sum_{n = 2}^infty b_n$ converges too, and
$ sum_{n = 2}^infty b_n = sum_{n = 2}^infty a_n$.
$endgroup$
$begingroup$
Maybe this is a dumb question. Was this arrangement obvious at first sight? It is clear that it is natural to manipulate sum in that manner though it might not converge.
$endgroup$
– user45765
Dec 27 '18 at 1:20
$begingroup$
@user45765 I had to stare at it for a bit...
$endgroup$
– Kenny Wong
Dec 27 '18 at 1:21
$begingroup$
I see. Thanks alot.
$endgroup$
– user45765
Dec 27 '18 at 1:22
add a comment |
$begingroup$
The point is that
$$ left| sum_{n = 2}^N b_n - sum_{n = 2}^N a_n right| = left| pi (N) log left(1 - tfrac{1}{(N + 1)^s} right) right| leq CN^{1 - sigma}$$
for some constant $C > 0$, and for sufficient large $N$.
Since $1 - sigma < 0$, we have
$$ lim_{N to infty} left| sum_{n = 2}^N b_n - sum_{n = 2}^N a_n right| = 0.$$
So since $sum_{n = 2}^infty a_n$ converges, it must be true that $sum_{n = 2}^infty b_n$ converges too, and
$ sum_{n = 2}^infty b_n = sum_{n = 2}^infty a_n$.
$endgroup$
$begingroup$
Maybe this is a dumb question. Was this arrangement obvious at first sight? It is clear that it is natural to manipulate sum in that manner though it might not converge.
$endgroup$
– user45765
Dec 27 '18 at 1:20
$begingroup$
@user45765 I had to stare at it for a bit...
$endgroup$
– Kenny Wong
Dec 27 '18 at 1:21
$begingroup$
I see. Thanks alot.
$endgroup$
– user45765
Dec 27 '18 at 1:22
add a comment |
$begingroup$
The point is that
$$ left| sum_{n = 2}^N b_n - sum_{n = 2}^N a_n right| = left| pi (N) log left(1 - tfrac{1}{(N + 1)^s} right) right| leq CN^{1 - sigma}$$
for some constant $C > 0$, and for sufficient large $N$.
Since $1 - sigma < 0$, we have
$$ lim_{N to infty} left| sum_{n = 2}^N b_n - sum_{n = 2}^N a_n right| = 0.$$
So since $sum_{n = 2}^infty a_n$ converges, it must be true that $sum_{n = 2}^infty b_n$ converges too, and
$ sum_{n = 2}^infty b_n = sum_{n = 2}^infty a_n$.
$endgroup$
The point is that
$$ left| sum_{n = 2}^N b_n - sum_{n = 2}^N a_n right| = left| pi (N) log left(1 - tfrac{1}{(N + 1)^s} right) right| leq CN^{1 - sigma}$$
for some constant $C > 0$, and for sufficient large $N$.
Since $1 - sigma < 0$, we have
$$ lim_{N to infty} left| sum_{n = 2}^N b_n - sum_{n = 2}^N a_n right| = 0.$$
So since $sum_{n = 2}^infty a_n$ converges, it must be true that $sum_{n = 2}^infty b_n$ converges too, and
$ sum_{n = 2}^infty b_n = sum_{n = 2}^infty a_n$.
answered Dec 27 '18 at 1:14
Kenny WongKenny Wong
19.1k21441
19.1k21441
$begingroup$
Maybe this is a dumb question. Was this arrangement obvious at first sight? It is clear that it is natural to manipulate sum in that manner though it might not converge.
$endgroup$
– user45765
Dec 27 '18 at 1:20
$begingroup$
@user45765 I had to stare at it for a bit...
$endgroup$
– Kenny Wong
Dec 27 '18 at 1:21
$begingroup$
I see. Thanks alot.
$endgroup$
– user45765
Dec 27 '18 at 1:22
add a comment |
$begingroup$
Maybe this is a dumb question. Was this arrangement obvious at first sight? It is clear that it is natural to manipulate sum in that manner though it might not converge.
$endgroup$
– user45765
Dec 27 '18 at 1:20
$begingroup$
@user45765 I had to stare at it for a bit...
$endgroup$
– Kenny Wong
Dec 27 '18 at 1:21
$begingroup$
I see. Thanks alot.
$endgroup$
– user45765
Dec 27 '18 at 1:22
$begingroup$
Maybe this is a dumb question. Was this arrangement obvious at first sight? It is clear that it is natural to manipulate sum in that manner though it might not converge.
$endgroup$
– user45765
Dec 27 '18 at 1:20
$begingroup$
Maybe this is a dumb question. Was this arrangement obvious at first sight? It is clear that it is natural to manipulate sum in that manner though it might not converge.
$endgroup$
– user45765
Dec 27 '18 at 1:20
$begingroup$
@user45765 I had to stare at it for a bit...
$endgroup$
– Kenny Wong
Dec 27 '18 at 1:21
$begingroup$
@user45765 I had to stare at it for a bit...
$endgroup$
– Kenny Wong
Dec 27 '18 at 1:21
$begingroup$
I see. Thanks alot.
$endgroup$
– user45765
Dec 27 '18 at 1:22
$begingroup$
I see. Thanks alot.
$endgroup$
– user45765
Dec 27 '18 at 1:22
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3053475%2frearrangement-of-summations-in-series-expansion-of-log-zetas%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown