- Show that has exactly one real root given by
- Show that is a field extension of of degree 3
- Let be the splitting field of over find the size of the Galois group of .
- For each isomoprhism determine
It should be clear that has one real root, this can be noted that it has power and that , thus it can only pass through the x-axis at most once, leading to exactly one real root.
In order to prove that is a field extension of of degree 3, all we have to do is shot ath is irreducible over . Recall that the following: given two polynomials such that , then is irreducible iff is irreducible.
With that said define where we note that which allows us to use Eisenstien's with to deduce that is irreducible in , but then is also irreducible by our previous paragraph. Therefore since has degree 3, then we know that the extension has degree 3.
Note that is sparable because has characteristic 0. Therefore since is its splitting field, then we have that .
Note that since there is exactly one root in then we know that because if it was equal to one, then would be the splitting field, which it cannot be because it contains exactly one root, we require that because the splitting field contains distinct roots, all of this forces that so that which means that .
Each of the permutations in the Galois group is equivalent to one of the permutations in the symmetry group. Let (where be the roots, but instead let's denote them by so that we can use cycle notation to easily describe what each does to
Finally note that is a root of this polynomial:
We'll do this by first noticing something which is not immediately obvious: To see this let's show that . Well as needed, thus it's true, from this we can note that Now observe that so we conclude that We've seen that so we conclude that the answer to the original question is .
Let , let , note that , so that thus is an element who's sequre is since we are in an intergral domain then an element can have at most two square roots and since those would be then we know that .
On a similar note, we see that so that the only possibilities are . Summing up, we've deduced that given any element in the galois group it must map to and to , since knowing what the map does to and fully determines it, this means that there are at most 4 automorphisms in the galois group.
We note that is the splitting field for as are contained in it, and there is nothing smaller containg all of them so that . Note that because we may use the basis .
Going back to our original paragraphs, we deduce that the four automorphisms are indeed uniquely determined by , , and
- Show that is irreducible over
- Let be the splitting field of . Find and describe its elements.
Since it is of degree we may verify that it is irreducible by checking all possible input values and confirming none are roots, so let then so that we must have If so, then . If it's the case that , then we have but by plugging that into we obtain a non-zero value, on the other hand if then this forces which also leads to a non-zero value when plugged into therefore we know that is irreducible over
Let's observe that is separable, this is simply because it is a non-zero polynomial within a field of characteristic zero, so we have that We also know that . We also know that has one real root, given by and the other two are distinct complex numbers.
Let We now deduce that because is not the splitting field as just discussed, by iv in theorem 47, we have that therefore with all this information we are forced to have that so that and thus so that each the galois's groups elements are one of the permutations.
- Prove that there is a non-zero polynomial such that
- Let be the set of all polynomaisl such that , prove that is an ideal in
- Let be a monic polynomilal of least degree in . Prove that .
- Prove that is the unique monic polynomial of least degree in
Consider as a vector space over , in this case it's easy to see that the "one-hot" matricies at each form a basis for this vector space, and the dimension is precisely .
On the other hand, supposing we had the matrices A ^ 0, \ldots A ^ \left( n ^ 2 \right) ParseError: Got function '\left' with no arguments as superscript at position 19: … 0, \ldots A ^ \̲l̲e̲f̲t̲( n ^ 2 \right), then as there are of these matrices then we know that they are linearly depedent, so we get coefficients a _ 0, \ldots a _ \left( n ^ 2 \right) \in F ParseError: Got function '\left' with no arguments as subscript at position 19: … 0, \ldots a _ \̲l̲e̲f̲t̲( n ^ 2 \right)… not all zero such that a _ 0 A ^ 0 + \ldots + a _ { n ^ 2 } A ^ \left( n ^ 2 \right) = 0 ParseError: Got function '\left' with no arguments as superscript at position 42: … { n ^ 2 } A ^ \̲l̲e̲f̲t̲( n ^ 2 \right)…, semantically replace every with an to obtain a polynomial such that is a root.
let , note that so that so that , also let then because , so that is an ideal.
We want to show that , one way of proving this is to show that divides every element in . So let by the quotient remainder theorem we obtain such that where either or , but note the latter is impossible because was the monic polynomial with the smallest degree in (which is also the smallest degree of any polynomial in ) so that we must have which implies that divides as needed.
Suppose that there was another monic polynomial with the same degree as , we know that divides , but then we must have that the quotient is a non-zero constant polynomial, so that , but then is no longer monic unless therefore as needed.
Given any we can see that , and , and we also know that it is uniquely determined by these equations. Therefore we deduce that the only possible automorphisms are that of which there are .
Alternately we may observe that given the maps , it's easy to see that .
Also we may explictly construct a basis for to do this we recall that if we have a field extension and an -vector space . If is a -basis of , and is an -basis of , then is an -basis of . Using this we observe that since is a basis for and is a basis for then we conclude that is a basis for , repeating this process again for yields the basis , so that which confirms our earlier remark on the number of automorphisms.
- Show that
- Describe all automorphisms in
- Write the multiplication table for the group
- Which finite group is isomorphic to?
Let's first notice that and thus it is separable so the first part of the equation is confirmed. We now verify that .
Since and we observe that divides all coefficients besides the leading terms coefficient but doesn't divide the constant term, then by Eisensteins Criterion this polynomial is irreducible over note that since has degree four, then we can conclude that . Therefore we have
Note that given any we must have that and that under such constraints we can see that and that therefore since we've observed taht there are 8 of them each such choice leads to a valid automorphism. If we denote and , we can see that using composition we can generate all of the possible automorphisms.
Therefore we know that where we have that the order of is 2 and 4 respectively and that , with that said we can construct it's multiplication table
We can see that through this table that and are in clear bijection through the map and , using this map we see that the two multiplications map into eachother and therefore they are isomorphic. Note that you can also do this by showing that the only two non-abelian groups of order are and the quaternion group, but in the quaternion group each non-trivial element has order but in this group we note that then it can only be .
- Show that .
- Describe the nontrivial automorphism . That is say what is doing to the generators of .
Since then , so therefore we can look back at all of 's automorphisms and determines which ones actually fix . To do this we simply see which ones fix , observe that by exhaustion we can observe that only the identity and the automorphism and will work. Therefore , note that this solves both parts of the question at once.
Show that
- Show that
- Describe all the automorphisms in
We start by showing that . The harder direction is that , an arbitrary element of is , so if we can show that each of then this sum will also be in so we'll focus on this problem instead, but to that end note the following therefore we have one direction of the inclusion. As for since each is already a linear combination of those things this direction is immediate.
We show it's equal to 12 by factoring it.
We'll describe all the automorphisms by explicitly finding them, initially we would have to verify many things but we first notice that and are Galois as they are splitting fields of and respectively, therefore as as a composite then we know that where the RHS is a subgroup of . Note that therefore the RHS actually equals
Note that given some we have that this is because so that so that .
On the other hand if we had some then since the roots of are then must permute these roots that of which there are different permutations. Note that such a permutation may be specified by what it does to and separately, also note that so we know that must be a 3rd root of unity, which allows for an even more compact representation of the permutations.
Note that at this point we may list out all 12 permutations each of which is generated by selecting and a permutation as specfied above, which may be given as and , which uniquely restricts each root to get sent to a root.
- Prove that is a field. Note that .
- Let be a field extension. Let be a polynomial with coefficients in . Suppose is a root of , where but . Show that is also a root of . Hint: apply the 'conjugation' to the equation . Here denotes the automorphsm of fixing pointwise, determined by .
- Let be a cubic polynomial with rational coefficients. Show that the sum of the roots of is a rational number.
- Using the notation of part (b), assume is a cubic polynomial. Prove that if is a root of then also has a root in . Hint: parts (b), (c).
- Use induction to prove that if a cubic polynomial has a surd root, it must have a rational root.
- Let denote a degree angle. Show that .
- Show that is not a surd. Hint: by part (f), we know is a root of the cubic polynomial . So if where a surd then would have a rational root. Show that has no rational roots (can use rational root theorem).
We start by proving that is a field let and then and are both in the tower of fields which can be generated by adjoining and then to . Since is a field than by combining in any way with the operations at hand always still produces an element of , since was defined as the union of all towers than we know that and so that this combination of is also in showing that is a field.
For this question lets first observe that for any , let , with and note that conjugation moves through summations and products, so that:
Given the polynomial and the roots to this equation then we know that therefore since then the sum of the roots are rational.
If is a root of then we know that is a root of but then as just shown the sum of all the roots is rational so if is the last root of we have that Isolating we have that since and then
Suppose that has a surd root in the field extension where we have the tower Suppose that where is the smallest field in the tower which contains a root of but then as just noted, there would then be a root in which is a contradiction to being the smallest field that contained a root of therefore so that contains a root of , in other words we've just proven that has a rational root. Note that this proof is equivalent to induction.
Let , let's prove that . We recall that , therefore plugging in we obtain that
We've shown that if a polynomial has a surd root then it has a rational root, therefore by the converse we know that if it has no rational roots, then it has no surd roots. Therefore if we were able to show that has no rational roots then it would have no surd roots, and since is a root, then it could not be a surd. Note that by the rational roots theorem the only possible roots are note that by plugging either in it is the sum of three odd numbers and thus cannot be 0, thus it has no rational roots, and therefore is not a surd