Let RR be an . An element p∈Rp\in R is a prime element if p≠0p\neq 0, pp is not a unit, and whenever pp divides a product abab, then pp divides aa or pp divides bb.

Remarks

Prime elements correspond to prime ideals: pp is prime if and only if the (p)(p) is a . Prime elements are always , and in a UFD the converse holds.

Examples
  • In Z\mathbb{Z}, an integer is prime (in the usual number-theoretic sense) exactly when it is a prime element.
  • In k[x]k[x] for a field kk, the polynomial xx is a prime element.
  • In Z\mathbb{Z}, the element 66 is not prime since 6∣2⋅36\mid 2\cdot 3 but 6∤26\nmid 2 and 6∤36\nmid 3.