statement theorem
Well-ordering theorem
Statement
Assume the axiom of choice. Then each set has a well-order.
Remarks
Another name is Zermelo's theorem. Over ZF, it is equivalent to the axiom of choice and to Zorn's lemma. A well-order of is hard or impossible to visualize, because its construction needs the axiom of choice. With a well-order, each set allows proofs by transfinite induction.
History
Ernst Zermelo proved the theorem in 1904 with the axiom of choice, which he formulated for this purpose.
Explanations
L1 human
The theorem says that each set has an order with a first element, a next element, and so on, possibly beyond infinity. For the usual order works. For such an order exists, but it is very hard to picture.
What this node needs for W2
- edge about out: the concepts that the statement is about (0 of 1)
- edge proves in: at least one proof node (0 of 1)
- edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
- explanation L2 (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
Sources
- Web https://en.wikipedia.org/wiki/Well-ordering_theorem, lead section
What links here
No node links to this node yet.