Field theory and polynomials Proof
Proof of the reduction modulo p test for irreducibility
Builds on Irreducible polynomialMonic polynomialGauss's lemmaPrimitive polynomialUniversal property of the polynomial ringZ/pZ is a field for p primeDegree of a productUnit of a ringThe integers are a Euclidean domainEuclidean domains are principal ideal domainsPID implies UFDThe rationals as the field of fractions of the integers
Proof
- Let be monic, let be a prime, and assume that is irreducible in . Here is a field.
- Let reduce each coefficient modulo . By the universal property of the polynomial ring, applied to and , the map is a ring homomorphism. Also .
- If is monic, then is monic with , because the leading coefficient reduces to .
- Over a field , the units of are the nonzero constants. Indeed, forces by the degree of a product, and a nonzero constant has an inverse in .
- By the same degree argument, the units of are the units of , that is, .
- Since is irreducible, it is not a unit, so by Step 4. By Step 3, . So is nonzero and not a unit of .
- Suppose that with . Their leading coefficients multiply to , so both are or both are .
- In the second case, replace by . This does not change the product, and is a unit if and only if is. So we may assume that and are monic.
- By Step 2, . Since is irreducible, or is a unit, say . By Step 4, .
- By Step 3, . A monic polynomial of degree is the constant , so is a unit.
- By Steps 6 to 10, is irreducible in .
- The monic polynomial is primitive: an integer that divides every coefficient divides the leading coefficient , so it is .
- The ring is a Euclidean domain, hence a principal ideal domain, hence a unique factorisation domain, with field of fractions .
- By Gauss's lemma, with Steps 11 to 13, is irreducible in .
Idea
Reduction modulo is a ring homomorphism, and it keeps the degree of a monic polynomial. So a factorisation of into monic factors of positive degree would give one of . Gauss's lemma then moves irreducibility from to .
Reading path
To understand this page from the ground up, read these 146 pages in order. The foundations come first. The path takes the proofs Proof of Bézout's identity, Proof that in a UFD irreducible elements are prime, Proof of cancellation in an integral domain, Proof of the commutativity of addition by induction, Proof that R/P is an integral domain iff P is prime, Proof of the universal property of the polynomial ring, Proof that Z/nZ is a field if and only if n is prime, Proof that every principal ideal domain is a unique factorisation domain, Proof that a composition of injections is injective, Proof that R[x] is an integral domain iff R is, Proof that a function is bijective iff it has a two-sided inverse, Proof that the product of primitive polynomials is primitive, Proof that maximal ideals are prime, Proof that a finite integral domain is a field, Proof of the degree of a product over an integral domain, Proof of strong induction from ordinary induction, Proof of the correspondence theorem for rings, Proof of the complement principle, Proof of the pigeonhole principle, Proof that a composition of surjections is surjective, Proof that R/M is a field iff M is maximal, Proof that the integers are a Euclidean domain, Proof that congruence is compatible with addition, Proof that the only ideals of a field are zero and the whole field, Proof that congruence is compatible with multiplication, Proof of the rule of sum, Proof of the well-ordering principle from strong induction, Proof of the division algorithm, Proof of Gauss's lemma on irreducibility over a UFD, Proof that prime elements are irreducible in an integral domain, Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal, Proof of the bijection principle, Proof that Euclidean domains are principal ideal domains.
- Cardinality of a finite set definition
- Definition by recursion concept
- Divisibility definition
- Element definition
- Group concept
- Mathematical induction concept
- Natural numbers object
- Peano axioms concept
- Proposition concept
- Congruence modulo n definition
- Greatest common divisor definition
- Prime number definition
- Set definition
- Ring definition
- Successor function definition
- Conjunction definition
- Implication definition
- Predicate definition
- Residue class definition
- Proof that congruence is compatible with addition proof
- Proof that congruence is compatible with multiplication proof
- Composite number definition
- Empty set object
- Ordered pair definition
- Addition of natural numbers definition
- Commutative ring definition
- Ideal definition
- Intersection definition
- Polynomial ring definition
- Ring homomorphism definition
- Unit of a ring definition
- Zero divisor definition
- The successor function is injective statement
- Zero is not a successor statement
- Existential quantifier definition
- Universal quantifier definition
- Congruence is compatible with addition statement
- Congruence is compatible with multiplication statement
- Cartesian product definition
- Proof of the commutativity of addition by induction proof
- Order on the natural numbers definition
- Disjoint sets definition
- Divisibility in a commutative ring definition
- The ring of integers example
- Ideal generated by a subset definition
- Prime ideal definition
- Subset definition
- Maximal ideal definition
- Two-sided ideal definition
- Proof of the universal property of the polynomial ring proof
- Field definition
- Degree of a polynomial definition
- Integral domain definition
- Polynomial evaluation definition
- Uniqueness quantifier definition
- Integers modulo n definition
- Commutativity of addition statement
- Binary relation definition
- Principal ideal definition
- Quotient ring definition
- Proof of strong induction from ordinary induction proof
- Associate elements definition
- Prime element definition
- Proof of cancellation in an integral domain proof
- Proof that the only ideals of a field are zero and the whole field proof
- Evaluation homomorphism definition
- Irreducible element definition
- Field of fractions definition
- Leading coefficient definition
- Euclidean domain definition
- Strong induction statement
- Proof that R/M is a field iff M is maximal proof
- Proof that R/P is an integral domain iff P is prime proof
- Greatest common divisor in an integral domain definition
- Principal ideal domain definition
- The rationals as the field of fractions of the integers example
- Function definition
- The only ideals of a field are zero and the whole field statement
- Irreducible polynomial definition
- Unique factorisation domain definition
- Universal property of the polynomial ring statement
- Cancellation in an integral domain statement
- Monic polynomial definition
- Proof of the degree of a product over an integral domain proof
- Proof of the well-ordering principle from strong induction proof
- Codomain definition
- Content of a polynomial definition
- Function composition definition
- Identity function definition
- Injective function definition
- R/P is an integral domain iff P is prime statement
- Image of a set definition
- Preimage of a set definition
- Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal proof
- Proof that prime elements are irreducible in an integral domain proof
- Degree of a product statement
- Primitive polynomial definition
- Well-ordering principle statement
- Left inverse definition
- Right inverse definition
- Surjective function definition
- Proof that a composition of injections is injective proof
- In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
- Prime elements are irreducible in an integral domain statement
- Proof that R[x] is an integral domain iff R is proof
- Proof of the division algorithm proof
- Proof that a composition of surjections is surjective proof
- Composition of injections is injective statement
- Bijective function definition
- Proof that Euclidean domains are principal ideal domains proof
- Proof that in a UFD irreducible elements are prime proof
- Proof that the integers are a Euclidean domain proof
- R[x] is an integral domain iff R is statement
- Division algorithm statement
- Composition of surjections is surjective statement
- Proof of the rule of sum proof
- Proof that a function is bijective iff it has a two-sided inverse proof
- Proof of the correspondence theorem for rings proof
- Euclidean domains are principal ideal domains statement
- In a UFD irreducible elements are prime statement
- The integers are a Euclidean domain statement
- Proof of Bézout's identity proof
- Rule of sum statement
- Bijective iff it has a two-sided inverse statement
- Correspondence theorem for rings statement
- Proof that the product of primitive polynomials is primitive proof
- Proof of Gauss's lemma on irreducibility over a UFD proof
- Bézout's identity statement
- Proof of the bijection principle proof
- Proof of the complement principle proof
- Product of primitive polynomials is primitive statement
- R/M is a field iff M is maximal statement
- Bijection principle statement
- Complement principle statement
- Proof that Z/nZ is a field if and only if n is prime proof
- Gauss's lemma statement
- Proof that maximal ideals are prime proof
- Proof of the pigeonhole principle proof
- Maximal ideals are prime statement
- Pigeonhole principle statement
- Proof that every principal ideal domain is a unique factorisation domain proof
- PID implies UFD statement
- Proof that a finite integral domain is a field proof
- A finite integral domain is a field statement
- Z/pZ is a field for p prime statement
- Proof of the reduction modulo p test for irreducibility proof
Where this leads
1 page builds on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Irreducible_polynomial, Over the integers and finite fields
About this page
| Tag | W5N7GWHAKZ |
|---|---|
| URI | m2://W5N7GWHAKZ |
| Kind | proof |
| Writing | W0 stub |
| MSC | 12E05 |
| Proves | Reduction modulo p test for irreducibility |
| Uses | Irreducible polynomial, Monic polynomial, Gauss's lemma, Primitive polynomial, Universal property of the polynomial ring, Z/pZ is a field for p prime, Degree of a product, Unit of a ring, The integers are a Euclidean domain, Euclidean domains are principal ideal domains, PID implies UFD, The rationals as the field of fractions of the integers |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.