A proper ideal P of a commutative ring R such that whenever a·b ∈ P then either a ∈ P or b ∈ P; equivalently the quotient R/P is an integral domain.

Principle

Primality enforces multiplicative indecomposability at the level of ideals: products falling into P force at least one factor into P, so zero divisors vanish in the quotient.

Demonstration

In Z, the ideal (p) generated by a prime number p is prime and Z/(p) is a field and hence an integral domain. In k[x,y], the ideal (x) is prime because k[x,y]/(x) ≅ k[y] is a domain.

Misapplication

Assuming every prime ideal is maximal: this holds in principal ideal domains or rings of dimension one, but in general prime ideals need not be maximal.

Consequence

Quotienting by a prime ideal yields an integral domain; prime ideals correspond to irreducible geometric components in algebraic geometry and control localization behavior.

Reversal

A non-prime proper ideal allows products to lie inside without forcing a factor inside; its quotient ring has zero divisors and is not an integral domain.

Boundary

Prime ideals are by definition proper ideals; the zero ideal may be prime in domains. In noncommutative rings several inequivalent notions of prime arise (prime ideals, completely prime, etc.).

Semantic Tension

Prime ideal vs irreducible element: primes generalize prime elements, but a prime element generates a prime ideal only under appropriate factorization conditions; confusing the two blurs ideal-theoretic and element-theoretic viewpoints.

Synthesis

A prime ideal is a proper ideal that detects multiplicative decomposition: it forces factors of products to lie inside and yields an integral-domain quotient, making it a basic building block in algebraic and geometric structure.