SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q. 1. Quadratic Extensions
|
|
- Aubrey Cummings
- 8 years ago
- Views:
Transcription
1 SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q TREVOR ARNOLD Abstract This aer demonstrates a few characteristics of finite extensions of small degree over the rational numbers Q It comrises attemts at classification of all such extensions of degrees, 3, and 4, as well as mention of how one might begin the rocess of classifying all finite fields with degree a ower of Some toics discussed are discriminants of certain fields, how to reresent a given extension as a simle extension, and some alied Galois theory 1 Quadratic Extensions It is fairly clear why quadratic extensions are in most resects the easiest to understand: they all have the same Galois grou (Z ), their degree over Q is as small as ossible without being trivial, and the number is in many ways very easy to work with 11 The Make-u of a Quadratic Number Ring We begin by comletely classifying the elements of the number ring associated with any number field of the form Q( m), where m 1 or 0, is squarefree (ie a quadratic number field) This ring is by definition simly A Q( m), where A is the set of algebraic integers, defined here to be the set {α C : f(x) Z[x] f(α) 0, f(x) monic and irreducible} 111 Preliminaries We know that [Q( m) : Q], and so any element of A Q( m) is going to have a minimum olynomial f(x) with deg f(x) Thus we know that the algebraic numbers in Q( m) will simly be those elements α C such that f(α) 0 for some f(x) Z, monic and irreducible, with deg f(x) Our goal in section?? will be to show that any root of such a olynomial can be exressed in one of the following ways: as a + b m, where a, b Z and m or 3 (mod 4), for some squarefree m or as a+b m, where a, b Z, a b (mod 4), and m 1 (mod 4), for some squarefree m Date: May 15, 000 1
2 TREVOR ARNOLD This is trivial to show if deg f(x) <, and so we will only give a treatment of the case where f is a genuine quadratic 11 Roots of quadratic olynomials Take any f(x) x + cx + d Z[x] By an elementary theorem of arithmetic, we know that f(x) 0 x c ± c 4d Choosing t and m aroriately, we can write c 4d t m where m is squarefree Since t 0, 1,, or 3 (mod 4), it follows that t 0 or 1 (mod 4) This gives us two cases If t 0 (mod 4), we have 4 c 4d 4 c c c ± t m Z, and hence we know that any root of f(x) has the form a + b m, a, b Z This is what we want for m or 3 (mod 4), and for m 1 (mod 4), we simly note that have a + b m a + b m where 0 a b (mod ) If t 1 (mod 4), consider the ossibility that m or 3 (mod 4) We would c 4d c 1 or 1 3 or 3 (mod 4), which is an imossibility for the square of an integer (see above) Thus we must have m 1 (mod 4) since m is assumed to be squarefree, and therefore c 4d c t m (mod 4) Hence t and c are both odd (or else t c 0 (mod 4)) From all of this it follows that when t 1 (mod 4), c ±t (mod ) and m 1 (mod 4) Thus we have shown exlicitly that all roots of a monic quadratic olynomial f(x) Z[x] have the form stated above, from which it directly follows that any α A Q( m) also has this form for some m 1 The Discriminant Now that we have shown what an element of A Q( m) has to look like, we want to know if everything of this form has to be in A Q( m) for some m; more secifically, we want to show A Q( {a + b m} m or 3 (mod 4) m) { } a+b m : a b (mod ) m 1 (mod 4)
3 SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q 3 Once we know this, it will be clear that the following will be a set of generators for A Q( m) as a Z-module (ie an integral basis): { 1, m } when m or 3 (mod 4), { 1, } m when m 1 (mod 4) From this we will be able to directly comute the discriminant of Q( m) 11 Preliminaries Although we have shown exlicitly what the elements of a number field look like, we have as yet to show that if a+b m 1 A Q( m ) then necessarily m 1 m We do this here in rearation for demonstrating that the generators are exactly what we want them to be It is clear that the result will follow immediately if we can show so this how we shall roceed Q( m 1 ) Q( m ) Q, From elementary field theory, we want to show that one of the two conditions Q( m 1 ) Q( m ) Q Q( m 1 ) Q( m ) must hold, which we will be able to conclude from the following: [ Q( m 1 ) : Q ] [ Q( m ) : Q ] both Q( m 1 ) and Q( m ) contain Q( m 1 ) Q( m ) [ Q( m 1 ) Q( m ) : Q ] 1 or Thus all that we will need to show is that if there is some β / Q with β Q( m 1 ) Q( m ), then it must be the case that m 1 m There will be such a β a 1 + b 1 m1 a + b m with a i, b i Q if and only if we can find rational numbers a and b such that a + b m 1 m But then we would have the following: m a + ab m 1 + b m Z a 0 or b 0 If a 0 then m b m 1 Say b c d (where c, d Z are relatively rime, c 0, and d 0) We then have d m c m 1 First off, we may assume that c 1, because if so, we would either have m 1 not squarefree (in the case that d 1), or we would have m 1 m (if d 1), which we assumed wasn t the case But since (c, d) 1, we know that (c, d ) 1, and hence that for any dividing c, it is also the case that m, contradicting the assumtion that m is squarefree On the other hand, if b 0, then m a, again contradicting the fact that m is
4 4 TREVOR ARNOLD squarefree (since we know in this case that a, and hence a, is necessarily in Z since a Q) Thus we know there can be no such β, and hence Q( m 1 ) Q( m ) Q 1 A comlete descrition of A Q( m) What we have shown so far (combining sections?? and??) is that A Q( {a + b m} m or 3 (mod 4) m) { } a+b m : a b (mod ) m 1 (mod 4) What we want to show now is, which will rove to be relatively straightforward Once we have done this, all that we need to do to find the discriminant will be a short, simle calculation Let a+b m be in one of the sets on the right hand side of the above equation (where a b (mod ) and where a and b are odd only if m 1 (mod 4)) This is clearly a root of the following olynomial: x ax + a b m 4 Thus all we need to show is that a b m 4 Z We consider two cases If a and b are even then 4 a and 4 b so 4 a b m If a and b are odd, then (by assumtion) m 1 (mod 4) Since a and b are odd, we have a b 1 (mod 4) a b m (mod 4) 4 a b m x ax + a b Z[x] We can therefore conclude that A Q( m) is in fact equal to what we want it to be 13 The discriminant: summing u Now that we have our hands on exactly what the makeu of a quadratic number ring is, we can take the integral basis that we have found and lug them into the defining formula for the discriminant For m or 3 (mod 4), we know that {1, m} is an integral basis, and that the only conjugate of m is m Hence: disc ( Q( m) ) 1 m 1 ( m m ) ( ) m 4m m { For m 1 (mod 4), a set of generators over Z is 1+ m is 1 m Hence: disc ( Q( m) ) m 1 m ( 1 m 1, 1+ m } ; the conjugate of 1 + ) m ( m ) m
5 SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q 5 And so we have established the following formulae for the discriminant of any quadratic number field: disc ( Q( m) ) 4m if m or 3 (mod 4) m if m 1 (mod 4) Degree 3 Extensions Degree 3 extensions are nearly as routine as those of degree, and for many of the same reasons, eg their Galois grous are always isomorhic to Z 3 In this section, we will show which cubic olynomials have slitting fields of degree 3 over Q and what the discriminant of a simle radical extension of degree 3 over Q is, following the outline on of [?] (and Ex 41 in articular) 1 Cubic Polynomials In this section, it will be necessary to introduce the concet of the discriminant of a olynomial Say f(x) F [x], F a field, has roots x 1,, x n in its slitting field K F The discriminant D f of f is defined by the formula D D f (x i x j ) 1 i<j n It is clear that for any φ G(K : F ), which acts by necessity as a ermutation on the roots, then φ(d) D Since D is fixed by every element of the Galois grou, it must be the case that D F We roceed to find necessary and sufficient conditions for a cubic olynomial to have a slitting field of degree 3 over Q (as outlined on 13 of [?]) Assume that f(x) Q[x] is monic and irreducible of degree 3, say f(x) x 3 + ax + bx + c It can be shown by lengthy and tedious calculation (or the command [> discrim(x^3 + a*x^ + b*x + c, x); in Male) that in fact D f 7c +18cab+a b 4a 3 c 4b 3 It will be convenient to define the value d to be a square root of D, ie d ± (x i x j ), 1 i<j n where we may choose the sign arbitrarily It is clear that d K, the slitting field for f over Q Also convenient will be the variable change x u a/3, which yields f(x) g(u) u 3 + u + q for some, q Q We note that D g D f since our variable change simly translates the roots of f, and hence, for our uroses, we may assume that a 0 to
6 6 TREVOR ARNOLD begin with Thus we have D f 7c 4a 3 c The Galois grou G of K over Q can be viewed as a subgrou of S 3, the symmetric grou on 3 letters, acting on the three roots of f (which must be distinct since f is irreducible, and hence searable, over Q) Furthermore, G must act transitively on the roots of f The only transitive subgrous of S 3 are S 3 itself and A 3 Z3, the alternating subgrou comrising all even ermutations of S 3 It is clear that if φ Q is even, then φ(d) d (indeed, this is one way to define the term even ), ie G A 3 Z3 if and only if φ(d) d for each φ G, ie if and only if d Q Since the Fundamental Theorem of Galois Theory tells us that the degree of a Galois extension is equal to the order of its Galois grou, we have shown that [K : Q] 3 if and only if d Q, ie D is a square in Q Discriminants Following the sketch in [?], we will now show how to find the discriminant of Q( 3 m) where m is a cubefree integer We will need to use a standard theorem from algebraic number theory (taken from [?]), stated here without roof: Theorem If R is a number ring and α R has degree n over Q, then there is a basis for R over Z of the form 1, f 1(α),, f n 1(α) d 1 d n 1 where d i Z with d 1 d d n 1 and f i Z[x] is monic and of degree i The idea, of course, is to use this to find an integral basis for Q( 3 m) in this form, after doing which it will be a straightforward calculation to find the discriminant of this field We begin by verifying some needed facts 1 A few rearations Let K be an extension of Q of degree n and choose any two subsets of K {η 1,, η n } and {θ 1,, θ n } which generate the same Z- submodule Then there is a matrix M over Z such that η 1 M θ 1 η n θ n If σ 1,, σ n are the n isomorhisms between K and other subfields of C, then we may aly each σ i to the system of equations above to yield the matrix equation [ σj (η i ) ] M [ σ j (θ i ) ], which yields, according to the definition of the discriminant of an n-tule, disc (η 1,, η n ) M disc (θ 1,, θ n )
7 SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q 7 Since the determinant of M must be an integer, we may conclude that in fact disc (η 1,, η n ) disc (θ 1,, θ n ) Equality follows from the fact that our argument is symmetric It is an easy alication of this result that disc (α) disc ( 1, f 1 (α),, f n 1 (α) ) for α R and it follows from the definition of the discriminant that ( ) disc (α) (d 1 d d n 1 ) disc ( Q( 3 m) ) since 1, f 1 (α),, f n 1 (α) is an integral basis for Q( 3 m) Now choose two ositive integers i and j such that i + j < n Then we know that f i (α)f j (α) is monic of degree i + j and hence f i (α)f j (α) d i d j d i+j + i+j k1 m kd 1 d k f k (α) d i+j m k Z, imlying that d i d j d i+j Inductively then we can see that for i < n, d i 1 d i, and hence by (??), we have that d n(n 1) 1 disc (α) An integral basis The general manner in which we will roceed to find our integral basis for Q( 3 m) is by considering and rejecting various ossibilities In order to kee notation consistent with the receding section, we set K Q( 3 m) and α 3 m Furthermore, we choose two relatively rime, squarefree integers h and k such that m hk To start things off, we will show that disc (α) 7m To do this, we use the formula for the discriminant given by disc (α) ±N K/Q ( m α,q (α) ), where m α,q (x) is the minimum olynomial for α over Q and + holds if and only if n 0 or 1 (mod 4) Since m α,q (x) x 3 m, disc (α) N K/Q (3α ) 3α 3ζα 3ζ α 7m, where ζ is a rimitive 3 rd root of unity Thus, by the fact that d 6 1 disc (α) 7m, we know that d 1 1 or 3, and can only equal 3 when 9 m However, if 9 m we have β (α + a)/3 R for some integer a But then Tr(β 3 ) Z, and ( 1 Tr(β 3 ) Tr 7 m aα a α + 1 ) 7 a3 m + a3 Z 9 imlies that 3 a (since 9 m), which is imossible since then α/3 R and hence m/7 R, contradicting the fact that m is cubefree (the only rational numbers in a number ring are integers) Thus we have shown that d 1 1 in any case, and hence we may choose f 1 (α) α
8 8 TREVOR ARNOLD Now we attack f and d We will need the fact that α /k R, which is shown simly by the fact that it is a root of x 3 h k Now let m ±1 (mod 9) and let β (α 1) /3 It is easy to comute that β 3 β + 1 ± m (m 1) β 0, 3 7 which tells us that β R (which follows from our assumtion that m ±9 (mod 9)), and so too is αβ/3 (α ± k α + k )/3k Note that this imlies that when m ±1 (mod 9), 3k d (we have shown before that k d when m ±1 (mod 9)) By the revious section, we know that d disc (α) 7m, imlying that d 3m In order to work with the coefficients of f, it will be convenient to say f (α) α + aα + b for some integers a and b In order to start determining which rimes can divide d, we now choose a rime number such that 3, m, and m If d then it is clear that (α + aα + b)/ R Taking the trace of this yields ( α ) + aα + b Tr 3b Z, and hence b, imlying that (α + aα) R But then cubing this yields ( m + 3mα + 3a α + a 3 ) m Tr 3 3(m + a 3 m) 3 Z, and hence 3 m(m + a 3 ), imlying that m + a 3 (since m) But then (again since m) a 3, and it follows that a 3 and hence m, a contradiction Thus no such rime can divide d So suose 3 and m We know from above that k d Since m, it must be that k, and hence d If d, by the same reasoning as above we obtain 6 m(m + a 3 ) and hence 3 m, another contradiction Thus d for such rimes At this oint we know that d 3 i k for some i If we square f (α)/d, we get the following: mα + a m + a α + abα + b d R, which imlies that d divides all of a + b, m + ab, and b + am, since no ratio in R can have a denominator greater than d To find the ower of 3 dividing d, first consider the case where 3 m We have already shown that d 3m, and so it is easy to conclude that 9 d When m ±1 (mod 9), we already know that d is divisible by 3 since it is divisible by 3k If m ±1 (mod 9), suose 3 d If a or b 0 (mod 3), then m 0 (mod 3) since 3 divides m + ab However, we know that a + b 0 (mod 3) and so a 1 b (mod 3), imlying that m ab a (mod 3) All of this
9 SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q 9 imlies that (α + mα + 1)/3 is in R If m (mod 3), then we can see that (α 1) /3 R Hence ( ) (α 1) 4 Tr 8m 56m + 1 Z, 3 7 and so m(m ) 1 (mod 9) It is easy to check that the only way this can haen is when m 1 (mod 9), contradicting our assumtion A similar contradiction arises if we ick m (mod 9), and hence our initial assumtion that 3 d must have been incorrect Now we consider the case where 3 divides m but 9 does not Assume 3 d Then 3 also divides a + b and b + am Hence 3 b and also 3 a Thus α /3 is in R, and so m /7 is in Z, contradicting our assumtion that 9 m Our final case is when 9 m Assume now that 9 d Then 9 b + am imlies 9 b Then at least 3 b Then since 9 a + b, we have 9 a, which imlies that 9 b as well But then we recall from above that (α + aα)/3 R, and so 9 3 m(m + a 3 ), which, if we stare at it long enough, leads to 9 m, a contradiction 3 The discriminant finally Although the last section was a bit technical an somewhat obscure, it none the less got the job done Though at first it might not be aarent, we have in fact shown that 3k if m ±1 (mod 9) d, k if m ±1 (mod 9) which also means that an integral basis for Q( 3 m) has the form } {1, α, α when m ±1 (mod 9), k {1, α, α ± k α + k } when m ±1 (mod 9) 3k Now that we have found an integral basis, calculation of the discriminant amounts to calculating the square of the determinant of a 3 3 matrix We will not erform this calculation here, but the result is disc ( Q( 3 m) ) 3kh if m ±1 (mod 9) 7kh if m ±1 (mod 9) To sum u, the amount of work required to find the discriminant of even a small class of cubic extensions surasses that which is required to determine the discriminant of all quadratic extensions, affirming the large increase in comlexity associated with even a small increase in degree
10 10 TREVOR ARNOLD 3 Quartic Extensions Degree 4 extension are, dans un certain sens, the first interesting case, at least when it comes to the determination of Galois grous This section will be entirely devoted to the classification of the Galois grous of extensions of degree 4 over Q There are only two grous of order 4: V, the Klein 4-grou, and Z 4, the cyclic grou of order 4 31 Biquadratic Extensions We first consider the easiest case, ie when K (finite and Galois over Q) has G(K : Q) V The grou V has two distinct subgrous of order, which, by the Fundamental Theorem of Galois Theory (FTGT), corresond to two distinct subfields of degree over Q These two subfields can be written in the form Q( m) and Q( n) where m n and both are squarefree integers The smallest field containing both of these is, of course, Q( m, n), which has degree 4 over Q Thus we can conclude that every extension K with Galois grou over Q isomorhic to V is in this form Going the other way, if we have two squarefree integers m n, then every element of G ( Q( m, n) : Q ) has at most order, since the only conjugate of m (or n) is m (or n) This tells us that the Galois grou must be isomorhic to V, as Z 4 has two elements of order 4 3 Cyclic Extensions Now the more interesting case We aroach cyclic extensions in the natural way: namely, we will view them as degree extensions of quadratic extensions Thus they will all have the form Q( m)( α), where α Q( m) and hence α a + b m for some a, b Q We know that if b 0, then we have a Galois extension with Galois grou isomorhic to either V or Z, deending on whether Q( a) Q( m) or not If a 0, then the extension looks like Q( 4 d) (where d b m) The conjugates of 4 d over Q are the other roots of x 4 b m: ζ 4 d, ζ 4 d, and ζ 3 4 d, where ζ is a rimitive 4 th root of unity Then it is easy to see that if we are working with a Galois extension, then i Q( 4 d), which means that Q(i) Q( 4 d), and so this must be the unique quadratic subextension of degree (unique by the FTGT) Hence we may assume that m 1 to begin with, and so our extension is nothing more than Q( ib) Since i i, we know that ib b + i b, and hence Q( ib) Q(i, b), which means that the Galois grou of Q( ib) is isomorhic to either Z or V, since the Galois grou of Q(i, b) has already been shown to be one of these Hence we know that if we are looking for a cyclic extension, we need only consider the cases where a 0 b 31 Some necessary and sufficient conditions So let us choose a, b Q, not both zero, such that Q ( a + b m ) is a Galois extension of Q (m, as usual, is
11 SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q 11 taken to be squarefree) Our field must contain, then, not only a + b m, but also a b m, since they are conjugates (from now on we will call them α and ᾱ, resectively) The other two conjugates differ by only a negative sign, and so we can correctly claim that our field is a Galois extension if and only if it contains ᾱ We now roceed to rove a rather general statement which can be alied to our secific case This statement is: for a field K with char K and any elements a, b K, not squares in K, K( a) K( b) if and only if a x b for some x K Let us first assume the equality of the two fields Then a y + z b for some y, z K We then get a y + yz b + z b Now we can see that either y 0 or z 0 (but not both), or else a / K If z 0, then a is a square, contra our assumtion Hence y 0 and we get a z b where z K Now assume that a x b for some x K Then a ±x b K( b) and b ± 1 x a K( a) Hence K( a) K( b) We can aly this directly to our situation We have Q(α) Galois if and only if Q(α) Q(ᾱ), if and only if α c ᾱ for some c Q( m), and this holds if and only if a + b m a b m (a + b m) a b m c, ie if and only if a b m is a square in Q( m), say a b m (d + e m) d + ed m + e m As before, either d 0 or e 0 In the latter case, we have a b m d We will show that in this case, our extension does not have a Galois grou isomorhic to Z 4 (which is unfortunate since it is rather easy to find all solutions of this equation for a and b) First we note that a b m ᾱα d, and so α d/ᾱ Thus if we consider any element φ of the Galois grou, the order of φ can be at most since this is certainly the case if φ takes α to α, and if φ takes α to ᾱ, we have ( φ (α) φ ± d ) ± d α φ(α) ± d ± d α, α and hence φ has order Therefore, it is a necessary and sufficient condition for K to be Galois and cyclic over Q that a b m e m for some e Q We can simlify this condition by dividing through by e and absorbing it into a and b, yielding a /m b 1 3 Some more on this note There are two basic aroaches (as there are for most roblems) to trying find all fields of degree 4 over Q with cyclic Galois grou : the clever aroach and brute force We will discuss the latter aroach first The idea is that there is an easy solution to our equation, viz a 0, b i, but we are not allowed to use it However, what we are allowed to do is use this solution to
12 1 TREVOR ARNOLD find other solutions It is clear that any rational solution to this equation will lie on a line connecting the oint (0, i) C with our solution, and that this line will have comlex rational sloe Likewise, if we take any line with comlex rational sloe through the oint (0, i), we will get another comlex rational solution (this is a simle algebraic comutation), ie all solutions can be found in this way Thus we take b ( c d + i e f )a + i for some c, d, e, f Z We may assume that none of these integers are zero, since if c 0 then b is ure imaginary, and if e 0 then Imb i if a is real If we lug this into our original equation (a /m b 1) and ask a symbolic engine to solve for a, we get a m( e f c d ( ) i) 1 mc d me f + i mce df Again asking a symbolic engine, we find that if we require a R, then md 3 f 4 m df 4 c 3 md 3 f ce 0, an equation which can be whittled down to d f mf c md e 0 by using the fact that we are dealing with nonzero numbers The quadratic formula then tells us that this equation holds if and only if m d ±fc f me Since d is an integer and m is squarefree, the only way that this can haen is if f me m At first it may seem that we are right back where we started, but then we realize that f and e are integers, ie we have just shown that if there is a solution the equation a /m b 1 over the rationals, then there must also be one over the integers This is as far as the brute force method can take us The clever aroach leads to a different though likewise incomlete result We again rewrite our equation as a m(1 + b ) We can show that if ζ is a rimitive m th root of unity, then ( ) m Qζ of a,, as follows: c ( ) c Now we take the Gauss sum of ζ, and let For a rime, define the Legendre symbol 1 if a is a square mod 1 otherwise 1 ( ) c g ζ c Q( m) c1 Looking at the comlex conjugate ḡ of g, we see that 1 ( ) c ḡ ζ c c1 1 c1 ( ) c ζ c ( ) 1 g,
13 SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q 13 but we also have (summing over equivalence classes mod, which we are clearly justified in doing) ( ) 1 ( ab gḡ a,b ( ) 1 ( 1 ( a ) 1 + ( 1 a ) ζ a+b ( ) 1 b 1 ) ) 1 b1 ( 1 ) ζ a( 1+1) + ( ) 1 b 1 ( b ) ( a b a ab ( ) 1 ( b a,b 1 ) ( ζ b+1 ) a a ( ) b ( 1), ( ) 1 ) ζ a(1+b) ( 1 ( ) b ζ a(1+b) ( 1 ) + b 1 and hence g The fact that ḡ ±g tells us then that g ± ) a,b ( ) b ( ) b Since we will only be interested in ( rimes ) equivalent to 1 mod 4, we assume now that 1 (mod 4) and thus 1 (the easiest way to see that this is 1 true is to note that in this case Z 1 Z has an element of order 4) So now we have g, imlying that Q(ζ) Moreover, the (cyclic) Galois grou of Q(ζ) has degree divisible by 4, and so by the FTGT we know that there is a unique degree 4 cyclic subextension, necessarily containing Q( ) since this is the unique subextension of degree If m 1 n where i 1 (mod 4), then if ζ is a rimitive m th root of unity the Galois grou of Q(ζ) is isomorhic to Z 1 1 Z n 1 Let us consider the subgrou of order generated by the element ( ( 1 1)/,, ( n 1)/ ) We can choose ζ to be the roduct ζ 1 ζ n where ζ i is a rimitive th i root of unity It is clear that we can view each factor of Z i 1 in the Galois grou of Q(ζ) as corresonding to the subfield of Q(ζ i ) Doing this also makes it clear that each subfield generated by ( 0,, ( i 1)/, 0, ) contains i Hence the subfield in consideration contains m, and is, in fact, Q( m) This allows us to find a large class of examles of cyclic extensions of degree 4, which can be quite a useful, and at least tells us that there infinitely many such extensions 33 Further ossibilities The main oint to kee in mind when looking for extensions of degree a higher ower of is that most of the work is done in characterizing the next lowest ower Grous of order n will always have subgrous of order n 1, and will often be largely determined by them Thus, once all fields of degree n 1 have been classified, it becomes much easier to classify fields of the next highest
14 14 TREVOR ARNOLD degree For examle, the work done in this aer can be used directly to find all fields of degree 8 whose Galois grou is isomorhic either to Z Z Z or to Z 4 Z Adding a factor of 3 into the degree of the field is likewise relatively straightforward References [1] Larry Grove, Algebra, Academic Press, San Diego, 1983 [] Serge Lang, Algebraic number theory, Addison-Wesley, Menlo Park, CA, 1970 [3] Daniel A Marcus, Number fields, Sringer-Verlag, New York, 1977
As we have seen, there is a close connection between Legendre symbols of the form
Gauss Sums As we have seen, there is a close connection between Legendre symbols of the form 3 and cube roots of unity. Secifically, if is a rimitive cube root of unity, then 2 ± i 3 and hence 2 2 3 In
More informationON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
More informationFactoring of Prime Ideals in Galois Extensions
Chater 8 Factoring of Prime Ideals in Galois Extensions 8.1 Decomosition and Inertia Grous We return to the general AKLB setu: A is a Dedekind domain with fraction field K, L is a finite searable extension
More informationCyclotomic Extensions
Chapter 7 Cyclotomic Extensions A cyclotomic extension Q(ζ n ) of the rationals is formed by adjoining a primitive n th root of unity ζ n. In this chapter, we will find an integral basis and calculate
More informationLectures on the Dirichlet Class Number Formula for Imaginary Quadratic Fields. Tom Weston
Lectures on the Dirichlet Class Number Formula for Imaginary Quadratic Fields Tom Weston Contents Introduction 4 Chater 1. Comlex lattices and infinite sums of Legendre symbols 5 1. Comlex lattices 5
More information6.042/18.062J Mathematics for Computer Science December 12, 2006 Tom Leighton and Ronitt Rubinfeld. Random Walks
6.042/8.062J Mathematics for Comuter Science December 2, 2006 Tom Leighton and Ronitt Rubinfeld Lecture Notes Random Walks Gambler s Ruin Today we re going to talk about one-dimensional random walks. In
More informationminimal polyonomial Example
Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We
More informationTRANSCENDENTAL NUMBERS
TRANSCENDENTAL NUMBERS JEREMY BOOHER. Introduction The Greeks tried unsuccessfully to square the circle with a comass and straightedge. In the 9th century, Lindemann showed that this is imossible by demonstrating
More informationa 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)
ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x
More information7. Some irreducible polynomials
7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of
More informationNumber Theory Naoki Sato <ensato@hotmail.com>
Number Theory Naoki Sato 0 Preface This set of notes on number theory was originally written in 1995 for students at the IMO level. It covers the basic background material that an
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationGalois Theory III. 3.1. Splitting fields.
Galois Theory III. 3.1. Splitting fields. We know how to construct a field extension L of a given field K where a given irreducible polynomial P (X) K[X] has a root. We need a field extension of K where
More informationPythagorean Triples and Rational Points on the Unit Circle
Pythagorean Triles and Rational Points on the Unit Circle Solutions Below are samle solutions to the roblems osed. You may find that your solutions are different in form and you may have found atterns
More informationJUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson
JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials
More informationComplex Conjugation and Polynomial Factorization
Comlex Conjugation and Polynomial Factorization Dave L. Renfro Summer 2004 Central Michigan University I. The Remainder Theorem Let P (x) be a olynomial with comlex coe cients 1 and r be a comlex number.
More information3 1. Note that all cubes solve it; therefore, there are no more
Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if
More informationThe Notebook Series. The solution of cubic and quartic equations. R.S. Johnson. Professor of Applied Mathematics
The Notebook Series The solution of cubic and quartic equations by R.S. Johnson Professor of Applied Mathematics School of Mathematics & Statistics University of Newcastle upon Tyne R.S.Johnson 006 CONTENTS
More informationCHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
More information1 Gambler s Ruin Problem
Coyright c 2009 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins
More informationModern Algebra Lecture Notes: Rings and fields set 4 (Revision 2)
Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2) Kevin Broughan University of Waikato, Hamilton, New Zealand May 13, 2010 Remainder and Factor Theorem 15 Definition of factor If f (x)
More informationSOLVING POLYNOMIAL EQUATIONS BY RADICALS
SOLVING POLYNOMIAL EQUATIONS BY RADICALS Lee Si Ying 1 and Zhang De-Qi 2 1 Raffles Girls School (Secondary), 20 Anderson Road, Singapore 259978 2 Department of Mathematics, National University of Singapore,
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationA number field is a field of finite degree over Q. By the Primitive Element Theorem, any number
Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α K. The minimal polynomial Let K be a number field and
More informationIntroduction to Finite Fields (cont.)
Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number
More informationcalculating the result modulo 3, as follows: p(0) = 0 3 + 0 + 1 = 1 0,
Homework #02, due 1/27/10 = 9.4.1, 9.4.2, 9.4.5, 9.4.6, 9.4.7. Additional problems recommended for study: (9.4.3), 9.4.4, 9.4.9, 9.4.11, 9.4.13, (9.4.14), 9.4.17 9.4.1 Determine whether the following polynomials
More informationSolving Cubic Polynomials
Solving Cubic Polynomials 1.1 The general solution to the quadratic equation There are four steps to finding the zeroes of a quadratic polynomial. 1. First divide by the leading term, making the polynomial
More informationit is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
More informationH/wk 13, Solutions to selected problems
H/wk 13, Solutions to selected problems Ch. 4.1, Problem 5 (a) Find the number of roots of x x in Z 4, Z Z, any integral domain, Z 6. (b) Find a commutative ring in which x x has infinitely many roots.
More informationInteger roots of quadratic and cubic polynomials with integer coefficients
Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationIntroduction to NP-Completeness Written and copyright c by Jie Wang 1
91.502 Foundations of Comuter Science 1 Introduction to Written and coyright c by Jie Wang 1 We use time-bounded (deterministic and nondeterministic) Turing machines to study comutational comlexity of
More informationMathematics. (www.tiwariacademy.com : Focus on free Education) (Chapter 5) (Complex Numbers and Quadratic Equations) (Class XI)
( : Focus on free Education) Miscellaneous Exercise on chapter 5 Question 1: Evaluate: Answer 1: 1 ( : Focus on free Education) Question 2: For any two complex numbers z1 and z2, prove that Re (z1z2) =
More informationWinter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com
Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).
More informationMOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu
Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing
More informationThe Method of Partial Fractions Math 121 Calculus II Spring 2015
Rational functions. as The Method of Partial Fractions Math 11 Calculus II Spring 015 Recall that a rational function is a quotient of two polynomials such f(x) g(x) = 3x5 + x 3 + 16x x 60. The method
More information1.3 Algebraic Expressions
1.3 Algebraic Expressions A polynomial is an expression of the form: a n x n + a n 1 x n 1 +... + a 2 x 2 + a 1 x + a 0 The numbers a 1, a 2,..., a n are called coefficients. Each of the separate parts,
More informationPOLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).
More informationQUADRATIC RECIPROCITY IN CHARACTERISTIC 2
QUADRATIC RECIPROCITY IN CHARACTERISTIC 2 KEITH CONRAD 1. Introduction Let F be a finite field. When F has odd characteristic, the quadratic reciprocity law in F[T ] (see [4, Section 3.2.2] or [5]) lets
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationZeros of a Polynomial Function
Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we
More informationCopy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.
Algebra 2 - Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers - {1,2,3,4,...}
More informationThe Cubic Formula. The quadratic formula tells us the roots of a quadratic polynomial, a polynomial of the form ax 2 + bx + c. The roots (if b 2 b+
The Cubic Formula The quadratic formula tells us the roots of a quadratic olynomial, a olynomial of the form ax + bx + c. The roots (if b b+ 4ac 0) are b 4ac a and b b 4ac a. The cubic formula tells us
More informationNumber Theory Naoki Sato <sato@artofproblemsolving.com>
Number Theory Naoki Sato 0 Preface This set of notes on number theory was originally written in 1995 for students at the IMO level. It covers the basic background material
More informationUnique Factorization
Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon
More informationModule MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013
Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of
More informationSECTION 6: FIBER BUNDLES
SECTION 6: FIBER BUNDLES In this section we will introduce the interesting class o ibrations given by iber bundles. Fiber bundles lay an imortant role in many geometric contexts. For examle, the Grassmaniann
More informationFACTORING AFTER DEDEKIND
FACTORING AFTER DEDEKIND KEITH CONRAD Let K be a number field and p be a prime number. When we factor (p) = po K into prime ideals, say (p) = p e 1 1 peg g, we refer to the data of the e i s, the exponents
More informationSOLVING POLYNOMIAL EQUATIONS
C SOLVING POLYNOMIAL EQUATIONS We will assume in this appendix that you know how to divide polynomials using long division and synthetic division. If you need to review those techniques, refer to an algebra
More informationCUBIC AND QUARTIC FORMULAS. James T. Smith San Francisco State University
CUBIC AND QUARTIC FORMULAS James T. Smith San Francisco State University Quadratic formula You ve met the uadratic formula in algebra courses: the solution of the uadratic euation ax + bx + c = 0 with
More informationFactoring Polynomials
Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent
More informationAssignment 9; Due Friday, March 17
Assignment 9; Due Friday, March 17 24.4b: A icture of this set is shown below. Note that the set only contains oints on the lines; internal oints are missing. Below are choices for U and V. Notice that
More informationSOLUTIONS TO PROBLEM SET 3
SOLUTIONS TO PROBLEM SET 3 MATTI ÅSTRAND The General Cubic Extension Denote L = k(α 1, α 2, α 3 ), F = k(a 1, a 2, a 3 ) and K = F (α 1 ). The polynomial f(x) = x 3 a 1 x 2 + a 2 x a 3 = (x α 1 )(x α 2
More information1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is
More informationStat 134 Fall 2011: Gambler s ruin
Stat 134 Fall 2011: Gambler s ruin Michael Lugo Setember 12, 2011 In class today I talked about the roblem of gambler s ruin but there wasn t enough time to do it roerly. I fear I may have confused some
More informationA Class of Three-Weight Cyclic Codes
A Class of Three-Weight Cyclic Codes Zhengchun Zhou Cunsheng Ding Abstract arxiv:30.0569v [cs.it] 4 Feb 03 Cyclic codes are a subclass of linear codes have alications in consumer electronics, data storage
More information9. POLYNOMIALS. Example 1: The expression a(x) = x 3 4x 2 + 7x 11 is a polynomial in x. The coefficients of a(x) are the numbers 1, 4, 7, 11.
9. POLYNOMIALS 9.1. Definition of a Polynomial A polynomial is an expression of the form: a(x) = a n x n + a n-1 x n-1 +... + a 1 x + a 0. The symbol x is called an indeterminate and simply plays the role
More information5. Factoring by the QF method
5. Factoring by the QF method 5.0 Preliminaries 5.1 The QF view of factorability 5.2 Illustration of the QF view of factorability 5.3 The QF approach to factorization 5.4 Alternative factorization by the
More informationCONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationIntroduction to Algebraic Geometry. Bézout s Theorem and Inflection Points
Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a
More informationThe van Hoeij Algorithm for Factoring Polynomials
The van Hoeij Algorithm for Factoring Polynomials Jürgen Klüners Abstract In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial
More informationRevised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)
Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationFactoring of Prime Ideals in Extensions
Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree
More information1 Lecture: Integration of rational functions by decomposition
Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.
More informationA Modified Measure of Covert Network Performance
A Modified Measure of Covert Network Performance LYNNE L DOTY Marist College Deartment of Mathematics Poughkeesie, NY UNITED STATES lynnedoty@maristedu Abstract: In a covert network the need for secrecy
More informationAlgebraic and Transcendental Numbers
Pondicherry University July 2000 Algebraic and Transcendental Numbers Stéphane Fischler This text is meant to be an introduction to algebraic and transcendental numbers. For a detailed (though elementary)
More informationSECTION 0.6: POLYNOMIAL, RATIONAL, AND ALGEBRAIC EXPRESSIONS
(Section 0.6: Polynomial, Rational, and Algebraic Expressions) 0.6.1 SECTION 0.6: POLYNOMIAL, RATIONAL, AND ALGEBRAIC EXPRESSIONS LEARNING OBJECTIVES Be able to identify polynomial, rational, and algebraic
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationCOLLEGE ALGEBRA. Paul Dawkins
COLLEGE ALGEBRA Paul Dawkins Table of Contents Preface... iii Outline... iv Preliminaries... Introduction... Integer Exponents... Rational Exponents... 9 Real Exponents...5 Radicals...6 Polynomials...5
More informationPrecalculus Prerequisites a.k.a. Chapter 0. August 16, 2013
Precalculus Prerequisites a.k.a. Chater 0 by Carl Stitz, Ph.D. Lakeland Community College Jeff Zeager, Ph.D. Lorain County Community College August 6, 0 Table of Contents 0 Prerequisites 0. Basic Set
More informationPRIME NUMBERS AND THE RIEMANN HYPOTHESIS
PRIME NUMBERS AND THE RIEMANN HYPOTHESIS CARL ERICKSON This minicourse has two main goals. The first is to carefully define the Riemann zeta function and exlain how it is connected with the rime numbers.
More informationLecture Notes on Polynomials
Lecture Notes on Polynomials Arne Jensen Department of Mathematical Sciences Aalborg University c 008 Introduction These lecture notes give a very short introduction to polynomials with real and complex
More informationFactoring Polynomials and Solving Quadratic Equations
Factoring Polynomials and Solving Quadratic Equations Math Tutorial Lab Special Topic Factoring Factoring Binomials Remember that a binomial is just a polynomial with two terms. Some examples include 2x+3
More informationMore Properties of Limits: Order of Operations
math 30 day 5: calculating its 6 More Proerties of Limits: Order of Oerations THEOREM 45 (Order of Oerations, Continued) Assume that!a f () L and that m and n are ositive integers Then 5 (Power)!a [ f
More informationFactoring Patterns in the Gaussian Plane
Factoring Patterns in the Gaussian Plane Steve Phelps Introduction This paper describes discoveries made at the Park City Mathematics Institute, 00, as well as some proofs. Before the summer I understood
More informationZeros of Polynomial Functions
Review: Synthetic Division Find (x 2-5x - 5x 3 + x 4 ) (5 + x). Factor Theorem Solve 2x 3-5x 2 + x + 2 =0 given that 2 is a zero of f(x) = 2x 3-5x 2 + x + 2. Zeros of Polynomial Functions Introduction
More informationRESULTANT AND DISCRIMINANT OF POLYNOMIALS
RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results
More informationMath 345-60 Abstract Algebra I Questions for Section 23: Factoring Polynomials over a Field
Math 345-60 Abstract Algebra I Questions for Section 23: Factoring Polynomials over a Field 1. Throughout this section, F is a field and F [x] is the ring of polynomials with coefficients in F. We will
More informationOSTROWSKI FOR NUMBER FIELDS
OSTROWSKI FOR NUMBER FIELDS KEITH CONRAD Ostrowski classified the nontrivial absolute values on Q: up to equivalence, they are the usual (archimedean) absolute value and the p-adic absolute values for
More information15. Symmetric polynomials
15. Symmetric polynomials 15.1 The theorem 15.2 First examples 15.3 A variant: discriminants 1. The theorem Let S n be the group of permutations of {1,, n}, also called the symmetric group on n things.
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationThe Magnus-Derek Game
The Magnus-Derek Game Z. Nedev S. Muthukrishnan Abstract We introduce a new combinatorial game between two layers: Magnus and Derek. Initially, a token is laced at osition 0 on a round table with n ositions.
More informationGalois Theory. Richard Koch
Galois Theory Richard Koch April 2, 2015 Contents 1 Preliminaries 4 1.1 The Extension Problem; Simple Groups.................... 4 1.2 An Isomorphism Lemma............................. 5 1.3 Jordan Holder...................................
More informationFACTORISATION YEARS. A guide for teachers - Years 9 10 June 2011. The Improving Mathematics Education in Schools (TIMES) Project
9 10 YEARS The Improving Mathematics Education in Schools (TIMES) Project FACTORISATION NUMBER AND ALGEBRA Module 33 A guide for teachers - Years 9 10 June 2011 Factorisation (Number and Algebra : Module
More information6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives
6 EXTENDING ALGEBRA Chapter 6 Extending Algebra Objectives After studying this chapter you should understand techniques whereby equations of cubic degree and higher can be solved; be able to factorise
More informationFactoring Polynomials
Factoring Polynomials Hoste, Miller, Murieka September 12, 2011 1 Factoring In the previous section, we discussed how to determine the product of two or more terms. Consider, for instance, the equations
More informationCubic Functions: Global Analysis
Chapter 14 Cubic Functions: Global Analysis The Essential Question, 231 Concavity-sign, 232 Slope-sign, 234 Extremum, 235 Height-sign, 236 0-Concavity Location, 237 0-Slope Location, 239 Extremum Location,
More informationFACTORING IN QUADRATIC FIELDS. 1. Introduction. This is called a quadratic field and it has degree 2 over Q. Similarly, set
FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is called a quadratic field and it has degree 2 over Q. Similarly,
More informationThe Online Freeze-tag Problem
The Online Freeze-tag Problem Mikael Hammar, Bengt J. Nilsson, and Mia Persson Atus Technologies AB, IDEON, SE-3 70 Lund, Sweden mikael.hammar@atus.com School of Technology and Society, Malmö University,
More informationUnited Arab Emirates University College of Sciences Department of Mathematical Sciences HOMEWORK 1 SOLUTION. Section 10.1 Vectors in the Plane
United Arab Emirates University College of Sciences Deartment of Mathematical Sciences HOMEWORK 1 SOLUTION Section 10.1 Vectors in the Plane Calculus II for Engineering MATH 110 SECTION 0 CRN 510 :00 :00
More informationALGEBRA HW 5 CLAY SHONKWILER
ALGEBRA HW 5 CLAY SHONKWILER 510.5 Let F = Q(i). Prove that x 3 and x 3 3 are irreducible over F. Proof. If x 3 is reducible over F then, since it is a polynomial of degree 3, it must reduce into a product
More information3.6 The Real Zeros of a Polynomial Function
SECTION 3.6 The Real Zeros of a Polynomial Function 219 3.6 The Real Zeros of a Polynomial Function PREPARING FOR THIS SECTION Before getting started, review the following: Classification of Numbers (Appendix,
More information3 Factorisation into irreducibles
3 Factorisation into irreducibles Consider the factorisation of a non-zero, non-invertible integer n as a product of primes: n = p 1 p t. If you insist that primes should be positive then, since n could
More informationALGEBRA 2: 4.1 Graph Quadratic Functions in Standard Form
ALGEBRA 2: 4.1 Graph Quadratic Functions in Standard Form Goal Graph quadratic functions. VOCABULARY Quadratic function A function that can be written in the standard form y = ax 2 + bx+ c where a 0 Parabola
More information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More informationMath Review. for the Quantitative Reasoning Measure of the GRE revised General Test
Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important
More informationFACTORING QUADRATICS 8.1.1 and 8.1.2
FACTORING QUADRATICS 8.1.1 and 8.1.2 Chapter 8 introduces students to quadratic equations. These equations can be written in the form of y = ax 2 + bx + c and, when graphed, produce a curve called a parabola.
More information10 Splitting Fields. 2. The splitting field for x 3 2 over Q is Q( 3 2,ω), where ω is a primitive third root of 1 in C. Thus, since ω = 1+ 3
10 Splitting Fields We have seen how to construct a field K F such that K contains a root α of a given (irreducible) polynomial p(x) F [x], namely K = F [x]/(p(x)). We can extendthe procedure to build
More information