Natural numbers as a subset of integer numbers: $mathbb{N}subsetmathbb{Z}$.
$begingroup$
Within set theory, having the natural numbers $mathbb{N}$ built as the minimal inductive set with the corresponding additive and multiplicative operations defined, integers $mathbb{Z}$ can be set as equivalence classes of parallel diagonals of $mathbb{N}timesmathbb{N}$, which contain a copy of the natural numbers. See Set Theoretic Definition of Numbers
.
Is there any alternative definition of the set $mathbb{Z}$, starting from $mathbb{N}$ already defined as usual, such that $$mathbb{N}subsetmathbb{Z}$$
as sets, preserving the sum and product operations?
number-theory elementary-set-theory integers natural-numbers
$endgroup$
add a comment |
$begingroup$
Within set theory, having the natural numbers $mathbb{N}$ built as the minimal inductive set with the corresponding additive and multiplicative operations defined, integers $mathbb{Z}$ can be set as equivalence classes of parallel diagonals of $mathbb{N}timesmathbb{N}$, which contain a copy of the natural numbers. See Set Theoretic Definition of Numbers
.
Is there any alternative definition of the set $mathbb{Z}$, starting from $mathbb{N}$ already defined as usual, such that $$mathbb{N}subsetmathbb{Z}$$
as sets, preserving the sum and product operations?
number-theory elementary-set-theory integers natural-numbers
$endgroup$
add a comment |
$begingroup$
Within set theory, having the natural numbers $mathbb{N}$ built as the minimal inductive set with the corresponding additive and multiplicative operations defined, integers $mathbb{Z}$ can be set as equivalence classes of parallel diagonals of $mathbb{N}timesmathbb{N}$, which contain a copy of the natural numbers. See Set Theoretic Definition of Numbers
.
Is there any alternative definition of the set $mathbb{Z}$, starting from $mathbb{N}$ already defined as usual, such that $$mathbb{N}subsetmathbb{Z}$$
as sets, preserving the sum and product operations?
number-theory elementary-set-theory integers natural-numbers
$endgroup$
Within set theory, having the natural numbers $mathbb{N}$ built as the minimal inductive set with the corresponding additive and multiplicative operations defined, integers $mathbb{Z}$ can be set as equivalence classes of parallel diagonals of $mathbb{N}timesmathbb{N}$, which contain a copy of the natural numbers. See Set Theoretic Definition of Numbers
.
Is there any alternative definition of the set $mathbb{Z}$, starting from $mathbb{N}$ already defined as usual, such that $$mathbb{N}subsetmathbb{Z}$$
as sets, preserving the sum and product operations?
number-theory elementary-set-theory integers natural-numbers
number-theory elementary-set-theory integers natural-numbers
edited Dec 5 '18 at 4:20
Andrés E. Caicedo
65.2k8158247
65.2k8158247
asked Dec 4 '18 at 19:48
Dr PotatoDr Potato
394
394
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Yes (and the same argument goes for the other number sets).
Any construction of $mathbb{Z}$ comes equipped with an embedding $i : mathbb{N} hookrightarrow mathbb{Z}$, by letting $i(n)$ be '$n$ considered as an integer'.
Now define
$$mathbb{Z}' = mathbb{N} cup (mathbb{Z} setminus i[mathbb{N}])$$
where $i[mathbb{N}] = { i(n) mid n in mathbb{N} }$ is the image of $i : mathbb{N} hookrightarrow mathbb{Z}$.
Evidently $mathbb{N} subseteq mathbb{Z}'$ and the arithmetic operations of $mathbb{N}$ are preserved in $mathbb{Z}'$. And indeed, $mathbb{Z}'$ is a perfectly good 'set of integers', since there is an easy-to-define bijection $mathbb{Z}' to mathbb{Z}$ given by
$$n mapsto begin{cases} i(n) & text{if } n in mathbb{N} \ n & text{if } n in mathbb{Z} setminus i[mathbb{N}] end{cases}$$
[Slight caveat: if your construction of $mathbb{Z}$ already contains some natural numbers for whatever reason, replace $mathbb{Z} setminus i[mathbb{N}]$ by an isomorphic set that contains no natural numbers, such as $(mathbb{Z} setminus i[mathbb{N}]) times { 0 }$.]
$endgroup$
$begingroup$
I'm not sure the answers the question, since you're starting with "any construction of $Bbb{Z}$", and the question asks about starting with $Bbb{N}$.
$endgroup$
– dbx
Dec 4 '18 at 20:04
$begingroup$
@dbx: It does answer the question. The construction of $mathbb{Z}$ in the question takes $mathbb{Z}$ to be the quotient of $mathbb{N} times mathbb{N}$ by the equivalence relation $(a,b) sim (c,d) Leftrightarrow a+d=b+c$, and then the inclusion $i : mathbb{N} hookrightarrow mathbb{Z}$ is given by $i(n) = [(0,n)]$ for all $n in mathbb{N}$. This is one example of a construction of $mathbb{Z}$; my answer is saying that it doesn't matter what construction you pick. (So, in particular, my answer applies to the construction mentioned in the question.)
$endgroup$
– Clive Newstead
Dec 4 '18 at 21:00
$begingroup$
Although it answers the question, I am looking for something more elegant.
$endgroup$
– Dr Potato
Dec 4 '18 at 22:22
$begingroup$
@DrPotato: If you want to construct $mathbb{Z}$ from $mathbb{N}$ (with $mathbb{N}$ as a subset), all you really need is a way of encoding $-n$ for $n in mathbb{N}$. (This is assuming $0 in mathbb{N}$, of course.) So you could define $-n = (n,0)$ for $n>0$, and then $mathbb{Z} = mathbb{N} cup (mathbb{N}^+ times { 0 })$. I don't know if this qualifies as 'elegant' to you, but I'm not sure how much elegance you can expect to find in a set theoretic construction of $mathbb{Z}$ from $mathbb{N}$.
$endgroup$
– Clive Newstead
Dec 5 '18 at 2:37
1
$begingroup$
@dbx: Just to close this up, 'parallel diagonals' means sets of the form ${ (a,a+n) mid a in mathbb{N} }$. The individual elements of each diagonal don't correspond to the different natural numbers; rather, each diagonal itself refers to a single natural number—the diagonal ${ (a,a+n) mid a in mathbb{N} }$ corresponds with the natural number $n$.
$endgroup$
– Clive Newstead
Dec 5 '18 at 16:22
|
show 4 more comments
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%2f3026062%2fnatural-numbers-as-a-subset-of-integer-numbers-mathbbn-subset-mathbbz%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$
Yes (and the same argument goes for the other number sets).
Any construction of $mathbb{Z}$ comes equipped with an embedding $i : mathbb{N} hookrightarrow mathbb{Z}$, by letting $i(n)$ be '$n$ considered as an integer'.
Now define
$$mathbb{Z}' = mathbb{N} cup (mathbb{Z} setminus i[mathbb{N}])$$
where $i[mathbb{N}] = { i(n) mid n in mathbb{N} }$ is the image of $i : mathbb{N} hookrightarrow mathbb{Z}$.
Evidently $mathbb{N} subseteq mathbb{Z}'$ and the arithmetic operations of $mathbb{N}$ are preserved in $mathbb{Z}'$. And indeed, $mathbb{Z}'$ is a perfectly good 'set of integers', since there is an easy-to-define bijection $mathbb{Z}' to mathbb{Z}$ given by
$$n mapsto begin{cases} i(n) & text{if } n in mathbb{N} \ n & text{if } n in mathbb{Z} setminus i[mathbb{N}] end{cases}$$
[Slight caveat: if your construction of $mathbb{Z}$ already contains some natural numbers for whatever reason, replace $mathbb{Z} setminus i[mathbb{N}]$ by an isomorphic set that contains no natural numbers, such as $(mathbb{Z} setminus i[mathbb{N}]) times { 0 }$.]
$endgroup$
$begingroup$
I'm not sure the answers the question, since you're starting with "any construction of $Bbb{Z}$", and the question asks about starting with $Bbb{N}$.
$endgroup$
– dbx
Dec 4 '18 at 20:04
$begingroup$
@dbx: It does answer the question. The construction of $mathbb{Z}$ in the question takes $mathbb{Z}$ to be the quotient of $mathbb{N} times mathbb{N}$ by the equivalence relation $(a,b) sim (c,d) Leftrightarrow a+d=b+c$, and then the inclusion $i : mathbb{N} hookrightarrow mathbb{Z}$ is given by $i(n) = [(0,n)]$ for all $n in mathbb{N}$. This is one example of a construction of $mathbb{Z}$; my answer is saying that it doesn't matter what construction you pick. (So, in particular, my answer applies to the construction mentioned in the question.)
$endgroup$
– Clive Newstead
Dec 4 '18 at 21:00
$begingroup$
Although it answers the question, I am looking for something more elegant.
$endgroup$
– Dr Potato
Dec 4 '18 at 22:22
$begingroup$
@DrPotato: If you want to construct $mathbb{Z}$ from $mathbb{N}$ (with $mathbb{N}$ as a subset), all you really need is a way of encoding $-n$ for $n in mathbb{N}$. (This is assuming $0 in mathbb{N}$, of course.) So you could define $-n = (n,0)$ for $n>0$, and then $mathbb{Z} = mathbb{N} cup (mathbb{N}^+ times { 0 })$. I don't know if this qualifies as 'elegant' to you, but I'm not sure how much elegance you can expect to find in a set theoretic construction of $mathbb{Z}$ from $mathbb{N}$.
$endgroup$
– Clive Newstead
Dec 5 '18 at 2:37
1
$begingroup$
@dbx: Just to close this up, 'parallel diagonals' means sets of the form ${ (a,a+n) mid a in mathbb{N} }$. The individual elements of each diagonal don't correspond to the different natural numbers; rather, each diagonal itself refers to a single natural number—the diagonal ${ (a,a+n) mid a in mathbb{N} }$ corresponds with the natural number $n$.
$endgroup$
– Clive Newstead
Dec 5 '18 at 16:22
|
show 4 more comments
$begingroup$
Yes (and the same argument goes for the other number sets).
Any construction of $mathbb{Z}$ comes equipped with an embedding $i : mathbb{N} hookrightarrow mathbb{Z}$, by letting $i(n)$ be '$n$ considered as an integer'.
Now define
$$mathbb{Z}' = mathbb{N} cup (mathbb{Z} setminus i[mathbb{N}])$$
where $i[mathbb{N}] = { i(n) mid n in mathbb{N} }$ is the image of $i : mathbb{N} hookrightarrow mathbb{Z}$.
Evidently $mathbb{N} subseteq mathbb{Z}'$ and the arithmetic operations of $mathbb{N}$ are preserved in $mathbb{Z}'$. And indeed, $mathbb{Z}'$ is a perfectly good 'set of integers', since there is an easy-to-define bijection $mathbb{Z}' to mathbb{Z}$ given by
$$n mapsto begin{cases} i(n) & text{if } n in mathbb{N} \ n & text{if } n in mathbb{Z} setminus i[mathbb{N}] end{cases}$$
[Slight caveat: if your construction of $mathbb{Z}$ already contains some natural numbers for whatever reason, replace $mathbb{Z} setminus i[mathbb{N}]$ by an isomorphic set that contains no natural numbers, such as $(mathbb{Z} setminus i[mathbb{N}]) times { 0 }$.]
$endgroup$
$begingroup$
I'm not sure the answers the question, since you're starting with "any construction of $Bbb{Z}$", and the question asks about starting with $Bbb{N}$.
$endgroup$
– dbx
Dec 4 '18 at 20:04
$begingroup$
@dbx: It does answer the question. The construction of $mathbb{Z}$ in the question takes $mathbb{Z}$ to be the quotient of $mathbb{N} times mathbb{N}$ by the equivalence relation $(a,b) sim (c,d) Leftrightarrow a+d=b+c$, and then the inclusion $i : mathbb{N} hookrightarrow mathbb{Z}$ is given by $i(n) = [(0,n)]$ for all $n in mathbb{N}$. This is one example of a construction of $mathbb{Z}$; my answer is saying that it doesn't matter what construction you pick. (So, in particular, my answer applies to the construction mentioned in the question.)
$endgroup$
– Clive Newstead
Dec 4 '18 at 21:00
$begingroup$
Although it answers the question, I am looking for something more elegant.
$endgroup$
– Dr Potato
Dec 4 '18 at 22:22
$begingroup$
@DrPotato: If you want to construct $mathbb{Z}$ from $mathbb{N}$ (with $mathbb{N}$ as a subset), all you really need is a way of encoding $-n$ for $n in mathbb{N}$. (This is assuming $0 in mathbb{N}$, of course.) So you could define $-n = (n,0)$ for $n>0$, and then $mathbb{Z} = mathbb{N} cup (mathbb{N}^+ times { 0 })$. I don't know if this qualifies as 'elegant' to you, but I'm not sure how much elegance you can expect to find in a set theoretic construction of $mathbb{Z}$ from $mathbb{N}$.
$endgroup$
– Clive Newstead
Dec 5 '18 at 2:37
1
$begingroup$
@dbx: Just to close this up, 'parallel diagonals' means sets of the form ${ (a,a+n) mid a in mathbb{N} }$. The individual elements of each diagonal don't correspond to the different natural numbers; rather, each diagonal itself refers to a single natural number—the diagonal ${ (a,a+n) mid a in mathbb{N} }$ corresponds with the natural number $n$.
$endgroup$
– Clive Newstead
Dec 5 '18 at 16:22
|
show 4 more comments
$begingroup$
Yes (and the same argument goes for the other number sets).
Any construction of $mathbb{Z}$ comes equipped with an embedding $i : mathbb{N} hookrightarrow mathbb{Z}$, by letting $i(n)$ be '$n$ considered as an integer'.
Now define
$$mathbb{Z}' = mathbb{N} cup (mathbb{Z} setminus i[mathbb{N}])$$
where $i[mathbb{N}] = { i(n) mid n in mathbb{N} }$ is the image of $i : mathbb{N} hookrightarrow mathbb{Z}$.
Evidently $mathbb{N} subseteq mathbb{Z}'$ and the arithmetic operations of $mathbb{N}$ are preserved in $mathbb{Z}'$. And indeed, $mathbb{Z}'$ is a perfectly good 'set of integers', since there is an easy-to-define bijection $mathbb{Z}' to mathbb{Z}$ given by
$$n mapsto begin{cases} i(n) & text{if } n in mathbb{N} \ n & text{if } n in mathbb{Z} setminus i[mathbb{N}] end{cases}$$
[Slight caveat: if your construction of $mathbb{Z}$ already contains some natural numbers for whatever reason, replace $mathbb{Z} setminus i[mathbb{N}]$ by an isomorphic set that contains no natural numbers, such as $(mathbb{Z} setminus i[mathbb{N}]) times { 0 }$.]
$endgroup$
Yes (and the same argument goes for the other number sets).
Any construction of $mathbb{Z}$ comes equipped with an embedding $i : mathbb{N} hookrightarrow mathbb{Z}$, by letting $i(n)$ be '$n$ considered as an integer'.
Now define
$$mathbb{Z}' = mathbb{N} cup (mathbb{Z} setminus i[mathbb{N}])$$
where $i[mathbb{N}] = { i(n) mid n in mathbb{N} }$ is the image of $i : mathbb{N} hookrightarrow mathbb{Z}$.
Evidently $mathbb{N} subseteq mathbb{Z}'$ and the arithmetic operations of $mathbb{N}$ are preserved in $mathbb{Z}'$. And indeed, $mathbb{Z}'$ is a perfectly good 'set of integers', since there is an easy-to-define bijection $mathbb{Z}' to mathbb{Z}$ given by
$$n mapsto begin{cases} i(n) & text{if } n in mathbb{N} \ n & text{if } n in mathbb{Z} setminus i[mathbb{N}] end{cases}$$
[Slight caveat: if your construction of $mathbb{Z}$ already contains some natural numbers for whatever reason, replace $mathbb{Z} setminus i[mathbb{N}]$ by an isomorphic set that contains no natural numbers, such as $(mathbb{Z} setminus i[mathbb{N}]) times { 0 }$.]
edited Dec 4 '18 at 19:59
answered Dec 4 '18 at 19:54
Clive NewsteadClive Newstead
51.3k474135
51.3k474135
$begingroup$
I'm not sure the answers the question, since you're starting with "any construction of $Bbb{Z}$", and the question asks about starting with $Bbb{N}$.
$endgroup$
– dbx
Dec 4 '18 at 20:04
$begingroup$
@dbx: It does answer the question. The construction of $mathbb{Z}$ in the question takes $mathbb{Z}$ to be the quotient of $mathbb{N} times mathbb{N}$ by the equivalence relation $(a,b) sim (c,d) Leftrightarrow a+d=b+c$, and then the inclusion $i : mathbb{N} hookrightarrow mathbb{Z}$ is given by $i(n) = [(0,n)]$ for all $n in mathbb{N}$. This is one example of a construction of $mathbb{Z}$; my answer is saying that it doesn't matter what construction you pick. (So, in particular, my answer applies to the construction mentioned in the question.)
$endgroup$
– Clive Newstead
Dec 4 '18 at 21:00
$begingroup$
Although it answers the question, I am looking for something more elegant.
$endgroup$
– Dr Potato
Dec 4 '18 at 22:22
$begingroup$
@DrPotato: If you want to construct $mathbb{Z}$ from $mathbb{N}$ (with $mathbb{N}$ as a subset), all you really need is a way of encoding $-n$ for $n in mathbb{N}$. (This is assuming $0 in mathbb{N}$, of course.) So you could define $-n = (n,0)$ for $n>0$, and then $mathbb{Z} = mathbb{N} cup (mathbb{N}^+ times { 0 })$. I don't know if this qualifies as 'elegant' to you, but I'm not sure how much elegance you can expect to find in a set theoretic construction of $mathbb{Z}$ from $mathbb{N}$.
$endgroup$
– Clive Newstead
Dec 5 '18 at 2:37
1
$begingroup$
@dbx: Just to close this up, 'parallel diagonals' means sets of the form ${ (a,a+n) mid a in mathbb{N} }$. The individual elements of each diagonal don't correspond to the different natural numbers; rather, each diagonal itself refers to a single natural number—the diagonal ${ (a,a+n) mid a in mathbb{N} }$ corresponds with the natural number $n$.
$endgroup$
– Clive Newstead
Dec 5 '18 at 16:22
|
show 4 more comments
$begingroup$
I'm not sure the answers the question, since you're starting with "any construction of $Bbb{Z}$", and the question asks about starting with $Bbb{N}$.
$endgroup$
– dbx
Dec 4 '18 at 20:04
$begingroup$
@dbx: It does answer the question. The construction of $mathbb{Z}$ in the question takes $mathbb{Z}$ to be the quotient of $mathbb{N} times mathbb{N}$ by the equivalence relation $(a,b) sim (c,d) Leftrightarrow a+d=b+c$, and then the inclusion $i : mathbb{N} hookrightarrow mathbb{Z}$ is given by $i(n) = [(0,n)]$ for all $n in mathbb{N}$. This is one example of a construction of $mathbb{Z}$; my answer is saying that it doesn't matter what construction you pick. (So, in particular, my answer applies to the construction mentioned in the question.)
$endgroup$
– Clive Newstead
Dec 4 '18 at 21:00
$begingroup$
Although it answers the question, I am looking for something more elegant.
$endgroup$
– Dr Potato
Dec 4 '18 at 22:22
$begingroup$
@DrPotato: If you want to construct $mathbb{Z}$ from $mathbb{N}$ (with $mathbb{N}$ as a subset), all you really need is a way of encoding $-n$ for $n in mathbb{N}$. (This is assuming $0 in mathbb{N}$, of course.) So you could define $-n = (n,0)$ for $n>0$, and then $mathbb{Z} = mathbb{N} cup (mathbb{N}^+ times { 0 })$. I don't know if this qualifies as 'elegant' to you, but I'm not sure how much elegance you can expect to find in a set theoretic construction of $mathbb{Z}$ from $mathbb{N}$.
$endgroup$
– Clive Newstead
Dec 5 '18 at 2:37
1
$begingroup$
@dbx: Just to close this up, 'parallel diagonals' means sets of the form ${ (a,a+n) mid a in mathbb{N} }$. The individual elements of each diagonal don't correspond to the different natural numbers; rather, each diagonal itself refers to a single natural number—the diagonal ${ (a,a+n) mid a in mathbb{N} }$ corresponds with the natural number $n$.
$endgroup$
– Clive Newstead
Dec 5 '18 at 16:22
$begingroup$
I'm not sure the answers the question, since you're starting with "any construction of $Bbb{Z}$", and the question asks about starting with $Bbb{N}$.
$endgroup$
– dbx
Dec 4 '18 at 20:04
$begingroup$
I'm not sure the answers the question, since you're starting with "any construction of $Bbb{Z}$", and the question asks about starting with $Bbb{N}$.
$endgroup$
– dbx
Dec 4 '18 at 20:04
$begingroup$
@dbx: It does answer the question. The construction of $mathbb{Z}$ in the question takes $mathbb{Z}$ to be the quotient of $mathbb{N} times mathbb{N}$ by the equivalence relation $(a,b) sim (c,d) Leftrightarrow a+d=b+c$, and then the inclusion $i : mathbb{N} hookrightarrow mathbb{Z}$ is given by $i(n) = [(0,n)]$ for all $n in mathbb{N}$. This is one example of a construction of $mathbb{Z}$; my answer is saying that it doesn't matter what construction you pick. (So, in particular, my answer applies to the construction mentioned in the question.)
$endgroup$
– Clive Newstead
Dec 4 '18 at 21:00
$begingroup$
@dbx: It does answer the question. The construction of $mathbb{Z}$ in the question takes $mathbb{Z}$ to be the quotient of $mathbb{N} times mathbb{N}$ by the equivalence relation $(a,b) sim (c,d) Leftrightarrow a+d=b+c$, and then the inclusion $i : mathbb{N} hookrightarrow mathbb{Z}$ is given by $i(n) = [(0,n)]$ for all $n in mathbb{N}$. This is one example of a construction of $mathbb{Z}$; my answer is saying that it doesn't matter what construction you pick. (So, in particular, my answer applies to the construction mentioned in the question.)
$endgroup$
– Clive Newstead
Dec 4 '18 at 21:00
$begingroup$
Although it answers the question, I am looking for something more elegant.
$endgroup$
– Dr Potato
Dec 4 '18 at 22:22
$begingroup$
Although it answers the question, I am looking for something more elegant.
$endgroup$
– Dr Potato
Dec 4 '18 at 22:22
$begingroup$
@DrPotato: If you want to construct $mathbb{Z}$ from $mathbb{N}$ (with $mathbb{N}$ as a subset), all you really need is a way of encoding $-n$ for $n in mathbb{N}$. (This is assuming $0 in mathbb{N}$, of course.) So you could define $-n = (n,0)$ for $n>0$, and then $mathbb{Z} = mathbb{N} cup (mathbb{N}^+ times { 0 })$. I don't know if this qualifies as 'elegant' to you, but I'm not sure how much elegance you can expect to find in a set theoretic construction of $mathbb{Z}$ from $mathbb{N}$.
$endgroup$
– Clive Newstead
Dec 5 '18 at 2:37
$begingroup$
@DrPotato: If you want to construct $mathbb{Z}$ from $mathbb{N}$ (with $mathbb{N}$ as a subset), all you really need is a way of encoding $-n$ for $n in mathbb{N}$. (This is assuming $0 in mathbb{N}$, of course.) So you could define $-n = (n,0)$ for $n>0$, and then $mathbb{Z} = mathbb{N} cup (mathbb{N}^+ times { 0 })$. I don't know if this qualifies as 'elegant' to you, but I'm not sure how much elegance you can expect to find in a set theoretic construction of $mathbb{Z}$ from $mathbb{N}$.
$endgroup$
– Clive Newstead
Dec 5 '18 at 2:37
1
1
$begingroup$
@dbx: Just to close this up, 'parallel diagonals' means sets of the form ${ (a,a+n) mid a in mathbb{N} }$. The individual elements of each diagonal don't correspond to the different natural numbers; rather, each diagonal itself refers to a single natural number—the diagonal ${ (a,a+n) mid a in mathbb{N} }$ corresponds with the natural number $n$.
$endgroup$
– Clive Newstead
Dec 5 '18 at 16:22
$begingroup$
@dbx: Just to close this up, 'parallel diagonals' means sets of the form ${ (a,a+n) mid a in mathbb{N} }$. The individual elements of each diagonal don't correspond to the different natural numbers; rather, each diagonal itself refers to a single natural number—the diagonal ${ (a,a+n) mid a in mathbb{N} }$ corresponds with the natural number $n$.
$endgroup$
– Clive Newstead
Dec 5 '18 at 16:22
|
show 4 more comments
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%2f3026062%2fnatural-numbers-as-a-subset-of-integer-numbers-mathbbn-subset-mathbbz%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