If $A$ and $B$ are sets, then $A\cup B$ is defined as follows: $$A\cup B:=\{x: x\in A \, \, \,\text{ or } \, \, \, x\in B\}.$$

In ZFC, $A\cup B$ exists because $\bigcup\{A,B\}$ exists by union axiom, and it is known that axiom of union is independent of rest of ZFC.

If there is set such that $A\subset C$ and $B\subset C$, then we can define $A\cup B$ using the $C$ and seperation axiom. But can I prove the existence of $C$ in ZF-Union? Thanks for any help.

  • $\begingroup$ @RyanSullivant I read it before to question it. This article introduce the model of ZFC-Union that axiom of union fails. However, 'Axiom of union is fails' does not imply existence of finite union. As I know, existence of countable union fails on $H_{\beth_\omega}$, the model of ZFC-Union. However$H_{\beth_\omega}$ is closed under finite union. $\endgroup$ – Hanul Jeon Sep 19 '13 at 5:48
  • 1
    $\begingroup$ @Ryan: Maybe he does, but he is slightly too hungover to find out at this moment. :) $\endgroup$ – Asaf Karagila Sep 19 '13 at 6:09
  • $\begingroup$ It's hard to imagine. The only ways to build up sets without union are pairing and power set. I don't think it's possible to do anything useful with infinity and replacement because without unions there's no apparent way to get recursive definition. $\endgroup$ – dfeuer Sep 19 '13 at 6:09
  • 2
    $\begingroup$ Here are some stray thoughts on the problem: with separation or replacement the existence of finite unions is equivalent to the following. For every two sets there is a set including both of them. In particular this means that a counterexample cannot have some sort of cumulative hierarchy. So perhaps we need to throw regularity out of the window as well. $\endgroup$ – Asaf Karagila Sep 19 '13 at 6:56
  • 1
    $\begingroup$ @dfeuer: I don't know how one can prove the existence of limit ordinals, or any other ordinals other than $\omega$ (and the finite ordinals, of course) for that matter. But I don't see how one proves otherwise. I also didn't claim that regularity implies the existence of a cumulative hierarchy (and I don't see where I made that claim as well). I'm just saying that if there is a cumulative hierarchy then you can prove the existence of finite unions with replacement/separation. But the only models I can think of without a cumulative hierarchy are models where regularity fails as well. $\endgroup$ – Asaf Karagila Sep 19 '13 at 7:49

Nice question!

It turns out that in $T=\mathsf{ZFC}-\mathrm{Union}$, we can prove that unions of finite sets exist. There is a (remarkably recent) paper devoted to this issue. What follows is a (very) brief account of my reading of (section 3 of) the paper:

Greg Oman. On the axiom of union, Arch. Math. Logic, 49 (3), (2010), 283–289. MR2609983 (2011g:03122).

(Unfortunately the paper is behind a paywall, and the author does not have a version in their page or in the arXiv. Contact me if you find difficulties accessing it.)

Of note is that the argument uses choice in essential ways, so the question remains whether unions of finite sets can be proved to exist in $\mathsf{ZF}-\mathrm{Union}$. (Similarly, but perhaps less surprisingly, replacement also plays a key role.)

First, note that $T$ proves that if $x,y$ are sets, then $x\cup\{y\}$ exists: Map each singleton $\{z\}$ in $\mathcal P(x)$ to $z$, and every other subset to $y$. Call this Lemma 1.

The basic theory of ordinals can be carried out in $T$ (e.g., any two distinct ordinals are comparable by $\subset$ and by $\in$), and (crucially) $T$ proves that every set is in bijection with an ordinal. Call this Theorem 1.

This argument requires some care for two reasons: First, the usual approach uses transfinite recursion, which uses the union axiom. Second, arguing about the existence of functions requires some care, since at this stage it is not even clear that Cartesian products exist. However, we have a way of circumventing the second issue, since some functions do exist, since we have the axiom of choice (stated in the form: Choice functions exist).

Oman's argument (which is really a careful reworking of Zermelo's original approach) goes as follows: Given $X$, begin with a choice function $G$ on the nonempty subsets of $X$. Call $f$ an approximation iff its domain is an ordinal, its range is contained in $X$, and for each $\alpha\in\mathrm{dom}(f)$, $$ f(\alpha)=G(X\setminus\{f(\beta)\mid \beta<\alpha\}). $$ Now check that approximations are compatible, and that every element of $X$ is in the range of some approximation. For the latter, letting $Y$ be the subset of $X$ consisting of those elements of $X$ that appear in the range of some approximation, note that for each $y\in Y$ there is a unique $\alpha_y$ such that there is some approximation $f$ with $\alpha_y\in\mathrm{dom}(f)$ and $f(\alpha_y)=y$. It follows that $F=\{(\alpha_y,y)\mid y\in Y\}$ exists, and one readily verifies that it is itself an approximation.

One completes the argument by checking that the range of $F$ is $X$. But if it is not, then letting $\gamma=\mathrm{dom}(F)$, we have that $F\cup\{(\gamma,G(X\setminus Y))\}$ is also an approximation (thanks to Lemma 1!). This is a contradiction, since the definition of $Y$ then implies that $G(X\setminus Y)\in Y$, which is absurd as $G$ is a choice function. This completes the proof of Theorem 1.

By the way, if you are not familiar with this argument, you may want to read the nice survey by Kanamori and Pincus,

Akihiro Kanamori, and David Pincus. Does $\mathsf{GCH}$ imply $\mathsf{AC}$ locally?. In Paul Erdős and his mathematics, II (Budapest, 1999), pp. 413–426, Bolyai Soc. Math. Stud., 11, János Bolyai Math. Soc., Budapest, 2002. MR1954736 (2003m:03076).

(Theorem 3.3.c is false, but this does not affect their exposition on Zermelo's argument.)

Using Theorem 1, Oman argues that (finite) Cartesian products exist: Given $x,y$, find ordinals $\alpha,\beta$ in bijection with them. If $\gamma=\max\{\alpha,\beta\}$, then it is easy to check that $\alpha\times\beta$ exists, since it is a subset of $\mathcal P(\mathcal P(\gamma))$. Replacement completes the proof.

It follows immediately that the collection of functions from $x$ to $y$ exists. Using this, we can now prove

Theorem 2. If $x$ is a set and $\{|y|\colon y\in x\}$ is a bounded set of ordinals, then $\bigcup x$ exists.

Note that the boundedness assumption is obviously necessary, and it is immediate in the presence of the union axiom. This could therefore be seen as the key feature that the union axiom gives us. As an immediate corollary, if $x$ is finite, then $\bigcup x$ exists, answering your question affirmatively.

Let's conclude by sketching the proof of Theorem 2: We may assume that no element of $x$ is empty. Let $\gamma$ be a bound for the cardinalities of the elements of $x$. For $y\in x$, let $S_y$ be the set of all surjections from $\{y\}\times\gamma$ onto $y$, and note that $S_y\ne\emptyset$. Now consider a choice function $G$ on $\{S_y\mid y\in x\}$, so for each $y\in x$, $G(y):\{y\}\times\gamma\to y$ is onto. Replacement now implies that $\bigcup x=\{G(y)(y,\alpha)\mid (y,\alpha)\in x\times\gamma\}$ is a set, and we are done.

  • 2
    $\begingroup$ Great answer. I can't say I'm surprised by the result, but it does look like something they would have done in the '50s, rather than in this millennium. $\endgroup$ – Asaf Karagila Sep 19 '13 at 21:56
  • $\begingroup$ That's one of the reasons why I would like to find original references for the independence of union from the other axioms, these results may even be addressed there. $\endgroup$ – Andrés E. Caicedo Sep 19 '13 at 22:14
  • $\begingroup$ I'll look for it tomorrow. Maybe I can find something. After all, if they have papers about independence of extensionality, union should be right there with it (on the time period, I mean). $\endgroup$ – Asaf Karagila Sep 19 '13 at 22:15

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.