Rearrange the index of a summation to get an infinite sum
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
I'd like to know the basis for the following transformation:
$$sum_i,j:i+j=ka_ib_j quad k=0, dots n+m$$
Let $j = k-i$ then:
$$sum_i=-infty^inftya_ib_k-i quad k=0, dots n+m$$
I understand that the $j$ index is eliminated by the substitution, I just don't get how it suddenly becomes an infinite sum across all $i$.
Source
summation
add a comment |Â
up vote
0
down vote
favorite
I'd like to know the basis for the following transformation:
$$sum_i,j:i+j=ka_ib_j quad k=0, dots n+m$$
Let $j = k-i$ then:
$$sum_i=-infty^inftya_ib_k-i quad k=0, dots n+m$$
I understand that the $j$ index is eliminated by the substitution, I just don't get how it suddenly becomes an infinite sum across all $i$.
Source
summation
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I'd like to know the basis for the following transformation:
$$sum_i,j:i+j=ka_ib_j quad k=0, dots n+m$$
Let $j = k-i$ then:
$$sum_i=-infty^inftya_ib_k-i quad k=0, dots n+m$$
I understand that the $j$ index is eliminated by the substitution, I just don't get how it suddenly becomes an infinite sum across all $i$.
Source
summation
I'd like to know the basis for the following transformation:
$$sum_i,j:i+j=ka_ib_j quad k=0, dots n+m$$
Let $j = k-i$ then:
$$sum_i=-infty^inftya_ib_k-i quad k=0, dots n+m$$
I understand that the $j$ index is eliminated by the substitution, I just don't get how it suddenly becomes an infinite sum across all $i$.
Source
summation
summation
asked Sep 1 at 7:15
Dianne
31
31
add a comment |Â
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
1
down vote
accepted
In the first sum you have pairs of indices $(i,j)$ all with property $i+j=k$.
So actually for e.g. $k=2$ like this :$$cdots,(-3,5),(-2,4),(-1,3),(0,2),(1,3),(2,4),(3,5),cdots$$
In the second sum only the $i$ remains and get the corresponding sequence:$$cdots,-3,-2,-1,0,1,2,3,cdots$$
1
... and since $i+j=k$ we have $j=k-i$ I.e. once we know the first index, we can calculate the second. Although the first sum has two indices, the index values only have one degree of freedom.
â gandalf61
Sep 1 at 7:39
@gandalf61 Yep. I left that out because the OP said "I understand that the index $j$ is eliminated by the substitution". But it does not harm to mention that too.
â drhab
Sep 1 at 7:42
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
accepted
In the first sum you have pairs of indices $(i,j)$ all with property $i+j=k$.
So actually for e.g. $k=2$ like this :$$cdots,(-3,5),(-2,4),(-1,3),(0,2),(1,3),(2,4),(3,5),cdots$$
In the second sum only the $i$ remains and get the corresponding sequence:$$cdots,-3,-2,-1,0,1,2,3,cdots$$
1
... and since $i+j=k$ we have $j=k-i$ I.e. once we know the first index, we can calculate the second. Although the first sum has two indices, the index values only have one degree of freedom.
â gandalf61
Sep 1 at 7:39
@gandalf61 Yep. I left that out because the OP said "I understand that the index $j$ is eliminated by the substitution". But it does not harm to mention that too.
â drhab
Sep 1 at 7:42
add a comment |Â
up vote
1
down vote
accepted
In the first sum you have pairs of indices $(i,j)$ all with property $i+j=k$.
So actually for e.g. $k=2$ like this :$$cdots,(-3,5),(-2,4),(-1,3),(0,2),(1,3),(2,4),(3,5),cdots$$
In the second sum only the $i$ remains and get the corresponding sequence:$$cdots,-3,-2,-1,0,1,2,3,cdots$$
1
... and since $i+j=k$ we have $j=k-i$ I.e. once we know the first index, we can calculate the second. Although the first sum has two indices, the index values only have one degree of freedom.
â gandalf61
Sep 1 at 7:39
@gandalf61 Yep. I left that out because the OP said "I understand that the index $j$ is eliminated by the substitution". But it does not harm to mention that too.
â drhab
Sep 1 at 7:42
add a comment |Â
up vote
1
down vote
accepted
up vote
1
down vote
accepted
In the first sum you have pairs of indices $(i,j)$ all with property $i+j=k$.
So actually for e.g. $k=2$ like this :$$cdots,(-3,5),(-2,4),(-1,3),(0,2),(1,3),(2,4),(3,5),cdots$$
In the second sum only the $i$ remains and get the corresponding sequence:$$cdots,-3,-2,-1,0,1,2,3,cdots$$
In the first sum you have pairs of indices $(i,j)$ all with property $i+j=k$.
So actually for e.g. $k=2$ like this :$$cdots,(-3,5),(-2,4),(-1,3),(0,2),(1,3),(2,4),(3,5),cdots$$
In the second sum only the $i$ remains and get the corresponding sequence:$$cdots,-3,-2,-1,0,1,2,3,cdots$$
answered Sep 1 at 7:28
drhab
88.9k541122
88.9k541122
1
... and since $i+j=k$ we have $j=k-i$ I.e. once we know the first index, we can calculate the second. Although the first sum has two indices, the index values only have one degree of freedom.
â gandalf61
Sep 1 at 7:39
@gandalf61 Yep. I left that out because the OP said "I understand that the index $j$ is eliminated by the substitution". But it does not harm to mention that too.
â drhab
Sep 1 at 7:42
add a comment |Â
1
... and since $i+j=k$ we have $j=k-i$ I.e. once we know the first index, we can calculate the second. Although the first sum has two indices, the index values only have one degree of freedom.
â gandalf61
Sep 1 at 7:39
@gandalf61 Yep. I left that out because the OP said "I understand that the index $j$ is eliminated by the substitution". But it does not harm to mention that too.
â drhab
Sep 1 at 7:42
1
1
... and since $i+j=k$ we have $j=k-i$ I.e. once we know the first index, we can calculate the second. Although the first sum has two indices, the index values only have one degree of freedom.
â gandalf61
Sep 1 at 7:39
... and since $i+j=k$ we have $j=k-i$ I.e. once we know the first index, we can calculate the second. Although the first sum has two indices, the index values only have one degree of freedom.
â gandalf61
Sep 1 at 7:39
@gandalf61 Yep. I left that out because the OP said "I understand that the index $j$ is eliminated by the substitution". But it does not harm to mention that too.
â drhab
Sep 1 at 7:42
@gandalf61 Yep. I left that out because the OP said "I understand that the index $j$ is eliminated by the substitution". But it does not harm to mention that too.
â drhab
Sep 1 at 7:42
add a comment |Â
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2901454%2frearrange-the-index-of-a-summation-to-get-an-infinite-sum%23new-answer', 'question_page');
);
Post as a guest
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
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
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