First we note that are roots of the given polynomial and that we have the following factorization.
We observe that in that is irreducible, by explicitly plugging in the two possible values for , therefore is a field containing and a root of , specifically , where we note that , we also then note that so that is also a root.
So far we know that contains the elements , but we actually note is has no more elements through the addition and multiplication tables:
Addition: Multiplication:Suppose that are fields with and elements respectively, then let denote the set of elements in which are units, since it's a field, then every non-zero element has an inverse, so then has elements, symetrically has 7 elements. Moreover note that are multiplicative groups.
Suppose for the sake of contradiction that was isomorphic to some subfield of . In this case we note that must be a subgroup of , this is because is a subfield, of , but then by Lagranges theorem, we should have that the order of divides , but clearly does not divide , therefore our assumption was incorrect, so we know that cannot be isomorphic to any subfield of .
- How many elements does have?
- Express each element of in terms of
- Write out the multiplication table for
We'll first note that , this can be seen by the isomorphism which can be constructed by using the evaluation map at (which can be seen to be well defined for cosets). Therefore since we know there are elements in the latter, then we know there are 8 elements in
For each coset from is of the form where , and so for each evaluation, we obtain an element of , namely we get the following
Note that the multiplication table can be obtained, but will take a while, we can cut down on half of our work by realizing that it is a field and so the table will be symmetric down the diagonal.
In order for this to be true, we would need to be able to have all roots existing in the extension , we now go along this path.
We know that is a root, therefore we deduce that , this is beneficial as it will allow us to reduce any power that is greater or equal to . We'll first note that if is prime, then for any we have that , therefore in the context of when we expand , we can ignore all terms execept for the first and last, therefore we obtain Similarly we note that is a root because We don't have to check because we already did as it equals . Finally note that is a root because We would continue like this but we see that , so it cycles back after this point. Anyways we've found all four roots, so we have
Therefore we know that is a field containing and a root of .
Notice that this field has order , meaning that it's multiplicative group has order . Which means that given any element in the multiplicative group we know , and since we can conclude that it is also a root to the polynomial.
Therefore we can say that no matter which irredicible polynomial we choose to use Kronecker's on, the extension will contain all roots.