What set theory axioms do I need to believe in uncountable ordinals?
$begingroup$
Math people:
The title is the question. I am convinced that uncountable sets exist, thanks to Cantor's diagonal proof. It is not intuitively clear to me that uncountable ordinals or cardinals should exist. What axioms of set theory are needed to accept their existence? I think I have read here that the Axiom of Choice is not necessary. I am reluctant to accept as "true" any theorems that rely on the Axiom of Choice.
EDIT: This question may be a duplicate: I just found No uncountable ordinals without the axiom of choice? . I apologize if this is so.
set-theory ordinals axioms
$endgroup$
|
show 2 more comments
$begingroup$
Math people:
The title is the question. I am convinced that uncountable sets exist, thanks to Cantor's diagonal proof. It is not intuitively clear to me that uncountable ordinals or cardinals should exist. What axioms of set theory are needed to accept their existence? I think I have read here that the Axiom of Choice is not necessary. I am reluctant to accept as "true" any theorems that rely on the Axiom of Choice.
EDIT: This question may be a duplicate: I just found No uncountable ordinals without the axiom of choice? . I apologize if this is so.
set-theory ordinals axioms
$endgroup$
1
$begingroup$
It at least partly answers the question: $mathsf{ZF}$ is sufficient, since it’s sufficient for the Hartogs’ number argument, but $mathsf{ZF}$ minus the power set axiom is not.
$endgroup$
– Brian M. Scott
May 26 '13 at 1:33
$begingroup$
Duplicate of: this, and that, and also this, and of course the one linked in the question
$endgroup$
– Asaf Karagila♦
May 26 '13 at 1:39
$begingroup$
After giving more thought, I'm not sure if that's a complete duplicate of the above links (and I'd withdraw my vote to close if that was possible). This question can be read as a broader question than just the axiom of choice. True, it was particularly interested in the axiom of choice, but there are other axioms in $sf ZFC$ that may or may not be used in that proof. Hence my answer below.
$endgroup$
– Asaf Karagila♦
May 26 '13 at 1:55
$begingroup$
What's the difference between the smallest uncountable ordinal, and a smallest uncountable ordinal? Those are the same. You don't need choice. There is a question I have answered on this site which describes the axioms of ZFC. I am writing from my phone right now, I'll find it when I wake up in a couple of hours.
$endgroup$
– Asaf Karagila♦
May 26 '13 at 2:05
$begingroup$
If there are uncoutnable ordinals, then there is a least uncountable ordinal. Courtesy of being well-ordered!
$endgroup$
– Asaf Karagila♦
May 26 '13 at 2:13
|
show 2 more comments
$begingroup$
Math people:
The title is the question. I am convinced that uncountable sets exist, thanks to Cantor's diagonal proof. It is not intuitively clear to me that uncountable ordinals or cardinals should exist. What axioms of set theory are needed to accept their existence? I think I have read here that the Axiom of Choice is not necessary. I am reluctant to accept as "true" any theorems that rely on the Axiom of Choice.
EDIT: This question may be a duplicate: I just found No uncountable ordinals without the axiom of choice? . I apologize if this is so.
set-theory ordinals axioms
$endgroup$
Math people:
The title is the question. I am convinced that uncountable sets exist, thanks to Cantor's diagonal proof. It is not intuitively clear to me that uncountable ordinals or cardinals should exist. What axioms of set theory are needed to accept their existence? I think I have read here that the Axiom of Choice is not necessary. I am reluctant to accept as "true" any theorems that rely on the Axiom of Choice.
EDIT: This question may be a duplicate: I just found No uncountable ordinals without the axiom of choice? . I apologize if this is so.
set-theory ordinals axioms
set-theory ordinals axioms
edited Apr 13 '17 at 12:21
Community♦
1
1
asked May 26 '13 at 1:20
Stefan SmithStefan Smith
5,0982250
5,0982250
1
$begingroup$
It at least partly answers the question: $mathsf{ZF}$ is sufficient, since it’s sufficient for the Hartogs’ number argument, but $mathsf{ZF}$ minus the power set axiom is not.
$endgroup$
– Brian M. Scott
May 26 '13 at 1:33
$begingroup$
Duplicate of: this, and that, and also this, and of course the one linked in the question
$endgroup$
– Asaf Karagila♦
May 26 '13 at 1:39
$begingroup$
After giving more thought, I'm not sure if that's a complete duplicate of the above links (and I'd withdraw my vote to close if that was possible). This question can be read as a broader question than just the axiom of choice. True, it was particularly interested in the axiom of choice, but there are other axioms in $sf ZFC$ that may or may not be used in that proof. Hence my answer below.
$endgroup$
– Asaf Karagila♦
May 26 '13 at 1:55
$begingroup$
What's the difference between the smallest uncountable ordinal, and a smallest uncountable ordinal? Those are the same. You don't need choice. There is a question I have answered on this site which describes the axioms of ZFC. I am writing from my phone right now, I'll find it when I wake up in a couple of hours.
$endgroup$
– Asaf Karagila♦
May 26 '13 at 2:05
$begingroup$
If there are uncoutnable ordinals, then there is a least uncountable ordinal. Courtesy of being well-ordered!
$endgroup$
– Asaf Karagila♦
May 26 '13 at 2:13
|
show 2 more comments
1
$begingroup$
It at least partly answers the question: $mathsf{ZF}$ is sufficient, since it’s sufficient for the Hartogs’ number argument, but $mathsf{ZF}$ minus the power set axiom is not.
$endgroup$
– Brian M. Scott
May 26 '13 at 1:33
$begingroup$
Duplicate of: this, and that, and also this, and of course the one linked in the question
$endgroup$
– Asaf Karagila♦
May 26 '13 at 1:39
$begingroup$
After giving more thought, I'm not sure if that's a complete duplicate of the above links (and I'd withdraw my vote to close if that was possible). This question can be read as a broader question than just the axiom of choice. True, it was particularly interested in the axiom of choice, but there are other axioms in $sf ZFC$ that may or may not be used in that proof. Hence my answer below.
$endgroup$
– Asaf Karagila♦
May 26 '13 at 1:55
$begingroup$
What's the difference between the smallest uncountable ordinal, and a smallest uncountable ordinal? Those are the same. You don't need choice. There is a question I have answered on this site which describes the axioms of ZFC. I am writing from my phone right now, I'll find it when I wake up in a couple of hours.
$endgroup$
– Asaf Karagila♦
May 26 '13 at 2:05
$begingroup$
If there are uncoutnable ordinals, then there is a least uncountable ordinal. Courtesy of being well-ordered!
$endgroup$
– Asaf Karagila♦
May 26 '13 at 2:13
1
1
$begingroup$
It at least partly answers the question: $mathsf{ZF}$ is sufficient, since it’s sufficient for the Hartogs’ number argument, but $mathsf{ZF}$ minus the power set axiom is not.
$endgroup$
– Brian M. Scott
May 26 '13 at 1:33
$begingroup$
It at least partly answers the question: $mathsf{ZF}$ is sufficient, since it’s sufficient for the Hartogs’ number argument, but $mathsf{ZF}$ minus the power set axiom is not.
$endgroup$
– Brian M. Scott
May 26 '13 at 1:33
$begingroup$
Duplicate of: this, and that, and also this, and of course the one linked in the question
$endgroup$
– Asaf Karagila♦
May 26 '13 at 1:39
$begingroup$
Duplicate of: this, and that, and also this, and of course the one linked in the question
$endgroup$
– Asaf Karagila♦
May 26 '13 at 1:39
$begingroup$
After giving more thought, I'm not sure if that's a complete duplicate of the above links (and I'd withdraw my vote to close if that was possible). This question can be read as a broader question than just the axiom of choice. True, it was particularly interested in the axiom of choice, but there are other axioms in $sf ZFC$ that may or may not be used in that proof. Hence my answer below.
$endgroup$
– Asaf Karagila♦
May 26 '13 at 1:55
$begingroup$
After giving more thought, I'm not sure if that's a complete duplicate of the above links (and I'd withdraw my vote to close if that was possible). This question can be read as a broader question than just the axiom of choice. True, it was particularly interested in the axiom of choice, but there are other axioms in $sf ZFC$ that may or may not be used in that proof. Hence my answer below.
$endgroup$
– Asaf Karagila♦
May 26 '13 at 1:55
$begingroup$
What's the difference between the smallest uncountable ordinal, and a smallest uncountable ordinal? Those are the same. You don't need choice. There is a question I have answered on this site which describes the axioms of ZFC. I am writing from my phone right now, I'll find it when I wake up in a couple of hours.
$endgroup$
– Asaf Karagila♦
May 26 '13 at 2:05
$begingroup$
What's the difference between the smallest uncountable ordinal, and a smallest uncountable ordinal? Those are the same. You don't need choice. There is a question I have answered on this site which describes the axioms of ZFC. I am writing from my phone right now, I'll find it when I wake up in a couple of hours.
$endgroup$
– Asaf Karagila♦
May 26 '13 at 2:05
$begingroup$
If there are uncoutnable ordinals, then there is a least uncountable ordinal. Courtesy of being well-ordered!
$endgroup$
– Asaf Karagila♦
May 26 '13 at 2:13
$begingroup$
If there are uncoutnable ordinals, then there is a least uncountable ordinal. Courtesy of being well-ordered!
$endgroup$
– Asaf Karagila♦
May 26 '13 at 2:13
|
show 2 more comments
1 Answer
1
active
oldest
votes
$begingroup$
As [1], [2], [3], and [4] may tell you, the axiom of choice is not needed to define $omega_1$ (in particular [1] and [4]).
Two key axioms are the power set axiom and the replacement axiom schema. In [2] and [3] you can see why the axiom of power set is needed. It is consistent with $sf ZF$ without the power set axiom that there are only countable ordinals. In particular the set of hereditarily countable sets satisfies that. In fact, it shows that without the power set axiom we cannot prove the existence of any uncountable sets.
But the replacement schema is also essential. We use it in order to map a certain subset of $mathcal P(omegatimesomega)$ onto ordinals, and we need the replacement schema to show that the result is a set. Indeed if we consider $sf ZF$ without the replacement schema, then $V_{omega+omega}$ is a model of these axioms, and there are only countable ordinals in that model. It should be remarked that there may still be well-ordered of length $omega_1$ in $V_{omega+omega}$ but the von Neumann ordinal, a transitive set ordered by $in$ does not exist there. That is to say, it is consistent that the axiom of choice holds, and every set can be well-ordered, but the von Neumann ordinals don't exist beyond $omega+omega$. In such model we separate between ordinals as we think about today (von Neumann's definition), and as equivalence classes of order types (which are proper classes, of course).
Of course one uses the axiom of union all the time, as well extensionality. It should be remarked that regularity is not necessarily because we can always limit ourselves to the part of the well-founded sets, where it holds, at least if we have replacement.
The Links:
- How do we know an $ aleph_1 $ exists at all?
- Uncountable ordinals without power set axiom
- Does the definition of countable ordinals require the power set axiom?
- No uncountable ordinals without the axiom of choice?
$endgroup$
add a comment |
Your Answer
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%2f402493%2fwhat-set-theory-axioms-do-i-need-to-believe-in-uncountable-ordinals%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$
As [1], [2], [3], and [4] may tell you, the axiom of choice is not needed to define $omega_1$ (in particular [1] and [4]).
Two key axioms are the power set axiom and the replacement axiom schema. In [2] and [3] you can see why the axiom of power set is needed. It is consistent with $sf ZF$ without the power set axiom that there are only countable ordinals. In particular the set of hereditarily countable sets satisfies that. In fact, it shows that without the power set axiom we cannot prove the existence of any uncountable sets.
But the replacement schema is also essential. We use it in order to map a certain subset of $mathcal P(omegatimesomega)$ onto ordinals, and we need the replacement schema to show that the result is a set. Indeed if we consider $sf ZF$ without the replacement schema, then $V_{omega+omega}$ is a model of these axioms, and there are only countable ordinals in that model. It should be remarked that there may still be well-ordered of length $omega_1$ in $V_{omega+omega}$ but the von Neumann ordinal, a transitive set ordered by $in$ does not exist there. That is to say, it is consistent that the axiom of choice holds, and every set can be well-ordered, but the von Neumann ordinals don't exist beyond $omega+omega$. In such model we separate between ordinals as we think about today (von Neumann's definition), and as equivalence classes of order types (which are proper classes, of course).
Of course one uses the axiom of union all the time, as well extensionality. It should be remarked that regularity is not necessarily because we can always limit ourselves to the part of the well-founded sets, where it holds, at least if we have replacement.
The Links:
- How do we know an $ aleph_1 $ exists at all?
- Uncountable ordinals without power set axiom
- Does the definition of countable ordinals require the power set axiom?
- No uncountable ordinals without the axiom of choice?
$endgroup$
add a comment |
$begingroup$
As [1], [2], [3], and [4] may tell you, the axiom of choice is not needed to define $omega_1$ (in particular [1] and [4]).
Two key axioms are the power set axiom and the replacement axiom schema. In [2] and [3] you can see why the axiom of power set is needed. It is consistent with $sf ZF$ without the power set axiom that there are only countable ordinals. In particular the set of hereditarily countable sets satisfies that. In fact, it shows that without the power set axiom we cannot prove the existence of any uncountable sets.
But the replacement schema is also essential. We use it in order to map a certain subset of $mathcal P(omegatimesomega)$ onto ordinals, and we need the replacement schema to show that the result is a set. Indeed if we consider $sf ZF$ without the replacement schema, then $V_{omega+omega}$ is a model of these axioms, and there are only countable ordinals in that model. It should be remarked that there may still be well-ordered of length $omega_1$ in $V_{omega+omega}$ but the von Neumann ordinal, a transitive set ordered by $in$ does not exist there. That is to say, it is consistent that the axiom of choice holds, and every set can be well-ordered, but the von Neumann ordinals don't exist beyond $omega+omega$. In such model we separate between ordinals as we think about today (von Neumann's definition), and as equivalence classes of order types (which are proper classes, of course).
Of course one uses the axiom of union all the time, as well extensionality. It should be remarked that regularity is not necessarily because we can always limit ourselves to the part of the well-founded sets, where it holds, at least if we have replacement.
The Links:
- How do we know an $ aleph_1 $ exists at all?
- Uncountable ordinals without power set axiom
- Does the definition of countable ordinals require the power set axiom?
- No uncountable ordinals without the axiom of choice?
$endgroup$
add a comment |
$begingroup$
As [1], [2], [3], and [4] may tell you, the axiom of choice is not needed to define $omega_1$ (in particular [1] and [4]).
Two key axioms are the power set axiom and the replacement axiom schema. In [2] and [3] you can see why the axiom of power set is needed. It is consistent with $sf ZF$ without the power set axiom that there are only countable ordinals. In particular the set of hereditarily countable sets satisfies that. In fact, it shows that without the power set axiom we cannot prove the existence of any uncountable sets.
But the replacement schema is also essential. We use it in order to map a certain subset of $mathcal P(omegatimesomega)$ onto ordinals, and we need the replacement schema to show that the result is a set. Indeed if we consider $sf ZF$ without the replacement schema, then $V_{omega+omega}$ is a model of these axioms, and there are only countable ordinals in that model. It should be remarked that there may still be well-ordered of length $omega_1$ in $V_{omega+omega}$ but the von Neumann ordinal, a transitive set ordered by $in$ does not exist there. That is to say, it is consistent that the axiom of choice holds, and every set can be well-ordered, but the von Neumann ordinals don't exist beyond $omega+omega$. In such model we separate between ordinals as we think about today (von Neumann's definition), and as equivalence classes of order types (which are proper classes, of course).
Of course one uses the axiom of union all the time, as well extensionality. It should be remarked that regularity is not necessarily because we can always limit ourselves to the part of the well-founded sets, where it holds, at least if we have replacement.
The Links:
- How do we know an $ aleph_1 $ exists at all?
- Uncountable ordinals without power set axiom
- Does the definition of countable ordinals require the power set axiom?
- No uncountable ordinals without the axiom of choice?
$endgroup$
As [1], [2], [3], and [4] may tell you, the axiom of choice is not needed to define $omega_1$ (in particular [1] and [4]).
Two key axioms are the power set axiom and the replacement axiom schema. In [2] and [3] you can see why the axiom of power set is needed. It is consistent with $sf ZF$ without the power set axiom that there are only countable ordinals. In particular the set of hereditarily countable sets satisfies that. In fact, it shows that without the power set axiom we cannot prove the existence of any uncountable sets.
But the replacement schema is also essential. We use it in order to map a certain subset of $mathcal P(omegatimesomega)$ onto ordinals, and we need the replacement schema to show that the result is a set. Indeed if we consider $sf ZF$ without the replacement schema, then $V_{omega+omega}$ is a model of these axioms, and there are only countable ordinals in that model. It should be remarked that there may still be well-ordered of length $omega_1$ in $V_{omega+omega}$ but the von Neumann ordinal, a transitive set ordered by $in$ does not exist there. That is to say, it is consistent that the axiom of choice holds, and every set can be well-ordered, but the von Neumann ordinals don't exist beyond $omega+omega$. In such model we separate between ordinals as we think about today (von Neumann's definition), and as equivalence classes of order types (which are proper classes, of course).
Of course one uses the axiom of union all the time, as well extensionality. It should be remarked that regularity is not necessarily because we can always limit ourselves to the part of the well-founded sets, where it holds, at least if we have replacement.
The Links:
- How do we know an $ aleph_1 $ exists at all?
- Uncountable ordinals without power set axiom
- Does the definition of countable ordinals require the power set axiom?
- No uncountable ordinals without the axiom of choice?
edited Apr 13 '17 at 12:20
Community♦
1
1
answered May 26 '13 at 1:50
Asaf Karagila♦Asaf Karagila
308k33441775
308k33441775
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%2f402493%2fwhat-set-theory-axioms-do-i-need-to-believe-in-uncountable-ordinals%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$
It at least partly answers the question: $mathsf{ZF}$ is sufficient, since it’s sufficient for the Hartogs’ number argument, but $mathsf{ZF}$ minus the power set axiom is not.
$endgroup$
– Brian M. Scott
May 26 '13 at 1:33
$begingroup$
Duplicate of: this, and that, and also this, and of course the one linked in the question
$endgroup$
– Asaf Karagila♦
May 26 '13 at 1:39
$begingroup$
After giving more thought, I'm not sure if that's a complete duplicate of the above links (and I'd withdraw my vote to close if that was possible). This question can be read as a broader question than just the axiom of choice. True, it was particularly interested in the axiom of choice, but there are other axioms in $sf ZFC$ that may or may not be used in that proof. Hence my answer below.
$endgroup$
– Asaf Karagila♦
May 26 '13 at 1:55
$begingroup$
What's the difference between the smallest uncountable ordinal, and a smallest uncountable ordinal? Those are the same. You don't need choice. There is a question I have answered on this site which describes the axioms of ZFC. I am writing from my phone right now, I'll find it when I wake up in a couple of hours.
$endgroup$
– Asaf Karagila♦
May 26 '13 at 2:05
$begingroup$
If there are uncoutnable ordinals, then there is a least uncountable ordinal. Courtesy of being well-ordered!
$endgroup$
– Asaf Karagila♦
May 26 '13 at 2:13