MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Main Question:

Does ZF (no axiom of choice) prove that every Principal Ideal Domain is a Unique Factorization Domain?

The proofs I've seen all use dependent choice.

Minor Questions:

Does ZF + Countable Choice prove all PIDs are UFDs?

Does ZF prove "If all PIDs are UFDs, then [some choice principle]"?

(If anyone knows how I could force line breaks to put the questions on their own lines, please tell me.)

share|cite|improve this question
Nope, it doesn't. I'm also pretty sure this is a duplicate question. – Harry Gindi Jul 12 '10 at 6:57
Gjergji, that's a more nicely put together proof than the others I've seen, but it still uses dependant choice. – Ricky Demer Jul 12 '10 at 7:15
While this is very similar to the question cited, I don't see it as identical. This question amounts roughly to is "PID => UFD" equivalent in ZF to some choice principle. It's maybe more a question for logicians than algebraists. – Robin Chapman Jul 12 '10 at 8:41
Re line breaks, <br /> will force a line break. – Chris Phan Jul 12 '10 at 14:41
up vote 17 down vote accepted

ZF alone does not prove that every PID is a UFD, according to this paper: Hodges, Wilfrid. Läuchli's algebraic closure of $Q$. Math. Proc. Cambridge Philos. Soc. 79 (1976), no. 2, 289--297. MR 422022.

One result in this paper is the following:

COROLLARY 10. Neither (a) nor (b) is provable from ZF alone:
(a) Every principal ideal domain is a unique factorization domain.
(b) Every principal ideal domain has a maximal ideal.

By the way, I didn't know the answer to this question until today. To find the answer, I consulted Howard and Rubin's book Consequences of the Axiom of Choice. (Actually, I did a search for "principal ideal domain" of their book using Google Books.)

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.