statement proposition
Prime elements are irreducible in an integral domain
Statement
Let be an integral domain and let be a prime element. Then is irreducible.
Remarks
The proof: let . Then , so , say. Write . Then , and cancellation gives , so is a unit. The converse is false in general: in , is irreducible but not prime. In a unique factorization domain, irreducible elements are prime.
Explanations
L1 human
Suppose that a prime factors as . Then divides one factor, so that factor is at least as large as for divisibility. The other factor must then be a unit.
What this node 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 node is. They do not measure its truth.
What this needs
To read this node, read these 10 nodes in this order. The foundations come first, and the list ends with this node.
- 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
- Prime element definition
- Irreducible element definition
- Prime elements are irreducible in an integral domain statement
What depends on this
1 node uses this node, directly or through other nodes.
- In a UFD irreducible elements are prime 0QRCFZKXH8
Sources
- Web https://en.wikipedia.org/wiki/Prime_element, Irreducible elements
What links here
Used by
- In a UFD irreducible elements are prime 0QRCFZKXH8