Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Part (b) proves one implication. Conversely, assume in ZF that
for every infinite cardinal . Let be any set and let be its Hartogs ordinal. Finite is already well-orderable, so suppose is infinite and form the disjoint union
By hypothesis, is bijective with . Since injects into , we obtain
Apply part (c), with and . It gives either an injection or a surjection . The first alternative contradicts Hartogs theorem. In the second, every fiber is a nonempty set of ordinals and therefore has a least member. The map
is an injection of into the ordinal and pulls its well-order back to . Thus every set is well-orderable, so the well-ordering theorem gives the axiom of choice. This proves the Tarski cardinal-square theorem.
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. D
  2. 16H
  3. Paper 4
  4. Ii
  5. 2023
  6. Past exam of the mathematics course of the University of Cambridge
  7. Mathematics course of the University of Cambridge
  8. Course of the University of Cambridge
  9. University of Cambridge
  10. List of universities
  11. Home