Mixing
![How do I center a form in a navbar? [duplicate]](https://lh6.googleusercontent.com/-KPd7vRPqy8A/AAAAAAAAAAI/AAAAAAAAABU/gaL6F6GKWPY/s72-c/photo.jpg?sz=32)
Step in proof of Structure Theorem for finitely generated modules over a PID
$begingroup$
I'm looking for help with problem #6 on page 189 of Jacobson's "Basic Algebra I". In particular, we suppose $D$ is a PID and $M$ is a finitely generated module over $D$ with generators $x_1, ... x_n$. Furthermore, we specify these generators have minimal $n$ and that $l(x_1)$ is minimal among generating sets with $n$ members. ($l(x)$ is defined to be number of primes in the factorization of $a in D$ where $text{ann}(x) = (a)$. If $a=0$ then we define $l(a) = infty$.)
Define $N := sum_{j ge 2}{Dx_j}$. The problem claims "To show $text{ann}(x_1) supset text{ann}(y)$ for $y in N$ it suffices to prove $text{ann}(x_1) supset text{ann}(x_j), j ge 2$". Can someone clarify for me why this is sufficient?
abstract-algebra modules principal-ideal-domains
asked Jan 4 at 0:52
Jeremiah GoertzJeremiah Goertz
313
$endgroup$
add a comment |
$begingroup$
I'm looking for help with problem #6 on page 189 of Jacobson's "Basic Algebra I". In particular, we suppose $D$ is a PID and $M$ is a finitely generated module over $D$ with generators $x_1, ... x_n$. Furthermore, we specify these generators have minimal $n$ and that $l(x_1)$ is minimal among generating sets with $n$ members. ($l(x)$ is defined to be number of primes in the factorization of $a in D$ where $text{ann}(x) = (a)$. If $a=0$ then we define $l(a) = infty$.)
Define $N := sum_{j ge 2}{Dx_j}$. The problem claims "To show $text{ann}(x_1) supset text{ann}(y)$ for $y in N$ it suffices to prove $text{ann}(x_1) supset text{ann}(x_j), j ge 2$". Can someone clarify for me why this is sufficient?
abstract-algebra modules principal-ideal-domains
asked Jan 4 at 0:52
Jeremiah GoertzJeremiah Goertz
313
$endgroup$
$begingroup$
If $din D$ kills $yin N$, then from the decomposition of $M$ into $Dx_j$'s $d$ must kill each component of $y$ in $Dx_j$. So it suffices to show that any $d$ killing $x_j$ kills $x_1$, which is the claim.
$endgroup$
– cjackal
Jan 4 at 2:31
$begingroup$
The "d must kill each component of y" isn't obvious. As stated in question's title, this is part of the proof of the structure theorem, so we can't assume the decomposition that theorem provides
$endgroup$
– Jeremiah Goertz
Jan 4 at 18:09
$begingroup$
(I.e., we can't assume the sum is direct, so it isn't immediate that $d$ must kill each component of $y$ in order to kill $y$.)
$endgroup$
– Jeremiah Goertz
Jan 5 at 12:22
add a comment |
$begingroup$
I'm looking for help with problem #6 on page 189 of Jacobson's "Basic Algebra I". In particular, we suppose $D$ is a PID and $M$ is a finitely generated module over $D$ with generators $x_1, ... x_n$. Furthermore, we specify these generators have minimal $n$ and that $l(x_1)$ is minimal among generating sets with $n$ members. ($l(x)$ is defined to be number of primes in the factorization of $a in D$ where $text{ann}(x) = (a)$. If $a=0$ then we define $l(a) = infty$.)
Define $N := sum_{j ge 2}{Dx_j}$. The problem claims "To show $text{ann}(x_1) supset text{ann}(y)$ for $y in N$ it suffices to prove $text{ann}(x_1) supset text{ann}(x_j), j ge 2$". Can someone clarify for me why this is sufficient?
abstract-algebra modules principal-ideal-domains
asked Jan 4 at 0:52
Jeremiah GoertzJeremiah Goertz
313
$endgroup$
I'm looking for help with problem #6 on page 189 of Jacobson's "Basic Algebra I". In particular, we suppose $D$ is a PID and $M$ is a finitely generated module over $D$ with generators $x_1, ... x_n$. Furthermore, we specify these generators have minimal $n$ and that $l(x_1)$ is minimal among generating sets with $n$ members. ($l(x)$ is defined to be number of primes in the factorization of $a in D$ where $text{ann}(x) = (a)$. If $a=0$ then we define $l(a) = infty$.)
Define $N := sum_{j ge 2}{Dx_j}$. The problem claims "To show $text{ann}(x_1) supset text{ann}(y)$ for $y in N$ it suffices to prove $text{ann}(x_1) supset text{ann}(x_j), j ge 2$". Can someone clarify for me why this is sufficient?
abstract-algebra modules principal-ideal-domains
abstract-algebra modules principal-ideal-domains
asked Jan 4 at 0:52
Jeremiah GoertzJeremiah Goertz
313
asked Jan 4 at 0:52
Jeremiah GoertzJeremiah Goertz
313
edited Jan 5 at 12:24
Jeremiah Goertz
asked Jan 4 at 0:52
Jeremiah GoertzJeremiah Goertz
313
asked Jan 4 at 0:52
Jeremiah GoertzJeremiah Goertz
313
asked Jan 4 at 0:52
Jeremiah GoertzJeremiah Goertz
313
313
$begingroup$
If $din D$ kills $yin N$, then from the decomposition of $M$ into $Dx_j$'s $d$ must kill each component of $y$ in $Dx_j$. So it suffices to show that any $d$ killing $x_j$ kills $x_1$, which is the claim.
$endgroup$
– cjackal
Jan 4 at 2:31
$begingroup$
The "d must kill each component of y" isn't obvious. As stated in question's title, this is part of the proof of the structure theorem, so we can't assume the decomposition that theorem provides
$endgroup$
– Jeremiah Goertz
Jan 4 at 18:09
$begingroup$
(I.e., we can't assume the sum is direct, so it isn't immediate that $d$ must kill each component of $y$ in order to kill $y$.)
$endgroup$
– Jeremiah Goertz
Jan 5 at 12:22
add a comment |
$begingroup$
If $din D$ kills $yin N$, then from the decomposition of $M$ into $Dx_j$'s $d$ must kill each component of $y$ in $Dx_j$. So it suffices to show that any $d$ killing $x_j$ kills $x_1$, which is the claim.
$endgroup$
– cjackal
Jan 4 at 2:31
$begingroup$
The "d must kill each component of y" isn't obvious. As stated in question's title, this is part of the proof of the structure theorem, so we can't assume the decomposition that theorem provides
$endgroup$
– Jeremiah Goertz
Jan 4 at 18:09
$begingroup$
(I.e., we can't assume the sum is direct, so it isn't immediate that $d$ must kill each component of $y$ in order to kill $y$.)
$endgroup$
– Jeremiah Goertz
Jan 5 at 12:22
$begingroup$
If $din D$ kills $yin N$, then from the decomposition of $M$ into $Dx_j$'s $d$ must kill each component of $y$ in $Dx_j$. So it suffices to show that any $d$ killing $x_j$ kills $x_1$, which is the claim.
$endgroup$
– cjackal
Jan 4 at 2:31
$begingroup$
If $din D$ kills $yin N$, then from the decomposition of $M$ into $Dx_j$'s $d$ must kill each component of $y$ in $Dx_j$. So it suffices to show that any $d$ killing $x_j$ kills $x_1$, which is the claim.
$endgroup$
– cjackal
Jan 4 at 2:31
$begingroup$
The "d must kill each component of y" isn't obvious. As stated in question's title, this is part of the proof of the structure theorem, so we can't assume the decomposition that theorem provides
$endgroup$
– Jeremiah Goertz
Jan 4 at 18:09
$begingroup$
The "d must kill each component of y" isn't obvious. As stated in question's title, this is part of the proof of the structure theorem, so we can't assume the decomposition that theorem provides
$endgroup$
– Jeremiah Goertz
Jan 4 at 18:09
$begingroup$
(I.e., we can't assume the sum is direct, so it isn't immediate that $d$ must kill each component of $y$ in order to kill $y$.)
$endgroup$
– Jeremiah Goertz
Jan 5 at 12:22
$begingroup$
(I.e., we can't assume the sum is direct, so it isn't immediate that $d$ must kill each component of $y$ in order to kill $y$.)
$endgroup$
– Jeremiah Goertz
Jan 5 at 12:22
add a comment |
0
active
oldest
votes
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%2f3061201%2fstep-in-proof-of-structure-theorem-for-finitely-generated-modules-over-a-pid%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3061201%2fstep-in-proof-of-structure-theorem-for-finitely-generated-modules-over-a-pid%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$
If $din D$ kills $yin N$, then from the decomposition of $M$ into $Dx_j$'s $d$ must kill each component of $y$ in $Dx_j$. So it suffices to show that any $d$ killing $x_j$ kills $x_1$, which is the claim.
$endgroup$
– cjackal
Jan 4 at 2:31
$begingroup$
The "d must kill each component of y" isn't obvious. As stated in question's title, this is part of the proof of the structure theorem, so we can't assume the decomposition that theorem provides
$endgroup$
– Jeremiah Goertz
Jan 4 at 18:09
$begingroup$
(I.e., we can't assume the sum is direct, so it isn't immediate that $d$ must kill each component of $y$ in order to kill $y$.)
$endgroup$
– Jeremiah Goertz
Jan 5 at 12:22