Let S be an uncountable subset of a separable metric space (X,d). Then,can we find any such S in X which...
$begingroup$
This question arrived into my mind after observing the fact that many of the uncountable subsets is either dense or posseses a dense subset, dense in itself, even the Cantor set in R is perfect .
general-topology metric-spaces
$endgroup$
add a comment |
$begingroup$
This question arrived into my mind after observing the fact that many of the uncountable subsets is either dense or posseses a dense subset, dense in itself, even the Cantor set in R is perfect .
general-topology metric-spaces
$endgroup$
add a comment |
$begingroup$
This question arrived into my mind after observing the fact that many of the uncountable subsets is either dense or posseses a dense subset, dense in itself, even the Cantor set in R is perfect .
general-topology metric-spaces
$endgroup$
This question arrived into my mind after observing the fact that many of the uncountable subsets is either dense or posseses a dense subset, dense in itself, even the Cantor set in R is perfect .
general-topology metric-spaces
general-topology metric-spaces
edited Jan 10 at 10:49
bof
51.6k558120
51.6k558120
asked Jan 10 at 10:34
RABI KUMAR CHAKRABORTYRABI KUMAR CHAKRABORTY
565
565
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Since a subspace of a separable metric space is separable, we may as well assume that $S=X$. The answer is yes, any uncountable separable metric space $S$ contains an uncountable subset which is dense in itself. To see this write $S=Ccup D$ where $xin C$ if some neighborhood of $x$ is countable, $xin D$ if every neighborhood of $x$ is uncountable. Now it is easy to see that $C$ is countable (from the Lindelöf property of separable metric spaces); it follows that $D$ is uncountable, and every neighborhood of a point $xin D$ contains uncountably many points of $D$.
$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%2f3068481%2flet-s-be-an-uncountable-subset-of-a-separable-metric-space-x-d-then-can-we-fi%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$
Since a subspace of a separable metric space is separable, we may as well assume that $S=X$. The answer is yes, any uncountable separable metric space $S$ contains an uncountable subset which is dense in itself. To see this write $S=Ccup D$ where $xin C$ if some neighborhood of $x$ is countable, $xin D$ if every neighborhood of $x$ is uncountable. Now it is easy to see that $C$ is countable (from the Lindelöf property of separable metric spaces); it follows that $D$ is uncountable, and every neighborhood of a point $xin D$ contains uncountably many points of $D$.
$endgroup$
add a comment |
$begingroup$
Since a subspace of a separable metric space is separable, we may as well assume that $S=X$. The answer is yes, any uncountable separable metric space $S$ contains an uncountable subset which is dense in itself. To see this write $S=Ccup D$ where $xin C$ if some neighborhood of $x$ is countable, $xin D$ if every neighborhood of $x$ is uncountable. Now it is easy to see that $C$ is countable (from the Lindelöf property of separable metric spaces); it follows that $D$ is uncountable, and every neighborhood of a point $xin D$ contains uncountably many points of $D$.
$endgroup$
add a comment |
$begingroup$
Since a subspace of a separable metric space is separable, we may as well assume that $S=X$. The answer is yes, any uncountable separable metric space $S$ contains an uncountable subset which is dense in itself. To see this write $S=Ccup D$ where $xin C$ if some neighborhood of $x$ is countable, $xin D$ if every neighborhood of $x$ is uncountable. Now it is easy to see that $C$ is countable (from the Lindelöf property of separable metric spaces); it follows that $D$ is uncountable, and every neighborhood of a point $xin D$ contains uncountably many points of $D$.
$endgroup$
Since a subspace of a separable metric space is separable, we may as well assume that $S=X$. The answer is yes, any uncountable separable metric space $S$ contains an uncountable subset which is dense in itself. To see this write $S=Ccup D$ where $xin C$ if some neighborhood of $x$ is countable, $xin D$ if every neighborhood of $x$ is uncountable. Now it is easy to see that $C$ is countable (from the Lindelöf property of separable metric spaces); it follows that $D$ is uncountable, and every neighborhood of a point $xin D$ contains uncountably many points of $D$.
answered Jan 10 at 10:44
bofbof
51.6k558120
51.6k558120
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%2f3068481%2flet-s-be-an-uncountable-subset-of-a-separable-metric-space-x-d-then-can-we-fi%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