How to show that this simple extension avoids adding more elements in $L$?
$begingroup$
$Fsubset L subset K$ is a field extension, $α in K$ is algebraic element over $F$ , whose minimal polynomial $p(x)$ over $F$ is irreducible over $L$, show that $F(α)cap L = F$
I don't know how to do..thanks for any help..
field-theory extension-field
$endgroup$
add a comment |
$begingroup$
$Fsubset L subset K$ is a field extension, $α in K$ is algebraic element over $F$ , whose minimal polynomial $p(x)$ over $F$ is irreducible over $L$, show that $F(α)cap L = F$
I don't know how to do..thanks for any help..
field-theory extension-field
$endgroup$
add a comment |
$begingroup$
$Fsubset L subset K$ is a field extension, $α in K$ is algebraic element over $F$ , whose minimal polynomial $p(x)$ over $F$ is irreducible over $L$, show that $F(α)cap L = F$
I don't know how to do..thanks for any help..
field-theory extension-field
$endgroup$
$Fsubset L subset K$ is a field extension, $α in K$ is algebraic element over $F$ , whose minimal polynomial $p(x)$ over $F$ is irreducible over $L$, show that $F(α)cap L = F$
I don't know how to do..thanks for any help..
field-theory extension-field
field-theory extension-field
asked Jan 16 at 0:29
likemathlikemath
16519
16519
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
$newcommand{Size}[1]{leftlvert #1 rightrvert}$Recall that every element of $F(alpha)$ can be written uniquely as $q(alpha)$, where $q(x) in F[x]$ is either zero, or has degree less than the degree of $p(x)$.
Also, since $p(x)$ is irreducible over $L$, it is the minimal polynomial of $alpha$ not only over $F$, but also over $L$
Suppose by way of contradiction that $F(alpha) cap L supsetneq F$. Then there is a non-constant polynomial $q(x) in F[x]$, of degree smaller than the degree of $p(x)$, such that $q(alpha) = b in L$. But then $alpha$ is a root of $0 ne q(x) - b in L[x]$. This is a contradiction, as $q(x) - b$ has degree less than $p(x)$, which was assumed to be the minimal polynomial of $alpha$ over $L$.
$endgroup$
$begingroup$
Thanks, I got it.
$endgroup$
– likemath
Jan 16 at 1:26
$begingroup$
@likemath, you're welcome.
$endgroup$
– Andreas Caranti
Jan 16 at 1:27
add a comment |
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%2f3075169%2fhow-to-show-that-this-simple-extension-avoids-adding-more-elements-in-l%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$
$newcommand{Size}[1]{leftlvert #1 rightrvert}$Recall that every element of $F(alpha)$ can be written uniquely as $q(alpha)$, where $q(x) in F[x]$ is either zero, or has degree less than the degree of $p(x)$.
Also, since $p(x)$ is irreducible over $L$, it is the minimal polynomial of $alpha$ not only over $F$, but also over $L$
Suppose by way of contradiction that $F(alpha) cap L supsetneq F$. Then there is a non-constant polynomial $q(x) in F[x]$, of degree smaller than the degree of $p(x)$, such that $q(alpha) = b in L$. But then $alpha$ is a root of $0 ne q(x) - b in L[x]$. This is a contradiction, as $q(x) - b$ has degree less than $p(x)$, which was assumed to be the minimal polynomial of $alpha$ over $L$.
$endgroup$
$begingroup$
Thanks, I got it.
$endgroup$
– likemath
Jan 16 at 1:26
$begingroup$
@likemath, you're welcome.
$endgroup$
– Andreas Caranti
Jan 16 at 1:27
add a comment |
$begingroup$
$newcommand{Size}[1]{leftlvert #1 rightrvert}$Recall that every element of $F(alpha)$ can be written uniquely as $q(alpha)$, where $q(x) in F[x]$ is either zero, or has degree less than the degree of $p(x)$.
Also, since $p(x)$ is irreducible over $L$, it is the minimal polynomial of $alpha$ not only over $F$, but also over $L$
Suppose by way of contradiction that $F(alpha) cap L supsetneq F$. Then there is a non-constant polynomial $q(x) in F[x]$, of degree smaller than the degree of $p(x)$, such that $q(alpha) = b in L$. But then $alpha$ is a root of $0 ne q(x) - b in L[x]$. This is a contradiction, as $q(x) - b$ has degree less than $p(x)$, which was assumed to be the minimal polynomial of $alpha$ over $L$.
$endgroup$
$begingroup$
Thanks, I got it.
$endgroup$
– likemath
Jan 16 at 1:26
$begingroup$
@likemath, you're welcome.
$endgroup$
– Andreas Caranti
Jan 16 at 1:27
add a comment |
$begingroup$
$newcommand{Size}[1]{leftlvert #1 rightrvert}$Recall that every element of $F(alpha)$ can be written uniquely as $q(alpha)$, where $q(x) in F[x]$ is either zero, or has degree less than the degree of $p(x)$.
Also, since $p(x)$ is irreducible over $L$, it is the minimal polynomial of $alpha$ not only over $F$, but also over $L$
Suppose by way of contradiction that $F(alpha) cap L supsetneq F$. Then there is a non-constant polynomial $q(x) in F[x]$, of degree smaller than the degree of $p(x)$, such that $q(alpha) = b in L$. But then $alpha$ is a root of $0 ne q(x) - b in L[x]$. This is a contradiction, as $q(x) - b$ has degree less than $p(x)$, which was assumed to be the minimal polynomial of $alpha$ over $L$.
$endgroup$
$newcommand{Size}[1]{leftlvert #1 rightrvert}$Recall that every element of $F(alpha)$ can be written uniquely as $q(alpha)$, where $q(x) in F[x]$ is either zero, or has degree less than the degree of $p(x)$.
Also, since $p(x)$ is irreducible over $L$, it is the minimal polynomial of $alpha$ not only over $F$, but also over $L$
Suppose by way of contradiction that $F(alpha) cap L supsetneq F$. Then there is a non-constant polynomial $q(x) in F[x]$, of degree smaller than the degree of $p(x)$, such that $q(alpha) = b in L$. But then $alpha$ is a root of $0 ne q(x) - b in L[x]$. This is a contradiction, as $q(x) - b$ has degree less than $p(x)$, which was assumed to be the minimal polynomial of $alpha$ over $L$.
edited Jan 16 at 19:21
answered Jan 16 at 1:10
Andreas CarantiAndreas Caranti
56.9k34397
56.9k34397
$begingroup$
Thanks, I got it.
$endgroup$
– likemath
Jan 16 at 1:26
$begingroup$
@likemath, you're welcome.
$endgroup$
– Andreas Caranti
Jan 16 at 1:27
add a comment |
$begingroup$
Thanks, I got it.
$endgroup$
– likemath
Jan 16 at 1:26
$begingroup$
@likemath, you're welcome.
$endgroup$
– Andreas Caranti
Jan 16 at 1:27
$begingroup$
Thanks, I got it.
$endgroup$
– likemath
Jan 16 at 1:26
$begingroup$
Thanks, I got it.
$endgroup$
– likemath
Jan 16 at 1:26
$begingroup$
@likemath, you're welcome.
$endgroup$
– Andreas Caranti
Jan 16 at 1:27
$begingroup$
@likemath, you're welcome.
$endgroup$
– Andreas Caranti
Jan 16 at 1:27
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%2f3075169%2fhow-to-show-that-this-simple-extension-avoids-adding-more-elements-in-l%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