Prove $(x_n)$ has a subsequence convergent to $x$.
$begingroup$
I’m trying to do this one but I don’t know how to start.
Let $(x_n)$ be a sequence on a metric space $(X,d)$, and $x$ a limit point of the image set of the sequence. Prove $(x_n)$ has a subsequence convergent to $x$.
My definition of limit point is that a point $x$ is a limit point on a space $Ssubset X$ if every neighbourhood of $x$ contains a point of $S$ different of $x$.
I don’t know how to build the convergent subsequence with this assumptions.
Thanks for your help.
calculus general-topology analysis
$endgroup$
add a comment |
$begingroup$
I’m trying to do this one but I don’t know how to start.
Let $(x_n)$ be a sequence on a metric space $(X,d)$, and $x$ a limit point of the image set of the sequence. Prove $(x_n)$ has a subsequence convergent to $x$.
My definition of limit point is that a point $x$ is a limit point on a space $Ssubset X$ if every neighbourhood of $x$ contains a point of $S$ different of $x$.
I don’t know how to build the convergent subsequence with this assumptions.
Thanks for your help.
calculus general-topology analysis
$endgroup$
1
$begingroup$
Hint: consider a sequence of shrinking neighbourhoods of $x$.
$endgroup$
– SmileyCraft
Dec 14 '18 at 12:52
add a comment |
$begingroup$
I’m trying to do this one but I don’t know how to start.
Let $(x_n)$ be a sequence on a metric space $(X,d)$, and $x$ a limit point of the image set of the sequence. Prove $(x_n)$ has a subsequence convergent to $x$.
My definition of limit point is that a point $x$ is a limit point on a space $Ssubset X$ if every neighbourhood of $x$ contains a point of $S$ different of $x$.
I don’t know how to build the convergent subsequence with this assumptions.
Thanks for your help.
calculus general-topology analysis
$endgroup$
I’m trying to do this one but I don’t know how to start.
Let $(x_n)$ be a sequence on a metric space $(X,d)$, and $x$ a limit point of the image set of the sequence. Prove $(x_n)$ has a subsequence convergent to $x$.
My definition of limit point is that a point $x$ is a limit point on a space $Ssubset X$ if every neighbourhood of $x$ contains a point of $S$ different of $x$.
I don’t know how to build the convergent subsequence with this assumptions.
Thanks for your help.
calculus general-topology analysis
calculus general-topology analysis
edited Dec 14 '18 at 12:49
H. R.
9,48093263
9,48093263
asked Dec 14 '18 at 12:41
RelureRelure
2,1671035
2,1671035
1
$begingroup$
Hint: consider a sequence of shrinking neighbourhoods of $x$.
$endgroup$
– SmileyCraft
Dec 14 '18 at 12:52
add a comment |
1
$begingroup$
Hint: consider a sequence of shrinking neighbourhoods of $x$.
$endgroup$
– SmileyCraft
Dec 14 '18 at 12:52
1
1
$begingroup$
Hint: consider a sequence of shrinking neighbourhoods of $x$.
$endgroup$
– SmileyCraft
Dec 14 '18 at 12:52
$begingroup$
Hint: consider a sequence of shrinking neighbourhoods of $x$.
$endgroup$
– SmileyCraft
Dec 14 '18 at 12:52
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
For every positive integer $k$ the set ${ninmathbb Nmid d(x_n,x)<frac1k}$ is infinite.
(If not then it can be shown that $x$ is not a limit point of ${x_nmid ninmathbb N}$)
So for $k=1$ choose some $n_1$ with $d(x_{n_1},x)<frac11=1$.
Then for $k=2$ choose some $n_2>n_1$ with $d(x_{n_2},x)<frac12$.
Et cetera.
$endgroup$
add a comment |
$begingroup$
Let denote : $B_epsilon = {y in X mid d(y-x) < epsilon }$ this is an open ball with center $x$ and radius $epsilon$.
Since $x$ is a limit point of the $(x_n)$ it means that for all $epsilon$ we can find an $N_{epsilon}$ such that : $x_{N_{epsilon}} in B_epsilon backslash {x}$.
Now let's construct a striclty increasing function $phi : mathbb{N} to mathbb{N}$ such that : $x_{phi(n)} to x$.
Let's choose an $epsilon > 0$, and let $phi(0) = N_{epsilon}$. Now suppose that the function $phi$ has been construct for all $n leq N$. Then we can take : $0 < epsilon'= frac{1}{K} < min {d(x_{phi(n)}-x) mid n leq N }$. And we can let : $phi(N+1) = N_{epsilon'}$.
$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%2f3039319%2fprove-x-n-has-a-subsequence-convergent-to-x%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
For every positive integer $k$ the set ${ninmathbb Nmid d(x_n,x)<frac1k}$ is infinite.
(If not then it can be shown that $x$ is not a limit point of ${x_nmid ninmathbb N}$)
So for $k=1$ choose some $n_1$ with $d(x_{n_1},x)<frac11=1$.
Then for $k=2$ choose some $n_2>n_1$ with $d(x_{n_2},x)<frac12$.
Et cetera.
$endgroup$
add a comment |
$begingroup$
For every positive integer $k$ the set ${ninmathbb Nmid d(x_n,x)<frac1k}$ is infinite.
(If not then it can be shown that $x$ is not a limit point of ${x_nmid ninmathbb N}$)
So for $k=1$ choose some $n_1$ with $d(x_{n_1},x)<frac11=1$.
Then for $k=2$ choose some $n_2>n_1$ with $d(x_{n_2},x)<frac12$.
Et cetera.
$endgroup$
add a comment |
$begingroup$
For every positive integer $k$ the set ${ninmathbb Nmid d(x_n,x)<frac1k}$ is infinite.
(If not then it can be shown that $x$ is not a limit point of ${x_nmid ninmathbb N}$)
So for $k=1$ choose some $n_1$ with $d(x_{n_1},x)<frac11=1$.
Then for $k=2$ choose some $n_2>n_1$ with $d(x_{n_2},x)<frac12$.
Et cetera.
$endgroup$
For every positive integer $k$ the set ${ninmathbb Nmid d(x_n,x)<frac1k}$ is infinite.
(If not then it can be shown that $x$ is not a limit point of ${x_nmid ninmathbb N}$)
So for $k=1$ choose some $n_1$ with $d(x_{n_1},x)<frac11=1$.
Then for $k=2$ choose some $n_2>n_1$ with $d(x_{n_2},x)<frac12$.
Et cetera.
answered Dec 14 '18 at 12:56
drhabdrhab
101k545136
101k545136
add a comment |
add a comment |
$begingroup$
Let denote : $B_epsilon = {y in X mid d(y-x) < epsilon }$ this is an open ball with center $x$ and radius $epsilon$.
Since $x$ is a limit point of the $(x_n)$ it means that for all $epsilon$ we can find an $N_{epsilon}$ such that : $x_{N_{epsilon}} in B_epsilon backslash {x}$.
Now let's construct a striclty increasing function $phi : mathbb{N} to mathbb{N}$ such that : $x_{phi(n)} to x$.
Let's choose an $epsilon > 0$, and let $phi(0) = N_{epsilon}$. Now suppose that the function $phi$ has been construct for all $n leq N$. Then we can take : $0 < epsilon'= frac{1}{K} < min {d(x_{phi(n)}-x) mid n leq N }$. And we can let : $phi(N+1) = N_{epsilon'}$.
$endgroup$
add a comment |
$begingroup$
Let denote : $B_epsilon = {y in X mid d(y-x) < epsilon }$ this is an open ball with center $x$ and radius $epsilon$.
Since $x$ is a limit point of the $(x_n)$ it means that for all $epsilon$ we can find an $N_{epsilon}$ such that : $x_{N_{epsilon}} in B_epsilon backslash {x}$.
Now let's construct a striclty increasing function $phi : mathbb{N} to mathbb{N}$ such that : $x_{phi(n)} to x$.
Let's choose an $epsilon > 0$, and let $phi(0) = N_{epsilon}$. Now suppose that the function $phi$ has been construct for all $n leq N$. Then we can take : $0 < epsilon'= frac{1}{K} < min {d(x_{phi(n)}-x) mid n leq N }$. And we can let : $phi(N+1) = N_{epsilon'}$.
$endgroup$
add a comment |
$begingroup$
Let denote : $B_epsilon = {y in X mid d(y-x) < epsilon }$ this is an open ball with center $x$ and radius $epsilon$.
Since $x$ is a limit point of the $(x_n)$ it means that for all $epsilon$ we can find an $N_{epsilon}$ such that : $x_{N_{epsilon}} in B_epsilon backslash {x}$.
Now let's construct a striclty increasing function $phi : mathbb{N} to mathbb{N}$ such that : $x_{phi(n)} to x$.
Let's choose an $epsilon > 0$, and let $phi(0) = N_{epsilon}$. Now suppose that the function $phi$ has been construct for all $n leq N$. Then we can take : $0 < epsilon'= frac{1}{K} < min {d(x_{phi(n)}-x) mid n leq N }$. And we can let : $phi(N+1) = N_{epsilon'}$.
$endgroup$
Let denote : $B_epsilon = {y in X mid d(y-x) < epsilon }$ this is an open ball with center $x$ and radius $epsilon$.
Since $x$ is a limit point of the $(x_n)$ it means that for all $epsilon$ we can find an $N_{epsilon}$ such that : $x_{N_{epsilon}} in B_epsilon backslash {x}$.
Now let's construct a striclty increasing function $phi : mathbb{N} to mathbb{N}$ such that : $x_{phi(n)} to x$.
Let's choose an $epsilon > 0$, and let $phi(0) = N_{epsilon}$. Now suppose that the function $phi$ has been construct for all $n leq N$. Then we can take : $0 < epsilon'= frac{1}{K} < min {d(x_{phi(n)}-x) mid n leq N }$. And we can let : $phi(N+1) = N_{epsilon'}$.
answered Dec 14 '18 at 12:59
ThinkingThinking
1,11416
1,11416
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%2f3039319%2fprove-x-n-has-a-subsequence-convergent-to-x%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
1
$begingroup$
Hint: consider a sequence of shrinking neighbourhoods of $x$.
$endgroup$
– SmileyCraft
Dec 14 '18 at 12:52