ΘρϵηΠατπ

Automorphism
If E is a field, then an automorphism of E is an isomorphism of E with itself.
Automorphism Fixed Pointwise
If E/F is a field extension, then an automorphism σ of E fixes F pointwise if σ(c)=c for every cF
Automorphism Fixed Pointwise Takes Roots to Roots
Let f(x)F[X] and let E/F be an extension field of F. If σ:EE is an automorphism fixing F pointwise , and if αE is a root of f(x) then σ(α) is also a root of f(x)
Suppose that f(x)=a0+a1x1+anxn with aiF and therefore a0+a1α1+anαn=0, now since σ is a homomorphism, we have that 0=σ(0)=σ(a0+a1α1+an)=σ(a0)+σ(a1)σ(α)++σ(an)σ(α)n And since σ fixes F pointwise we know that this is equal to a0+a1σ(α)++anσ(α)n=0 which means that σ(α) is a root of f(x) as needed.
Galois Group
Let E/F be a field extension, then it's Galois Group is Gal(E/F):={ automorphisms σ of E fixing F pointwise } where the
Degree 1 iff Same as Fields
Suppose that E is a field extension of F, then [E:F]=1E=F
Prime Degree Extension Restricts Subfields
Suppose that the degree of the extension E/F is a prime p. Show that any subfields K of E containing F is either E or F.
Suppose that K is a subfield of E containing F, we know that [E:F]=p, but also that p=[E:F]=[E:K][K:F] Since p is prime then we have two cases, if [E:K]=1,[K:F]=p then we know K=E, in the other case we will obtain that F=K, which proves what we wanted to show.
Irreducible Polynomial Restricts Size of Galois Group
Suppose that p(x) is irreducible fo degree n, and let E be p(x)'s splitting field then
  • n|Gal(E/)|n!
  • |Gal(E/)||n!
Polynomial to Galois
Consider the polynomial given by p(x)=x3+3x1[x]
  • Show that p(x) has exactly one real root given by α
  • Show that (α) is a field extension of of degree 3
  • Let E be the splitting field of p(x) over find the size of the Galois group G(E/) of E/.
  • For each isomoprhism ϕGal(E/) determine ϕ(α)

It should be clear that p(x) has one real root, this can be noted that it has power 3 and that p(x)=3x2+3>0, 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 p(x) is irreducible over . Recall that the following: given two polynomials m(x),k(x) such that m(x)=k(x+a), then m(x) is irreducible iff k(x) is irreducible.

With that said define m(x)=p(x+1) where we note that p(x+1)=x3+3x2+3x+1+3x+31=x3+3x2+6x+3 which allows us to use Eisenstien's with p=3 to deduce that p(x+1) is irreducible in [x] , but then p(x) is also irreducible by our previous paragraph. Therefore since p(x) has degree 3, then we know that the extension (α) has degree 3.


Note that p(x)=x3+3x1 is sparable because has characteristic 0. Therefore since E is its splitting field, then we have that |Gal(E/)|=[E:]=[E:(α)][(α):].

Note that since there is exactly one root in (α) then we know that [E:(α)]>1 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 ||Gal(E/|<|S3|=6) because the splitting field contains 3 distinct roots, all of this forces that [E:(α)]=2 so that Gal(E/)|=[E:]=6 which means that Gal(E/)S3.


Each of the permutations in the Galois group is equivalent to one of the permutations in the symmetry group. Let a1,a2,a3 (where a2=α be the roots, but instead let's denote them by 1,2,3 so that we can use cycle notation to easily describe what each does to α a1()amp;=a1a1(1,2)amp;=a2a1(2,3)amp;=a1a1(1,3)amp;=a3a1(1,2,3)amp;=a2a1(1,3,2)amp;=a3

The Irreducible Polynomial of 1 + i
Find the irreducbile polynomial of 1+i over
Recall that the irreducible polynomial of 1+i is a monic irreducible polynomial having 1+i as a root. Note that we main employ the following idea, start with x=1+i and then attempt to re-arrange this into a polynomial which is easy to verify if it is irreducible and is monic. Observe that x=1+ix1=ix22x+1=1x22x+2=0 Observe that this is monic, which is good using the rational roots theorem, let's observe that the only possible solutions would be given by ±2 by verifying both we observe that this polynomial is irreducible over [x] as it has degree 2 and no roots.

Finally note that 1+i is a root of this polynomial: (1+i)22(1+i)+2=1+2i122i+2=0

Degree of Extension
Find the degree of the extension (3+22)

We'll do this by first noticing something which is not immediately obvious: 3+22=1+2 To see this let's show that 3+22=(1+2)2. Well (1+2)2=(1+22+2)=3+22 as needed, thus it's true, from this we can note that (3+22)=(1+2) Now observe that (2)=(1+2) so we conclude that (3+22)=(2) We've seen that [(2):]=2 so we conclude that the answer to the original question is 2.

Quartic Roots
Find the order of the Galois group Gal((24,i)/(2)) and say what each of its elements are doing to the generators 24 and i.

Let α=24, let ϕGal((24,i)/(2)), note that ϕ(α2)=α2, so that ϕ(α)2=ϕ(α2)=α2 thus ϕ(α) is an element who's sequre is α2 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 ϕ(i)2=1 so that the only possibilities are phi(i)=±i. Summing up, we've deduced that given any element in the galois group it must map α to ±α and i to ±i, since knowing what the map does to α and i fully determines it, this means that there are at most 4 automorphisms in the galois group.

We note that (α,i) is the splitting field for x42 as α,αi,α,αi are contained in it, and there is nothing smaller containg all of them so that |Gal(α,i)/(α2)|=[(α,i):(α2)]=[(α,i):(α)][(α):(α2)]=22=4. Note that [(α):(α2)]=2 because we may use the basis (1,α).

Going back to our original paragraphs, we deduce that the four automorphisms are indeed uniquely determined by ϕ1(b)=b,ϕ1(i)=i , ϕ2(b)=b,ϕ2=i , ϕ3(b)=b,ϕ3(i)=i and ϕ4(b)=b,ϕ4(i)=i

Square Root Coefficients
Let f(x)=x32(2)[x]
  • Show that f(x) is irreducible over (2)
  • Let E be the splitting field of f(x). Find Gal(E/(2)) and describe its elements.

Since it is of degree 3 we may verify that it is irreducible by checking all possible input values and confirming none are roots, so let a+b2(2) then (a+b2)32=0a3+3a2b2+3ab2(2)2+b3(2)32=0(a3+6ab2)+2(3a2b+2b31)=0 so that we must have a3+6ab2=0 and 3a2b+2b31=0 If so, then a3+6ab2=0a(a2+6b2)=0. If it's the case that a=0, then we have 3a2b+2b31=0b=123 but by plugging that into f we obtain a non-zero value, on the other hand if a2+6b2=0 then this forces a,b=0 which also leads to a non-zero value when plugged into f therefore we know that f is irreducible over (2)


Let's observe that f(x) is separable, this is simply because it is a non-zero polynomial within a field of characteristic zero, so we have that |Gal(E/(2))|=[E:(2)] We also know that |Gal(E/(2))|||S3|=6. We also know that f has one real root, given by r=26 and the other two are distinct complex numbers.

Let F=(2) We now deduce that [E:F(r)]1 because F(r) is not the splitting field as just discussed, by iv in theorem 47, we have that [F(r):F]=deg(f)=3 therefore with all this information we are forced to have that [E:F(r)]=2 so that |Gal(E/(2))|=6 and thus Gal(E/(2))S3 so that each the galois's groups elements are one of the permutations.

Polynomials as Matrices
Let p(x)=a0+a1x1++amxmF[x] be a polynomial with coefficients in a field F. Let AMn×n(F), and note that we can evaluate p(A)=a0I+a1A++amAm
  • Prove that there is a non-zero polynomial p(x)F[x] such that p(A)=0
  • Let I be the set of all polynomaisl q(x)F[x] such that q(A)=0, prove that I is an ideal in F[x]
  • Let m(x) be a monic polynomilal of least degree in I. Prove that I=(m(x)).
  • Prove that m(x) is the unique monic polynomial of least degree in I

Consider Mn×n(F) as a vector space over F, in this case it's easy to see that the "one-hot" matricies at each i,j form a basis for this vector space, and the dimension is precisely n2.

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 n2+1 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 A with an x to obtain a polynomial such that A is a root.


let j(x),k(x)I, note that (jk)(x)=j(x)k(x) so that (jk)(A)=00=0 so that (jk)(x)I, also let r(x)F[x] then r(x)j(x)I because r(A)j(A)=r(A)0=0, so that I is an ideal.


We want to show that I=(m(x)), one way of proving this is to show that m(x) divides every element in I. So let f(x)I by the quotient remainder theorem we obtain q(x),r(x) such that f(x)=q(x)m(x)+r(x) where either r(x)=0 or deg(r)<deg(m), but note the latter is impossible because m(x) was the monic polynomial with the smallest degree in I (which is also the smallest degree of any polynomial in I) so that we must have r(x)=0 which implies that m(x) divides f(x) as needed.


Suppose that there was another monic polynomial c(x)I with the same degree as m(x), we know that m(x) divides c(x), but then we must have that the quotient is a non-zero constant polynomial, so that c(x)=αm(x), but then αm(x) is no longer monic unless α=1 therefore c(x)=m(x) as needed.

Big Adjoin
Suppose E=(α1,α2,,αn) where αi2 for i=1,2,,n. Prove that 23E.
Observe that each αi is a root of x2α2[x], in other words the minimal polynomial is at most 2, and so we know that [(α1,α2,αi):(α1,αi1)]{1,2} therefore by repeatedly breaking this into a product the entire sum will be 2k for some k0. Now if it so happens that 23E then we have [E:]=[E:(23)][(23):] Note that [E:(23)]=3 which implies that 3|2k which is clearly impossible, so we deduce that 23E as needed.
Automorphism Takes Roots of a Factor to the Root of the Same Factor
Let f(x)F[x] such that f(x)=a(x)b(x) where a(x),b(x) are irreducible and let E/F be a field extension of F. If σ:EE is an automorphism fixing F pointwise, and if αE is a root of f(x) such that a(α)=0 then σ(α) is a root of f(x) which makes a(σ(α))=0
Galois Group of Factored Polynomial
Let f(x)=(x22)(x23)(x25)[x] and E=(2,3,5) be the splitting field over f(x) over . Find the galois group Gal(E/) of f(x).

Given any σGal(E/) we can see that σ(2)=±2, σ(3)=±3 and σ(5)=±5, and we also know that it is uniquely determined by these equations. Therefore we deduce that the only possible automorphisms are σ(a+b2+c3+d5)=a±b2±c3±d5 that of which there are 23=8.

Alternately we may observe that given the maps σ1:(2,3,5)(2,3,5),σ2:(2,3,5)(2,3,5),σ3:(2,3,5)(2,3,5), it's easy to see that Gal(E/)=σ1,σ2,σ3C2×C2×C2.

Also we may explictly construct a Q basis for (2,3,5) to do this we recall that if we have a field extension E/F and an E-vector space V . If {v1,,vm} is a E-basis of V , and {e1,,en} is an F-basis of E , then {eivj:i[1n],j[1m]} is an F-basis of V. Using this we observe that since {1,2} is a basis for Q(2)/ and 1,3 is a basis for (2,3)/(2) then we conclude that 1,2,3,6 is a basis for (2,3), repeating this process again for (2,3,5) yields the basis (1,2,3,5,6,10,15,30), so that |Gal((2,3,5)/)|=[(2,3,5):]=8 which confirms our earlier remark on the number of automorphisms.

A Familiar Group
Consider the polynomial f(x)=x45[x] and let E=(i,54) be it's splitting field over
  • Show that |Gal(E/)|=[E:]=8
  • Describe all automorphisms {σ1,σ2,σ8} in Gal(E/)
  • Write the multiplication table for the group Gal(E/)
  • Which finite group is Gal(E/) isomorphic to?

Let's first notice that x45=(x54)(x+54)(xi54)(x+i54) and thus it is separable so the first part of the equation is confirmed. We now verify that [E:]=8.

Since x45[x] and we observe that 5 divides all coefficients besides the leading terms coefficient but 52 doesn't divide the constant term, then by Eisensteins Criterion this polynomial is irreducible over note that since p(x) has degree four, then we can conclude that [(54):]=4. Therefore we have [E:]=[(54,i):(54)][(54):]=24=8


Note that given any σGal(E/) we must have that σ(i)2=σ(i2)=σ(1)=1 and that σ(54)4=5 under such constraints we can see that σ(i){i,i} and that σ(54){54,54,i54,i54} therefore since we've observed taht there are 8 of them each such choice leads to a valid automorphism. If we denote τ:(i,54)(i,54) and σ:(i,54)(i,i54), we can see that using composition we can generate all of the possible automorphisms.

Therefore we know that Gal(E/)=τ,σ where we have that the order of τ,σ is 2 and 4 respectively and that στ=τσ1, with that said we can construct it's multiplication table

eσσ2σ3τστσ2τσ3τeeσσ2σ3τστσ2τσ3τσσσ2σ3eστσ2τσ3ττσ2σ2σ3eσσ2τσ3ττστσ3σ3eσσ2σ3ττστσ2τττσ3τσ2τστeσ3σ2σστσττσ3τσ2τσeσ3σ2σ2τσ2τσττσ3τσ2σeσ3σ3τσ3τσ2τσττσ3σ2σe

We can see that through this table that D8 and Gal(E/) are in clear bijection through the map f(τ)=f and f(σ)=r, 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 8 are D24 and the quaternion group, but in the quaternion group each non-trivial element has order 4 but in this group we note that τ2=e then it can only be D8.

Only One
Let B=(i54). Recall (see Q.3) that B is a subfield of the splitting field E of f(x)=x45[x].
  • Show that |Gal(E/B)|=2.
  • Describe the nontrivial automorphism σGal(E/B). That is say what σ is doing to the generators of E.

Since B then Gal(E/B)Gal(E/), so therefore we can look back at all of Gal(E/)'s automorphisms and determines which ones actually fix B. To do this we simply see which ones fix i54, observe that by exhaustion we can observe that only the identity and the automorphism σ(i)=i and σ(54)=54 will work. Therefore |Gal(E/B)|=2, note that this solves both parts of the question at once.


Big Polynomial
Let f(x)=x66x410x3+12x260x+17[x] and let E=(α1,α2,α3,α4,α5,α6) where
  • α1=2+53
  • α2=2+ω53
  • α3=2+ω253
  • α4=2+53
  • α5=2+ω53
  • α6=2+ω253

Show that
  • E=(2,53,ω)
  • Show that |Gal(E/)|=[E:]=12
  • Describe all the automorphisms {σ1,σ2,...σ12} in Gal(E/)

We start by showing that E=(2,53,ω). The harder direction is that (2,53,ω)E, an arbitrary element of (2,53,ω) is a+b2+c53+dω, so if we can show that each of 2,53,ωE then this sum will also be in E so we'll focus on this problem instead, but to that end note the following α1+α42=53α2+α5253=ωα2+α3+532=2 therefore we have one direction of the inclusion. As for E(2,53,ω) since each αi 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 (b)/ and (c,ω)/ are Galois as they are splitting fields of x22 and x35 respectively, therefore as (b,c,ω)=(b)(c,ω) as a composite then we know that Gal((b,c,ω)){(σ,τ):σ(b)(c,ω)=τ(b)(c,ω)} where the RHS is a subgroup of Gal((b)/)×Gal((c,ω)/). Note that (b)(c,ω)= therefore the RHS actually equals Gal((b)/)×Gal((c,ω)/)C2×C3

Note that given some σGal((b)/) we have that σ(b)=±b this is because b=2 so that (σ(b))2=σ(b2)=σ(2)=2 so that σ(b)=±b.

On the other hand if we had some τGal((c,ω)/) then since the roots of f(x)=x35 are 53,ω53,ω253(c,ω) then τ must permute these roots that of which there are 6 different permutations. Note that such a permutation may be specified by what it does to ω and 53 separately, also note that τ(ω)3=1 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 σ(b){b,b} and a permutation as specfied above, which may be given as σ(53)=... and σ(ω)=..., which uniquely restricts each root to get sent to a root.

Cos 20 Is not a Surd
In this question we only consider subfields of . Recall that a field extension B/F is a pure extension of type m=2 if B=F(α), where α2F but αF. A tower of number fields F=B0B1 Bt is a radical tower were each Bi+1/Bi is a pure extension of type 2 and F=. Let S denote the union of all towers of number fields. The numbers in S are called surds. So a surd is a real number that is in some tower of number fields.
  • Prove that S is a field. Note that S.
  • Let B/ be a field extension. Let p(x)B[x] be a polynomial with coefficients in B. Suppose a+brB(r) is a root of p(x), where rB but rB. Show that abr is also a root of p(x). Hint: apply the 'conjugation' σ to the equation p(a+br)=0. Here σ denotes the automorphsm of B(r) fixing B pointwise, determined by σ(a+br)=abr.
  • Let p(x) be a cubic polynomial with rational coefficients. Show that the sum of the roots of p(x) is a rational number.
  • Using the notation of part (b), assume p(x)B[x] is a cubic polynomial. Prove that if a+brB(r) is a root of p(x) then p(x) also has a root in B. Hint: parts (b), (c).
  • Use induction to prove that if a cubic polynomial p(x)[x] has a surd root, it must have a rational root.
  • Let θ denote a 20 degree angle. Show that (2cosθ)33(2cosθ) 1=0.
  • Show that x0:=2cosθ is not a surd. Hint: by part (f), we know x0 is a root of the cubic polynomial p(x)=x33x1[x]. So if x0 where a surd then p(x) would have a rational root. Show that p(x) has no rational roots (can use rational root theorem).

We start by proving that S is a field let xF(rm) and yF(sn) then x and y are both in the tower of fields which can be generated by adjoining r1,rm and then s1,sn to F0=. Since is a field than by combining x,y in any way with the operations at hand always still produces an element of , since S was defined as the union of all towers than we know that S and so that this combination of x,y is also in S showing that S is a field.


For this question lets first observe that r=r for any r, let p(x)=anxn+an1xn1++a1x1+a0, with ai and note that conjugation moves through summations and products, so that: p(a+br)=0an(a+br)n++a1(a+br)+a0=0an(a+br)n++a1(a+br)+a0=0an(a+br)n++a1(a+br)+a0=0p(a+br)=0p(abr)=0


Given the polynomial x3+bx2+cx+d=0 and the roots to this equation α1,α2,α3 then we know that x3+bx2+cx+damp;=(xα1)(xα2)(xα3)amp;=(x2(α1+α2)x+α1α2)(xα3)amp;=x3α3x2(α1+α2)x2+(α1+α2)α3x+α1α2xα1α2α3amp;=x3(α1+α2+α3)x2+(α1α2+α1α3+α2α3)xα1α2α3 therefore b=(α1+α2+α3) since b then the sum of the roots are rational.


If a+brB(r) is a root of p(x) then we know that abrB(r) is a root of p(x) but then as just shown the sum of all the roots is rational so if α is the last root of p(x) we have that a+br+abr+α=s Isolating α we have that α=s2a since aB and sB then αB


Suppose that p(x) has a surd root in the field extension B(r) where we have the tower =B0B1Bn Suppose that Bi where i>1 is the smallest field in the tower which contains a root of p(x) but then as just noted, there would then be a root in Bi1 which is a contradiction to Bi being the smallest field that contained a root of p(x) therefore i=0 so that =B0 contains a root of p(x), in other words we've just proven that p(x) has a rational root. Note that this proof is equivalent to induction.


Let x=2cos(20), let's prove that x33x1=0. We recall that cos(3θ)=4cos3(θ)3cos(θ), therefore plugging in θ=20 we obtain that 12=4cos3(20)3cos(20)8cos3(20)6cos(20)1=0x33x1=0


We've shown that if a polynomial p(x) 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 x33x1 has no rational roots then it would have no surd roots, and since 2cos(20) is a root, then it could not be a surd. Note that by the rational roots theorem the only possible roots are ±1 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 2cos(20) is not a surd