Math 4120 Lecture 6.3: Polynomials and Irreducibility PDF

Lecture 6.3: Polynomials and irreducibility Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/...

Lecture 6.3: Polynomials and irreducibility Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson) Lecture 6.3: Polynomials and irreducibility Math 4120, Modern Algebra 1 / 11 Polynomials Definition Let x be an unknown variable. A polynomial is a function f (x) = an x n + an−1 x n−1 + · · · + a2 x 2 + a1 x + a0. The highest non-zero power of n is called the degree of f. We can assume that all of our coefficients ai lie in a field F. For example, if each ai ∈ Z (not a field), we could alternatively say that ai ∈ Q. Let F [x] denote the set of polynomials with coefficients in F. We call this the set of polynomials over F. Remark Even though Z is not a field, we can still write Z[x] to be the set of polynomials with integer coefficients. Most polynomials we encounter have integer coeffients anyways. M. Macauley (Clemson) Lecture 6.3: Polynomials and irreducibility Math 4120, Modern Algebra 2 / 11 Radicals The roots of low-degree polynomials can be expressed using arithmetic and radicals. For example, the roots of the polynomial f (x) = 5x 4 − 18x 2 − 27 are √ √ s s 6 6+9 9−6 6 x1,2 = ± , x3,4 = ±. 5 5 Remark The operations of arithmetic, and radicals, are really the “only way” we have to write down generic complex numbers. Thus, if there is some number that cannot be expressed using radicals, we have no way to express it, unless we invent a special symbol for it (e.g., π or e). Even weirder, since a computer program is just a string of 0s and 1s, there are only countably infinite many possible programs. Since R is an uncountable set, there are numbers (in fact, “almost all” numbers) that can never be expressed algorithmically by a computer program! Such numbers are called “uncomputable.” M. Macauley (Clemson) Lecture 6.3: Polynomials and irreducibility Math 4120, Modern Algebra 3 / 11 Algebraic numbers Definition A complex number is algebraic (over Q) if it is the root of some polynomial in Z[x]. The set A of all algebraic numbers forms a field (this is not immediately obvious). A number that is not algebraic over Q (e.g., π, e, φ) is called transcendental. Every number that can be expressed from the natural numbers using arithmetic and radicals is algebraic. For example, consider p5 √ √ x = 1 + −3 ⇐⇒ x 5 = 1 + √−3 5 ⇐⇒ x − 1 = −3 ⇐⇒ (x 5 − 1)2 = −3 ⇐⇒ x 10 − 2x 5 + 4 = 0. Question Can all algebraic numbers be expressed using radicals? This question was unsolved until the early 1800s. M. Macauley (Clemson) Lecture 6.3: Polynomials and irreducibility Math 4120, Modern Algebra 4 / 11 Hasse diagrams The relationship between the natural numbers N, and the fields Q, R, A, and C, is shown in the following Hasse diagrams. C complex numbers a + bi, for a, b ∈ R C algebraic closure A || ||| ??? | R real numbers || ???A solving polynomial equations AA AA A using radicals AA Q a operations of arithmetic Q rational numbers, b for a, b ∈ Z (b 6= 0) N M. Macauley (Clemson) Lecture 6.3: Polynomials and irreducibility Math 4120, Modern Algebra 5 / 11 Some basic facts about the complex numbers Definition A field F is algebraically closed if for any polynomial f (x) ∈ F [x], all of the roots of f (x) lie in F. Non-examples √ Q is not algebraically closed because f (x) = x 2 − 2 ∈ Q[x] has a root 2 6∈ Q. √ R is not algebraically closed because f (x) = x 2 + 1 ∈ R[x] has a root −1 6∈ R. Fundamental theorem of algebra The field C is algebraically closed. Thus, every polynomial f (x) ∈ Z[x] completely factors, or splits over C: f (x) = (x − r1 )(x − r2 ) · · · (x − rn ) , ri ∈ C. Conversely, if F is not algebraically closed, then there are polynomials f (x) ∈ F [x] that do not split into linear factors over F. M. Macauley (Clemson) Lecture 6.3: Polynomials and irreducibility Math 4120, Modern Algebra 6 / 11 Complex conjugates f (x) = x 2 − 2x + 2 Recall that complex roots of f (x) ∈ C[x] come Roots: 1 ± i y in conjugate pairs: If r = a + bi is a root, then so is r := a − bi. 1+i For example, here are the roots of some polyno- x mials (degrees 2 through 5) plotted in the com- plex plane. All of them exhibit symmetry across 1−i the x-axis. f (x) = 12x 3 − 44x 2 + 35x + 17 f (x) = x 4 + 1 f (x) = 8x 5 −28x 4 −6x 3 +83x 2 −117x +90 √ √ Roots: − 1 , 2± 1 i Roots: ± 2 ± 2 Roots: −2, 3 , 3, 1 i ±i 3 2 2 2 2 2 y y y √ √ √ √ − 2+ 2i 2+ 2i 1 +i 2 2 2 2 2 2 + 1i 2 −1 −2 3 3 2 3 x x x 2 − 1i √ 2 √ √ √ 2− 2i 2− 2i 1 −i − 2 2 2 2 2 M. Macauley (Clemson) Lecture 6.3: Polynomials and irreducibility Math 4120, Modern Algebra 7 / 11 Irreducibility Definition A polynomial f (x) ∈ F [x] is reducible over F if we can factor it as f (x) = g (x)h(x) for some g (x), h(x) ∈ F [x] of strictly lower degree. If f (x) is not reducible, we say it is irreducible over F. Examples x 2 − x − 6 = (x + 2)(x − 3) is reducible over Q. x 4 + 5x 2 + 4 = (x 2 + 1)(x 2 + 4) is reducible over Q, but it has no roots in Q. x 3 − 2 is irreducible over Q. If we could factor it, then one of the factors would have degree 1. But x 3 − 2 has no roots in Q. Facts If deg(f ) > 1 and has a root in F , then it is reducible over F. Every polynomial in Z[x] is reducible over C. If f (x) ∈ F [x] is a degree-2 or 3 polynomial, then f (x) is reducible over F if and only if f (x) has a root in F. M. Macauley (Clemson) Lecture 6.3: Polynomials and irreducibility Math 4120, Modern Algebra 8 / 11 Eisenstein’s criterion for irreducibility Lemma Let f ∈ Z[x] be irreducible. Then f is also irreducible over Q. Equivalently, if f ∈ Z[x] factors over Q, then it factors over Z. Theorem (Eisenstein’s criterion) A polynomial f (x) = an x n + an−1 x n−1 + · · · a1 x + a0 ∈ Z[x] is irreducible if for some prime p, the following all hold: 1. p - an ; 2. p | ak for k = 0,... , n − 1; 3. p 2 - a0. For example, Eisenstein’s criterion tells us that x 10 + 4x 7 + 18x + 14 is irreducible. Remark If Eisenstein’s criterion fails for all primes p, that does not necessarily imply that f is reducible. For example, f (x) = x 2 + x + 1 is irreducible over Q, but Eisenstein cannot detect this. M. Macauley (Clemson) Lecture 6.3: Polynomials and irreducibility Math 4120, Modern Algebra 9 / 11 Extension fields as vector spaces Recall that a vector space over Q is a set of vectors V such that If u, v ∈ V , then u + v ∈ V (closed under addition) If v ∈ V , then cv ∈ V for all c ∈ Q (closed under scalar multiplication). √ The field Q( 2) is a 2-dimensional vector space over Q: √ √ Q( 2) = {a + b 2 : a, b ∈ Q}. √ √ This is why we say that {1, 2} is a basis for Q( 2) over Q. Notice that the other field extensions we’ve seen are also vector spaces over Q: √ √ √ Q( 2,√ i) = {a + b √2 + ci√+ d 2i : a, b,√c, d ∈ Q}, √ Q(ζ, 2) = {a + b 2 + c 4 + dζ + eζ 3 2 + f ζ 3 4 : a, b, c, d, e, f ∈ Q}. 3 3 3 √ √ As Q-vector spaces, Q( 2, i) has dimension 4, and Q(ζ, 3 2) has dimension 6. Definition If F ⊆ E are fields, then the degree of the extension, denoted [E : F ], is the dimension of E as a vector space over F. Equivalently, this is the number of terms in the expression for a general element for E using coefficients from F. M. Macauley (Clemson) Lecture 6.3: Polynomials and irreducibility Math 4120, Modern Algebra 10 / 11 Minimial polynomials Definition Let r 6∈ F be algebraic. The minimal polynomial of r over F is the irreducible polynomial in F [x] of which r is a root. It is unique up to scalar multiplication. Examples √ √ 2 has minimal polynomial x 2 − 2 over Q, and [Q( 2) : Q] = 2. √ i = −1 has minimal polynomial x 2 + 1 over Q, and [Q(i) : Q] = 2. ζ = e 2πi/3 has minimal polynomial x 2 + x + 1 over Q, and [Q(ζ) : Q] = 2. √ √ 3 2 has minimal polynomial x 3 − 2 over Q, and [Q( 3 2) : Q] = 3. What are the minimal polynomials of the following numbers over Q? √ √ √ ζ2 , ζ2 2. 3 3 − 2, −i , ζ 2, Degree theorem The degree of the extension Q(r ) is the degree of the minimal polynomial of r. M. Macauley (Clemson) Lecture 6.3: Polynomials and irreducibility Math 4120, Modern Algebra 11 / 11