Partition of an infinite set into two infinite sets
$begingroup$
I wanted to try and prove this statement which looks seemingly true.
An infinite set $X$ can be partitioned in such a way that $X = X_1 cup X_2$ where $X_1$ and $X_2$ are infinite subsets of $X.$
Attempt :
case (i) If $X$ is countably infinite, then we can list the elements of $X$ as ${x_1,x_2,x_3,dots}.$ If we choose $X_1$ to be indexed by the odd natural numbers and $X_2$ to be indexed by the even natural numbers, we are done.
case (ii) If $X$ is uncountably infinite. Choose $X_1$ to be the countable infinite subset of $X.$ Then let $X_2 := X_1^mathsf{c}.$ This shall ensure that $X_2$ is uncountable. $spacespaceblacksquare$
But I think I'll have to be a bit clear for case (ii). How do I show that given an uncountable set $X,$ there always exists a countable infinite subset $X_1$ of $X.$
elementary-set-theory
$endgroup$
add a comment |
$begingroup$
I wanted to try and prove this statement which looks seemingly true.
An infinite set $X$ can be partitioned in such a way that $X = X_1 cup X_2$ where $X_1$ and $X_2$ are infinite subsets of $X.$
Attempt :
case (i) If $X$ is countably infinite, then we can list the elements of $X$ as ${x_1,x_2,x_3,dots}.$ If we choose $X_1$ to be indexed by the odd natural numbers and $X_2$ to be indexed by the even natural numbers, we are done.
case (ii) If $X$ is uncountably infinite. Choose $X_1$ to be the countable infinite subset of $X.$ Then let $X_2 := X_1^mathsf{c}.$ This shall ensure that $X_2$ is uncountable. $spacespaceblacksquare$
But I think I'll have to be a bit clear for case (ii). How do I show that given an uncountable set $X,$ there always exists a countable infinite subset $X_1$ of $X.$
elementary-set-theory
$endgroup$
1
$begingroup$
Every infinite set contains a countably infinite set (if we assume some axiom of choice). An uncountable set is in particular infinite. Also see this thread etc.
$endgroup$
– Henno Brandsma
Jan 20 at 10:47
add a comment |
$begingroup$
I wanted to try and prove this statement which looks seemingly true.
An infinite set $X$ can be partitioned in such a way that $X = X_1 cup X_2$ where $X_1$ and $X_2$ are infinite subsets of $X.$
Attempt :
case (i) If $X$ is countably infinite, then we can list the elements of $X$ as ${x_1,x_2,x_3,dots}.$ If we choose $X_1$ to be indexed by the odd natural numbers and $X_2$ to be indexed by the even natural numbers, we are done.
case (ii) If $X$ is uncountably infinite. Choose $X_1$ to be the countable infinite subset of $X.$ Then let $X_2 := X_1^mathsf{c}.$ This shall ensure that $X_2$ is uncountable. $spacespaceblacksquare$
But I think I'll have to be a bit clear for case (ii). How do I show that given an uncountable set $X,$ there always exists a countable infinite subset $X_1$ of $X.$
elementary-set-theory
$endgroup$
I wanted to try and prove this statement which looks seemingly true.
An infinite set $X$ can be partitioned in such a way that $X = X_1 cup X_2$ where $X_1$ and $X_2$ are infinite subsets of $X.$
Attempt :
case (i) If $X$ is countably infinite, then we can list the elements of $X$ as ${x_1,x_2,x_3,dots}.$ If we choose $X_1$ to be indexed by the odd natural numbers and $X_2$ to be indexed by the even natural numbers, we are done.
case (ii) If $X$ is uncountably infinite. Choose $X_1$ to be the countable infinite subset of $X.$ Then let $X_2 := X_1^mathsf{c}.$ This shall ensure that $X_2$ is uncountable. $spacespaceblacksquare$
But I think I'll have to be a bit clear for case (ii). How do I show that given an uncountable set $X,$ there always exists a countable infinite subset $X_1$ of $X.$
elementary-set-theory
elementary-set-theory
asked Jan 20 at 10:41
Bijesh K.SBijesh K.S
996824
996824
1
$begingroup$
Every infinite set contains a countably infinite set (if we assume some axiom of choice). An uncountable set is in particular infinite. Also see this thread etc.
$endgroup$
– Henno Brandsma
Jan 20 at 10:47
add a comment |
1
$begingroup$
Every infinite set contains a countably infinite set (if we assume some axiom of choice). An uncountable set is in particular infinite. Also see this thread etc.
$endgroup$
– Henno Brandsma
Jan 20 at 10:47
1
1
$begingroup$
Every infinite set contains a countably infinite set (if we assume some axiom of choice). An uncountable set is in particular infinite. Also see this thread etc.
$endgroup$
– Henno Brandsma
Jan 20 at 10:47
$begingroup$
Every infinite set contains a countably infinite set (if we assume some axiom of choice). An uncountable set is in particular infinite. Also see this thread etc.
$endgroup$
– Henno Brandsma
Jan 20 at 10:47
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Case 2. Well order X and take the first $omega_0$ elements.
Or recursively construct a denumerable set. Pick any element a$_1$ from X. Having picked S = { $a_1,.. a_n$ }, pick any
a$_{n+1}$ from uncountable X - S.
$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%2f3080414%2fpartition-of-an-infinite-set-into-two-infinite-sets%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$
Case 2. Well order X and take the first $omega_0$ elements.
Or recursively construct a denumerable set. Pick any element a$_1$ from X. Having picked S = { $a_1,.. a_n$ }, pick any
a$_{n+1}$ from uncountable X - S.
$endgroup$
add a comment |
$begingroup$
Case 2. Well order X and take the first $omega_0$ elements.
Or recursively construct a denumerable set. Pick any element a$_1$ from X. Having picked S = { $a_1,.. a_n$ }, pick any
a$_{n+1}$ from uncountable X - S.
$endgroup$
add a comment |
$begingroup$
Case 2. Well order X and take the first $omega_0$ elements.
Or recursively construct a denumerable set. Pick any element a$_1$ from X. Having picked S = { $a_1,.. a_n$ }, pick any
a$_{n+1}$ from uncountable X - S.
$endgroup$
Case 2. Well order X and take the first $omega_0$ elements.
Or recursively construct a denumerable set. Pick any element a$_1$ from X. Having picked S = { $a_1,.. a_n$ }, pick any
a$_{n+1}$ from uncountable X - S.
answered Jan 20 at 11:08
William ElliotWilliam Elliot
8,3822720
8,3822720
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%2f3080414%2fpartition-of-an-infinite-set-into-two-infinite-sets%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$
Every infinite set contains a countably infinite set (if we assume some axiom of choice). An uncountable set is in particular infinite. Also see this thread etc.
$endgroup$
– Henno Brandsma
Jan 20 at 10:47