Irreducible Polynomials

Abstract Algebra · Axiom Academy

LESSON Irreducible Polynomials Understanding the "prime numbers" of polynomial rings and how irreducibility depends on the coefficient field 1. Definition: The Polynomial Primes In other words, f(x) is irreducible over F if whenever f(x) = g(x)h(x) with , either g(x) or h(x) must be a constant (unit). 2. Field Dependence: Context Matters! The most important concept: irreducibility depends on the coefficient field . A polynomial can be irreducible over one field but reducible over another! How do we determine if a polynomial is irreducible? Here are three powerful methods: (doesn't divide leading coefficient) for all i < n (divides all other coefficients) (doesn't divide constant term twice) Let's apply these concepts to specific polynomials and see how irreducibility changes across different fields. Over : Irreducible (no rational roots by Rational Root Theorem) Over : Reducible (same factorization) Over : Irreducible (can verify by substitution y = x+1 and Eisenstein with p=2 ) Over : Reducible into four linear factors Over : Irreducible by Eisenstein's Criterion with p = 2

This is the written version of the interactive lesson above. See the full Abstract Algebra course.