Intersection of ideals of $mathbb{Z}$
$begingroup$
Let $R=mathbb{Z}$, and let $p$ a fixed prime. We condiser $$bigcap_{kge 1} (p^k).$$
I know that this intersection is empty for the Foundamental Theorem, but How can I properly formalize the proof?
Thanks
proof-verification proof-explanation
$endgroup$
add a comment |
$begingroup$
Let $R=mathbb{Z}$, and let $p$ a fixed prime. We condiser $$bigcap_{kge 1} (p^k).$$
I know that this intersection is empty for the Foundamental Theorem, but How can I properly formalize the proof?
Thanks
proof-verification proof-explanation
$endgroup$
1
$begingroup$
The intersection isn't empty but is the zero ideal. The integers in the intersection are those integers that are divisible by all powers of $p$. But any nonzero integer has a highest power of $p$ that divides it, as follows from unique prime factorization. So this intersection doesn't contain nonzero elements, and hence is $=(0)={0}$.
$endgroup$
– Olivier Bégassat
Dec 4 '18 at 17:55
$begingroup$
Thanks for your answer. The theorem of unique factorization is it also true for negative integer?
$endgroup$
– Jack J.
Dec 4 '18 at 18:01
$begingroup$
First of all the intersection is an ideal. If it is not $(0)$, then it contains a minimal positive integer. But $p^ktoinfty$ gives a contradiction.
$endgroup$
– dan_fulea
Dec 4 '18 at 18:22
$begingroup$
Thanks for your answer. But I would like a proof to consider the unique factorization theorem.
$endgroup$
– Jack J.
Dec 4 '18 at 19:08
add a comment |
$begingroup$
Let $R=mathbb{Z}$, and let $p$ a fixed prime. We condiser $$bigcap_{kge 1} (p^k).$$
I know that this intersection is empty for the Foundamental Theorem, but How can I properly formalize the proof?
Thanks
proof-verification proof-explanation
$endgroup$
Let $R=mathbb{Z}$, and let $p$ a fixed prime. We condiser $$bigcap_{kge 1} (p^k).$$
I know that this intersection is empty for the Foundamental Theorem, but How can I properly formalize the proof?
Thanks
proof-verification proof-explanation
proof-verification proof-explanation
asked Dec 4 '18 at 17:52
Jack J.Jack J.
4392419
4392419
1
$begingroup$
The intersection isn't empty but is the zero ideal. The integers in the intersection are those integers that are divisible by all powers of $p$. But any nonzero integer has a highest power of $p$ that divides it, as follows from unique prime factorization. So this intersection doesn't contain nonzero elements, and hence is $=(0)={0}$.
$endgroup$
– Olivier Bégassat
Dec 4 '18 at 17:55
$begingroup$
Thanks for your answer. The theorem of unique factorization is it also true for negative integer?
$endgroup$
– Jack J.
Dec 4 '18 at 18:01
$begingroup$
First of all the intersection is an ideal. If it is not $(0)$, then it contains a minimal positive integer. But $p^ktoinfty$ gives a contradiction.
$endgroup$
– dan_fulea
Dec 4 '18 at 18:22
$begingroup$
Thanks for your answer. But I would like a proof to consider the unique factorization theorem.
$endgroup$
– Jack J.
Dec 4 '18 at 19:08
add a comment |
1
$begingroup$
The intersection isn't empty but is the zero ideal. The integers in the intersection are those integers that are divisible by all powers of $p$. But any nonzero integer has a highest power of $p$ that divides it, as follows from unique prime factorization. So this intersection doesn't contain nonzero elements, and hence is $=(0)={0}$.
$endgroup$
– Olivier Bégassat
Dec 4 '18 at 17:55
$begingroup$
Thanks for your answer. The theorem of unique factorization is it also true for negative integer?
$endgroup$
– Jack J.
Dec 4 '18 at 18:01
$begingroup$
First of all the intersection is an ideal. If it is not $(0)$, then it contains a minimal positive integer. But $p^ktoinfty$ gives a contradiction.
$endgroup$
– dan_fulea
Dec 4 '18 at 18:22
$begingroup$
Thanks for your answer. But I would like a proof to consider the unique factorization theorem.
$endgroup$
– Jack J.
Dec 4 '18 at 19:08
1
1
$begingroup$
The intersection isn't empty but is the zero ideal. The integers in the intersection are those integers that are divisible by all powers of $p$. But any nonzero integer has a highest power of $p$ that divides it, as follows from unique prime factorization. So this intersection doesn't contain nonzero elements, and hence is $=(0)={0}$.
$endgroup$
– Olivier Bégassat
Dec 4 '18 at 17:55
$begingroup$
The intersection isn't empty but is the zero ideal. The integers in the intersection are those integers that are divisible by all powers of $p$. But any nonzero integer has a highest power of $p$ that divides it, as follows from unique prime factorization. So this intersection doesn't contain nonzero elements, and hence is $=(0)={0}$.
$endgroup$
– Olivier Bégassat
Dec 4 '18 at 17:55
$begingroup$
Thanks for your answer. The theorem of unique factorization is it also true for negative integer?
$endgroup$
– Jack J.
Dec 4 '18 at 18:01
$begingroup$
Thanks for your answer. The theorem of unique factorization is it also true for negative integer?
$endgroup$
– Jack J.
Dec 4 '18 at 18:01
$begingroup$
First of all the intersection is an ideal. If it is not $(0)$, then it contains a minimal positive integer. But $p^ktoinfty$ gives a contradiction.
$endgroup$
– dan_fulea
Dec 4 '18 at 18:22
$begingroup$
First of all the intersection is an ideal. If it is not $(0)$, then it contains a minimal positive integer. But $p^ktoinfty$ gives a contradiction.
$endgroup$
– dan_fulea
Dec 4 '18 at 18:22
$begingroup$
Thanks for your answer. But I would like a proof to consider the unique factorization theorem.
$endgroup$
– Jack J.
Dec 4 '18 at 19:08
$begingroup$
Thanks for your answer. But I would like a proof to consider the unique factorization theorem.
$endgroup$
– Jack J.
Dec 4 '18 at 19:08
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Follows what I would consider a more-or-less formal proof of the assertion than $bigcap_{k ge 1} (p^k) = {0}$, where $p in Bbb P$ is a prime:
If
$displaystyle bigcap_{kge 1} (p^k) ne {0}, tag 1$
then
$exists 0 ne z in Bbb Z, ; z in displaystyle bigcap_{k ge 1} (p^k), tag 2$
and since $bigcap_{k ge 1} (p^k)$ is an ideal,
$z in displaystyle bigcap_{k ge 1} (p^k) Longleftrightarrow -z in displaystyle bigcap_{k ge 1} (p^k); tag 3$
thus we may assume
$z > 0; tag 4$
now by (2) we have
$forall k ge 1, ; z in (p^k); tag 5$
then
$forall k ge 1 ; exists 0 < m_k in Bbb Z, z = m_k p^k; tag 6$
we observe that if $z ne 0$ then this forces $z > 1$; however, then this contradicts the fundamental theorem of arithmetic, which asserts that the prime factorization of every positive integer is unique. We thus conclude that (1) is false, i.e. that
$displaystyle bigcap_{kge 1} (p^k) = {0}. tag 7$
$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%2f3025895%2fintersection-of-ideals-of-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$
Follows what I would consider a more-or-less formal proof of the assertion than $bigcap_{k ge 1} (p^k) = {0}$, where $p in Bbb P$ is a prime:
If
$displaystyle bigcap_{kge 1} (p^k) ne {0}, tag 1$
then
$exists 0 ne z in Bbb Z, ; z in displaystyle bigcap_{k ge 1} (p^k), tag 2$
and since $bigcap_{k ge 1} (p^k)$ is an ideal,
$z in displaystyle bigcap_{k ge 1} (p^k) Longleftrightarrow -z in displaystyle bigcap_{k ge 1} (p^k); tag 3$
thus we may assume
$z > 0; tag 4$
now by (2) we have
$forall k ge 1, ; z in (p^k); tag 5$
then
$forall k ge 1 ; exists 0 < m_k in Bbb Z, z = m_k p^k; tag 6$
we observe that if $z ne 0$ then this forces $z > 1$; however, then this contradicts the fundamental theorem of arithmetic, which asserts that the prime factorization of every positive integer is unique. We thus conclude that (1) is false, i.e. that
$displaystyle bigcap_{kge 1} (p^k) = {0}. tag 7$
$endgroup$
add a comment |
$begingroup$
Follows what I would consider a more-or-less formal proof of the assertion than $bigcap_{k ge 1} (p^k) = {0}$, where $p in Bbb P$ is a prime:
If
$displaystyle bigcap_{kge 1} (p^k) ne {0}, tag 1$
then
$exists 0 ne z in Bbb Z, ; z in displaystyle bigcap_{k ge 1} (p^k), tag 2$
and since $bigcap_{k ge 1} (p^k)$ is an ideal,
$z in displaystyle bigcap_{k ge 1} (p^k) Longleftrightarrow -z in displaystyle bigcap_{k ge 1} (p^k); tag 3$
thus we may assume
$z > 0; tag 4$
now by (2) we have
$forall k ge 1, ; z in (p^k); tag 5$
then
$forall k ge 1 ; exists 0 < m_k in Bbb Z, z = m_k p^k; tag 6$
we observe that if $z ne 0$ then this forces $z > 1$; however, then this contradicts the fundamental theorem of arithmetic, which asserts that the prime factorization of every positive integer is unique. We thus conclude that (1) is false, i.e. that
$displaystyle bigcap_{kge 1} (p^k) = {0}. tag 7$
$endgroup$
add a comment |
$begingroup$
Follows what I would consider a more-or-less formal proof of the assertion than $bigcap_{k ge 1} (p^k) = {0}$, where $p in Bbb P$ is a prime:
If
$displaystyle bigcap_{kge 1} (p^k) ne {0}, tag 1$
then
$exists 0 ne z in Bbb Z, ; z in displaystyle bigcap_{k ge 1} (p^k), tag 2$
and since $bigcap_{k ge 1} (p^k)$ is an ideal,
$z in displaystyle bigcap_{k ge 1} (p^k) Longleftrightarrow -z in displaystyle bigcap_{k ge 1} (p^k); tag 3$
thus we may assume
$z > 0; tag 4$
now by (2) we have
$forall k ge 1, ; z in (p^k); tag 5$
then
$forall k ge 1 ; exists 0 < m_k in Bbb Z, z = m_k p^k; tag 6$
we observe that if $z ne 0$ then this forces $z > 1$; however, then this contradicts the fundamental theorem of arithmetic, which asserts that the prime factorization of every positive integer is unique. We thus conclude that (1) is false, i.e. that
$displaystyle bigcap_{kge 1} (p^k) = {0}. tag 7$
$endgroup$
Follows what I would consider a more-or-less formal proof of the assertion than $bigcap_{k ge 1} (p^k) = {0}$, where $p in Bbb P$ is a prime:
If
$displaystyle bigcap_{kge 1} (p^k) ne {0}, tag 1$
then
$exists 0 ne z in Bbb Z, ; z in displaystyle bigcap_{k ge 1} (p^k), tag 2$
and since $bigcap_{k ge 1} (p^k)$ is an ideal,
$z in displaystyle bigcap_{k ge 1} (p^k) Longleftrightarrow -z in displaystyle bigcap_{k ge 1} (p^k); tag 3$
thus we may assume
$z > 0; tag 4$
now by (2) we have
$forall k ge 1, ; z in (p^k); tag 5$
then
$forall k ge 1 ; exists 0 < m_k in Bbb Z, z = m_k p^k; tag 6$
we observe that if $z ne 0$ then this forces $z > 1$; however, then this contradicts the fundamental theorem of arithmetic, which asserts that the prime factorization of every positive integer is unique. We thus conclude that (1) is false, i.e. that
$displaystyle bigcap_{kge 1} (p^k) = {0}. tag 7$
answered Dec 4 '18 at 19:17
Robert LewisRobert Lewis
45.6k23065
45.6k23065
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%2f3025895%2fintersection-of-ideals-of-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
1
$begingroup$
The intersection isn't empty but is the zero ideal. The integers in the intersection are those integers that are divisible by all powers of $p$. But any nonzero integer has a highest power of $p$ that divides it, as follows from unique prime factorization. So this intersection doesn't contain nonzero elements, and hence is $=(0)={0}$.
$endgroup$
– Olivier Bégassat
Dec 4 '18 at 17:55
$begingroup$
Thanks for your answer. The theorem of unique factorization is it also true for negative integer?
$endgroup$
– Jack J.
Dec 4 '18 at 18:01
$begingroup$
First of all the intersection is an ideal. If it is not $(0)$, then it contains a minimal positive integer. But $p^ktoinfty$ gives a contradiction.
$endgroup$
– dan_fulea
Dec 4 '18 at 18:22
$begingroup$
Thanks for your answer. But I would like a proof to consider the unique factorization theorem.
$endgroup$
– Jack J.
Dec 4 '18 at 19:08