Series that evaluates to different values upon changing order of summationSummation : Series with each term having components of two different seriesSimplify this summation: $sumlimits_k=5^inftybinomk-1k-5frack^32^k$Problem regarding inverstion of order of summationChanging summation in a power seriesCan different choices of regulator assign different values to the same divergent series?Change of order of summation in infinite seriesFind for which values of $x$ the series convergesChanging summation and limits for sequences in $ell^p$Expected value of an r.v. that counts the number of pickable values that never appear in a random sequenceWhy are the sums of absolutely convergent series not affected by changing the order of summation?
What was the plan for an abort of the Enola Gay's mission to drop the atomic bomb?
Is there a need for better software for writers?
Best species to breed to intelligence
What food production methods would allow a metropolis like New York to become self sufficient
Two researchers want to work on the same extension to my paper. Who to help?
Cropping a message using array splits
Has magnetic core memory been used beyond the Moon?
What does this quote in Small Gods refer to?
Extending Kan fibrations, without using minimal fibrations
If a character drops a magic item that turns on/off, does that item turn off when they drop it?
Why was wildfire not used during the Battle of Winterfell?
Why do Thanos' punches not kill Captain America or at least cause some mortal injuries?
Why does the Earth follow an elliptical trajectory rather than a parabolic one?
What's the "magic similar to the Knock spell" referenced in the Dungeon of the Mad Mage adventure?
Why are parallelograms defined as quadrilaterals? What term would encompass polygons with greater than two parallel pairs?
No such column 'DeveloperName' on entity 'RecordType' after Summer '19 release on sandbox
Ex-manager wants to stay in touch, I don't want to
Why can't I prove summation identities without guessing?
Why is it wrong to *implement* myself a known, published, widely believed to be secure crypto algorithm?
Passport stamps art, can it be done?
Was the Highlands Ranch shooting the 115th mass shooting in the US in 2019
Is there any evidence to support the claim that the United States was "suckered into WW1" by Zionists, made by Benjamin Freedman in his 1961 speech
Why was the ancient one so hesitant to teach Dr Strange the art of sorcery
My perfect evil overlord plan... or is it?
Series that evaluates to different values upon changing order of summation
Summation : Series with each term having components of two different seriesSimplify this summation: $sumlimits_k=5^inftybinomk-1k-5frack^32^k$Problem regarding inverstion of order of summationChanging summation in a power seriesCan different choices of regulator assign different values to the same divergent series?Change of order of summation in infinite seriesFind for which values of $x$ the series convergesChanging summation and limits for sequences in $ell^p$Expected value of an r.v. that counts the number of pickable values that never appear in a random sequenceWhy are the sums of absolutely convergent series not affected by changing the order of summation?
$begingroup$
I am trying to find a sequence $x_pq$ such that $sum_p=1^inftysum_q=1^infty x_pq$ and $sum_q=1^inftysum_p=1^infty x_pq$ both exist and evaluate to different values. I am thinking of this as a matrix, but I can't seem to see how adding all the elements of it column wise vs row-wise would change the total sum? Any hints/examples would be helpful.
real-analysis sequences-and-series summation
New contributor
$endgroup$
add a comment |
$begingroup$
I am trying to find a sequence $x_pq$ such that $sum_p=1^inftysum_q=1^infty x_pq$ and $sum_q=1^inftysum_p=1^infty x_pq$ both exist and evaluate to different values. I am thinking of this as a matrix, but I can't seem to see how adding all the elements of it column wise vs row-wise would change the total sum? Any hints/examples would be helpful.
real-analysis sequences-and-series summation
New contributor
$endgroup$
1
$begingroup$
Is this the kind of thing you're looking for? The second paragraph gives an example and the convergent values for which a series can be rearranged and obtain different values.
$endgroup$
– Clayton
5 hours ago
1
$begingroup$
This theorem is what motivates my question - but how would you write an explicit example with 2 indices?
$endgroup$
– user4351123
5 hours ago
$begingroup$
One of the classical example (which should be well-attested enough to find a detailed proof for) is the Eisenstein series $G_2(tau) = sum_m, n (n + m tau)^-2$. Unlike the higher $G_n$, swapping the order of the summation $n, m$ produces an extra $2pi i/tau$ term.
$endgroup$
– anomaly
55 mins ago
add a comment |
$begingroup$
I am trying to find a sequence $x_pq$ such that $sum_p=1^inftysum_q=1^infty x_pq$ and $sum_q=1^inftysum_p=1^infty x_pq$ both exist and evaluate to different values. I am thinking of this as a matrix, but I can't seem to see how adding all the elements of it column wise vs row-wise would change the total sum? Any hints/examples would be helpful.
real-analysis sequences-and-series summation
New contributor
$endgroup$
I am trying to find a sequence $x_pq$ such that $sum_p=1^inftysum_q=1^infty x_pq$ and $sum_q=1^inftysum_p=1^infty x_pq$ both exist and evaluate to different values. I am thinking of this as a matrix, but I can't seem to see how adding all the elements of it column wise vs row-wise would change the total sum? Any hints/examples would be helpful.
real-analysis sequences-and-series summation
real-analysis sequences-and-series summation
New contributor
New contributor
New contributor
asked 5 hours ago
user4351123user4351123
311
311
New contributor
New contributor
1
$begingroup$
Is this the kind of thing you're looking for? The second paragraph gives an example and the convergent values for which a series can be rearranged and obtain different values.
$endgroup$
– Clayton
5 hours ago
1
$begingroup$
This theorem is what motivates my question - but how would you write an explicit example with 2 indices?
$endgroup$
– user4351123
5 hours ago
$begingroup$
One of the classical example (which should be well-attested enough to find a detailed proof for) is the Eisenstein series $G_2(tau) = sum_m, n (n + m tau)^-2$. Unlike the higher $G_n$, swapping the order of the summation $n, m$ produces an extra $2pi i/tau$ term.
$endgroup$
– anomaly
55 mins ago
add a comment |
1
$begingroup$
Is this the kind of thing you're looking for? The second paragraph gives an example and the convergent values for which a series can be rearranged and obtain different values.
$endgroup$
– Clayton
5 hours ago
1
$begingroup$
This theorem is what motivates my question - but how would you write an explicit example with 2 indices?
$endgroup$
– user4351123
5 hours ago
$begingroup$
One of the classical example (which should be well-attested enough to find a detailed proof for) is the Eisenstein series $G_2(tau) = sum_m, n (n + m tau)^-2$. Unlike the higher $G_n$, swapping the order of the summation $n, m$ produces an extra $2pi i/tau$ term.
$endgroup$
– anomaly
55 mins ago
1
1
$begingroup$
Is this the kind of thing you're looking for? The second paragraph gives an example and the convergent values for which a series can be rearranged and obtain different values.
$endgroup$
– Clayton
5 hours ago
$begingroup$
Is this the kind of thing you're looking for? The second paragraph gives an example and the convergent values for which a series can be rearranged and obtain different values.
$endgroup$
– Clayton
5 hours ago
1
1
$begingroup$
This theorem is what motivates my question - but how would you write an explicit example with 2 indices?
$endgroup$
– user4351123
5 hours ago
$begingroup$
This theorem is what motivates my question - but how would you write an explicit example with 2 indices?
$endgroup$
– user4351123
5 hours ago
$begingroup$
One of the classical example (which should be well-attested enough to find a detailed proof for) is the Eisenstein series $G_2(tau) = sum_m, n (n + m tau)^-2$. Unlike the higher $G_n$, swapping the order of the summation $n, m$ produces an extra $2pi i/tau$ term.
$endgroup$
– anomaly
55 mins ago
$begingroup$
One of the classical example (which should be well-attested enough to find a detailed proof for) is the Eisenstein series $G_2(tau) = sum_m, n (n + m tau)^-2$. Unlike the higher $G_n$, swapping the order of the summation $n, m$ produces an extra $2pi i/tau$ term.
$endgroup$
– anomaly
55 mins ago
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
The iterated sums will be equal (if they converge) when all terms are nonnegative or, more generally, when we have absolute convergence.
Consider, on the other hand, $a_jk = 1/(k^2-j^2)$ if $jneq k$ and $a_jk = 0$ if $j=k$.
Here we have,
$$fracpi^28=tag*sum_j=1^infty sum_k=1\jneq k^infty frac1k^2 - j^2 neq sum_k=1^infty sum_j=1\j neq k^infty frac1k^2-j^2 = -fracpi^28 $$
To obtain the sum, note that
$$sum_k=1\jneq k^K frac1k^2-j^2 = frac12jsum_k=1\jneq k^K left(frac1k-j - frac1k+j right) \= frac12jleft(-sum_k=1^j-1frac1k + sum_k=1^K-jfrac1k - sum_k=j+1^K+jfrac1k + frac12j right)\= frac12jleft(frac1j +sum_k=j+1^K-jfrac1k - sum_k=j+1^K+jfrac1k + frac12j right)\ = frac12jleft(frac32j - sum_k=-j+1^j frac1K+kright) $$
and,
$$sum_k=1\jneq k^infty frac1k^2-j^2 = lim_K to inftyfrac12jleft(frac32j - sum_k=-n+1^n frac1K+kright) = frac34j^2$$
Thus,
$$sum_j=1^infty sum_k=1\jneq k^infty frac1k^2 - j^2 = sum_j=1^infty frac34j^2 = frac34 fracpi^26$$
$endgroup$
add a comment |
$begingroup$
Maybe you are looking for something like this: $$beginpmatrix1 &-1 & 0&0&0 & 0 &cdots \
0 & 1 & -1& 0 & 0 & 0&cdots\
0 & 0 & 1 & -1 & 0 & 0&cdots\
0 & 0 & 0 & 1 & -1 & 0&cdots \
0 & 0 & 0 & 0 & 1 & -1&cdots \
vdots &vdots &vdots & vdots & vdots & ddots&ddots
endpmatrix.$$
So that $x_p,p = 1$, $x_p,p+1=-1$ and $x_p,q = 0$ if $q neq p,p+1$.
Here we have $$sum_q=1^infty x_p,q = 0$$ for all $p in mathbb N$, and so $$sum^infty_p=1 sum^infty_q=1 x_p,q = 0.$$ However, we also have $$sum_p=1^infty x_p,q = 0 ,,,, text for ,,,, q ge 2, ,,,,, text but ,,,,, sum_p=1^infty x_p,1 = 1$$ and so $$sum^infty_q=1 sum^infty_p=1 x_p,q = 1.$$
As was said in the other answer, if $$sum_p,q lvert x_p,qrvert$$ converges (which isn't the case here), then Fubini's theorem tells us we can sum in either dimension first and get the same answer. Similarly, if all $x_p,q >0$, we can do the same, by Tonelli's theorem and this allows for the possibility that the sums evaluate to $+infty$.
$endgroup$
$begingroup$
Thats a good example where the sums are not just of different sign (+1).
$endgroup$
– RRL
4 hours ago
add a comment |
Your Answer
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
);
);
user4351123 is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3220297%2fseries-that-evaluates-to-different-values-upon-changing-order-of-summation%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The iterated sums will be equal (if they converge) when all terms are nonnegative or, more generally, when we have absolute convergence.
Consider, on the other hand, $a_jk = 1/(k^2-j^2)$ if $jneq k$ and $a_jk = 0$ if $j=k$.
Here we have,
$$fracpi^28=tag*sum_j=1^infty sum_k=1\jneq k^infty frac1k^2 - j^2 neq sum_k=1^infty sum_j=1\j neq k^infty frac1k^2-j^2 = -fracpi^28 $$
To obtain the sum, note that
$$sum_k=1\jneq k^K frac1k^2-j^2 = frac12jsum_k=1\jneq k^K left(frac1k-j - frac1k+j right) \= frac12jleft(-sum_k=1^j-1frac1k + sum_k=1^K-jfrac1k - sum_k=j+1^K+jfrac1k + frac12j right)\= frac12jleft(frac1j +sum_k=j+1^K-jfrac1k - sum_k=j+1^K+jfrac1k + frac12j right)\ = frac12jleft(frac32j - sum_k=-j+1^j frac1K+kright) $$
and,
$$sum_k=1\jneq k^infty frac1k^2-j^2 = lim_K to inftyfrac12jleft(frac32j - sum_k=-n+1^n frac1K+kright) = frac34j^2$$
Thus,
$$sum_j=1^infty sum_k=1\jneq k^infty frac1k^2 - j^2 = sum_j=1^infty frac34j^2 = frac34 fracpi^26$$
$endgroup$
add a comment |
$begingroup$
The iterated sums will be equal (if they converge) when all terms are nonnegative or, more generally, when we have absolute convergence.
Consider, on the other hand, $a_jk = 1/(k^2-j^2)$ if $jneq k$ and $a_jk = 0$ if $j=k$.
Here we have,
$$fracpi^28=tag*sum_j=1^infty sum_k=1\jneq k^infty frac1k^2 - j^2 neq sum_k=1^infty sum_j=1\j neq k^infty frac1k^2-j^2 = -fracpi^28 $$
To obtain the sum, note that
$$sum_k=1\jneq k^K frac1k^2-j^2 = frac12jsum_k=1\jneq k^K left(frac1k-j - frac1k+j right) \= frac12jleft(-sum_k=1^j-1frac1k + sum_k=1^K-jfrac1k - sum_k=j+1^K+jfrac1k + frac12j right)\= frac12jleft(frac1j +sum_k=j+1^K-jfrac1k - sum_k=j+1^K+jfrac1k + frac12j right)\ = frac12jleft(frac32j - sum_k=-j+1^j frac1K+kright) $$
and,
$$sum_k=1\jneq k^infty frac1k^2-j^2 = lim_K to inftyfrac12jleft(frac32j - sum_k=-n+1^n frac1K+kright) = frac34j^2$$
Thus,
$$sum_j=1^infty sum_k=1\jneq k^infty frac1k^2 - j^2 = sum_j=1^infty frac34j^2 = frac34 fracpi^26$$
$endgroup$
add a comment |
$begingroup$
The iterated sums will be equal (if they converge) when all terms are nonnegative or, more generally, when we have absolute convergence.
Consider, on the other hand, $a_jk = 1/(k^2-j^2)$ if $jneq k$ and $a_jk = 0$ if $j=k$.
Here we have,
$$fracpi^28=tag*sum_j=1^infty sum_k=1\jneq k^infty frac1k^2 - j^2 neq sum_k=1^infty sum_j=1\j neq k^infty frac1k^2-j^2 = -fracpi^28 $$
To obtain the sum, note that
$$sum_k=1\jneq k^K frac1k^2-j^2 = frac12jsum_k=1\jneq k^K left(frac1k-j - frac1k+j right) \= frac12jleft(-sum_k=1^j-1frac1k + sum_k=1^K-jfrac1k - sum_k=j+1^K+jfrac1k + frac12j right)\= frac12jleft(frac1j +sum_k=j+1^K-jfrac1k - sum_k=j+1^K+jfrac1k + frac12j right)\ = frac12jleft(frac32j - sum_k=-j+1^j frac1K+kright) $$
and,
$$sum_k=1\jneq k^infty frac1k^2-j^2 = lim_K to inftyfrac12jleft(frac32j - sum_k=-n+1^n frac1K+kright) = frac34j^2$$
Thus,
$$sum_j=1^infty sum_k=1\jneq k^infty frac1k^2 - j^2 = sum_j=1^infty frac34j^2 = frac34 fracpi^26$$
$endgroup$
The iterated sums will be equal (if they converge) when all terms are nonnegative or, more generally, when we have absolute convergence.
Consider, on the other hand, $a_jk = 1/(k^2-j^2)$ if $jneq k$ and $a_jk = 0$ if $j=k$.
Here we have,
$$fracpi^28=tag*sum_j=1^infty sum_k=1\jneq k^infty frac1k^2 - j^2 neq sum_k=1^infty sum_j=1\j neq k^infty frac1k^2-j^2 = -fracpi^28 $$
To obtain the sum, note that
$$sum_k=1\jneq k^K frac1k^2-j^2 = frac12jsum_k=1\jneq k^K left(frac1k-j - frac1k+j right) \= frac12jleft(-sum_k=1^j-1frac1k + sum_k=1^K-jfrac1k - sum_k=j+1^K+jfrac1k + frac12j right)\= frac12jleft(frac1j +sum_k=j+1^K-jfrac1k - sum_k=j+1^K+jfrac1k + frac12j right)\ = frac12jleft(frac32j - sum_k=-j+1^j frac1K+kright) $$
and,
$$sum_k=1\jneq k^infty frac1k^2-j^2 = lim_K to inftyfrac12jleft(frac32j - sum_k=-n+1^n frac1K+kright) = frac34j^2$$
Thus,
$$sum_j=1^infty sum_k=1\jneq k^infty frac1k^2 - j^2 = sum_j=1^infty frac34j^2 = frac34 fracpi^26$$
answered 4 hours ago
RRLRRL
54.8k52776
54.8k52776
add a comment |
add a comment |
$begingroup$
Maybe you are looking for something like this: $$beginpmatrix1 &-1 & 0&0&0 & 0 &cdots \
0 & 1 & -1& 0 & 0 & 0&cdots\
0 & 0 & 1 & -1 & 0 & 0&cdots\
0 & 0 & 0 & 1 & -1 & 0&cdots \
0 & 0 & 0 & 0 & 1 & -1&cdots \
vdots &vdots &vdots & vdots & vdots & ddots&ddots
endpmatrix.$$
So that $x_p,p = 1$, $x_p,p+1=-1$ and $x_p,q = 0$ if $q neq p,p+1$.
Here we have $$sum_q=1^infty x_p,q = 0$$ for all $p in mathbb N$, and so $$sum^infty_p=1 sum^infty_q=1 x_p,q = 0.$$ However, we also have $$sum_p=1^infty x_p,q = 0 ,,,, text for ,,,, q ge 2, ,,,,, text but ,,,,, sum_p=1^infty x_p,1 = 1$$ and so $$sum^infty_q=1 sum^infty_p=1 x_p,q = 1.$$
As was said in the other answer, if $$sum_p,q lvert x_p,qrvert$$ converges (which isn't the case here), then Fubini's theorem tells us we can sum in either dimension first and get the same answer. Similarly, if all $x_p,q >0$, we can do the same, by Tonelli's theorem and this allows for the possibility that the sums evaluate to $+infty$.
$endgroup$
$begingroup$
Thats a good example where the sums are not just of different sign (+1).
$endgroup$
– RRL
4 hours ago
add a comment |
$begingroup$
Maybe you are looking for something like this: $$beginpmatrix1 &-1 & 0&0&0 & 0 &cdots \
0 & 1 & -1& 0 & 0 & 0&cdots\
0 & 0 & 1 & -1 & 0 & 0&cdots\
0 & 0 & 0 & 1 & -1 & 0&cdots \
0 & 0 & 0 & 0 & 1 & -1&cdots \
vdots &vdots &vdots & vdots & vdots & ddots&ddots
endpmatrix.$$
So that $x_p,p = 1$, $x_p,p+1=-1$ and $x_p,q = 0$ if $q neq p,p+1$.
Here we have $$sum_q=1^infty x_p,q = 0$$ for all $p in mathbb N$, and so $$sum^infty_p=1 sum^infty_q=1 x_p,q = 0.$$ However, we also have $$sum_p=1^infty x_p,q = 0 ,,,, text for ,,,, q ge 2, ,,,,, text but ,,,,, sum_p=1^infty x_p,1 = 1$$ and so $$sum^infty_q=1 sum^infty_p=1 x_p,q = 1.$$
As was said in the other answer, if $$sum_p,q lvert x_p,qrvert$$ converges (which isn't the case here), then Fubini's theorem tells us we can sum in either dimension first and get the same answer. Similarly, if all $x_p,q >0$, we can do the same, by Tonelli's theorem and this allows for the possibility that the sums evaluate to $+infty$.
$endgroup$
$begingroup$
Thats a good example where the sums are not just of different sign (+1).
$endgroup$
– RRL
4 hours ago
add a comment |
$begingroup$
Maybe you are looking for something like this: $$beginpmatrix1 &-1 & 0&0&0 & 0 &cdots \
0 & 1 & -1& 0 & 0 & 0&cdots\
0 & 0 & 1 & -1 & 0 & 0&cdots\
0 & 0 & 0 & 1 & -1 & 0&cdots \
0 & 0 & 0 & 0 & 1 & -1&cdots \
vdots &vdots &vdots & vdots & vdots & ddots&ddots
endpmatrix.$$
So that $x_p,p = 1$, $x_p,p+1=-1$ and $x_p,q = 0$ if $q neq p,p+1$.
Here we have $$sum_q=1^infty x_p,q = 0$$ for all $p in mathbb N$, and so $$sum^infty_p=1 sum^infty_q=1 x_p,q = 0.$$ However, we also have $$sum_p=1^infty x_p,q = 0 ,,,, text for ,,,, q ge 2, ,,,,, text but ,,,,, sum_p=1^infty x_p,1 = 1$$ and so $$sum^infty_q=1 sum^infty_p=1 x_p,q = 1.$$
As was said in the other answer, if $$sum_p,q lvert x_p,qrvert$$ converges (which isn't the case here), then Fubini's theorem tells us we can sum in either dimension first and get the same answer. Similarly, if all $x_p,q >0$, we can do the same, by Tonelli's theorem and this allows for the possibility that the sums evaluate to $+infty$.
$endgroup$
Maybe you are looking for something like this: $$beginpmatrix1 &-1 & 0&0&0 & 0 &cdots \
0 & 1 & -1& 0 & 0 & 0&cdots\
0 & 0 & 1 & -1 & 0 & 0&cdots\
0 & 0 & 0 & 1 & -1 & 0&cdots \
0 & 0 & 0 & 0 & 1 & -1&cdots \
vdots &vdots &vdots & vdots & vdots & ddots&ddots
endpmatrix.$$
So that $x_p,p = 1$, $x_p,p+1=-1$ and $x_p,q = 0$ if $q neq p,p+1$.
Here we have $$sum_q=1^infty x_p,q = 0$$ for all $p in mathbb N$, and so $$sum^infty_p=1 sum^infty_q=1 x_p,q = 0.$$ However, we also have $$sum_p=1^infty x_p,q = 0 ,,,, text for ,,,, q ge 2, ,,,,, text but ,,,,, sum_p=1^infty x_p,1 = 1$$ and so $$sum^infty_q=1 sum^infty_p=1 x_p,q = 1.$$
As was said in the other answer, if $$sum_p,q lvert x_p,qrvert$$ converges (which isn't the case here), then Fubini's theorem tells us we can sum in either dimension first and get the same answer. Similarly, if all $x_p,q >0$, we can do the same, by Tonelli's theorem and this allows for the possibility that the sums evaluate to $+infty$.
edited 2 hours ago
Brian Borchers
6,53011320
6,53011320
answered 4 hours ago
User8128User8128
11.1k1622
11.1k1622
$begingroup$
Thats a good example where the sums are not just of different sign (+1).
$endgroup$
– RRL
4 hours ago
add a comment |
$begingroup$
Thats a good example where the sums are not just of different sign (+1).
$endgroup$
– RRL
4 hours ago
$begingroup$
Thats a good example where the sums are not just of different sign (+1).
$endgroup$
– RRL
4 hours ago
$begingroup$
Thats a good example where the sums are not just of different sign (+1).
$endgroup$
– RRL
4 hours ago
add a comment |
user4351123 is a new contributor. Be nice, and check out our Code of Conduct.
user4351123 is a new contributor. Be nice, and check out our Code of Conduct.
user4351123 is a new contributor. Be nice, and check out our Code of Conduct.
user4351123 is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3220297%2fseries-that-evaluates-to-different-values-upon-changing-order-of-summation%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
1
$begingroup$
Is this the kind of thing you're looking for? The second paragraph gives an example and the convergent values for which a series can be rearranged and obtain different values.
$endgroup$
– Clayton
5 hours ago
1
$begingroup$
This theorem is what motivates my question - but how would you write an explicit example with 2 indices?
$endgroup$
– user4351123
5 hours ago
$begingroup$
One of the classical example (which should be well-attested enough to find a detailed proof for) is the Eisenstein series $G_2(tau) = sum_m, n (n + m tau)^-2$. Unlike the higher $G_n$, swapping the order of the summation $n, m$ produces an extra $2pi i/tau$ term.
$endgroup$
– anomaly
55 mins ago