Work with well-ordered cardinals, as usual with the axiom of choice. We first prove the infinite cardinal arithmetic identity . If a least infinite counterexample existed, order pairs of ordinals below first by their maximum coordinate, then lexicographically within each level. Every initial segment ending at lies inside . Its cardinal is less than , by the smaller-cardinal identity or finite counting. This well-order cannot have an element with predecessors, so its order type is at most the initial ordinal . Thus , contrary to its being a counterexample; the reverse injection is . HenceA sum of finitely many finite cardinals is finite, so is regular. A sum of fewer than smaller cardinals is a countable union of countable sets and has size at most , so is regular.
Articles by others on the same topic
There are currently no matching articles.