Fubini's theorem for series with dependent indices
As a part of a proposition about power series that I am trying to prove I have to show that
$$ sum_{m=0}^{infty} left(sum_{n=m}^{infty} frac{n!}{m!(n-m)!}(b-a)^{n-m}c_nright)(x-b)^m = sum_{n=0}^{infty}c_n(x-a)^n$$
Proof: What I have done so far is to show that
$$sum_{m=0}^{n} frac{n!}{m!(n-m)!}(b-a)^{n-m}(x-b)^m = (x-a)^n $$
So the next idea is to use Fubini's rearrangement theorem for infinite series (I have also shown that the series are absolutely convergent). However, the theorem does not accomodate for dependent indices. Intuitively (using triangular summation), I think that the proper way to interchange series would be
begin{equation*}
%begin{array}{ll}
sum_{m=0}^{infty} sum_{n=m}^{infty} frac{n!}{m!(n-m)!}(b-a)^{n-m}c_n(x-b)^m = sum_{n=0}^{infty} sum_{m=0}^{n}frac{n!}{m!(n-m)!}(b-a)^{n-m}c_n(x-b)^m
%end{array}
end{equation*}
and thus
$$=sum_{n=0}^{infty} c_n(x-a)^n$$
However, I do not know how to perform this step rigorously in case of infinite summation.
real-analysis sequences-and-series power-series
add a comment |
As a part of a proposition about power series that I am trying to prove I have to show that
$$ sum_{m=0}^{infty} left(sum_{n=m}^{infty} frac{n!}{m!(n-m)!}(b-a)^{n-m}c_nright)(x-b)^m = sum_{n=0}^{infty}c_n(x-a)^n$$
Proof: What I have done so far is to show that
$$sum_{m=0}^{n} frac{n!}{m!(n-m)!}(b-a)^{n-m}(x-b)^m = (x-a)^n $$
So the next idea is to use Fubini's rearrangement theorem for infinite series (I have also shown that the series are absolutely convergent). However, the theorem does not accomodate for dependent indices. Intuitively (using triangular summation), I think that the proper way to interchange series would be
begin{equation*}
%begin{array}{ll}
sum_{m=0}^{infty} sum_{n=m}^{infty} frac{n!}{m!(n-m)!}(b-a)^{n-m}c_n(x-b)^m = sum_{n=0}^{infty} sum_{m=0}^{n}frac{n!}{m!(n-m)!}(b-a)^{n-m}c_n(x-b)^m
%end{array}
end{equation*}
and thus
$$=sum_{n=0}^{infty} c_n(x-a)^n$$
However, I do not know how to perform this step rigorously in case of infinite summation.
real-analysis sequences-and-series power-series
add a comment |
As a part of a proposition about power series that I am trying to prove I have to show that
$$ sum_{m=0}^{infty} left(sum_{n=m}^{infty} frac{n!}{m!(n-m)!}(b-a)^{n-m}c_nright)(x-b)^m = sum_{n=0}^{infty}c_n(x-a)^n$$
Proof: What I have done so far is to show that
$$sum_{m=0}^{n} frac{n!}{m!(n-m)!}(b-a)^{n-m}(x-b)^m = (x-a)^n $$
So the next idea is to use Fubini's rearrangement theorem for infinite series (I have also shown that the series are absolutely convergent). However, the theorem does not accomodate for dependent indices. Intuitively (using triangular summation), I think that the proper way to interchange series would be
begin{equation*}
%begin{array}{ll}
sum_{m=0}^{infty} sum_{n=m}^{infty} frac{n!}{m!(n-m)!}(b-a)^{n-m}c_n(x-b)^m = sum_{n=0}^{infty} sum_{m=0}^{n}frac{n!}{m!(n-m)!}(b-a)^{n-m}c_n(x-b)^m
%end{array}
end{equation*}
and thus
$$=sum_{n=0}^{infty} c_n(x-a)^n$$
However, I do not know how to perform this step rigorously in case of infinite summation.
real-analysis sequences-and-series power-series
As a part of a proposition about power series that I am trying to prove I have to show that
$$ sum_{m=0}^{infty} left(sum_{n=m}^{infty} frac{n!}{m!(n-m)!}(b-a)^{n-m}c_nright)(x-b)^m = sum_{n=0}^{infty}c_n(x-a)^n$$
Proof: What I have done so far is to show that
$$sum_{m=0}^{n} frac{n!}{m!(n-m)!}(b-a)^{n-m}(x-b)^m = (x-a)^n $$
So the next idea is to use Fubini's rearrangement theorem for infinite series (I have also shown that the series are absolutely convergent). However, the theorem does not accomodate for dependent indices. Intuitively (using triangular summation), I think that the proper way to interchange series would be
begin{equation*}
%begin{array}{ll}
sum_{m=0}^{infty} sum_{n=m}^{infty} frac{n!}{m!(n-m)!}(b-a)^{n-m}c_n(x-b)^m = sum_{n=0}^{infty} sum_{m=0}^{n}frac{n!}{m!(n-m)!}(b-a)^{n-m}c_n(x-b)^m
%end{array}
end{equation*}
and thus
$$=sum_{n=0}^{infty} c_n(x-a)^n$$
However, I do not know how to perform this step rigorously in case of infinite summation.
real-analysis sequences-and-series power-series
real-analysis sequences-and-series power-series
edited Jan 6 at 11:38
Cebiş Mellim
asked Jan 6 at 10:41
Cebiş MellimCebiş Mellim
12210
12210
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
Using the indicator function
$$mathbf{1}_{{m leqslant n}}=mathbf{1}_{{n geqslant m}} = begin{cases}1 , & ngeqslant m \ 0, & n < mend{cases}$$
we have
$$sum_{m=0}^inftysum_{n=m}^infty f(m,n) = sum_{m=0}^inftysum_{n=0}^infty f(m,n)mathbf{1}_{{n geqslant m}}= sum_{m=0}^inftysum_{n=0}^infty f(m,n)mathbf{1}_{{m leqslant n}} $$
With absolute convergence we can apply Fubini's theorem to interchange summations and obtain
$$sum_{m=0}^inftysum_{n=m}^infty f(m,n) =underbrace{sum_{n=0}^inftysum_{m=0}^infty f(m,n)mathbf{1}_{{m leqslant n}}}_{text{after switching summation order}} = sum_{n=0}^inftysum_{m=0}^n f(m,n)$$
When will I finally start to do the magic like this on my own ...
– Cebiş Mellim
2 days ago
1
@CebişMellim: Well, your intuition and observation about triangular summation was a good start and it allowed you to reach the correct conclusion.
– RRL
2 days ago
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%2f3063704%2ffubinis-theorem-for-series-with-dependent-indices%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
Using the indicator function
$$mathbf{1}_{{m leqslant n}}=mathbf{1}_{{n geqslant m}} = begin{cases}1 , & ngeqslant m \ 0, & n < mend{cases}$$
we have
$$sum_{m=0}^inftysum_{n=m}^infty f(m,n) = sum_{m=0}^inftysum_{n=0}^infty f(m,n)mathbf{1}_{{n geqslant m}}= sum_{m=0}^inftysum_{n=0}^infty f(m,n)mathbf{1}_{{m leqslant n}} $$
With absolute convergence we can apply Fubini's theorem to interchange summations and obtain
$$sum_{m=0}^inftysum_{n=m}^infty f(m,n) =underbrace{sum_{n=0}^inftysum_{m=0}^infty f(m,n)mathbf{1}_{{m leqslant n}}}_{text{after switching summation order}} = sum_{n=0}^inftysum_{m=0}^n f(m,n)$$
When will I finally start to do the magic like this on my own ...
– Cebiş Mellim
2 days ago
1
@CebişMellim: Well, your intuition and observation about triangular summation was a good start and it allowed you to reach the correct conclusion.
– RRL
2 days ago
add a comment |
Using the indicator function
$$mathbf{1}_{{m leqslant n}}=mathbf{1}_{{n geqslant m}} = begin{cases}1 , & ngeqslant m \ 0, & n < mend{cases}$$
we have
$$sum_{m=0}^inftysum_{n=m}^infty f(m,n) = sum_{m=0}^inftysum_{n=0}^infty f(m,n)mathbf{1}_{{n geqslant m}}= sum_{m=0}^inftysum_{n=0}^infty f(m,n)mathbf{1}_{{m leqslant n}} $$
With absolute convergence we can apply Fubini's theorem to interchange summations and obtain
$$sum_{m=0}^inftysum_{n=m}^infty f(m,n) =underbrace{sum_{n=0}^inftysum_{m=0}^infty f(m,n)mathbf{1}_{{m leqslant n}}}_{text{after switching summation order}} = sum_{n=0}^inftysum_{m=0}^n f(m,n)$$
When will I finally start to do the magic like this on my own ...
– Cebiş Mellim
2 days ago
1
@CebişMellim: Well, your intuition and observation about triangular summation was a good start and it allowed you to reach the correct conclusion.
– RRL
2 days ago
add a comment |
Using the indicator function
$$mathbf{1}_{{m leqslant n}}=mathbf{1}_{{n geqslant m}} = begin{cases}1 , & ngeqslant m \ 0, & n < mend{cases}$$
we have
$$sum_{m=0}^inftysum_{n=m}^infty f(m,n) = sum_{m=0}^inftysum_{n=0}^infty f(m,n)mathbf{1}_{{n geqslant m}}= sum_{m=0}^inftysum_{n=0}^infty f(m,n)mathbf{1}_{{m leqslant n}} $$
With absolute convergence we can apply Fubini's theorem to interchange summations and obtain
$$sum_{m=0}^inftysum_{n=m}^infty f(m,n) =underbrace{sum_{n=0}^inftysum_{m=0}^infty f(m,n)mathbf{1}_{{m leqslant n}}}_{text{after switching summation order}} = sum_{n=0}^inftysum_{m=0}^n f(m,n)$$
Using the indicator function
$$mathbf{1}_{{m leqslant n}}=mathbf{1}_{{n geqslant m}} = begin{cases}1 , & ngeqslant m \ 0, & n < mend{cases}$$
we have
$$sum_{m=0}^inftysum_{n=m}^infty f(m,n) = sum_{m=0}^inftysum_{n=0}^infty f(m,n)mathbf{1}_{{n geqslant m}}= sum_{m=0}^inftysum_{n=0}^infty f(m,n)mathbf{1}_{{m leqslant n}} $$
With absolute convergence we can apply Fubini's theorem to interchange summations and obtain
$$sum_{m=0}^inftysum_{n=m}^infty f(m,n) =underbrace{sum_{n=0}^inftysum_{m=0}^infty f(m,n)mathbf{1}_{{m leqslant n}}}_{text{after switching summation order}} = sum_{n=0}^inftysum_{m=0}^n f(m,n)$$
answered Jan 6 at 19:06
RRLRRL
49.4k42573
49.4k42573
When will I finally start to do the magic like this on my own ...
– Cebiş Mellim
2 days ago
1
@CebişMellim: Well, your intuition and observation about triangular summation was a good start and it allowed you to reach the correct conclusion.
– RRL
2 days ago
add a comment |
When will I finally start to do the magic like this on my own ...
– Cebiş Mellim
2 days ago
1
@CebişMellim: Well, your intuition and observation about triangular summation was a good start and it allowed you to reach the correct conclusion.
– RRL
2 days ago
When will I finally start to do the magic like this on my own ...
– Cebiş Mellim
2 days ago
When will I finally start to do the magic like this on my own ...
– Cebiş Mellim
2 days ago
1
1
@CebişMellim: Well, your intuition and observation about triangular summation was a good start and it allowed you to reach the correct conclusion.
– RRL
2 days ago
@CebişMellim: Well, your intuition and observation about triangular summation was a good start and it allowed you to reach the correct conclusion.
– RRL
2 days ago
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3063704%2ffubinis-theorem-for-series-with-dependent-indices%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