Linear order on the set N^N
$begingroup$
Give the example of the Linear order on the set: $mathbb N^mathbb N$
I know that $mathbb N^mathbb N$ is a function from $mathbb N$ to $mathbb N$ and it's a string, but I'm unable to give an example.
discrete-mathematics logic relations
$endgroup$
|
show 6 more comments
$begingroup$
Give the example of the Linear order on the set: $mathbb N^mathbb N$
I know that $mathbb N^mathbb N$ is a function from $mathbb N$ to $mathbb N$ and it's a string, but I'm unable to give an example.
discrete-mathematics logic relations
$endgroup$
$begingroup$
Hint : There is an order on the alphabet $a,b,c,d,...,x,y,z$, and hence there is an order on words made out of $a,b,c,d,...,x,y,z$ which is reflected in the English dictionary, for example. Think about using this approach on your set : there is a natural order on $mathbb N$, and it should lead to an ordering on $mathbb N^mathbb N$
$endgroup$
– астон вілла олоф мэллбэрг
Jan 20 at 14:29
$begingroup$
@астонвіллаолофмэллбэрг, thanks for answering but haven't learned about the alphabet. Any other ideas?
$endgroup$
– Karol
Jan 20 at 14:38
$begingroup$
I think that he just means the letters that we write with, not a mathematical term. Do you know how to find a word in a dictionary based on your knowledge of the ABC?
$endgroup$
– badjohn
Jan 20 at 14:40
$begingroup$
What I am saying is this : for example if you have two strings $a_1a_2a_3...$ and $b_1b_2b_3...$ of natural numbers, which correspond to two elements of $mathbb N^mathbb N$. You first compare $a_1$ and $b_1$ : if $a_1<b_1$ then the first string is smaller than the second string. If $a_1 > b_1$ then the first string is larger than the second string. If $a_1 = b_1$, then move to comparing $a_2$ and $b_2$ (repeat the above steps with $a_1,b_1$ replaced by $a_2,b_2$). If these are equal then move to $a_3$ and $b_3$. I hope you see how to compare the strings from here.
$endgroup$
– астон вілла олоф мэллбэрг
Jan 20 at 14:43
$begingroup$
@badjohn, so, this set is a set of natural numbers strings, tell me if I'm wrong. So those would be sets of natural numbers, so how exactly do I use the alphabet there?
$endgroup$
– Karol
Jan 20 at 14:43
|
show 6 more comments
$begingroup$
Give the example of the Linear order on the set: $mathbb N^mathbb N$
I know that $mathbb N^mathbb N$ is a function from $mathbb N$ to $mathbb N$ and it's a string, but I'm unable to give an example.
discrete-mathematics logic relations
$endgroup$
Give the example of the Linear order on the set: $mathbb N^mathbb N$
I know that $mathbb N^mathbb N$ is a function from $mathbb N$ to $mathbb N$ and it's a string, but I'm unable to give an example.
discrete-mathematics logic relations
discrete-mathematics logic relations
asked Jan 20 at 14:20
KarolKarol
205
205
$begingroup$
Hint : There is an order on the alphabet $a,b,c,d,...,x,y,z$, and hence there is an order on words made out of $a,b,c,d,...,x,y,z$ which is reflected in the English dictionary, for example. Think about using this approach on your set : there is a natural order on $mathbb N$, and it should lead to an ordering on $mathbb N^mathbb N$
$endgroup$
– астон вілла олоф мэллбэрг
Jan 20 at 14:29
$begingroup$
@астонвіллаолофмэллбэрг, thanks for answering but haven't learned about the alphabet. Any other ideas?
$endgroup$
– Karol
Jan 20 at 14:38
$begingroup$
I think that he just means the letters that we write with, not a mathematical term. Do you know how to find a word in a dictionary based on your knowledge of the ABC?
$endgroup$
– badjohn
Jan 20 at 14:40
$begingroup$
What I am saying is this : for example if you have two strings $a_1a_2a_3...$ and $b_1b_2b_3...$ of natural numbers, which correspond to two elements of $mathbb N^mathbb N$. You first compare $a_1$ and $b_1$ : if $a_1<b_1$ then the first string is smaller than the second string. If $a_1 > b_1$ then the first string is larger than the second string. If $a_1 = b_1$, then move to comparing $a_2$ and $b_2$ (repeat the above steps with $a_1,b_1$ replaced by $a_2,b_2$). If these are equal then move to $a_3$ and $b_3$. I hope you see how to compare the strings from here.
$endgroup$
– астон вілла олоф мэллбэрг
Jan 20 at 14:43
$begingroup$
@badjohn, so, this set is a set of natural numbers strings, tell me if I'm wrong. So those would be sets of natural numbers, so how exactly do I use the alphabet there?
$endgroup$
– Karol
Jan 20 at 14:43
|
show 6 more comments
$begingroup$
Hint : There is an order on the alphabet $a,b,c,d,...,x,y,z$, and hence there is an order on words made out of $a,b,c,d,...,x,y,z$ which is reflected in the English dictionary, for example. Think about using this approach on your set : there is a natural order on $mathbb N$, and it should lead to an ordering on $mathbb N^mathbb N$
$endgroup$
– астон вілла олоф мэллбэрг
Jan 20 at 14:29
$begingroup$
@астонвіллаолофмэллбэрг, thanks for answering but haven't learned about the alphabet. Any other ideas?
$endgroup$
– Karol
Jan 20 at 14:38
$begingroup$
I think that he just means the letters that we write with, not a mathematical term. Do you know how to find a word in a dictionary based on your knowledge of the ABC?
$endgroup$
– badjohn
Jan 20 at 14:40
$begingroup$
What I am saying is this : for example if you have two strings $a_1a_2a_3...$ and $b_1b_2b_3...$ of natural numbers, which correspond to two elements of $mathbb N^mathbb N$. You first compare $a_1$ and $b_1$ : if $a_1<b_1$ then the first string is smaller than the second string. If $a_1 > b_1$ then the first string is larger than the second string. If $a_1 = b_1$, then move to comparing $a_2$ and $b_2$ (repeat the above steps with $a_1,b_1$ replaced by $a_2,b_2$). If these are equal then move to $a_3$ and $b_3$. I hope you see how to compare the strings from here.
$endgroup$
– астон вілла олоф мэллбэрг
Jan 20 at 14:43
$begingroup$
@badjohn, so, this set is a set of natural numbers strings, tell me if I'm wrong. So those would be sets of natural numbers, so how exactly do I use the alphabet there?
$endgroup$
– Karol
Jan 20 at 14:43
$begingroup$
Hint : There is an order on the alphabet $a,b,c,d,...,x,y,z$, and hence there is an order on words made out of $a,b,c,d,...,x,y,z$ which is reflected in the English dictionary, for example. Think about using this approach on your set : there is a natural order on $mathbb N$, and it should lead to an ordering on $mathbb N^mathbb N$
$endgroup$
– астон вілла олоф мэллбэрг
Jan 20 at 14:29
$begingroup$
Hint : There is an order on the alphabet $a,b,c,d,...,x,y,z$, and hence there is an order on words made out of $a,b,c,d,...,x,y,z$ which is reflected in the English dictionary, for example. Think about using this approach on your set : there is a natural order on $mathbb N$, and it should lead to an ordering on $mathbb N^mathbb N$
$endgroup$
– астон вілла олоф мэллбэрг
Jan 20 at 14:29
$begingroup$
@астонвіллаолофмэллбэрг, thanks for answering but haven't learned about the alphabet. Any other ideas?
$endgroup$
– Karol
Jan 20 at 14:38
$begingroup$
@астонвіллаолофмэллбэрг, thanks for answering but haven't learned about the alphabet. Any other ideas?
$endgroup$
– Karol
Jan 20 at 14:38
$begingroup$
I think that he just means the letters that we write with, not a mathematical term. Do you know how to find a word in a dictionary based on your knowledge of the ABC?
$endgroup$
– badjohn
Jan 20 at 14:40
$begingroup$
I think that he just means the letters that we write with, not a mathematical term. Do you know how to find a word in a dictionary based on your knowledge of the ABC?
$endgroup$
– badjohn
Jan 20 at 14:40
$begingroup$
What I am saying is this : for example if you have two strings $a_1a_2a_3...$ and $b_1b_2b_3...$ of natural numbers, which correspond to two elements of $mathbb N^mathbb N$. You first compare $a_1$ and $b_1$ : if $a_1<b_1$ then the first string is smaller than the second string. If $a_1 > b_1$ then the first string is larger than the second string. If $a_1 = b_1$, then move to comparing $a_2$ and $b_2$ (repeat the above steps with $a_1,b_1$ replaced by $a_2,b_2$). If these are equal then move to $a_3$ and $b_3$. I hope you see how to compare the strings from here.
$endgroup$
– астон вілла олоф мэллбэрг
Jan 20 at 14:43
$begingroup$
What I am saying is this : for example if you have two strings $a_1a_2a_3...$ and $b_1b_2b_3...$ of natural numbers, which correspond to two elements of $mathbb N^mathbb N$. You first compare $a_1$ and $b_1$ : if $a_1<b_1$ then the first string is smaller than the second string. If $a_1 > b_1$ then the first string is larger than the second string. If $a_1 = b_1$, then move to comparing $a_2$ and $b_2$ (repeat the above steps with $a_1,b_1$ replaced by $a_2,b_2$). If these are equal then move to $a_3$ and $b_3$. I hope you see how to compare the strings from here.
$endgroup$
– астон вілла олоф мэллбэрг
Jan 20 at 14:43
$begingroup$
@badjohn, so, this set is a set of natural numbers strings, tell me if I'm wrong. So those would be sets of natural numbers, so how exactly do I use the alphabet there?
$endgroup$
– Karol
Jan 20 at 14:43
$begingroup$
@badjohn, so, this set is a set of natural numbers strings, tell me if I'm wrong. So those would be sets of natural numbers, so how exactly do I use the alphabet there?
$endgroup$
– Karol
Jan 20 at 14:43
|
show 6 more comments
1 Answer
1
active
oldest
votes
$begingroup$
First, think of words in a dictionary: how do you order them? Which comes first: Apple or Orange? You compare the first letters and since A is before O, you say that Apple is before Orange. If the first letters, are the same then compare the second so apple is before avocado. If they are the same until one ends then you need a rule, e.g. the shorter one is first so grape is before grapefruit.
Your functions can be written as a list of numbers. $f(1), f(2), f(3), ... $ To compare $f$ and $g$, compare $f(1)$ and $g(1)$. If $f(1)$ is less then $f$ is less. If they are the same then compare $f(2)$ and $g(2)$, etc. Continue until you find a difference.
$endgroup$
$begingroup$
Thank you, just quick question. Is a linear order a lexicographical order?
$endgroup$
– Karol
Jan 20 at 15:05
$begingroup$
I'd said the reverse. A lexicographical order will be a linear but maybe not the reverse.
$endgroup$
– badjohn
Jan 20 at 15:16
$begingroup$
why is a lexicographical order a linear order? I cannot find any explanation and I'm beginning to understand it so I want to be 100% sure.
$endgroup$
– Karol
Jan 20 at 15:24
$begingroup$
Well, because the procedure I described will satisfy the axioms of a linear order. en.m.wikipedia.org/wiki/Total_order
$endgroup$
– badjohn
Jan 20 at 15:37
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%2f3080633%2flinear-order-on-the-set-nn%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$
First, think of words in a dictionary: how do you order them? Which comes first: Apple or Orange? You compare the first letters and since A is before O, you say that Apple is before Orange. If the first letters, are the same then compare the second so apple is before avocado. If they are the same until one ends then you need a rule, e.g. the shorter one is first so grape is before grapefruit.
Your functions can be written as a list of numbers. $f(1), f(2), f(3), ... $ To compare $f$ and $g$, compare $f(1)$ and $g(1)$. If $f(1)$ is less then $f$ is less. If they are the same then compare $f(2)$ and $g(2)$, etc. Continue until you find a difference.
$endgroup$
$begingroup$
Thank you, just quick question. Is a linear order a lexicographical order?
$endgroup$
– Karol
Jan 20 at 15:05
$begingroup$
I'd said the reverse. A lexicographical order will be a linear but maybe not the reverse.
$endgroup$
– badjohn
Jan 20 at 15:16
$begingroup$
why is a lexicographical order a linear order? I cannot find any explanation and I'm beginning to understand it so I want to be 100% sure.
$endgroup$
– Karol
Jan 20 at 15:24
$begingroup$
Well, because the procedure I described will satisfy the axioms of a linear order. en.m.wikipedia.org/wiki/Total_order
$endgroup$
– badjohn
Jan 20 at 15:37
add a comment |
$begingroup$
First, think of words in a dictionary: how do you order them? Which comes first: Apple or Orange? You compare the first letters and since A is before O, you say that Apple is before Orange. If the first letters, are the same then compare the second so apple is before avocado. If they are the same until one ends then you need a rule, e.g. the shorter one is first so grape is before grapefruit.
Your functions can be written as a list of numbers. $f(1), f(2), f(3), ... $ To compare $f$ and $g$, compare $f(1)$ and $g(1)$. If $f(1)$ is less then $f$ is less. If they are the same then compare $f(2)$ and $g(2)$, etc. Continue until you find a difference.
$endgroup$
$begingroup$
Thank you, just quick question. Is a linear order a lexicographical order?
$endgroup$
– Karol
Jan 20 at 15:05
$begingroup$
I'd said the reverse. A lexicographical order will be a linear but maybe not the reverse.
$endgroup$
– badjohn
Jan 20 at 15:16
$begingroup$
why is a lexicographical order a linear order? I cannot find any explanation and I'm beginning to understand it so I want to be 100% sure.
$endgroup$
– Karol
Jan 20 at 15:24
$begingroup$
Well, because the procedure I described will satisfy the axioms of a linear order. en.m.wikipedia.org/wiki/Total_order
$endgroup$
– badjohn
Jan 20 at 15:37
add a comment |
$begingroup$
First, think of words in a dictionary: how do you order them? Which comes first: Apple or Orange? You compare the first letters and since A is before O, you say that Apple is before Orange. If the first letters, are the same then compare the second so apple is before avocado. If they are the same until one ends then you need a rule, e.g. the shorter one is first so grape is before grapefruit.
Your functions can be written as a list of numbers. $f(1), f(2), f(3), ... $ To compare $f$ and $g$, compare $f(1)$ and $g(1)$. If $f(1)$ is less then $f$ is less. If they are the same then compare $f(2)$ and $g(2)$, etc. Continue until you find a difference.
$endgroup$
First, think of words in a dictionary: how do you order them? Which comes first: Apple or Orange? You compare the first letters and since A is before O, you say that Apple is before Orange. If the first letters, are the same then compare the second so apple is before avocado. If they are the same until one ends then you need a rule, e.g. the shorter one is first so grape is before grapefruit.
Your functions can be written as a list of numbers. $f(1), f(2), f(3), ... $ To compare $f$ and $g$, compare $f(1)$ and $g(1)$. If $f(1)$ is less then $f$ is less. If they are the same then compare $f(2)$ and $g(2)$, etc. Continue until you find a difference.
answered Jan 20 at 14:52
badjohnbadjohn
4,3021620
4,3021620
$begingroup$
Thank you, just quick question. Is a linear order a lexicographical order?
$endgroup$
– Karol
Jan 20 at 15:05
$begingroup$
I'd said the reverse. A lexicographical order will be a linear but maybe not the reverse.
$endgroup$
– badjohn
Jan 20 at 15:16
$begingroup$
why is a lexicographical order a linear order? I cannot find any explanation and I'm beginning to understand it so I want to be 100% sure.
$endgroup$
– Karol
Jan 20 at 15:24
$begingroup$
Well, because the procedure I described will satisfy the axioms of a linear order. en.m.wikipedia.org/wiki/Total_order
$endgroup$
– badjohn
Jan 20 at 15:37
add a comment |
$begingroup$
Thank you, just quick question. Is a linear order a lexicographical order?
$endgroup$
– Karol
Jan 20 at 15:05
$begingroup$
I'd said the reverse. A lexicographical order will be a linear but maybe not the reverse.
$endgroup$
– badjohn
Jan 20 at 15:16
$begingroup$
why is a lexicographical order a linear order? I cannot find any explanation and I'm beginning to understand it so I want to be 100% sure.
$endgroup$
– Karol
Jan 20 at 15:24
$begingroup$
Well, because the procedure I described will satisfy the axioms of a linear order. en.m.wikipedia.org/wiki/Total_order
$endgroup$
– badjohn
Jan 20 at 15:37
$begingroup$
Thank you, just quick question. Is a linear order a lexicographical order?
$endgroup$
– Karol
Jan 20 at 15:05
$begingroup$
Thank you, just quick question. Is a linear order a lexicographical order?
$endgroup$
– Karol
Jan 20 at 15:05
$begingroup$
I'd said the reverse. A lexicographical order will be a linear but maybe not the reverse.
$endgroup$
– badjohn
Jan 20 at 15:16
$begingroup$
I'd said the reverse. A lexicographical order will be a linear but maybe not the reverse.
$endgroup$
– badjohn
Jan 20 at 15:16
$begingroup$
why is a lexicographical order a linear order? I cannot find any explanation and I'm beginning to understand it so I want to be 100% sure.
$endgroup$
– Karol
Jan 20 at 15:24
$begingroup$
why is a lexicographical order a linear order? I cannot find any explanation and I'm beginning to understand it so I want to be 100% sure.
$endgroup$
– Karol
Jan 20 at 15:24
$begingroup$
Well, because the procedure I described will satisfy the axioms of a linear order. en.m.wikipedia.org/wiki/Total_order
$endgroup$
– badjohn
Jan 20 at 15:37
$begingroup$
Well, because the procedure I described will satisfy the axioms of a linear order. en.m.wikipedia.org/wiki/Total_order
$endgroup$
– badjohn
Jan 20 at 15:37
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%2f3080633%2flinear-order-on-the-set-nn%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$
Hint : There is an order on the alphabet $a,b,c,d,...,x,y,z$, and hence there is an order on words made out of $a,b,c,d,...,x,y,z$ which is reflected in the English dictionary, for example. Think about using this approach on your set : there is a natural order on $mathbb N$, and it should lead to an ordering on $mathbb N^mathbb N$
$endgroup$
– астон вілла олоф мэллбэрг
Jan 20 at 14:29
$begingroup$
@астонвіллаолофмэллбэрг, thanks for answering but haven't learned about the alphabet. Any other ideas?
$endgroup$
– Karol
Jan 20 at 14:38
$begingroup$
I think that he just means the letters that we write with, not a mathematical term. Do you know how to find a word in a dictionary based on your knowledge of the ABC?
$endgroup$
– badjohn
Jan 20 at 14:40
$begingroup$
What I am saying is this : for example if you have two strings $a_1a_2a_3...$ and $b_1b_2b_3...$ of natural numbers, which correspond to two elements of $mathbb N^mathbb N$. You first compare $a_1$ and $b_1$ : if $a_1<b_1$ then the first string is smaller than the second string. If $a_1 > b_1$ then the first string is larger than the second string. If $a_1 = b_1$, then move to comparing $a_2$ and $b_2$ (repeat the above steps with $a_1,b_1$ replaced by $a_2,b_2$). If these are equal then move to $a_3$ and $b_3$. I hope you see how to compare the strings from here.
$endgroup$
– астон вілла олоф мэллбэрг
Jan 20 at 14:43
$begingroup$
@badjohn, so, this set is a set of natural numbers strings, tell me if I'm wrong. So those would be sets of natural numbers, so how exactly do I use the alphabet there?
$endgroup$
– Karol
Jan 20 at 14:43