Exercise of sequence of continuous functions
Let $(f_n)_n$ be a sequence of continuous functions on $Dsubset mathbb{R}^{N} to mathbb{R}$ which is monotone decreasing. If $lim_{ntoinfty }f_n(c))=0$ for some $cin D$ and $ epsilon >0$ , show that there are $m in mathbb{N}$ and a neighbourhood $U$ of $c$ shuch that if $n>m$ and $x in U cap D$ , then $f_n (x)< epsilon$.
real-analysis convergence sequence-of-function
add a comment |
Let $(f_n)_n$ be a sequence of continuous functions on $Dsubset mathbb{R}^{N} to mathbb{R}$ which is monotone decreasing. If $lim_{ntoinfty }f_n(c))=0$ for some $cin D$ and $ epsilon >0$ , show that there are $m in mathbb{N}$ and a neighbourhood $U$ of $c$ shuch that if $n>m$ and $x in U cap D$ , then $f_n (x)< epsilon$.
real-analysis convergence sequence-of-function
Are you going to share with us your thoughts about this exercise?
– Robert Z
Nov 22 '18 at 8:39
I was thinking some like this: $|f_k(x)| leq |f_k(c)| + |f_k(c)-f_k(x)|$ so the first term is less to $epsilon$ by $f_n(c)$ converges to zero and the second is less to $epsilon$ by continuity but the problem is that the neighbourhood depend of $k$ , thank you
– Parcos
Nov 22 '18 at 12:28
Next time please include your thoughts under the question. This increases significantly the probability that some user will answer your question.
– Robert Z
Nov 22 '18 at 12:52
add a comment |
Let $(f_n)_n$ be a sequence of continuous functions on $Dsubset mathbb{R}^{N} to mathbb{R}$ which is monotone decreasing. If $lim_{ntoinfty }f_n(c))=0$ for some $cin D$ and $ epsilon >0$ , show that there are $m in mathbb{N}$ and a neighbourhood $U$ of $c$ shuch that if $n>m$ and $x in U cap D$ , then $f_n (x)< epsilon$.
real-analysis convergence sequence-of-function
Let $(f_n)_n$ be a sequence of continuous functions on $Dsubset mathbb{R}^{N} to mathbb{R}$ which is monotone decreasing. If $lim_{ntoinfty }f_n(c))=0$ for some $cin D$ and $ epsilon >0$ , show that there are $m in mathbb{N}$ and a neighbourhood $U$ of $c$ shuch that if $n>m$ and $x in U cap D$ , then $f_n (x)< epsilon$.
real-analysis convergence sequence-of-function
real-analysis convergence sequence-of-function
edited Nov 22 '18 at 8:41


Robert Z
93.8k1061132
93.8k1061132
asked Nov 22 '18 at 8:29
ParcosParcos
506
506
Are you going to share with us your thoughts about this exercise?
– Robert Z
Nov 22 '18 at 8:39
I was thinking some like this: $|f_k(x)| leq |f_k(c)| + |f_k(c)-f_k(x)|$ so the first term is less to $epsilon$ by $f_n(c)$ converges to zero and the second is less to $epsilon$ by continuity but the problem is that the neighbourhood depend of $k$ , thank you
– Parcos
Nov 22 '18 at 12:28
Next time please include your thoughts under the question. This increases significantly the probability that some user will answer your question.
– Robert Z
Nov 22 '18 at 12:52
add a comment |
Are you going to share with us your thoughts about this exercise?
– Robert Z
Nov 22 '18 at 8:39
I was thinking some like this: $|f_k(x)| leq |f_k(c)| + |f_k(c)-f_k(x)|$ so the first term is less to $epsilon$ by $f_n(c)$ converges to zero and the second is less to $epsilon$ by continuity but the problem is that the neighbourhood depend of $k$ , thank you
– Parcos
Nov 22 '18 at 12:28
Next time please include your thoughts under the question. This increases significantly the probability that some user will answer your question.
– Robert Z
Nov 22 '18 at 12:52
Are you going to share with us your thoughts about this exercise?
– Robert Z
Nov 22 '18 at 8:39
Are you going to share with us your thoughts about this exercise?
– Robert Z
Nov 22 '18 at 8:39
I was thinking some like this: $|f_k(x)| leq |f_k(c)| + |f_k(c)-f_k(x)|$ so the first term is less to $epsilon$ by $f_n(c)$ converges to zero and the second is less to $epsilon$ by continuity but the problem is that the neighbourhood depend of $k$ , thank you
– Parcos
Nov 22 '18 at 12:28
I was thinking some like this: $|f_k(x)| leq |f_k(c)| + |f_k(c)-f_k(x)|$ so the first term is less to $epsilon$ by $f_n(c)$ converges to zero and the second is less to $epsilon$ by continuity but the problem is that the neighbourhood depend of $k$ , thank you
– Parcos
Nov 22 '18 at 12:28
Next time please include your thoughts under the question. This increases significantly the probability that some user will answer your question.
– Robert Z
Nov 22 '18 at 12:52
Next time please include your thoughts under the question. This increases significantly the probability that some user will answer your question.
– Robert Z
Nov 22 '18 at 12:52
add a comment |
1 Answer
1
active
oldest
votes
$f_k(c)<epsilon$ for some $k$. By continuity $f_k(x) <epsilon$ for all $x$ in some neighborhood. Since $f_n leq f_k$ for $n geq k$ we get $f_n(x) <epsilon$ for all $n geq k$ for all $x$ in the neighborhood.
Oh thank you!, it was easier than i thought
– Parcos
Nov 22 '18 at 12:34
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%2f3008875%2fexercise-of-sequence-of-continuous-functions%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
$f_k(c)<epsilon$ for some $k$. By continuity $f_k(x) <epsilon$ for all $x$ in some neighborhood. Since $f_n leq f_k$ for $n geq k$ we get $f_n(x) <epsilon$ for all $n geq k$ for all $x$ in the neighborhood.
Oh thank you!, it was easier than i thought
– Parcos
Nov 22 '18 at 12:34
add a comment |
$f_k(c)<epsilon$ for some $k$. By continuity $f_k(x) <epsilon$ for all $x$ in some neighborhood. Since $f_n leq f_k$ for $n geq k$ we get $f_n(x) <epsilon$ for all $n geq k$ for all $x$ in the neighborhood.
Oh thank you!, it was easier than i thought
– Parcos
Nov 22 '18 at 12:34
add a comment |
$f_k(c)<epsilon$ for some $k$. By continuity $f_k(x) <epsilon$ for all $x$ in some neighborhood. Since $f_n leq f_k$ for $n geq k$ we get $f_n(x) <epsilon$ for all $n geq k$ for all $x$ in the neighborhood.
$f_k(c)<epsilon$ for some $k$. By continuity $f_k(x) <epsilon$ for all $x$ in some neighborhood. Since $f_n leq f_k$ for $n geq k$ we get $f_n(x) <epsilon$ for all $n geq k$ for all $x$ in the neighborhood.
answered Nov 22 '18 at 8:33


Kavi Rama MurthyKavi Rama Murthy
52k32055
52k32055
Oh thank you!, it was easier than i thought
– Parcos
Nov 22 '18 at 12:34
add a comment |
Oh thank you!, it was easier than i thought
– Parcos
Nov 22 '18 at 12:34
Oh thank you!, it was easier than i thought
– Parcos
Nov 22 '18 at 12:34
Oh thank you!, it was easier than i thought
– Parcos
Nov 22 '18 at 12:34
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%2f3008875%2fexercise-of-sequence-of-continuous-functions%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
Are you going to share with us your thoughts about this exercise?
– Robert Z
Nov 22 '18 at 8:39
I was thinking some like this: $|f_k(x)| leq |f_k(c)| + |f_k(c)-f_k(x)|$ so the first term is less to $epsilon$ by $f_n(c)$ converges to zero and the second is less to $epsilon$ by continuity but the problem is that the neighbourhood depend of $k$ , thank you
– Parcos
Nov 22 '18 at 12:28
Next time please include your thoughts under the question. This increases significantly the probability that some user will answer your question.
– Robert Z
Nov 22 '18 at 12:52