← Graph View All Domains

A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Irreducibility Criteria

Graduate Depth 92 in the knowledge graph ☐ I know this ☆ Set as goal

42topics build on this

389prerequisites beneath it

See this on the map →

Polynomial Rings→→Splitting Fields

Core Idea

A polynomial is irreducible if it cannot be factored into non-constant polynomials. Eisenstein's criterion provides a sufficient condition for irreducibility over fields and principal ideal domains.

Explainer

From your work on polynomial rings, you know that polynomials can be factored much like integers — and just as a prime integer resists factorization, an irreducible polynomial cannot be written as a product of two non-constant polynomials of lower degree. Over ℚ, this is a richer question than it might seem: a polynomial could be irreducible over ℚ yet factor completely over ℝ or ℂ. Irreducibility is always relative to the coefficient ring or field you're working in.

The most practical tool for detecting irreducibility over ℚ is Eisenstein's criterion. It says: if you can find a prime p such that p divides every coefficient except the leading one, and p² does not divide the constant term, then the polynomial is irreducible over ℚ. For example, take f(x) = x⁴ + 6x³ + 12x² + 18x + 6. The prime p = 3 divides 6, 12, 18, and 6 (all non-leading coefficients), does not divide the leading coefficient 1, and 9 does not divide 6. Eisenstein applies: f is irreducible over ℚ.

An important technique is substitution before applying Eisenstein. The polynomial x^p − 1 is not directly Eisenstein, but substituting x → x + 1 gives (x+1)^p − 1, which after expanding has Eisenstein structure with the prime p. This proves the cyclotomic polynomial Φ_p(x) = (x^p − 1)/(x − 1) is irreducible — a non-obvious fact that substitution makes transparent.

Eisenstein is only a sufficient condition, not necessary — many irreducible polynomials fail every prime's test. When Eisenstein doesn't apply, other methods come into play: the rational root theorem (if f has a rational root, it factors as a linear times a lower-degree polynomial), reduction mod p (if f is irreducible mod p for some prime p, then f is irreducible over ℚ, by Gauss's lemma), or degree arguments (a cubic with no rational roots must be irreducible over ℚ). Together these criteria form a toolkit for proving that specific polynomials — like the minimal polynomials of algebraic numbers — cannot be factored, which is the foundation for building field extensions.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Proof by Cases → Proving by Cases and Exhaustion → Vacuous Truth and Trivial Cases → Proof by Cases (Proof by Exhaustion) → Mathematical Induction → Binary Operations and Algebraic Structures → Group Definition and Examples → Basic Properties of Groups → Group Homomorphisms → Group Isomorphisms → Cayley's Theorem → Cosets and Lagrange's Theorem → Normal Subgroups → Quotient Groups → First Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → First Isomorphism Theorem for Groups → Third Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → Integral Domains → Principal Ideal Domains → Unique Factorization Domains → Polynomial Rings → Irreducibility Criteria

Longest path: 93 steps · 389 total prerequisite topics

Prerequisites (1)

Polynomial Ringshard

Leads To (1)

Splitting Fieldssoft