Proof that prime elements are irreducible in an integral domain
Builds on Integral domainPrime elementIrreducible elementDivisibility in a commutative ringUnit of a ringCancellation in an integral domain
Proof
Let be an integral domain and let be a prime element.
- By the definition of a prime element, and is not a unit. These are the first two conditions for to be irreducible.
- Let with . Then divides , because .
- Since is prime, or . The roles of and are symmetric, so we may assume .
- Write with . Then .
- Since , cancellation gives . Since is commutative, also , so is a unit.
- Thus in every factorization , one factor is a unit. With step 1, is irreducible.
Idea
If , then divides the product , so divides one factor, say . Then , and cancelling shows that is a unit.
Reading path
To understand this page from the ground up, read these 12 pages in order. The foundations come first. The path takes the proof Proof of cancellation in an integral domain.
Show the path as a graph
- no evidence level
- Group concept
- Ring definition
- Commutative ring definition
- Unit of a ring definition
- Zero divisor definition
- Divisibility in a commutative ring definition
- Integral domain definition
- Proof of cancellation in an integral domain proof
- Prime element definition
- Irreducible element definition
- Cancellation in an integral domain statement
- Proof that prime elements are irreducible in an integral domain proof
Where this leads
45 pages build on this one.
- Uniqueness of finite fields of a given order
- Existence of splitting fields
- Uniqueness of the algebraic closure
- Eisenstein's criterion
- Galois field
- Uniqueness of splitting fields
- Product of primitive polynomials is primitive
- Impossibility of doubling the cube
- Polynomial ring over a UFD is a UFD
- Existence of an algebraic closure
- Prime elements are irreducible in an integral domain
- Reduction modulo p test for irreducibility
- Gauss's lemma
- In a UFD irreducible elements are prime
- Irreducibility of the cyclotomic polynomials over the rationals
- Primitive element theorem
- Fundamental theorem of Galois theory
- Existence of finite fields of every prime power order
- Every polynomial has a root in some extension field
- Gauss–Wantzel theorem
- Proof of the impossibility of doubling the cube
- Proof that in a UFD irreducible elements are prime
- Perron's irreducibility criterion
- Proof of the uniqueness of splitting fields
- Model theory of algebraically closed fields
- Weil conjectures
- Proof that the product of primitive polynomials is primitive
- Proof of Eisenstein's criterion
- Cyclotomic field
- Steinitz's theorem on algebraically closed fields
- Standard conjectures on algebraic cycles
- Proof of the irreducibility of the cyclotomic polynomials by reduction modulo primes
- Proof of the primitive element theorem
- Galois group of a finite field extension
- Proof of the existence of splitting fields
- Proof of the existence of finite fields of every prime power order
- Categorical theory
- Quintic equation
- Proof of Gauss's lemma on irreducibility over a UFD
- Proof of the fundamental theorem of Galois theory
- Proof of the Gauss–Wantzel theorem
- Proof of the reduction modulo p test for irreducibility
- Impossibility of the classical construction problems
- Artin's theorem on fixed fields
- Proof of the existence of an algebraic closure
Further reading
About this page
| Tag | V4JCKJNVYR |
|---|---|
| URI | m2://V4JCKJNVYR |
| Kind | proof |
| Writing | W0 stub |
| MSC | 13A05 |
| Proves | Prime elements are irreducible in an integral domain |
| Uses | Integral domain, Prime element, Irreducible element, Divisibility in a commutative ring, Unit of a ring, Cancellation in an integral domain |
| 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)
- a source with a locator (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.