How to prove #R + #P = #R
$begingroup$
I have already started this. I redefined the Reals as the Reals minus the Positive Integers (to make the two sets disjoint) so that I could prove that #(R - P) + #P = #R. I know that to prove this I will have to prove that #(R - P) = #(R). I would have to define a bijection, f:(R-P) -> R. I am having trouble coming up with a formula that will map the (R-P) to R. If anyone could point me in the right direction I would really appreciate it. Thanks
cardinals integers
$endgroup$
add a comment |
$begingroup$
I have already started this. I redefined the Reals as the Reals minus the Positive Integers (to make the two sets disjoint) so that I could prove that #(R - P) + #P = #R. I know that to prove this I will have to prove that #(R - P) = #(R). I would have to define a bijection, f:(R-P) -> R. I am having trouble coming up with a formula that will map the (R-P) to R. If anyone could point me in the right direction I would really appreciate it. Thanks
cardinals integers
$endgroup$
$begingroup$
Wait, so you're trying to prove $#(Bbb RbackslashBbb P)+#Bbb P=#Bbb R$ with $Bbb P:={xinBbb Z|x>0}$? Well, $#(Abackslash B)+#B=#A$ works for any sets $A,,B$ with $Bsubseteq A$, so perhaps I've misunderstood; perhaps you're trying to prove something less trivial.
$endgroup$
– J.G.
Dec 8 '18 at 21:49
$begingroup$
I am trying to prove #(reals) + #(positive integers) = #(reals) by defining a bijection f: (R-P) --> R. I'm really sorry if my question is confusing.
$endgroup$
– JaneDoe1094
Dec 8 '18 at 22:09
add a comment |
$begingroup$
I have already started this. I redefined the Reals as the Reals minus the Positive Integers (to make the two sets disjoint) so that I could prove that #(R - P) + #P = #R. I know that to prove this I will have to prove that #(R - P) = #(R). I would have to define a bijection, f:(R-P) -> R. I am having trouble coming up with a formula that will map the (R-P) to R. If anyone could point me in the right direction I would really appreciate it. Thanks
cardinals integers
$endgroup$
I have already started this. I redefined the Reals as the Reals minus the Positive Integers (to make the two sets disjoint) so that I could prove that #(R - P) + #P = #R. I know that to prove this I will have to prove that #(R - P) = #(R). I would have to define a bijection, f:(R-P) -> R. I am having trouble coming up with a formula that will map the (R-P) to R. If anyone could point me in the right direction I would really appreciate it. Thanks
cardinals integers
cardinals integers
asked Dec 8 '18 at 21:36
JaneDoe1094JaneDoe1094
1
1
$begingroup$
Wait, so you're trying to prove $#(Bbb RbackslashBbb P)+#Bbb P=#Bbb R$ with $Bbb P:={xinBbb Z|x>0}$? Well, $#(Abackslash B)+#B=#A$ works for any sets $A,,B$ with $Bsubseteq A$, so perhaps I've misunderstood; perhaps you're trying to prove something less trivial.
$endgroup$
– J.G.
Dec 8 '18 at 21:49
$begingroup$
I am trying to prove #(reals) + #(positive integers) = #(reals) by defining a bijection f: (R-P) --> R. I'm really sorry if my question is confusing.
$endgroup$
– JaneDoe1094
Dec 8 '18 at 22:09
add a comment |
$begingroup$
Wait, so you're trying to prove $#(Bbb RbackslashBbb P)+#Bbb P=#Bbb R$ with $Bbb P:={xinBbb Z|x>0}$? Well, $#(Abackslash B)+#B=#A$ works for any sets $A,,B$ with $Bsubseteq A$, so perhaps I've misunderstood; perhaps you're trying to prove something less trivial.
$endgroup$
– J.G.
Dec 8 '18 at 21:49
$begingroup$
I am trying to prove #(reals) + #(positive integers) = #(reals) by defining a bijection f: (R-P) --> R. I'm really sorry if my question is confusing.
$endgroup$
– JaneDoe1094
Dec 8 '18 at 22:09
$begingroup$
Wait, so you're trying to prove $#(Bbb RbackslashBbb P)+#Bbb P=#Bbb R$ with $Bbb P:={xinBbb Z|x>0}$? Well, $#(Abackslash B)+#B=#A$ works for any sets $A,,B$ with $Bsubseteq A$, so perhaps I've misunderstood; perhaps you're trying to prove something less trivial.
$endgroup$
– J.G.
Dec 8 '18 at 21:49
$begingroup$
Wait, so you're trying to prove $#(Bbb RbackslashBbb P)+#Bbb P=#Bbb R$ with $Bbb P:={xinBbb Z|x>0}$? Well, $#(Abackslash B)+#B=#A$ works for any sets $A,,B$ with $Bsubseteq A$, so perhaps I've misunderstood; perhaps you're trying to prove something less trivial.
$endgroup$
– J.G.
Dec 8 '18 at 21:49
$begingroup$
I am trying to prove #(reals) + #(positive integers) = #(reals) by defining a bijection f: (R-P) --> R. I'm really sorry if my question is confusing.
$endgroup$
– JaneDoe1094
Dec 8 '18 at 22:09
$begingroup$
I am trying to prove #(reals) + #(positive integers) = #(reals) by defining a bijection f: (R-P) --> R. I'm really sorry if my question is confusing.
$endgroup$
– JaneDoe1094
Dec 8 '18 at 22:09
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Do you know how to biject $[0,1)$ with $(0,1)$? You can then use the identity on $(-infty,0)$ and map $[n,n+1)$ to $(n,n+1)$
$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%2f3031662%2fhow-to-prove-r-p-r%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$
Do you know how to biject $[0,1)$ with $(0,1)$? You can then use the identity on $(-infty,0)$ and map $[n,n+1)$ to $(n,n+1)$
$endgroup$
add a comment |
$begingroup$
Do you know how to biject $[0,1)$ with $(0,1)$? You can then use the identity on $(-infty,0)$ and map $[n,n+1)$ to $(n,n+1)$
$endgroup$
add a comment |
$begingroup$
Do you know how to biject $[0,1)$ with $(0,1)$? You can then use the identity on $(-infty,0)$ and map $[n,n+1)$ to $(n,n+1)$
$endgroup$
Do you know how to biject $[0,1)$ with $(0,1)$? You can then use the identity on $(-infty,0)$ and map $[n,n+1)$ to $(n,n+1)$
answered Dec 8 '18 at 22:16
Ross MillikanRoss Millikan
296k23198371
296k23198371
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%2f3031662%2fhow-to-prove-r-p-r%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$
Wait, so you're trying to prove $#(Bbb RbackslashBbb P)+#Bbb P=#Bbb R$ with $Bbb P:={xinBbb Z|x>0}$? Well, $#(Abackslash B)+#B=#A$ works for any sets $A,,B$ with $Bsubseteq A$, so perhaps I've misunderstood; perhaps you're trying to prove something less trivial.
$endgroup$
– J.G.
Dec 8 '18 at 21:49
$begingroup$
I am trying to prove #(reals) + #(positive integers) = #(reals) by defining a bijection f: (R-P) --> R. I'm really sorry if my question is confusing.
$endgroup$
– JaneDoe1094
Dec 8 '18 at 22:09