Suppose $kappa$ is a cardinal, such that $2 kappa = kappa$. Can it be proven that $kappa ! = 2^kappa$ without...
up vote
1
down vote
favorite
The original question is given in an exercise. The first part of the problem is to show that if $left|Aright| = left|Aright| +left|Aright|$ for some set $A$, then there exists a partition of $A$, with every cell in the partition having cardinality $2$ (i.e. a partition of $A$ into pairs). The second part of the problem is to show that the cardinality of the set of permutations of $A$ is $2^{left|Aright|}$.
Using the first part of the problem, it's not hard to show that that cardinality of set of permutations of $A$ is bounded between $2^{left|Aright|}$ and $left|Aright|^{left|Aright|}$. But I couldn't find a way to proceed from here without assuming that $left|Aright| = left|Aright|cdotleft|Aright|$.
Is it possible to complete the proof without choice?
elementary-set-theory cardinals
asked 6 hours ago
j3M
594416
add a comment |
up vote
1
down vote
favorite
The original question is given in an exercise. The first part of the problem is to show that if $left|Aright| = left|Aright| +left|Aright|$ for some set $A$, then there exists a partition of $A$, with every cell in the partition having cardinality $2$ (i.e. a partition of $A$ into pairs). The second part of the problem is to show that the cardinality of the set of permutations of $A$ is $2^{left|Aright|}$.
Using the first part of the problem, it's not hard to show that that cardinality of set of permutations of $A$ is bounded between $2^{left|Aright|}$ and $left|Aright|^{left|Aright|}$. But I couldn't find a way to proceed from here without assuming that $left|Aright| = left|Aright|cdotleft|Aright|$.
Is it possible to complete the proof without choice?
elementary-set-theory cardinals
asked 6 hours ago
j3M
594416
Is that an exercise in a book?
– bof
5 hours ago
@bof No, it's from an exercise sheet given in a course. The exercise doesn't ask to avoid choice explicitly, but I thought it is implicit because the only assumption is that $left|Aright| + left|Aright| = left|Aright|$, and because the next problem goes "In the previous problem we saw that $left|Aright|+left|Aright|=left|Aright|$ implies that $A$ can be partitioned to pairs. What partition can we find if $left|Aright|cdotleft|Aright|=left|Aright|$?".
– j3M
4 hours ago
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
The original question is given in an exercise. The first part of the problem is to show that if $left|Aright| = left|Aright| +left|Aright|$ for some set $A$, then there exists a partition of $A$, with every cell in the partition having cardinality $2$ (i.e. a partition of $A$ into pairs). The second part of the problem is to show that the cardinality of the set of permutations of $A$ is $2^{left|Aright|}$.
Using the first part of the problem, it's not hard to show that that cardinality of set of permutations of $A$ is bounded between $2^{left|Aright|}$ and $left|Aright|^{left|Aright|}$. But I couldn't find a way to proceed from here without assuming that $left|Aright| = left|Aright|cdotleft|Aright|$.
Is it possible to complete the proof without choice?
elementary-set-theory cardinals
asked 6 hours ago
j3M
594416
The original question is given in an exercise. The first part of the problem is to show that if $left|Aright| = left|Aright| +left|Aright|$ for some set $A$, then there exists a partition of $A$, with every cell in the partition having cardinality $2$ (i.e. a partition of $A$ into pairs). The second part of the problem is to show that the cardinality of the set of permutations of $A$ is $2^{left|Aright|}$.
Using the first part of the problem, it's not hard to show that that cardinality of set of permutations of $A$ is bounded between $2^{left|Aright|}$ and $left|Aright|^{left|Aright|}$. But I couldn't find a way to proceed from here without assuming that $left|Aright| = left|Aright|cdotleft|Aright|$.
Is it possible to complete the proof without choice?
elementary-set-theory cardinals
elementary-set-theory cardinals
asked 6 hours ago
j3M
594416
asked 6 hours ago
j3M
594416
asked 6 hours ago
j3M
594416
asked 6 hours ago
j3M
594416
asked 6 hours ago
j3M
594416
594416
Is that an exercise in a book?
– bof
5 hours ago
@bof No, it's from an exercise sheet given in a course. The exercise doesn't ask to avoid choice explicitly, but I thought it is implicit because the only assumption is that $left|Aright| + left|Aright| = left|Aright|$, and because the next problem goes "In the previous problem we saw that $left|Aright|+left|Aright|=left|Aright|$ implies that $A$ can be partitioned to pairs. What partition can we find if $left|Aright|cdotleft|Aright|=left|Aright|$?".
– j3M
4 hours ago
add a comment |
Is that an exercise in a book?
– bof
5 hours ago
@bof No, it's from an exercise sheet given in a course. The exercise doesn't ask to avoid choice explicitly, but I thought it is implicit because the only assumption is that $left|Aright| + left|Aright| = left|Aright|$, and because the next problem goes "In the previous problem we saw that $left|Aright|+left|Aright|=left|Aright|$ implies that $A$ can be partitioned to pairs. What partition can we find if $left|Aright|cdotleft|Aright|=left|Aright|$?".
– j3M
4 hours ago
Is that an exercise in a book?
– bof
5 hours ago
Is that an exercise in a book?
– bof
5 hours ago
@bof No, it's from an exercise sheet given in a course. The exercise doesn't ask to avoid choice explicitly, but I thought it is implicit because the only assumption is that $left|Aright| + left|Aright| = left|Aright|$, and because the next problem goes "In the previous problem we saw that $left|Aright|+left|Aright|=left|Aright|$ implies that $A$ can be partitioned to pairs. What partition can we find if $left|Aright|cdotleft|Aright|=left|Aright|$?".
– j3M
4 hours ago
@bof No, it's from an exercise sheet given in a course. The exercise doesn't ask to avoid choice explicitly, but I thought it is implicit because the only assumption is that $left|Aright| + left|Aright| = left|Aright|$, and because the next problem goes "In the previous problem we saw that $left|Aright|+left|Aright|=left|Aright|$ implies that $A$ can be partitioned to pairs. What partition can we find if $left|Aright|cdotleft|Aright|=left|Aright|$?".
– j3M
4 hours ago
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f2999453%2fsuppose-kappa-is-a-cardinal-such-that-2-kappa-kappa-can-it-be-proven%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
Is that an exercise in a book?
– bof
5 hours ago
@bof No, it's from an exercise sheet given in a course. The exercise doesn't ask to avoid choice explicitly, but I thought it is implicit because the only assumption is that $left|Aright| + left|Aright| = left|Aright|$, and because the next problem goes "In the previous problem we saw that $left|Aright|+left|Aright|=left|Aright|$ implies that $A$ can be partitioned to pairs. What partition can we find if $left|Aright|cdotleft|Aright|=left|Aright|$?".
– j3M
4 hours ago