Kaplansky's criterion for unique factorization domains
ProvedFamousTheorems.kaplansky_ufd_criterionKaplansky's criterion for unique factorization domains. An integral domain is a unique factorization domain if and only if every nonzero prime ideal of contains a prime element.
The criterion describes unique factorization through prime ideals alone. It gives a short proof that a Noetherian domain is a UFD exactly when every height-one prime ideal is principal, and it is the standard route to Nagata's criterion for factoriality.
Formalization note. Mathlib's UniqueFactorizationMonoid.iff_exists_prime_mem_of_isPrime, stated for commutative semiring domains. UniqueFactorizationMonoid R is Mathlib's notion of unique factorization, and Prime x is primality of an element.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem kaplansky_ufd_criterion {R : Type*} [CommSemiring R] [IsDomain R] :
UniqueFactorizationMonoid R ↔ ∀ I ≠ (⊥ : Ideal R), I.IsPrime → ∃ x ∈ I, Prime x := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `UniqueFactorizationMonoid.iff_exists_prime_mem_of_isPrime`. Proof here reduces to that Mathlib result.