Every Euclidean domain is a principal ideal domain
ProvedFamousTheorems.euclidean_domain_is_pid_6bEvery Euclidean domain is a principal ideal domain. Let be a Euclidean domain. Then every ideal of is principal.
A nonzero ideal is generated by any of its elements of smallest Euclidean size, because the remainder on division by such an element lies in the ideal and is smaller. This is how one shows that , for a field , and the Gaussian integers are principal ideal domains, and hence unique factorization domains.
Formalization note. Mathlib's EuclideanDomain.to_principal_ideal_domain. IsPrincipalIdealRing R says that every ideal of is principal. A Mathlib EuclideanDomain comes with a well-founded relation r and a remainder function such that the remainder is r-smaller than the divisor.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems theorem euclidean_domain_is_pid_6b (R : Type*) [EuclideanDomain R] : IsPrincipalIdealRing R := by sorry end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `EuclideanDomain.to_principal_ideal_domain`. Proof here reduces to that Mathlib result.