irreducible polynomial has all its roots in $F_s$ and every element in $F_s$ satisfies such a polynomial
I'm currently trying to prove a certain statement( I will not post the whole statement because there is only one part, which is not clear to me).
Let us say that we have a finite field $F$ with $q$ elements. I was able to prove that $x^{q^s} - x $ is the product of all monic irreducible polynomials of degree
dividing $s$. but now I have to follow that every such irreducible polynomial has all its roots in $F_s$ (finite field with $q^s$ elements) and conversely that every element in $F_s$ satisfies such a polynomial. But I don't see why. Is there an easy way to prove both directions?
number-theory finite-fields
add a comment |
I'm currently trying to prove a certain statement( I will not post the whole statement because there is only one part, which is not clear to me).
Let us say that we have a finite field $F$ with $q$ elements. I was able to prove that $x^{q^s} - x $ is the product of all monic irreducible polynomials of degree
dividing $s$. but now I have to follow that every such irreducible polynomial has all its roots in $F_s$ (finite field with $q^s$ elements) and conversely that every element in $F_s$ satisfies such a polynomial. But I don't see why. Is there an easy way to prove both directions?
number-theory finite-fields
add a comment |
I'm currently trying to prove a certain statement( I will not post the whole statement because there is only one part, which is not clear to me).
Let us say that we have a finite field $F$ with $q$ elements. I was able to prove that $x^{q^s} - x $ is the product of all monic irreducible polynomials of degree
dividing $s$. but now I have to follow that every such irreducible polynomial has all its roots in $F_s$ (finite field with $q^s$ elements) and conversely that every element in $F_s$ satisfies such a polynomial. But I don't see why. Is there an easy way to prove both directions?
number-theory finite-fields
I'm currently trying to prove a certain statement( I will not post the whole statement because there is only one part, which is not clear to me).
Let us say that we have a finite field $F$ with $q$ elements. I was able to prove that $x^{q^s} - x $ is the product of all monic irreducible polynomials of degree
dividing $s$. but now I have to follow that every such irreducible polynomial has all its roots in $F_s$ (finite field with $q^s$ elements) and conversely that every element in $F_s$ satisfies such a polynomial. But I don't see why. Is there an easy way to prove both directions?
number-theory finite-fields
number-theory finite-fields
edited 2 days ago
Bernard
118k639112
118k639112
asked 2 days ago
RukiaKuchiki
322211
322211
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
For each $y in mathbb{F}_{q^s}$, note that $y^{q^s} = y$ [make sure you see why]. There are $q^s$ such $y$ (which is the degree of the polynomial $x^{q^s}-x$), so
those are precisely the $q^s$ roots of $x^{q^s}-x$.
let us write $x^{q^s}-x= prod_i p_i(x)$ where $p_i(x)$ are irreducible in $mathbb{F}_q[x]$. Suppose there exists a $y in mathbb{F}_{q^s}$ such that $p_i(y) not = 0$ for all such $i$. Then this would imply that $prod_i p_i(y) = y^{q^s}-y not = 0$, which contradicts
what we observed already above: $y^{q^s} = y$ for each $y in mathbb{F}_{q^s}$.
So 2 gives at least one of what you are trying to show, every $y in mathbb{F}_{q^s}$ satisfies $p(y)=0$ for some monic irreducible polynomial $p(x)$ dividing $x^{q^s}-x$; eqquivalently [as you had shown already] $p in mathbb{F}_q[x]$ irreducible and deg$(p)|s$.
On the other hand: You had already shown that every monic irreducible polynomial $p in mathbb{F}_q[x]$ satisfying deg$(p) | s$, divides the polynomial $x^{q^s}-x$. As $x^{p^s}-x$ factors completely in $mathbb{F}_{q^s}$ (i.e., 1. above) it follows that $p$ must also factor completely in $mathbb{F}_{q^s}$.
1
Thank you for your answer, Mike. :) I proved now that for each $ y in F_{q^s} $ it holds that $y^{q^s} = y$. Now I will deal with the rest of your answer.
– RukiaKuchiki
23 hours ago
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%2f3060915%2firreducible-polynomial-has-all-its-roots-in-f-s-and-every-element-in-f-s-sat%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
For each $y in mathbb{F}_{q^s}$, note that $y^{q^s} = y$ [make sure you see why]. There are $q^s$ such $y$ (which is the degree of the polynomial $x^{q^s}-x$), so
those are precisely the $q^s$ roots of $x^{q^s}-x$.
let us write $x^{q^s}-x= prod_i p_i(x)$ where $p_i(x)$ are irreducible in $mathbb{F}_q[x]$. Suppose there exists a $y in mathbb{F}_{q^s}$ such that $p_i(y) not = 0$ for all such $i$. Then this would imply that $prod_i p_i(y) = y^{q^s}-y not = 0$, which contradicts
what we observed already above: $y^{q^s} = y$ for each $y in mathbb{F}_{q^s}$.
So 2 gives at least one of what you are trying to show, every $y in mathbb{F}_{q^s}$ satisfies $p(y)=0$ for some monic irreducible polynomial $p(x)$ dividing $x^{q^s}-x$; eqquivalently [as you had shown already] $p in mathbb{F}_q[x]$ irreducible and deg$(p)|s$.
On the other hand: You had already shown that every monic irreducible polynomial $p in mathbb{F}_q[x]$ satisfying deg$(p) | s$, divides the polynomial $x^{q^s}-x$. As $x^{p^s}-x$ factors completely in $mathbb{F}_{q^s}$ (i.e., 1. above) it follows that $p$ must also factor completely in $mathbb{F}_{q^s}$.
1
Thank you for your answer, Mike. :) I proved now that for each $ y in F_{q^s} $ it holds that $y^{q^s} = y$. Now I will deal with the rest of your answer.
– RukiaKuchiki
23 hours ago
add a comment |
For each $y in mathbb{F}_{q^s}$, note that $y^{q^s} = y$ [make sure you see why]. There are $q^s$ such $y$ (which is the degree of the polynomial $x^{q^s}-x$), so
those are precisely the $q^s$ roots of $x^{q^s}-x$.
let us write $x^{q^s}-x= prod_i p_i(x)$ where $p_i(x)$ are irreducible in $mathbb{F}_q[x]$. Suppose there exists a $y in mathbb{F}_{q^s}$ such that $p_i(y) not = 0$ for all such $i$. Then this would imply that $prod_i p_i(y) = y^{q^s}-y not = 0$, which contradicts
what we observed already above: $y^{q^s} = y$ for each $y in mathbb{F}_{q^s}$.
So 2 gives at least one of what you are trying to show, every $y in mathbb{F}_{q^s}$ satisfies $p(y)=0$ for some monic irreducible polynomial $p(x)$ dividing $x^{q^s}-x$; eqquivalently [as you had shown already] $p in mathbb{F}_q[x]$ irreducible and deg$(p)|s$.
On the other hand: You had already shown that every monic irreducible polynomial $p in mathbb{F}_q[x]$ satisfying deg$(p) | s$, divides the polynomial $x^{q^s}-x$. As $x^{p^s}-x$ factors completely in $mathbb{F}_{q^s}$ (i.e., 1. above) it follows that $p$ must also factor completely in $mathbb{F}_{q^s}$.
1
Thank you for your answer, Mike. :) I proved now that for each $ y in F_{q^s} $ it holds that $y^{q^s} = y$. Now I will deal with the rest of your answer.
– RukiaKuchiki
23 hours ago
add a comment |
For each $y in mathbb{F}_{q^s}$, note that $y^{q^s} = y$ [make sure you see why]. There are $q^s$ such $y$ (which is the degree of the polynomial $x^{q^s}-x$), so
those are precisely the $q^s$ roots of $x^{q^s}-x$.
let us write $x^{q^s}-x= prod_i p_i(x)$ where $p_i(x)$ are irreducible in $mathbb{F}_q[x]$. Suppose there exists a $y in mathbb{F}_{q^s}$ such that $p_i(y) not = 0$ for all such $i$. Then this would imply that $prod_i p_i(y) = y^{q^s}-y not = 0$, which contradicts
what we observed already above: $y^{q^s} = y$ for each $y in mathbb{F}_{q^s}$.
So 2 gives at least one of what you are trying to show, every $y in mathbb{F}_{q^s}$ satisfies $p(y)=0$ for some monic irreducible polynomial $p(x)$ dividing $x^{q^s}-x$; eqquivalently [as you had shown already] $p in mathbb{F}_q[x]$ irreducible and deg$(p)|s$.
On the other hand: You had already shown that every monic irreducible polynomial $p in mathbb{F}_q[x]$ satisfying deg$(p) | s$, divides the polynomial $x^{q^s}-x$. As $x^{p^s}-x$ factors completely in $mathbb{F}_{q^s}$ (i.e., 1. above) it follows that $p$ must also factor completely in $mathbb{F}_{q^s}$.
For each $y in mathbb{F}_{q^s}$, note that $y^{q^s} = y$ [make sure you see why]. There are $q^s$ such $y$ (which is the degree of the polynomial $x^{q^s}-x$), so
those are precisely the $q^s$ roots of $x^{q^s}-x$.
let us write $x^{q^s}-x= prod_i p_i(x)$ where $p_i(x)$ are irreducible in $mathbb{F}_q[x]$. Suppose there exists a $y in mathbb{F}_{q^s}$ such that $p_i(y) not = 0$ for all such $i$. Then this would imply that $prod_i p_i(y) = y^{q^s}-y not = 0$, which contradicts
what we observed already above: $y^{q^s} = y$ for each $y in mathbb{F}_{q^s}$.
So 2 gives at least one of what you are trying to show, every $y in mathbb{F}_{q^s}$ satisfies $p(y)=0$ for some monic irreducible polynomial $p(x)$ dividing $x^{q^s}-x$; eqquivalently [as you had shown already] $p in mathbb{F}_q[x]$ irreducible and deg$(p)|s$.
On the other hand: You had already shown that every monic irreducible polynomial $p in mathbb{F}_q[x]$ satisfying deg$(p) | s$, divides the polynomial $x^{q^s}-x$. As $x^{p^s}-x$ factors completely in $mathbb{F}_{q^s}$ (i.e., 1. above) it follows that $p$ must also factor completely in $mathbb{F}_{q^s}$.
edited 2 days ago
answered 2 days ago
Mike
3,099211
3,099211
1
Thank you for your answer, Mike. :) I proved now that for each $ y in F_{q^s} $ it holds that $y^{q^s} = y$. Now I will deal with the rest of your answer.
– RukiaKuchiki
23 hours ago
add a comment |
1
Thank you for your answer, Mike. :) I proved now that for each $ y in F_{q^s} $ it holds that $y^{q^s} = y$. Now I will deal with the rest of your answer.
– RukiaKuchiki
23 hours ago
1
1
Thank you for your answer, Mike. :) I proved now that for each $ y in F_{q^s} $ it holds that $y^{q^s} = y$. Now I will deal with the rest of your answer.
– RukiaKuchiki
23 hours ago
Thank you for your answer, Mike. :) I proved now that for each $ y in F_{q^s} $ it holds that $y^{q^s} = y$. Now I will deal with the rest of your answer.
– RukiaKuchiki
23 hours ago
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3060915%2firreducible-polynomial-has-all-its-roots-in-f-s-and-every-element-in-f-s-sat%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