# The cardinality of a countable union of countable sets, without the axiom of choice

One of my homework questions was to prove, from the axioms of ZF only, that a countable union of countable sets does not have cardinality $\aleph_2$. My solution shows that it does not have cardinality $\aleph_n$, where $n$ is any non-zero ordinal (not necessarily finite). I have a sneaking suspicion that my solution is actually invalid, but I can't find any reference which invalidates my conclusion.

I have read that it is provable in ZF that there are no cardinals $\kappa$ such that $\aleph_0 < \kappa < \aleph_1$, but I believe the conclusion of my proof does not preclude the possibility that the cardinality is incomparable to $\aleph_1$ or some such.

I think the weakest point in my solution is where I claim that the supremum of a countable set of countable ordinals is again countable. This is true, of course, but it sounds uncomfortably close to the claim "a countable union of countable sets is countable", which is well-known to be unprovable in ZF. Can anybody confirm that the ordinal version is provable in ZF though? If not, I think I can weaken the claim to "the supremum of any set of countable ordinals is at most $\omega_1$", and this establishes the weaker result that the cardinality of a countable union of countable sets is not $\aleph_n$ for any ordinal $n \ge 2$.

-

## 1 Answer

$\omega_1$ can be a countable union of countable ordinals, i.e., the sup of a countable set of countable ordinals.

This consistency result was one of the first found with forcing. It was announced in S. Feferman-A. Levy, "Independence results in set theory by Cohen's method II", Notices Amer Math Soc., 10, (1963) 593.

The result is that it is consistent with ZF that ${\mathbb R}$ is a countable union of countable sets. From this, it follows easily that $\omega_1$ also has this property. A proof can be found in Jech's book on the Axiom of Choice.

The problem is that, as you suspect, "The supremum of a countable set of countable ordinals" cannot be proved without some choice to be countable. The issue is that although we know that each countable ordinal is in bijection with $\omega$, there is no uniform way of picking for each countable ordinal one such bijection. Now, you need this to run the usual proof that a countable union of countable sets is countable.

In fact, things can be worse: Gitik showed that it is consistent with ZF that every infinite (well-ordered) cardinal has cofinality $\omega$. ("All uncountable cardinals can be singular", Israel J. Math, 35, (1980) 61-88.)

On the other hand, one can check that a countable union of countable sets of ordinals must have size at most $\omega_1$ (which is essentially what your HW is asking to verify). So, in Gitik's model, $\omega_2$ is a countable union of countable unions of countable ordinals, but not a countable union of countable ordinals.

Let me add two comments about other things you say in your question: You write "I have read that it is provable in ZF that there are no cardinals $\kappa$ such that $\aleph_0<\kappa<\aleph_1$". This is true, but it is stronger than that: By definition $\aleph_1$ is the first ordinal that is not countable, so of course there are no cardinals in between $\aleph_0$ and $\aleph_1$. Similarly, there are no cardinals between any (well-ordered) cardinal $\kappa$ and its successor $\kappa^+$, by definition.

It is true, however, that a countable union of countable sets need not be comparable with $\aleph_1$ without choice. In fact, we can have a non-well-orderable set that can be written as a countable union of sets of size 2.

-
Thank you for the references and examples. I'm curious though — Can it be shown that the union of a countable family $S$ of countable unordered sets has cardinality at most $\aleph_1$? This seems to be a stronger claim than the conclusion of my proof (that $|\bigcup S| \ne \aleph_n$ for any $n \ge 2$). – Zhen Lin Jan 3 '11 at 17:24

1
This result of Gitik is terrifying, wonderful! – Asaf Karagila Jan 3 '11 at 17:43
@Zhen: No, this cannot be shown. As I mentioned, a countable union of sets of size 2 needs not be comparable with $\aleph_1$. – Andres Caicedo Jan 3 '11 at 17:50
@Asaf: I agree. And there are some very interesting questions still left. Schindler and Busche have recently looked at the consistency strength of Gitik's result, and Ioanna Fenderson Dimitriou, a student of Peter Koepke, has also been studying this model. – Andres Caicedo Jan 3 '11 at 17:53
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 29, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9600300788879395, "perplexity_flag": "head"}