Is every limit cardinal $alpha$ of the form $alpha=card(X)+card(P(X))+cardP(P(X))+…$, for some set $X$?
$begingroup$
A limit cardinal is a cardinal number $alpha$ such that if $beta<alpha,$ then there is a cardinal number $gamma$ with $beta<gamma<alpha.$
Now if $alpha$ is a limit cardinal then can we find a set $X$ which satisfies
$$alpha= card X + card P(X) + card P(P(X))+...?$$
set-theory
$endgroup$
add a comment |
$begingroup$
A limit cardinal is a cardinal number $alpha$ such that if $beta<alpha,$ then there is a cardinal number $gamma$ with $beta<gamma<alpha.$
Now if $alpha$ is a limit cardinal then can we find a set $X$ which satisfies
$$alpha= card X + card P(X) + card P(P(X))+...?$$
set-theory
$endgroup$
add a comment |
$begingroup$
A limit cardinal is a cardinal number $alpha$ such that if $beta<alpha,$ then there is a cardinal number $gamma$ with $beta<gamma<alpha.$
Now if $alpha$ is a limit cardinal then can we find a set $X$ which satisfies
$$alpha= card X + card P(X) + card P(P(X))+...?$$
set-theory
$endgroup$
A limit cardinal is a cardinal number $alpha$ such that if $beta<alpha,$ then there is a cardinal number $gamma$ with $beta<gamma<alpha.$
Now if $alpha$ is a limit cardinal then can we find a set $X$ which satisfies
$$alpha= card X + card P(X) + card P(P(X))+...?$$
set-theory
set-theory
asked Jan 3 at 6:52


aliali
38418
38418
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
No. An uncountable cardinal with that property is a strong limit cardinal of countable cofinality. An uncountable cardinal $a$ such that $forall b<a, (2^b<a)$ is called a strong limit cardinal.
GCH is consistent with ZFC (Kurt Godel, 1930's), and GCH implies that all limit cardinals are strong limits.
It is consistent with ZFC that $2^{omega}>omega_{omega}$ (Paul Cohen, 1960's) so it is consistent with ZFC that the limit cardinal $omega_{omega}$ is not a strong limit.
In ZFC the recursively-defined beth function maps the class $On$ of ordinals into the class of cardinal ordinals: $beth(0)=omega,$ and $beth(b+1)=2^{beth(b)}$ , and if $0ne b=cup b$ then $beth(b)=cup_{cin b}beth(c).$ Consider $beth (omega_1)=cup_{cin omega_1}beth(c),$ which is a strong limit cardinal of cofinality $omega_1.$
$endgroup$
add a comment |
$begingroup$
No. at least not without assuming GCH. Take $aleph_ω$ and look at the model of ZFC where $2^{aleph_0}=aleph_{ω+1}$.
Even assuming $GCH$, take $aleph_{ω_1}$, and assume that your proposition is true, you get that $mbox{cof}(aleph_{ω_1})=mbox{cof}(ω_1)=aleph_0$, which is false.
$endgroup$
$begingroup$
It seems $α=ω+ω$ is a limit ordinal but not a limit cardinal.
$endgroup$
– ali
Jan 3 at 7:07
$begingroup$
@ali sorry, I misread, edit it
$endgroup$
– Holo
Jan 3 at 7:11
$begingroup$
@ali it should be good now
$endgroup$
– Holo
Jan 3 at 7:20
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%2f3060315%2fis-every-limit-cardinal-alpha-of-the-form-alpha-cardxcardpxcardpp%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$
No. An uncountable cardinal with that property is a strong limit cardinal of countable cofinality. An uncountable cardinal $a$ such that $forall b<a, (2^b<a)$ is called a strong limit cardinal.
GCH is consistent with ZFC (Kurt Godel, 1930's), and GCH implies that all limit cardinals are strong limits.
It is consistent with ZFC that $2^{omega}>omega_{omega}$ (Paul Cohen, 1960's) so it is consistent with ZFC that the limit cardinal $omega_{omega}$ is not a strong limit.
In ZFC the recursively-defined beth function maps the class $On$ of ordinals into the class of cardinal ordinals: $beth(0)=omega,$ and $beth(b+1)=2^{beth(b)}$ , and if $0ne b=cup b$ then $beth(b)=cup_{cin b}beth(c).$ Consider $beth (omega_1)=cup_{cin omega_1}beth(c),$ which is a strong limit cardinal of cofinality $omega_1.$
$endgroup$
add a comment |
$begingroup$
No. An uncountable cardinal with that property is a strong limit cardinal of countable cofinality. An uncountable cardinal $a$ such that $forall b<a, (2^b<a)$ is called a strong limit cardinal.
GCH is consistent with ZFC (Kurt Godel, 1930's), and GCH implies that all limit cardinals are strong limits.
It is consistent with ZFC that $2^{omega}>omega_{omega}$ (Paul Cohen, 1960's) so it is consistent with ZFC that the limit cardinal $omega_{omega}$ is not a strong limit.
In ZFC the recursively-defined beth function maps the class $On$ of ordinals into the class of cardinal ordinals: $beth(0)=omega,$ and $beth(b+1)=2^{beth(b)}$ , and if $0ne b=cup b$ then $beth(b)=cup_{cin b}beth(c).$ Consider $beth (omega_1)=cup_{cin omega_1}beth(c),$ which is a strong limit cardinal of cofinality $omega_1.$
$endgroup$
add a comment |
$begingroup$
No. An uncountable cardinal with that property is a strong limit cardinal of countable cofinality. An uncountable cardinal $a$ such that $forall b<a, (2^b<a)$ is called a strong limit cardinal.
GCH is consistent with ZFC (Kurt Godel, 1930's), and GCH implies that all limit cardinals are strong limits.
It is consistent with ZFC that $2^{omega}>omega_{omega}$ (Paul Cohen, 1960's) so it is consistent with ZFC that the limit cardinal $omega_{omega}$ is not a strong limit.
In ZFC the recursively-defined beth function maps the class $On$ of ordinals into the class of cardinal ordinals: $beth(0)=omega,$ and $beth(b+1)=2^{beth(b)}$ , and if $0ne b=cup b$ then $beth(b)=cup_{cin b}beth(c).$ Consider $beth (omega_1)=cup_{cin omega_1}beth(c),$ which is a strong limit cardinal of cofinality $omega_1.$
$endgroup$
No. An uncountable cardinal with that property is a strong limit cardinal of countable cofinality. An uncountable cardinal $a$ such that $forall b<a, (2^b<a)$ is called a strong limit cardinal.
GCH is consistent with ZFC (Kurt Godel, 1930's), and GCH implies that all limit cardinals are strong limits.
It is consistent with ZFC that $2^{omega}>omega_{omega}$ (Paul Cohen, 1960's) so it is consistent with ZFC that the limit cardinal $omega_{omega}$ is not a strong limit.
In ZFC the recursively-defined beth function maps the class $On$ of ordinals into the class of cardinal ordinals: $beth(0)=omega,$ and $beth(b+1)=2^{beth(b)}$ , and if $0ne b=cup b$ then $beth(b)=cup_{cin b}beth(c).$ Consider $beth (omega_1)=cup_{cin omega_1}beth(c),$ which is a strong limit cardinal of cofinality $omega_1.$
answered Jan 3 at 7:48
DanielWainfleetDanielWainfleet
34.6k31648
34.6k31648
add a comment |
add a comment |
$begingroup$
No. at least not without assuming GCH. Take $aleph_ω$ and look at the model of ZFC where $2^{aleph_0}=aleph_{ω+1}$.
Even assuming $GCH$, take $aleph_{ω_1}$, and assume that your proposition is true, you get that $mbox{cof}(aleph_{ω_1})=mbox{cof}(ω_1)=aleph_0$, which is false.
$endgroup$
$begingroup$
It seems $α=ω+ω$ is a limit ordinal but not a limit cardinal.
$endgroup$
– ali
Jan 3 at 7:07
$begingroup$
@ali sorry, I misread, edit it
$endgroup$
– Holo
Jan 3 at 7:11
$begingroup$
@ali it should be good now
$endgroup$
– Holo
Jan 3 at 7:20
add a comment |
$begingroup$
No. at least not without assuming GCH. Take $aleph_ω$ and look at the model of ZFC where $2^{aleph_0}=aleph_{ω+1}$.
Even assuming $GCH$, take $aleph_{ω_1}$, and assume that your proposition is true, you get that $mbox{cof}(aleph_{ω_1})=mbox{cof}(ω_1)=aleph_0$, which is false.
$endgroup$
$begingroup$
It seems $α=ω+ω$ is a limit ordinal but not a limit cardinal.
$endgroup$
– ali
Jan 3 at 7:07
$begingroup$
@ali sorry, I misread, edit it
$endgroup$
– Holo
Jan 3 at 7:11
$begingroup$
@ali it should be good now
$endgroup$
– Holo
Jan 3 at 7:20
add a comment |
$begingroup$
No. at least not without assuming GCH. Take $aleph_ω$ and look at the model of ZFC where $2^{aleph_0}=aleph_{ω+1}$.
Even assuming $GCH$, take $aleph_{ω_1}$, and assume that your proposition is true, you get that $mbox{cof}(aleph_{ω_1})=mbox{cof}(ω_1)=aleph_0$, which is false.
$endgroup$
No. at least not without assuming GCH. Take $aleph_ω$ and look at the model of ZFC where $2^{aleph_0}=aleph_{ω+1}$.
Even assuming $GCH$, take $aleph_{ω_1}$, and assume that your proposition is true, you get that $mbox{cof}(aleph_{ω_1})=mbox{cof}(ω_1)=aleph_0$, which is false.
edited Jan 3 at 7:16
answered Jan 3 at 6:58


HoloHolo
5,60321030
5,60321030
$begingroup$
It seems $α=ω+ω$ is a limit ordinal but not a limit cardinal.
$endgroup$
– ali
Jan 3 at 7:07
$begingroup$
@ali sorry, I misread, edit it
$endgroup$
– Holo
Jan 3 at 7:11
$begingroup$
@ali it should be good now
$endgroup$
– Holo
Jan 3 at 7:20
add a comment |
$begingroup$
It seems $α=ω+ω$ is a limit ordinal but not a limit cardinal.
$endgroup$
– ali
Jan 3 at 7:07
$begingroup$
@ali sorry, I misread, edit it
$endgroup$
– Holo
Jan 3 at 7:11
$begingroup$
@ali it should be good now
$endgroup$
– Holo
Jan 3 at 7:20
$begingroup$
It seems $α=ω+ω$ is a limit ordinal but not a limit cardinal.
$endgroup$
– ali
Jan 3 at 7:07
$begingroup$
It seems $α=ω+ω$ is a limit ordinal but not a limit cardinal.
$endgroup$
– ali
Jan 3 at 7:07
$begingroup$
@ali sorry, I misread, edit it
$endgroup$
– Holo
Jan 3 at 7:11
$begingroup$
@ali sorry, I misread, edit it
$endgroup$
– Holo
Jan 3 at 7:11
$begingroup$
@ali it should be good now
$endgroup$
– Holo
Jan 3 at 7:20
$begingroup$
@ali it should be good now
$endgroup$
– Holo
Jan 3 at 7:20
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%2f3060315%2fis-every-limit-cardinal-alpha-of-the-form-alpha-cardxcardpxcardpp%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