Theorem 5.1. from the book of Algebra by Aluffi
$begingroup$
The following is from the book of Algebra by Aluffi:

My questions :
1- $mathbb{F_p} subset F$ is a field extension. $F$ includes $mathbb{F_p}$ but $E$ doesn't include $mathbb{F_p}$: Let $a in E$ and $f in mathbb{F_p}$ then $fa notin E$. So how $E=F$? (Obviously, $E subset F$ and not equality.)
2- Number of roots in the splitting field of $f(x)$ with degree $d$ over $mathbb{Z}$ or $mathbb{C}$ is $d$. I haven't seen a proof that 'similar' holds for a finite field like $mathbb{F_p}$: Is it true that the number of roots of $x^q − x$ over $mathbb{F_p}$ is $q$ (proof)?
abstract-algebra field-theory proof-explanation finite-fields
$endgroup$
add a comment |
$begingroup$
The following is from the book of Algebra by Aluffi:

My questions :
1- $mathbb{F_p} subset F$ is a field extension. $F$ includes $mathbb{F_p}$ but $E$ doesn't include $mathbb{F_p}$: Let $a in E$ and $f in mathbb{F_p}$ then $fa notin E$. So how $E=F$? (Obviously, $E subset F$ and not equality.)
2- Number of roots in the splitting field of $f(x)$ with degree $d$ over $mathbb{Z}$ or $mathbb{C}$ is $d$. I haven't seen a proof that 'similar' holds for a finite field like $mathbb{F_p}$: Is it true that the number of roots of $x^q − x$ over $mathbb{F_p}$ is $q$ (proof)?
abstract-algebra field-theory proof-explanation finite-fields
$endgroup$
add a comment |
$begingroup$
The following is from the book of Algebra by Aluffi:

My questions :
1- $mathbb{F_p} subset F$ is a field extension. $F$ includes $mathbb{F_p}$ but $E$ doesn't include $mathbb{F_p}$: Let $a in E$ and $f in mathbb{F_p}$ then $fa notin E$. So how $E=F$? (Obviously, $E subset F$ and not equality.)
2- Number of roots in the splitting field of $f(x)$ with degree $d$ over $mathbb{Z}$ or $mathbb{C}$ is $d$. I haven't seen a proof that 'similar' holds for a finite field like $mathbb{F_p}$: Is it true that the number of roots of $x^q − x$ over $mathbb{F_p}$ is $q$ (proof)?
abstract-algebra field-theory proof-explanation finite-fields
$endgroup$
The following is from the book of Algebra by Aluffi:

My questions :
1- $mathbb{F_p} subset F$ is a field extension. $F$ includes $mathbb{F_p}$ but $E$ doesn't include $mathbb{F_p}$: Let $a in E$ and $f in mathbb{F_p}$ then $fa notin E$. So how $E=F$? (Obviously, $E subset F$ and not equality.)
2- Number of roots in the splitting field of $f(x)$ with degree $d$ over $mathbb{Z}$ or $mathbb{C}$ is $d$. I haven't seen a proof that 'similar' holds for a finite field like $mathbb{F_p}$: Is it true that the number of roots of $x^q − x$ over $mathbb{F_p}$ is $q$ (proof)?
abstract-algebra field-theory proof-explanation finite-fields
abstract-algebra field-theory proof-explanation finite-fields
edited Dec 28 '18 at 23:31
72D
asked Dec 28 '18 at 23:26
72D72D
267117
267117
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
$E$ does include $mathbb F_p$. Every element $x in mathbb F_p$ obeys $x^p = x$ (by Fermat's little theorem), and therefore, also obeys $x^q = x$ for $q = p^n$.
The polynomial $f(x)$ certainly factorises a product $(x_1 - a_1) dots (x_n - a_n) $ with $a_1, dots , a_n in F$, but the question is whether the $a_i$ are distinct. For $f(x) = x^q - x$, the answer is yes: the fact that $(f(x), f'(x)) = 1$ implies that $f$ has no repeated roots.
$endgroup$
$begingroup$
I was confusing $x^p$ with $px$! (sum vs multiply) :(
$endgroup$
– 72D
Dec 28 '18 at 23:48
add a comment |
$begingroup$
- The elements of $mathbf F_p$ satisfy the equation $x^p=x$ (that's Fermat's theorem), hence by an easy induction $x^{p^k}=x$ for any $kge 1$. Taking $k=d$, you get the inclusion $mathbf F_psubset E$.
- Over any field, a polynomial of degree $q$ has at most $q$ distinct roots, and has actually $q$ roots if you take into account the multiplicity of the roots. This has not nothing to do with the field being finite or infinite – it just relies on the fact that an element $ alpha$ is a root of $f(x)$ if and only if $f(x)$ is divisible by $x-alpha$, and the multiplicity of a roots is determined by the successive derivatives having or not $alpha$ as a root.
Now, in the case of $f(x)=x^{p^d}-x$, one has $f'(x)=-1$ (we're in characteristic $p$), so all roots of $f(x)$ are simple, and it has exactly $p^d$ roots.
$endgroup$
add a comment |
$begingroup$
Obviously, $E subset F$, as you said. Also, $E$ is a field, as the proof shows. ($E$ definitely contains $Bbb{F}_p$, since any $xin Bbb{F}_p$ satisfies $x^{p^d}=x$ for any $d in Bbb{N}$.) Now, $F$ is defined as the smallest field that splits $x^q-x$. Therefore, F is a subset of any field that splits $x^q-x$. Since $E$ is a field containing all the roots of $x^q-x$, this means that $F subset E$. Thus, since $E subset F$ and $Fsubset E$, $E=F$.
The definition of splitting field of a polynomial says that the polynomial splits into linear factors in that field. Thus, in $F$, $x^q-x$ can be written as the product of a bunch of linear factors. Since multiplying $n$ linear factors leads to a polynomial of degree $n$, if we split $x^q-x$ into linear factors, then we will get $q$ linear factors. Also, each linear factor $x-a$ implies that $a$ is a root of $x^q-x$. Furthermore, since $x^q-x$ is separable, each root must be distinct. Therefore, $x^q-x$ has $q$ distinct roots, one for each of its linear factors.
$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%2f3055386%2ftheorem-5-1-from-the-book-of-algebra-by-aluffi%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
$E$ does include $mathbb F_p$. Every element $x in mathbb F_p$ obeys $x^p = x$ (by Fermat's little theorem), and therefore, also obeys $x^q = x$ for $q = p^n$.
The polynomial $f(x)$ certainly factorises a product $(x_1 - a_1) dots (x_n - a_n) $ with $a_1, dots , a_n in F$, but the question is whether the $a_i$ are distinct. For $f(x) = x^q - x$, the answer is yes: the fact that $(f(x), f'(x)) = 1$ implies that $f$ has no repeated roots.
$endgroup$
$begingroup$
I was confusing $x^p$ with $px$! (sum vs multiply) :(
$endgroup$
– 72D
Dec 28 '18 at 23:48
add a comment |
$begingroup$
$E$ does include $mathbb F_p$. Every element $x in mathbb F_p$ obeys $x^p = x$ (by Fermat's little theorem), and therefore, also obeys $x^q = x$ for $q = p^n$.
The polynomial $f(x)$ certainly factorises a product $(x_1 - a_1) dots (x_n - a_n) $ with $a_1, dots , a_n in F$, but the question is whether the $a_i$ are distinct. For $f(x) = x^q - x$, the answer is yes: the fact that $(f(x), f'(x)) = 1$ implies that $f$ has no repeated roots.
$endgroup$
$begingroup$
I was confusing $x^p$ with $px$! (sum vs multiply) :(
$endgroup$
– 72D
Dec 28 '18 at 23:48
add a comment |
$begingroup$
$E$ does include $mathbb F_p$. Every element $x in mathbb F_p$ obeys $x^p = x$ (by Fermat's little theorem), and therefore, also obeys $x^q = x$ for $q = p^n$.
The polynomial $f(x)$ certainly factorises a product $(x_1 - a_1) dots (x_n - a_n) $ with $a_1, dots , a_n in F$, but the question is whether the $a_i$ are distinct. For $f(x) = x^q - x$, the answer is yes: the fact that $(f(x), f'(x)) = 1$ implies that $f$ has no repeated roots.
$endgroup$
$E$ does include $mathbb F_p$. Every element $x in mathbb F_p$ obeys $x^p = x$ (by Fermat's little theorem), and therefore, also obeys $x^q = x$ for $q = p^n$.
The polynomial $f(x)$ certainly factorises a product $(x_1 - a_1) dots (x_n - a_n) $ with $a_1, dots , a_n in F$, but the question is whether the $a_i$ are distinct. For $f(x) = x^q - x$, the answer is yes: the fact that $(f(x), f'(x)) = 1$ implies that $f$ has no repeated roots.
answered Dec 28 '18 at 23:41
Kenny WongKenny Wong
19.1k21441
19.1k21441
$begingroup$
I was confusing $x^p$ with $px$! (sum vs multiply) :(
$endgroup$
– 72D
Dec 28 '18 at 23:48
add a comment |
$begingroup$
I was confusing $x^p$ with $px$! (sum vs multiply) :(
$endgroup$
– 72D
Dec 28 '18 at 23:48
$begingroup$
I was confusing $x^p$ with $px$! (sum vs multiply) :(
$endgroup$
– 72D
Dec 28 '18 at 23:48
$begingroup$
I was confusing $x^p$ with $px$! (sum vs multiply) :(
$endgroup$
– 72D
Dec 28 '18 at 23:48
add a comment |
$begingroup$
- The elements of $mathbf F_p$ satisfy the equation $x^p=x$ (that's Fermat's theorem), hence by an easy induction $x^{p^k}=x$ for any $kge 1$. Taking $k=d$, you get the inclusion $mathbf F_psubset E$.
- Over any field, a polynomial of degree $q$ has at most $q$ distinct roots, and has actually $q$ roots if you take into account the multiplicity of the roots. This has not nothing to do with the field being finite or infinite – it just relies on the fact that an element $ alpha$ is a root of $f(x)$ if and only if $f(x)$ is divisible by $x-alpha$, and the multiplicity of a roots is determined by the successive derivatives having or not $alpha$ as a root.
Now, in the case of $f(x)=x^{p^d}-x$, one has $f'(x)=-1$ (we're in characteristic $p$), so all roots of $f(x)$ are simple, and it has exactly $p^d$ roots.
$endgroup$
add a comment |
$begingroup$
- The elements of $mathbf F_p$ satisfy the equation $x^p=x$ (that's Fermat's theorem), hence by an easy induction $x^{p^k}=x$ for any $kge 1$. Taking $k=d$, you get the inclusion $mathbf F_psubset E$.
- Over any field, a polynomial of degree $q$ has at most $q$ distinct roots, and has actually $q$ roots if you take into account the multiplicity of the roots. This has not nothing to do with the field being finite or infinite – it just relies on the fact that an element $ alpha$ is a root of $f(x)$ if and only if $f(x)$ is divisible by $x-alpha$, and the multiplicity of a roots is determined by the successive derivatives having or not $alpha$ as a root.
Now, in the case of $f(x)=x^{p^d}-x$, one has $f'(x)=-1$ (we're in characteristic $p$), so all roots of $f(x)$ are simple, and it has exactly $p^d$ roots.
$endgroup$
add a comment |
$begingroup$
- The elements of $mathbf F_p$ satisfy the equation $x^p=x$ (that's Fermat's theorem), hence by an easy induction $x^{p^k}=x$ for any $kge 1$. Taking $k=d$, you get the inclusion $mathbf F_psubset E$.
- Over any field, a polynomial of degree $q$ has at most $q$ distinct roots, and has actually $q$ roots if you take into account the multiplicity of the roots. This has not nothing to do with the field being finite or infinite – it just relies on the fact that an element $ alpha$ is a root of $f(x)$ if and only if $f(x)$ is divisible by $x-alpha$, and the multiplicity of a roots is determined by the successive derivatives having or not $alpha$ as a root.
Now, in the case of $f(x)=x^{p^d}-x$, one has $f'(x)=-1$ (we're in characteristic $p$), so all roots of $f(x)$ are simple, and it has exactly $p^d$ roots.
$endgroup$
- The elements of $mathbf F_p$ satisfy the equation $x^p=x$ (that's Fermat's theorem), hence by an easy induction $x^{p^k}=x$ for any $kge 1$. Taking $k=d$, you get the inclusion $mathbf F_psubset E$.
- Over any field, a polynomial of degree $q$ has at most $q$ distinct roots, and has actually $q$ roots if you take into account the multiplicity of the roots. This has not nothing to do with the field being finite or infinite – it just relies on the fact that an element $ alpha$ is a root of $f(x)$ if and only if $f(x)$ is divisible by $x-alpha$, and the multiplicity of a roots is determined by the successive derivatives having or not $alpha$ as a root.
Now, in the case of $f(x)=x^{p^d}-x$, one has $f'(x)=-1$ (we're in characteristic $p$), so all roots of $f(x)$ are simple, and it has exactly $p^d$ roots.
edited Dec 29 '18 at 0:06
answered Dec 28 '18 at 23:52
BernardBernard
123k741116
123k741116
add a comment |
add a comment |
$begingroup$
Obviously, $E subset F$, as you said. Also, $E$ is a field, as the proof shows. ($E$ definitely contains $Bbb{F}_p$, since any $xin Bbb{F}_p$ satisfies $x^{p^d}=x$ for any $d in Bbb{N}$.) Now, $F$ is defined as the smallest field that splits $x^q-x$. Therefore, F is a subset of any field that splits $x^q-x$. Since $E$ is a field containing all the roots of $x^q-x$, this means that $F subset E$. Thus, since $E subset F$ and $Fsubset E$, $E=F$.
The definition of splitting field of a polynomial says that the polynomial splits into linear factors in that field. Thus, in $F$, $x^q-x$ can be written as the product of a bunch of linear factors. Since multiplying $n$ linear factors leads to a polynomial of degree $n$, if we split $x^q-x$ into linear factors, then we will get $q$ linear factors. Also, each linear factor $x-a$ implies that $a$ is a root of $x^q-x$. Furthermore, since $x^q-x$ is separable, each root must be distinct. Therefore, $x^q-x$ has $q$ distinct roots, one for each of its linear factors.
$endgroup$
add a comment |
$begingroup$
Obviously, $E subset F$, as you said. Also, $E$ is a field, as the proof shows. ($E$ definitely contains $Bbb{F}_p$, since any $xin Bbb{F}_p$ satisfies $x^{p^d}=x$ for any $d in Bbb{N}$.) Now, $F$ is defined as the smallest field that splits $x^q-x$. Therefore, F is a subset of any field that splits $x^q-x$. Since $E$ is a field containing all the roots of $x^q-x$, this means that $F subset E$. Thus, since $E subset F$ and $Fsubset E$, $E=F$.
The definition of splitting field of a polynomial says that the polynomial splits into linear factors in that field. Thus, in $F$, $x^q-x$ can be written as the product of a bunch of linear factors. Since multiplying $n$ linear factors leads to a polynomial of degree $n$, if we split $x^q-x$ into linear factors, then we will get $q$ linear factors. Also, each linear factor $x-a$ implies that $a$ is a root of $x^q-x$. Furthermore, since $x^q-x$ is separable, each root must be distinct. Therefore, $x^q-x$ has $q$ distinct roots, one for each of its linear factors.
$endgroup$
add a comment |
$begingroup$
Obviously, $E subset F$, as you said. Also, $E$ is a field, as the proof shows. ($E$ definitely contains $Bbb{F}_p$, since any $xin Bbb{F}_p$ satisfies $x^{p^d}=x$ for any $d in Bbb{N}$.) Now, $F$ is defined as the smallest field that splits $x^q-x$. Therefore, F is a subset of any field that splits $x^q-x$. Since $E$ is a field containing all the roots of $x^q-x$, this means that $F subset E$. Thus, since $E subset F$ and $Fsubset E$, $E=F$.
The definition of splitting field of a polynomial says that the polynomial splits into linear factors in that field. Thus, in $F$, $x^q-x$ can be written as the product of a bunch of linear factors. Since multiplying $n$ linear factors leads to a polynomial of degree $n$, if we split $x^q-x$ into linear factors, then we will get $q$ linear factors. Also, each linear factor $x-a$ implies that $a$ is a root of $x^q-x$. Furthermore, since $x^q-x$ is separable, each root must be distinct. Therefore, $x^q-x$ has $q$ distinct roots, one for each of its linear factors.
$endgroup$
Obviously, $E subset F$, as you said. Also, $E$ is a field, as the proof shows. ($E$ definitely contains $Bbb{F}_p$, since any $xin Bbb{F}_p$ satisfies $x^{p^d}=x$ for any $d in Bbb{N}$.) Now, $F$ is defined as the smallest field that splits $x^q-x$. Therefore, F is a subset of any field that splits $x^q-x$. Since $E$ is a field containing all the roots of $x^q-x$, this means that $F subset E$. Thus, since $E subset F$ and $Fsubset E$, $E=F$.
The definition of splitting field of a polynomial says that the polynomial splits into linear factors in that field. Thus, in $F$, $x^q-x$ can be written as the product of a bunch of linear factors. Since multiplying $n$ linear factors leads to a polynomial of degree $n$, if we split $x^q-x$ into linear factors, then we will get $q$ linear factors. Also, each linear factor $x-a$ implies that $a$ is a root of $x^q-x$. Furthermore, since $x^q-x$ is separable, each root must be distinct. Therefore, $x^q-x$ has $q$ distinct roots, one for each of its linear factors.
answered Dec 28 '18 at 23:48
Noble MushtakNoble Mushtak
15.3k1835
15.3k1835
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%2f3055386%2ftheorem-5-1-from-the-book-of-algebra-by-aluffi%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