bijection between $mathbb{Q}$ and $mathbb{N}$ that preserve the order.
$begingroup$
I know there is a bijection between $mathbb{Q}$ and $mathbb{N}$. But is there a bijection $mathbb{Q}xrightarrow{f}mathbb{N}$ that preserves the order? Intuitively I think this is not possible. What I would think of is enumerating the rationals in a form ${q_n}_{n in mathbb{N}}$ where $q_n < q_m$ if $n<m$ (I think this is not possible but why?) and then map to elements of $mathbb{N}$.
rational-numbers
$endgroup$
add a comment |
$begingroup$
I know there is a bijection between $mathbb{Q}$ and $mathbb{N}$. But is there a bijection $mathbb{Q}xrightarrow{f}mathbb{N}$ that preserves the order? Intuitively I think this is not possible. What I would think of is enumerating the rationals in a form ${q_n}_{n in mathbb{N}}$ where $q_n < q_m$ if $n<m$ (I think this is not possible but why?) and then map to elements of $mathbb{N}$.
rational-numbers
$endgroup$
$begingroup$
And what of $q_0$ ( or $q_1$)? That is, there is a least natural number, but not a least rational.
$endgroup$
– астон вілла олоф мэллбэрг
Jan 24 at 16:36
1
$begingroup$
Your question is equivalent to this one, since defining an order-preserving bijection $mathbb{Q} to mathbb{N}$ is equivalent to listing the rational numbers in increasing order.
$endgroup$
– Clive Newstead
Jan 24 at 16:37
$begingroup$
Compare also with this question here.
$endgroup$
– Dietrich Burde
Jan 24 at 16:38
$begingroup$
@CliveNewstead Thanks, that was actually easyer than I thought.
$endgroup$
– roi_saumon
Jan 24 at 16:46
add a comment |
$begingroup$
I know there is a bijection between $mathbb{Q}$ and $mathbb{N}$. But is there a bijection $mathbb{Q}xrightarrow{f}mathbb{N}$ that preserves the order? Intuitively I think this is not possible. What I would think of is enumerating the rationals in a form ${q_n}_{n in mathbb{N}}$ where $q_n < q_m$ if $n<m$ (I think this is not possible but why?) and then map to elements of $mathbb{N}$.
rational-numbers
$endgroup$
I know there is a bijection between $mathbb{Q}$ and $mathbb{N}$. But is there a bijection $mathbb{Q}xrightarrow{f}mathbb{N}$ that preserves the order? Intuitively I think this is not possible. What I would think of is enumerating the rationals in a form ${q_n}_{n in mathbb{N}}$ where $q_n < q_m$ if $n<m$ (I think this is not possible but why?) and then map to elements of $mathbb{N}$.
rational-numbers
rational-numbers
asked Jan 24 at 16:32
roi_saumonroi_saumon
59438
59438
$begingroup$
And what of $q_0$ ( or $q_1$)? That is, there is a least natural number, but not a least rational.
$endgroup$
– астон вілла олоф мэллбэрг
Jan 24 at 16:36
1
$begingroup$
Your question is equivalent to this one, since defining an order-preserving bijection $mathbb{Q} to mathbb{N}$ is equivalent to listing the rational numbers in increasing order.
$endgroup$
– Clive Newstead
Jan 24 at 16:37
$begingroup$
Compare also with this question here.
$endgroup$
– Dietrich Burde
Jan 24 at 16:38
$begingroup$
@CliveNewstead Thanks, that was actually easyer than I thought.
$endgroup$
– roi_saumon
Jan 24 at 16:46
add a comment |
$begingroup$
And what of $q_0$ ( or $q_1$)? That is, there is a least natural number, but not a least rational.
$endgroup$
– астон вілла олоф мэллбэрг
Jan 24 at 16:36
1
$begingroup$
Your question is equivalent to this one, since defining an order-preserving bijection $mathbb{Q} to mathbb{N}$ is equivalent to listing the rational numbers in increasing order.
$endgroup$
– Clive Newstead
Jan 24 at 16:37
$begingroup$
Compare also with this question here.
$endgroup$
– Dietrich Burde
Jan 24 at 16:38
$begingroup$
@CliveNewstead Thanks, that was actually easyer than I thought.
$endgroup$
– roi_saumon
Jan 24 at 16:46
$begingroup$
And what of $q_0$ ( or $q_1$)? That is, there is a least natural number, but not a least rational.
$endgroup$
– астон вілла олоф мэллбэрг
Jan 24 at 16:36
$begingroup$
And what of $q_0$ ( or $q_1$)? That is, there is a least natural number, but not a least rational.
$endgroup$
– астон вілла олоф мэллбэрг
Jan 24 at 16:36
1
1
$begingroup$
Your question is equivalent to this one, since defining an order-preserving bijection $mathbb{Q} to mathbb{N}$ is equivalent to listing the rational numbers in increasing order.
$endgroup$
– Clive Newstead
Jan 24 at 16:37
$begingroup$
Your question is equivalent to this one, since defining an order-preserving bijection $mathbb{Q} to mathbb{N}$ is equivalent to listing the rational numbers in increasing order.
$endgroup$
– Clive Newstead
Jan 24 at 16:37
$begingroup$
Compare also with this question here.
$endgroup$
– Dietrich Burde
Jan 24 at 16:38
$begingroup$
Compare also with this question here.
$endgroup$
– Dietrich Burde
Jan 24 at 16:38
$begingroup$
@CliveNewstead Thanks, that was actually easyer than I thought.
$endgroup$
– roi_saumon
Jan 24 at 16:46
$begingroup$
@CliveNewstead Thanks, that was actually easyer than I thought.
$endgroup$
– roi_saumon
Jan 24 at 16:46
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Let $n in mathbb{N}$ and $q_n,q_{n+1} in mathbb{Q}$ where $q_n < q_{n+1}$.
Assume there does not exist another rational number $q_k$ where $q_n<q_k<q_{n+1}$ (i.e., we can order the rationals). Since $mathbb{Q}subset mathbb{R}$, this implies that the rationals are not dense in the reals, which is false. Therefore, our assumption is false.
$endgroup$
add a comment |
$begingroup$
The reson is that if you have natural number n then you can find the NEXT number (=n+1), but if you have Rational number q then you cannot find NEXT number - because between any two different rational numbers is infinite number of other rational numbers.
If such bijection $f$ exists then when you find $q=f(n)$ then you shoud be able to find next rational number $p=f(n+1)$ but because $qneq p$ then between $q$ and $p$ exist infinite number of other rational numbers e.g. $r=(p+q)/2$
$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%2f3086083%2fbijection-between-mathbbq-and-mathbbn-that-preserve-the-order%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$
Let $n in mathbb{N}$ and $q_n,q_{n+1} in mathbb{Q}$ where $q_n < q_{n+1}$.
Assume there does not exist another rational number $q_k$ where $q_n<q_k<q_{n+1}$ (i.e., we can order the rationals). Since $mathbb{Q}subset mathbb{R}$, this implies that the rationals are not dense in the reals, which is false. Therefore, our assumption is false.
$endgroup$
add a comment |
$begingroup$
Let $n in mathbb{N}$ and $q_n,q_{n+1} in mathbb{Q}$ where $q_n < q_{n+1}$.
Assume there does not exist another rational number $q_k$ where $q_n<q_k<q_{n+1}$ (i.e., we can order the rationals). Since $mathbb{Q}subset mathbb{R}$, this implies that the rationals are not dense in the reals, which is false. Therefore, our assumption is false.
$endgroup$
add a comment |
$begingroup$
Let $n in mathbb{N}$ and $q_n,q_{n+1} in mathbb{Q}$ where $q_n < q_{n+1}$.
Assume there does not exist another rational number $q_k$ where $q_n<q_k<q_{n+1}$ (i.e., we can order the rationals). Since $mathbb{Q}subset mathbb{R}$, this implies that the rationals are not dense in the reals, which is false. Therefore, our assumption is false.
$endgroup$
Let $n in mathbb{N}$ and $q_n,q_{n+1} in mathbb{Q}$ where $q_n < q_{n+1}$.
Assume there does not exist another rational number $q_k$ where $q_n<q_k<q_{n+1}$ (i.e., we can order the rationals). Since $mathbb{Q}subset mathbb{R}$, this implies that the rationals are not dense in the reals, which is false. Therefore, our assumption is false.
answered Jan 24 at 16:44
BeyBey
1464
1464
add a comment |
add a comment |
$begingroup$
The reson is that if you have natural number n then you can find the NEXT number (=n+1), but if you have Rational number q then you cannot find NEXT number - because between any two different rational numbers is infinite number of other rational numbers.
If such bijection $f$ exists then when you find $q=f(n)$ then you shoud be able to find next rational number $p=f(n+1)$ but because $qneq p$ then between $q$ and $p$ exist infinite number of other rational numbers e.g. $r=(p+q)/2$
$endgroup$
add a comment |
$begingroup$
The reson is that if you have natural number n then you can find the NEXT number (=n+1), but if you have Rational number q then you cannot find NEXT number - because between any two different rational numbers is infinite number of other rational numbers.
If such bijection $f$ exists then when you find $q=f(n)$ then you shoud be able to find next rational number $p=f(n+1)$ but because $qneq p$ then between $q$ and $p$ exist infinite number of other rational numbers e.g. $r=(p+q)/2$
$endgroup$
add a comment |
$begingroup$
The reson is that if you have natural number n then you can find the NEXT number (=n+1), but if you have Rational number q then you cannot find NEXT number - because between any two different rational numbers is infinite number of other rational numbers.
If such bijection $f$ exists then when you find $q=f(n)$ then you shoud be able to find next rational number $p=f(n+1)$ but because $qneq p$ then between $q$ and $p$ exist infinite number of other rational numbers e.g. $r=(p+q)/2$
$endgroup$
The reson is that if you have natural number n then you can find the NEXT number (=n+1), but if you have Rational number q then you cannot find NEXT number - because between any two different rational numbers is infinite number of other rational numbers.
If such bijection $f$ exists then when you find $q=f(n)$ then you shoud be able to find next rational number $p=f(n+1)$ but because $qneq p$ then between $q$ and $p$ exist infinite number of other rational numbers e.g. $r=(p+q)/2$
edited Jan 24 at 16:49
answered Jan 24 at 16:36
Kamil KiełczewskiKamil Kiełczewski
1267
1267
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%2f3086083%2fbijection-between-mathbbq-and-mathbbn-that-preserve-the-order%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$
And what of $q_0$ ( or $q_1$)? That is, there is a least natural number, but not a least rational.
$endgroup$
– астон вілла олоф мэллбэрг
Jan 24 at 16:36
1
$begingroup$
Your question is equivalent to this one, since defining an order-preserving bijection $mathbb{Q} to mathbb{N}$ is equivalent to listing the rational numbers in increasing order.
$endgroup$
– Clive Newstead
Jan 24 at 16:37
$begingroup$
Compare also with this question here.
$endgroup$
– Dietrich Burde
Jan 24 at 16:38
$begingroup$
@CliveNewstead Thanks, that was actually easyer than I thought.
$endgroup$
– roi_saumon
Jan 24 at 16:46