Statement and proof of the sequential characterization of limits
$begingroup$
So frequently on this site I will use the sequential characterizations of limits and continuity in my answers only to find the OP is unfamiliar with it. It is such a crucial notion that I am going to write the statement and proof here so that I (and others) can link it in answers.
real-analysis limits
$endgroup$
add a comment |
$begingroup$
So frequently on this site I will use the sequential characterizations of limits and continuity in my answers only to find the OP is unfamiliar with it. It is such a crucial notion that I am going to write the statement and proof here so that I (and others) can link it in answers.
real-analysis limits
$endgroup$
add a comment |
$begingroup$
So frequently on this site I will use the sequential characterizations of limits and continuity in my answers only to find the OP is unfamiliar with it. It is such a crucial notion that I am going to write the statement and proof here so that I (and others) can link it in answers.
real-analysis limits
$endgroup$
So frequently on this site I will use the sequential characterizations of limits and continuity in my answers only to find the OP is unfamiliar with it. It is such a crucial notion that I am going to write the statement and proof here so that I (and others) can link it in answers.
real-analysis limits
real-analysis limits
asked Feb 23 '18 at 21:23
David ReedDavid Reed
2,3191422
2,3191422
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Theorem (Sequential Characterization of Limits):
Let $I$ be an open interval, $a in I$, and $f:I to mathbb{R}$, then:
$\$
$$lim_{x to a}f(x) = L text{ if and only if }lim_{n to infty}f(x_n) = L text{ for every sequence }x_n in I - { a } text { satisfying } \ x_n to a text{ as } n to infty$$
$\$
Proof:
$\$
$Rightarrow:$
Suppose $lim_{x to a}f(x) = L$ and let ${x_n}$ be a sequence such that $x_n to a$. Let $varepsilon > 0$ be given. Choose $delta > 0$ such that $$ 0 < vert x-avert < delta implies vert f(x) - L vert < varepsilon$$
Since $delta > 0$ and $x_n to a$ we can choose an $N in mathbb{N}$ such that $$ n geq N implies vert x_n - a vert < delta$$
Combining both statements we have $$n geq N implies |f(x_n) - L| < varepsilon$$
and hence $lim_{n to infty}f(x_n) = L$
$Leftarrow$:
By contradiction, suppose $x_n to a$ implies $f(x_n) to L$, but $ lim_{x to a}f(x) neq L$, then $$left(exists , varepsilon_0 > 0right)left(forall delta > 0right)left(exists x in I right)left(0 < vert x - a vert < delta text{ but } vert f(x) - L vert geq varepsilon_0right) $$
$\$
Thus we can define a sequence ${x_n}$ as follows: For each $delta = 1/n$, choose $x_n in I - {a}$ such that: $$ 0 < vert x_n - a vert < 1/n text{ and } vert f(x_n) - L vert geqvarepsilon_0$$
By the squeeze theorem, $x_n to a$ and thus by assumption $f(x_n) to L$. However, by construction, $vert f(x_n) - L vert geq varepsilon_0$ for all $n$ and thus ${f(x_n)}$ cannot converge to $L$. We have arrived at a contradiction. This completes the proof.
$endgroup$
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%2f2663863%2fstatement-and-proof-of-the-sequential-characterization-of-limits%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$
Theorem (Sequential Characterization of Limits):
Let $I$ be an open interval, $a in I$, and $f:I to mathbb{R}$, then:
$\$
$$lim_{x to a}f(x) = L text{ if and only if }lim_{n to infty}f(x_n) = L text{ for every sequence }x_n in I - { a } text { satisfying } \ x_n to a text{ as } n to infty$$
$\$
Proof:
$\$
$Rightarrow:$
Suppose $lim_{x to a}f(x) = L$ and let ${x_n}$ be a sequence such that $x_n to a$. Let $varepsilon > 0$ be given. Choose $delta > 0$ such that $$ 0 < vert x-avert < delta implies vert f(x) - L vert < varepsilon$$
Since $delta > 0$ and $x_n to a$ we can choose an $N in mathbb{N}$ such that $$ n geq N implies vert x_n - a vert < delta$$
Combining both statements we have $$n geq N implies |f(x_n) - L| < varepsilon$$
and hence $lim_{n to infty}f(x_n) = L$
$Leftarrow$:
By contradiction, suppose $x_n to a$ implies $f(x_n) to L$, but $ lim_{x to a}f(x) neq L$, then $$left(exists , varepsilon_0 > 0right)left(forall delta > 0right)left(exists x in I right)left(0 < vert x - a vert < delta text{ but } vert f(x) - L vert geq varepsilon_0right) $$
$\$
Thus we can define a sequence ${x_n}$ as follows: For each $delta = 1/n$, choose $x_n in I - {a}$ such that: $$ 0 < vert x_n - a vert < 1/n text{ and } vert f(x_n) - L vert geqvarepsilon_0$$
By the squeeze theorem, $x_n to a$ and thus by assumption $f(x_n) to L$. However, by construction, $vert f(x_n) - L vert geq varepsilon_0$ for all $n$ and thus ${f(x_n)}$ cannot converge to $L$. We have arrived at a contradiction. This completes the proof.
$endgroup$
add a comment |
$begingroup$
Theorem (Sequential Characterization of Limits):
Let $I$ be an open interval, $a in I$, and $f:I to mathbb{R}$, then:
$\$
$$lim_{x to a}f(x) = L text{ if and only if }lim_{n to infty}f(x_n) = L text{ for every sequence }x_n in I - { a } text { satisfying } \ x_n to a text{ as } n to infty$$
$\$
Proof:
$\$
$Rightarrow:$
Suppose $lim_{x to a}f(x) = L$ and let ${x_n}$ be a sequence such that $x_n to a$. Let $varepsilon > 0$ be given. Choose $delta > 0$ such that $$ 0 < vert x-avert < delta implies vert f(x) - L vert < varepsilon$$
Since $delta > 0$ and $x_n to a$ we can choose an $N in mathbb{N}$ such that $$ n geq N implies vert x_n - a vert < delta$$
Combining both statements we have $$n geq N implies |f(x_n) - L| < varepsilon$$
and hence $lim_{n to infty}f(x_n) = L$
$Leftarrow$:
By contradiction, suppose $x_n to a$ implies $f(x_n) to L$, but $ lim_{x to a}f(x) neq L$, then $$left(exists , varepsilon_0 > 0right)left(forall delta > 0right)left(exists x in I right)left(0 < vert x - a vert < delta text{ but } vert f(x) - L vert geq varepsilon_0right) $$
$\$
Thus we can define a sequence ${x_n}$ as follows: For each $delta = 1/n$, choose $x_n in I - {a}$ such that: $$ 0 < vert x_n - a vert < 1/n text{ and } vert f(x_n) - L vert geqvarepsilon_0$$
By the squeeze theorem, $x_n to a$ and thus by assumption $f(x_n) to L$. However, by construction, $vert f(x_n) - L vert geq varepsilon_0$ for all $n$ and thus ${f(x_n)}$ cannot converge to $L$. We have arrived at a contradiction. This completes the proof.
$endgroup$
add a comment |
$begingroup$
Theorem (Sequential Characterization of Limits):
Let $I$ be an open interval, $a in I$, and $f:I to mathbb{R}$, then:
$\$
$$lim_{x to a}f(x) = L text{ if and only if }lim_{n to infty}f(x_n) = L text{ for every sequence }x_n in I - { a } text { satisfying } \ x_n to a text{ as } n to infty$$
$\$
Proof:
$\$
$Rightarrow:$
Suppose $lim_{x to a}f(x) = L$ and let ${x_n}$ be a sequence such that $x_n to a$. Let $varepsilon > 0$ be given. Choose $delta > 0$ such that $$ 0 < vert x-avert < delta implies vert f(x) - L vert < varepsilon$$
Since $delta > 0$ and $x_n to a$ we can choose an $N in mathbb{N}$ such that $$ n geq N implies vert x_n - a vert < delta$$
Combining both statements we have $$n geq N implies |f(x_n) - L| < varepsilon$$
and hence $lim_{n to infty}f(x_n) = L$
$Leftarrow$:
By contradiction, suppose $x_n to a$ implies $f(x_n) to L$, but $ lim_{x to a}f(x) neq L$, then $$left(exists , varepsilon_0 > 0right)left(forall delta > 0right)left(exists x in I right)left(0 < vert x - a vert < delta text{ but } vert f(x) - L vert geq varepsilon_0right) $$
$\$
Thus we can define a sequence ${x_n}$ as follows: For each $delta = 1/n$, choose $x_n in I - {a}$ such that: $$ 0 < vert x_n - a vert < 1/n text{ and } vert f(x_n) - L vert geqvarepsilon_0$$
By the squeeze theorem, $x_n to a$ and thus by assumption $f(x_n) to L$. However, by construction, $vert f(x_n) - L vert geq varepsilon_0$ for all $n$ and thus ${f(x_n)}$ cannot converge to $L$. We have arrived at a contradiction. This completes the proof.
$endgroup$
Theorem (Sequential Characterization of Limits):
Let $I$ be an open interval, $a in I$, and $f:I to mathbb{R}$, then:
$\$
$$lim_{x to a}f(x) = L text{ if and only if }lim_{n to infty}f(x_n) = L text{ for every sequence }x_n in I - { a } text { satisfying } \ x_n to a text{ as } n to infty$$
$\$
Proof:
$\$
$Rightarrow:$
Suppose $lim_{x to a}f(x) = L$ and let ${x_n}$ be a sequence such that $x_n to a$. Let $varepsilon > 0$ be given. Choose $delta > 0$ such that $$ 0 < vert x-avert < delta implies vert f(x) - L vert < varepsilon$$
Since $delta > 0$ and $x_n to a$ we can choose an $N in mathbb{N}$ such that $$ n geq N implies vert x_n - a vert < delta$$
Combining both statements we have $$n geq N implies |f(x_n) - L| < varepsilon$$
and hence $lim_{n to infty}f(x_n) = L$
$Leftarrow$:
By contradiction, suppose $x_n to a$ implies $f(x_n) to L$, but $ lim_{x to a}f(x) neq L$, then $$left(exists , varepsilon_0 > 0right)left(forall delta > 0right)left(exists x in I right)left(0 < vert x - a vert < delta text{ but } vert f(x) - L vert geq varepsilon_0right) $$
$\$
Thus we can define a sequence ${x_n}$ as follows: For each $delta = 1/n$, choose $x_n in I - {a}$ such that: $$ 0 < vert x_n - a vert < 1/n text{ and } vert f(x_n) - L vert geqvarepsilon_0$$
By the squeeze theorem, $x_n to a$ and thus by assumption $f(x_n) to L$. However, by construction, $vert f(x_n) - L vert geq varepsilon_0$ for all $n$ and thus ${f(x_n)}$ cannot converge to $L$. We have arrived at a contradiction. This completes the proof.
edited Jan 21 at 2:50
answered Feb 23 '18 at 21:23
David ReedDavid Reed
2,3191422
2,3191422
add a comment |
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%2f2663863%2fstatement-and-proof-of-the-sequential-characterization-of-limits%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