Euclidean, PID, UFD hierarchy
Why this is asked: Memorise the chain and the counterexample at each strict inclusion — that single table answers most Part-C ring questions.
The chain
Field ⊂ Euclidean domain ⊂ PID ⊂ UFD ⊂ integral domain
| Inclusion | Strict because |
|---|---|
| Euclidean ⊊ PID | is a PID, not Euclidean |
| PID ⊊ UFD | and 𝔽[X, Y]: (2, X) and (X, Y) are not principal |
| UFD ⊊ domain |
Facts that follow
- R UFD ⇒ R[X] UFD (Gauss). So is a UFD.
- R PID ⇏ R[X] PID: is a PID, is not.
- 𝔽 field ⇒ 𝔽[X] Euclidean (degree), hence a PID; 𝔽[X, Y] is not. and are Euclidean (norm), hence PIDs and UFDs.
- In a UFD: irreducible ⇔ prime. In a general domain only prime ⇒ irreducible; in is irreducible but not prime.
- Every PID is Noetherian; infinitely many variables) is a UFD that is not Noetherian.
Norms for quadratic rings
| db| is multiplicative; units are the elements of norm 1. In and no element has norm 2, so 2 is irreducible; yet 2 | without dividing either factor.
Key takeaways
- Learn one counterexample per strict inclusion: .
- UFD is preserved by adjoining variables; PID is not.
- Norm arguments settle irreducibility in quadratic rings.
See it move
The trap here
“Every integral domain is a UFD” — false
Next: Polynomial rings and irreducibility tests
Create a free account to keep your place and have this feed your study plan.
Open this in the full syllabus view · Unit 2