Why is ${f,|,fcolon Atomathbb N}$ not uncountable?
$begingroup$
Let $S={,f,|,fcolon Atomathbb N}$, where $A={1,2}$.
I thought cardinality of $S$ is $2^{|mathbb N|}=aleph_0$. But my friend told that my answer was wrong.
Please help me where is I am wrong.
elementary-set-theory cardinals
edited Dec 8 '18 at 12:56
Asaf Karagila♦
304k32432763
asked Dec 8 '18 at 11:07
MathLoverMathLover
52510
$endgroup$
add a comment |
$begingroup$
Let $S={,f,|,fcolon Atomathbb N}$, where $A={1,2}$.
I thought cardinality of $S$ is $2^{|mathbb N|}=aleph_0$. But my friend told that my answer was wrong.
Please help me where is I am wrong.
elementary-set-theory cardinals
edited Dec 8 '18 at 12:56
Asaf Karagila♦
304k32432763
asked Dec 8 '18 at 11:07
MathLoverMathLover
52510
$endgroup$
$begingroup$
Why do you think the cardinality of $S$ would be $2^{|mathbb N|}$?
$endgroup$
– Henrik
Dec 8 '18 at 11:18
$begingroup$
Because for any function to defined every point has 2 choices so there are 2^|N|.I thought
$endgroup$
– MathLover
Dec 8 '18 at 11:19
$begingroup$
Note that the set $S = { f$ a function$ : f:mathbb{N}to{1,2}}$ is uncountable. To see why, think about $mathcal{P}(mathbb{N})$ and $f^{-1}(1)$ for $fin S$.
$endgroup$
– Santana Afton
Dec 8 '18 at 12:47
$begingroup$
You could just list down all the functions in your set and see what the answer is.
$endgroup$
– Andrés E. Caicedo
Dec 8 '18 at 14:02
add a comment |
$begingroup$
Let $S={,f,|,fcolon Atomathbb N}$, where $A={1,2}$.
I thought cardinality of $S$ is $2^{|mathbb N|}=aleph_0$. But my friend told that my answer was wrong.
Please help me where is I am wrong.
elementary-set-theory cardinals
edited Dec 8 '18 at 12:56
Asaf Karagila♦
304k32432763
asked Dec 8 '18 at 11:07
MathLoverMathLover
52510
$endgroup$
Let $S={,f,|,fcolon Atomathbb N}$, where $A={1,2}$.
I thought cardinality of $S$ is $2^{|mathbb N|}=aleph_0$. But my friend told that my answer was wrong.
Please help me where is I am wrong.
elementary-set-theory cardinals
elementary-set-theory cardinals
edited Dec 8 '18 at 12:56
Asaf Karagila♦
304k32432763
asked Dec 8 '18 at 11:07
MathLoverMathLover
52510
edited Dec 8 '18 at 12:56
Asaf Karagila♦
304k32432763
asked Dec 8 '18 at 11:07
MathLoverMathLover
52510
edited Dec 8 '18 at 12:56
Asaf Karagila♦
304k32432763
edited Dec 8 '18 at 12:56
Asaf Karagila♦
304k32432763
edited Dec 8 '18 at 12:56
Asaf Karagila♦
304k32432763
304k32432763
asked Dec 8 '18 at 11:07
MathLoverMathLover
52510
asked Dec 8 '18 at 11:07
MathLoverMathLover
52510
asked Dec 8 '18 at 11:07
MathLoverMathLover
52510
52510
$begingroup$
Why do you think the cardinality of $S$ would be $2^{|mathbb N|}$?
$endgroup$
– Henrik
Dec 8 '18 at 11:18
$begingroup$
Because for any function to defined every point has 2 choices so there are 2^|N|.I thought
$endgroup$
– MathLover
Dec 8 '18 at 11:19
$begingroup$
Note that the set $S = { f$ a function$ : f:mathbb{N}to{1,2}}$ is uncountable. To see why, think about $mathcal{P}(mathbb{N})$ and $f^{-1}(1)$ for $fin S$.
$endgroup$
– Santana Afton
Dec 8 '18 at 12:47
$begingroup$
You could just list down all the functions in your set and see what the answer is.
$endgroup$
– Andrés E. Caicedo
Dec 8 '18 at 14:02
add a comment |
$begingroup$
Why do you think the cardinality of $S$ would be $2^{|mathbb N|}$?
$endgroup$
– Henrik
Dec 8 '18 at 11:18
$begingroup$
Because for any function to defined every point has 2 choices so there are 2^|N|.I thought
$endgroup$
– MathLover
Dec 8 '18 at 11:19
$begingroup$
Note that the set $S = { f$ a function$ : f:mathbb{N}to{1,2}}$ is uncountable. To see why, think about $mathcal{P}(mathbb{N})$ and $f^{-1}(1)$ for $fin S$.
$endgroup$
– Santana Afton
Dec 8 '18 at 12:47
$begingroup$
You could just list down all the functions in your set and see what the answer is.
$endgroup$
– Andrés E. Caicedo
Dec 8 '18 at 14:02
$begingroup$
Why do you think the cardinality of $S$ would be $2^{|mathbb N|}$?
$endgroup$
– Henrik
Dec 8 '18 at 11:18
$begingroup$
Why do you think the cardinality of $S$ would be $2^{|mathbb N|}$?
$endgroup$
– Henrik
Dec 8 '18 at 11:18
$begingroup$
Because for any function to defined every point has 2 choices so there are 2^|N|.I thought
$endgroup$
– MathLover
Dec 8 '18 at 11:19
$begingroup$
Because for any function to defined every point has 2 choices so there are 2^|N|.I thought
$endgroup$
– MathLover
Dec 8 '18 at 11:19
$begingroup$
Note that the set $S = { f$ a function$ : f:mathbb{N}to{1,2}}$ is uncountable. To see why, think about $mathcal{P}(mathbb{N})$ and $f^{-1}(1)$ for $fin S$.
$endgroup$
– Santana Afton
Dec 8 '18 at 12:47
$begingroup$
Note that the set $S = { f$ a function$ : f:mathbb{N}to{1,2}}$ is uncountable. To see why, think about $mathcal{P}(mathbb{N})$ and $f^{-1}(1)$ for $fin S$.
$endgroup$
– Santana Afton
Dec 8 '18 at 12:47
$begingroup$
You could just list down all the functions in your set and see what the answer is.
$endgroup$
– Andrés E. Caicedo
Dec 8 '18 at 14:02
$begingroup$
You could just list down all the functions in your set and see what the answer is.
$endgroup$
– Andrés E. Caicedo
Dec 8 '18 at 14:02
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The cardinality of the set of functions from a set $A$ to a set $B$ is $|B|^{|A|}$.
In particular in your case the size of $S$ is $|mathbb{N}|^2$ (not $2^{|mathbb{N}|}$) which is the size of $mathbb{N}timesmathbb{N}$ (hence countable).
answered Dec 8 '18 at 11:14
YankoYanko
6,7931529
$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%2f3030963%2fwhy-is-f-f-colon-a-to-mathbb-n-not-uncountable%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$
The cardinality of the set of functions from a set $A$ to a set $B$ is $|B|^{|A|}$.
In particular in your case the size of $S$ is $|mathbb{N}|^2$ (not $2^{|mathbb{N}|}$) which is the size of $mathbb{N}timesmathbb{N}$ (hence countable).
answered Dec 8 '18 at 11:14
YankoYanko
6,7931529
$endgroup$
add a comment |
$begingroup$
The cardinality of the set of functions from a set $A$ to a set $B$ is $|B|^{|A|}$.
In particular in your case the size of $S$ is $|mathbb{N}|^2$ (not $2^{|mathbb{N}|}$) which is the size of $mathbb{N}timesmathbb{N}$ (hence countable).
answered Dec 8 '18 at 11:14
YankoYanko
6,7931529
$endgroup$
add a comment |
$begingroup$
The cardinality of the set of functions from a set $A$ to a set $B$ is $|B|^{|A|}$.
In particular in your case the size of $S$ is $|mathbb{N}|^2$ (not $2^{|mathbb{N}|}$) which is the size of $mathbb{N}timesmathbb{N}$ (hence countable).
answered Dec 8 '18 at 11:14
YankoYanko
6,7931529
$endgroup$
The cardinality of the set of functions from a set $A$ to a set $B$ is $|B|^{|A|}$.
In particular in your case the size of $S$ is $|mathbb{N}|^2$ (not $2^{|mathbb{N}|}$) which is the size of $mathbb{N}timesmathbb{N}$ (hence countable).
answered Dec 8 '18 at 11:14
YankoYanko
6,7931529
edited Dec 8 '18 at 13:35
answered Dec 8 '18 at 11:14
YankoYanko
6,7931529
answered Dec 8 '18 at 11:14
YankoYanko
6,7931529
answered Dec 8 '18 at 11:14
YankoYanko
6,7931529
6,7931529
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%2f3030963%2fwhy-is-f-f-colon-a-to-mathbb-n-not-uncountable%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
$begingroup$
Why do you think the cardinality of $S$ would be $2^{|mathbb N|}$?
$endgroup$
– Henrik
Dec 8 '18 at 11:18
$begingroup$
Because for any function to defined every point has 2 choices so there are 2^|N|.I thought
$endgroup$
– MathLover
Dec 8 '18 at 11:19
$begingroup$
Note that the set $S = { f$ a function$ : f:mathbb{N}to{1,2}}$ is uncountable. To see why, think about $mathcal{P}(mathbb{N})$ and $f^{-1}(1)$ for $fin S$.
$endgroup$
– Santana Afton
Dec 8 '18 at 12:47
$begingroup$
You could just list down all the functions in your set and see what the answer is.
$endgroup$
– Andrés E. Caicedo
Dec 8 '18 at 14:02