Part (b) proves one implication. Conversely, assume in ZF thatfor 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 unionBy 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 mapis 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.
Codex Wiki