If a series of functions satisfies the Cauchy criterion uniformly, then the series converges uniformly on $S$
$begingroup$
Problem: If a series $sum_{k=0}^infty g_k$ of functions satisfies the Cauchy criterion uniformly on a set $S$, then the series converges uniformly on $S$.
If the series satisfies the Cauchy criterion uniformly on $S$, then
$$forall epsilon>0, exists N : n geq m geq N Rightarrow bigg|sum_{k=m}^n g_k(x) bigg| < epsilon , forall x in S$$
Therefore, we can define
$$f_l(x) = sum_{i=0}^l g_i(x)$$
Which transforms the criterion into
$$bigg| sum_{k=0}^ng_k(x) - sum_{k=0}^m g_k(x) bigg| = |f_n(x) - f_m(x)| < epsilon$$
Therefore, the definition of uniformly Cauchy is satisfied.
Is this correct? Is the converse true?
real-analysis sequences-and-series proof-verification convergence uniform-convergence
$endgroup$
add a comment |
$begingroup$
Problem: If a series $sum_{k=0}^infty g_k$ of functions satisfies the Cauchy criterion uniformly on a set $S$, then the series converges uniformly on $S$.
If the series satisfies the Cauchy criterion uniformly on $S$, then
$$forall epsilon>0, exists N : n geq m geq N Rightarrow bigg|sum_{k=m}^n g_k(x) bigg| < epsilon , forall x in S$$
Therefore, we can define
$$f_l(x) = sum_{i=0}^l g_i(x)$$
Which transforms the criterion into
$$bigg| sum_{k=0}^ng_k(x) - sum_{k=0}^m g_k(x) bigg| = |f_n(x) - f_m(x)| < epsilon$$
Therefore, the definition of uniformly Cauchy is satisfied.
Is this correct? Is the converse true?
real-analysis sequences-and-series proof-verification convergence uniform-convergence
$endgroup$
add a comment |
$begingroup$
Problem: If a series $sum_{k=0}^infty g_k$ of functions satisfies the Cauchy criterion uniformly on a set $S$, then the series converges uniformly on $S$.
If the series satisfies the Cauchy criterion uniformly on $S$, then
$$forall epsilon>0, exists N : n geq m geq N Rightarrow bigg|sum_{k=m}^n g_k(x) bigg| < epsilon , forall x in S$$
Therefore, we can define
$$f_l(x) = sum_{i=0}^l g_i(x)$$
Which transforms the criterion into
$$bigg| sum_{k=0}^ng_k(x) - sum_{k=0}^m g_k(x) bigg| = |f_n(x) - f_m(x)| < epsilon$$
Therefore, the definition of uniformly Cauchy is satisfied.
Is this correct? Is the converse true?
real-analysis sequences-and-series proof-verification convergence uniform-convergence
$endgroup$
Problem: If a series $sum_{k=0}^infty g_k$ of functions satisfies the Cauchy criterion uniformly on a set $S$, then the series converges uniformly on $S$.
If the series satisfies the Cauchy criterion uniformly on $S$, then
$$forall epsilon>0, exists N : n geq m geq N Rightarrow bigg|sum_{k=m}^n g_k(x) bigg| < epsilon , forall x in S$$
Therefore, we can define
$$f_l(x) = sum_{i=0}^l g_i(x)$$
Which transforms the criterion into
$$bigg| sum_{k=0}^ng_k(x) - sum_{k=0}^m g_k(x) bigg| = |f_n(x) - f_m(x)| < epsilon$$
Therefore, the definition of uniformly Cauchy is satisfied.
Is this correct? Is the converse true?
real-analysis sequences-and-series proof-verification convergence uniform-convergence
real-analysis sequences-and-series proof-verification convergence uniform-convergence
edited Dec 17 '18 at 12:32
The Bosco
asked Dec 17 '18 at 12:25
The BoscoThe Bosco
541212
541212
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
If you write $f_l(x) = sum_{i=0}^l g_i(x)$ instead of $f_l(x) = sum_{i=0}^l f_i(x)$, then everything is correct.
And yes, the converse is also true. Try a proof !
$endgroup$
$begingroup$
Thank you! I fixed it. I was trying the converse. It seems to be one of those where you actually just go backwards from the original proof.
$endgroup$
– The Bosco
Dec 17 '18 at 12:33
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%2f3043869%2fif-a-series-of-functions-satisfies-the-cauchy-criterion-uniformly-then-the-seri%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$
If you write $f_l(x) = sum_{i=0}^l g_i(x)$ instead of $f_l(x) = sum_{i=0}^l f_i(x)$, then everything is correct.
And yes, the converse is also true. Try a proof !
$endgroup$
$begingroup$
Thank you! I fixed it. I was trying the converse. It seems to be one of those where you actually just go backwards from the original proof.
$endgroup$
– The Bosco
Dec 17 '18 at 12:33
add a comment |
$begingroup$
If you write $f_l(x) = sum_{i=0}^l g_i(x)$ instead of $f_l(x) = sum_{i=0}^l f_i(x)$, then everything is correct.
And yes, the converse is also true. Try a proof !
$endgroup$
$begingroup$
Thank you! I fixed it. I was trying the converse. It seems to be one of those where you actually just go backwards from the original proof.
$endgroup$
– The Bosco
Dec 17 '18 at 12:33
add a comment |
$begingroup$
If you write $f_l(x) = sum_{i=0}^l g_i(x)$ instead of $f_l(x) = sum_{i=0}^l f_i(x)$, then everything is correct.
And yes, the converse is also true. Try a proof !
$endgroup$
If you write $f_l(x) = sum_{i=0}^l g_i(x)$ instead of $f_l(x) = sum_{i=0}^l f_i(x)$, then everything is correct.
And yes, the converse is also true. Try a proof !
answered Dec 17 '18 at 12:28
FredFred
44.7k1846
44.7k1846
$begingroup$
Thank you! I fixed it. I was trying the converse. It seems to be one of those where you actually just go backwards from the original proof.
$endgroup$
– The Bosco
Dec 17 '18 at 12:33
add a comment |
$begingroup$
Thank you! I fixed it. I was trying the converse. It seems to be one of those where you actually just go backwards from the original proof.
$endgroup$
– The Bosco
Dec 17 '18 at 12:33
$begingroup$
Thank you! I fixed it. I was trying the converse. It seems to be one of those where you actually just go backwards from the original proof.
$endgroup$
– The Bosco
Dec 17 '18 at 12:33
$begingroup$
Thank you! I fixed it. I was trying the converse. It seems to be one of those where you actually just go backwards from the original proof.
$endgroup$
– The Bosco
Dec 17 '18 at 12:33
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%2f3043869%2fif-a-series-of-functions-satisfies-the-cauchy-criterion-uniformly-then-the-seri%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