Show that the algebraic extension $K(alpha,beta)/K$ is simple if $alpha$ is separable over $K$
$begingroup$
Let $L=K(alpha,beta)$ be an algebraic field extension, with $alpha$ separable over K.
Show that $L/K$ is simple.
My attempt:
If we could show that $L/K$ is finite and separable then the claim would follow by the primitive element theorem.
Since $L/K$ is algebraic and finitely generated, it is a finite extension.
Since $alpha$ is separable the minimal polynomial of $alpha$ in $overline{K}$ is of the form:
$m_{alpha}(X)=(X-alpha_1)(X-alpha_2)cdot....cdot(X-alpha_n)$ with pairwise distinct $alpha_i$ and $alpha=alpha_i$ for one $i$.
Then $f_{alpha,beta}(X)=(X-alpha_1)(X-alpha_2)cdot....cdot(X-alpha_n)cdot(X-beta)$ is a separable polynomial with $f_{alpha,beta}(beta)=0$, hence $beta$ is also separable. The conclusion follows because then $K(alpha,beta)$ is separable, since it's generated by separable elements.
Can someone go through it? I also have some questions about the proof:
- Our definition of a separable element $alpha$ is: the minimal polynomial of $alpha$ is separable. In the proof above I used that $alpha$ is separable because there exists a polynomial $f$ with $f(alpha)=0$. Are these two characterizations equivalent?
$(Leftarrow)$ If $f$ is separable with $f(alpha)=0$ then $m_alphacdot g=f$, hence $m_alpha$ can't have a multiple zero, because of the degrees.
But how does the other direction work?
- The polynomial $f$ in the proof: is it already the minimal polynomial of $beta$? If yes, why?
Thanks a lot!
abstract-algebra proof-verification field-theory extension-field
$endgroup$
add a comment |
$begingroup$
Let $L=K(alpha,beta)$ be an algebraic field extension, with $alpha$ separable over K.
Show that $L/K$ is simple.
My attempt:
If we could show that $L/K$ is finite and separable then the claim would follow by the primitive element theorem.
Since $L/K$ is algebraic and finitely generated, it is a finite extension.
Since $alpha$ is separable the minimal polynomial of $alpha$ in $overline{K}$ is of the form:
$m_{alpha}(X)=(X-alpha_1)(X-alpha_2)cdot....cdot(X-alpha_n)$ with pairwise distinct $alpha_i$ and $alpha=alpha_i$ for one $i$.
Then $f_{alpha,beta}(X)=(X-alpha_1)(X-alpha_2)cdot....cdot(X-alpha_n)cdot(X-beta)$ is a separable polynomial with $f_{alpha,beta}(beta)=0$, hence $beta$ is also separable. The conclusion follows because then $K(alpha,beta)$ is separable, since it's generated by separable elements.
Can someone go through it? I also have some questions about the proof:
- Our definition of a separable element $alpha$ is: the minimal polynomial of $alpha$ is separable. In the proof above I used that $alpha$ is separable because there exists a polynomial $f$ with $f(alpha)=0$. Are these two characterizations equivalent?
$(Leftarrow)$ If $f$ is separable with $f(alpha)=0$ then $m_alphacdot g=f$, hence $m_alpha$ can't have a multiple zero, because of the degrees.
But how does the other direction work?
- The polynomial $f$ in the proof: is it already the minimal polynomial of $beta$? If yes, why?
Thanks a lot!
abstract-algebra proof-verification field-theory extension-field
$endgroup$
2
$begingroup$
$beta$ doesn't have to be separable. Your polynomial $f_{alpha,beta}(X)=m_{alpha,K}(X)(X-beta)$ is not in $K[X]$, if $betanotin K$. Hence it is not minimal polynomial of $beta$ over $K$. You can find the proof here: math.cornell.edu/~kbrown/6310/primitive.pdf
$endgroup$
– SMM
Jan 17 '15 at 18:53
add a comment |
$begingroup$
Let $L=K(alpha,beta)$ be an algebraic field extension, with $alpha$ separable over K.
Show that $L/K$ is simple.
My attempt:
If we could show that $L/K$ is finite and separable then the claim would follow by the primitive element theorem.
Since $L/K$ is algebraic and finitely generated, it is a finite extension.
Since $alpha$ is separable the minimal polynomial of $alpha$ in $overline{K}$ is of the form:
$m_{alpha}(X)=(X-alpha_1)(X-alpha_2)cdot....cdot(X-alpha_n)$ with pairwise distinct $alpha_i$ and $alpha=alpha_i$ for one $i$.
Then $f_{alpha,beta}(X)=(X-alpha_1)(X-alpha_2)cdot....cdot(X-alpha_n)cdot(X-beta)$ is a separable polynomial with $f_{alpha,beta}(beta)=0$, hence $beta$ is also separable. The conclusion follows because then $K(alpha,beta)$ is separable, since it's generated by separable elements.
Can someone go through it? I also have some questions about the proof:
- Our definition of a separable element $alpha$ is: the minimal polynomial of $alpha$ is separable. In the proof above I used that $alpha$ is separable because there exists a polynomial $f$ with $f(alpha)=0$. Are these two characterizations equivalent?
$(Leftarrow)$ If $f$ is separable with $f(alpha)=0$ then $m_alphacdot g=f$, hence $m_alpha$ can't have a multiple zero, because of the degrees.
But how does the other direction work?
- The polynomial $f$ in the proof: is it already the minimal polynomial of $beta$? If yes, why?
Thanks a lot!
abstract-algebra proof-verification field-theory extension-field
$endgroup$
Let $L=K(alpha,beta)$ be an algebraic field extension, with $alpha$ separable over K.
Show that $L/K$ is simple.
My attempt:
If we could show that $L/K$ is finite and separable then the claim would follow by the primitive element theorem.
Since $L/K$ is algebraic and finitely generated, it is a finite extension.
Since $alpha$ is separable the minimal polynomial of $alpha$ in $overline{K}$ is of the form:
$m_{alpha}(X)=(X-alpha_1)(X-alpha_2)cdot....cdot(X-alpha_n)$ with pairwise distinct $alpha_i$ and $alpha=alpha_i$ for one $i$.
Then $f_{alpha,beta}(X)=(X-alpha_1)(X-alpha_2)cdot....cdot(X-alpha_n)cdot(X-beta)$ is a separable polynomial with $f_{alpha,beta}(beta)=0$, hence $beta$ is also separable. The conclusion follows because then $K(alpha,beta)$ is separable, since it's generated by separable elements.
Can someone go through it? I also have some questions about the proof:
- Our definition of a separable element $alpha$ is: the minimal polynomial of $alpha$ is separable. In the proof above I used that $alpha$ is separable because there exists a polynomial $f$ with $f(alpha)=0$. Are these two characterizations equivalent?
$(Leftarrow)$ If $f$ is separable with $f(alpha)=0$ then $m_alphacdot g=f$, hence $m_alpha$ can't have a multiple zero, because of the degrees.
But how does the other direction work?
- The polynomial $f$ in the proof: is it already the minimal polynomial of $beta$? If yes, why?
Thanks a lot!
abstract-algebra proof-verification field-theory extension-field
abstract-algebra proof-verification field-theory extension-field
edited Dec 13 '18 at 19:29
Brahadeesh
6,42442363
6,42442363
asked Jan 17 '15 at 16:49
RayBuriRayBuri
161
161
2
$begingroup$
$beta$ doesn't have to be separable. Your polynomial $f_{alpha,beta}(X)=m_{alpha,K}(X)(X-beta)$ is not in $K[X]$, if $betanotin K$. Hence it is not minimal polynomial of $beta$ over $K$. You can find the proof here: math.cornell.edu/~kbrown/6310/primitive.pdf
$endgroup$
– SMM
Jan 17 '15 at 18:53
add a comment |
2
$begingroup$
$beta$ doesn't have to be separable. Your polynomial $f_{alpha,beta}(X)=m_{alpha,K}(X)(X-beta)$ is not in $K[X]$, if $betanotin K$. Hence it is not minimal polynomial of $beta$ over $K$. You can find the proof here: math.cornell.edu/~kbrown/6310/primitive.pdf
$endgroup$
– SMM
Jan 17 '15 at 18:53
2
2
$begingroup$
$beta$ doesn't have to be separable. Your polynomial $f_{alpha,beta}(X)=m_{alpha,K}(X)(X-beta)$ is not in $K[X]$, if $betanotin K$. Hence it is not minimal polynomial of $beta$ over $K$. You can find the proof here: math.cornell.edu/~kbrown/6310/primitive.pdf
$endgroup$
– SMM
Jan 17 '15 at 18:53
$begingroup$
$beta$ doesn't have to be separable. Your polynomial $f_{alpha,beta}(X)=m_{alpha,K}(X)(X-beta)$ is not in $K[X]$, if $betanotin K$. Hence it is not minimal polynomial of $beta$ over $K$. You can find the proof here: math.cornell.edu/~kbrown/6310/primitive.pdf
$endgroup$
– SMM
Jan 17 '15 at 18:53
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Your proof is incorrect.
Notice that you have apparently proved that $beta$ is separable over $K$, when in fact you have not made any initial assumptions on $beta$. Surely this is a red flag: after all, you could have started with $beta notin K$ and $beta$ purely inseparable over $K$. Then it is quite impossible for $beta$ to also be separable over $K$.
Your proof fails because $f_{alpha,beta}$ need not be in $K[X]$. In fact, it definitely won't be when $beta notin K$. This also answers (2): it is not the minimal polynomial of $beta$ over $K$ because it does not lie in $K[X]$ (unless $beta in K$, which is a trivial scenario).
Regarding (1): I am not sure what your question is, because you have definitely used the fact that $alpha$ is separable because its minimal polynomial is separable.
For a full proof of the result, you can see here: math.cornell.edu/~kbrown/6310/primitive.pdf.
$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%2f1108002%2fshow-that-the-algebraic-extension-k-alpha-beta-k-is-simple-if-alpha-is-s%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$
Your proof is incorrect.
Notice that you have apparently proved that $beta$ is separable over $K$, when in fact you have not made any initial assumptions on $beta$. Surely this is a red flag: after all, you could have started with $beta notin K$ and $beta$ purely inseparable over $K$. Then it is quite impossible for $beta$ to also be separable over $K$.
Your proof fails because $f_{alpha,beta}$ need not be in $K[X]$. In fact, it definitely won't be when $beta notin K$. This also answers (2): it is not the minimal polynomial of $beta$ over $K$ because it does not lie in $K[X]$ (unless $beta in K$, which is a trivial scenario).
Regarding (1): I am not sure what your question is, because you have definitely used the fact that $alpha$ is separable because its minimal polynomial is separable.
For a full proof of the result, you can see here: math.cornell.edu/~kbrown/6310/primitive.pdf.
$endgroup$
add a comment |
$begingroup$
Your proof is incorrect.
Notice that you have apparently proved that $beta$ is separable over $K$, when in fact you have not made any initial assumptions on $beta$. Surely this is a red flag: after all, you could have started with $beta notin K$ and $beta$ purely inseparable over $K$. Then it is quite impossible for $beta$ to also be separable over $K$.
Your proof fails because $f_{alpha,beta}$ need not be in $K[X]$. In fact, it definitely won't be when $beta notin K$. This also answers (2): it is not the minimal polynomial of $beta$ over $K$ because it does not lie in $K[X]$ (unless $beta in K$, which is a trivial scenario).
Regarding (1): I am not sure what your question is, because you have definitely used the fact that $alpha$ is separable because its minimal polynomial is separable.
For a full proof of the result, you can see here: math.cornell.edu/~kbrown/6310/primitive.pdf.
$endgroup$
add a comment |
$begingroup$
Your proof is incorrect.
Notice that you have apparently proved that $beta$ is separable over $K$, when in fact you have not made any initial assumptions on $beta$. Surely this is a red flag: after all, you could have started with $beta notin K$ and $beta$ purely inseparable over $K$. Then it is quite impossible for $beta$ to also be separable over $K$.
Your proof fails because $f_{alpha,beta}$ need not be in $K[X]$. In fact, it definitely won't be when $beta notin K$. This also answers (2): it is not the minimal polynomial of $beta$ over $K$ because it does not lie in $K[X]$ (unless $beta in K$, which is a trivial scenario).
Regarding (1): I am not sure what your question is, because you have definitely used the fact that $alpha$ is separable because its minimal polynomial is separable.
For a full proof of the result, you can see here: math.cornell.edu/~kbrown/6310/primitive.pdf.
$endgroup$
Your proof is incorrect.
Notice that you have apparently proved that $beta$ is separable over $K$, when in fact you have not made any initial assumptions on $beta$. Surely this is a red flag: after all, you could have started with $beta notin K$ and $beta$ purely inseparable over $K$. Then it is quite impossible for $beta$ to also be separable over $K$.
Your proof fails because $f_{alpha,beta}$ need not be in $K[X]$. In fact, it definitely won't be when $beta notin K$. This also answers (2): it is not the minimal polynomial of $beta$ over $K$ because it does not lie in $K[X]$ (unless $beta in K$, which is a trivial scenario).
Regarding (1): I am not sure what your question is, because you have definitely used the fact that $alpha$ is separable because its minimal polynomial is separable.
For a full proof of the result, you can see here: math.cornell.edu/~kbrown/6310/primitive.pdf.
answered Dec 13 '18 at 18:54
BrahadeeshBrahadeesh
6,42442363
6,42442363
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%2f1108002%2fshow-that-the-algebraic-extension-k-alpha-beta-k-is-simple-if-alpha-is-s%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
2
$begingroup$
$beta$ doesn't have to be separable. Your polynomial $f_{alpha,beta}(X)=m_{alpha,K}(X)(X-beta)$ is not in $K[X]$, if $betanotin K$. Hence it is not minimal polynomial of $beta$ over $K$. You can find the proof here: math.cornell.edu/~kbrown/6310/primitive.pdf
$endgroup$
– SMM
Jan 17 '15 at 18:53