A{{1,2},{3},{2,4}} — the union axiom returns the original set unchanged
B{1,2,3,4} — the members of the members, collected into one set
C{{1,2,3,4}} — a set containing one set with all elements
D{3} — only the singleton element survives after flattening
The union axiom collects everything that is a member of any member of X. The elements of {{1,2},{3},{2,4}} are the sets {1,2}, {3}, and {2,4}. Their members are: 1 and 2 (from {1,2}), 3 (from {3}), 2 and 4 (from {2,4}). Combining these (sets contain no duplicates): {1,2,3,4}. The operation peels away exactly one layer of nesting — a set of sets becomes a flat set.
Question 2 Multiple Choice
Within ZFC set theory, how is the binary operation A ∪ B formally constructed?
ADirectly from the Union Axiom applied to A and B as two arguments
BFrom the Axiom of Separation by taking all elements that belong to either A or B
CBy first applying the Pairing Axiom to form {A, B}, then applying the Union Axiom to get ∪{A, B}
DFrom the Axiom of Power Set, since A ∪ B is a subset of the power set of A ∩ B
Binary union A ∪ B is a derived operation requiring two axioms. First, the Pairing Axiom guarantees that {A, B} — a set whose only members are A and B — exists. Then the Union Axiom applied to {A, B} collects all elements belonging to A or B. The Union Axiom alone takes a *single* set-of-sets argument; it is not a binary operation. Without Pairing, you cannot form the input that Union needs.
Question 3 True / False
The binary union A ∪ B is a primitive ZFC operation — it follows directly from the Union Axiom without needing any other axiom.
TTrue
FFalse
Answer: False
Binary union is a derived operation requiring two ZFC axioms. The Union Axiom takes a single set of sets and flattens it — it is a unary operation on a collection, not a binary operation on two sets. To form A ∪ B you must first use the Pairing Axiom to create {A, B}, then apply the Union Axiom to get ∪{A, B}. Without the Pairing Axiom you cannot construct the argument that Union needs.
Question 4 True / False
In ZFC, ∪∅ is undefined because the empty set has no members, so there is hardly anything for the union axiom to collect.
TTrue
FFalse
Answer: False
∪∅ = ∅, and this is perfectly well-defined. The Union Axiom states ∪X = {y : ∃z ∈ X, y ∈ z}. For X = ∅, no element y satisfies the condition (there is no z ∈ ∅ to witness y ∈ z), so the resulting set is empty. ∪∅ = ∅ is a valid, meaningful result — not undefined. Similarly ∪{∅} = ∅, because the only member of {∅} is ∅ itself, which contains nothing.
Question 5 Short Answer
Why can the Axiom of Separation alone not replace the Axiom of Union? What essential operation does Union provide that Separation cannot?
Think about your answer, then reveal below.
Model answer: The Axiom of Separation can only carve out a *subset* of an already-existing set using a predicate — it is inherently restrictive, making sets smaller or equal in size. It cannot produce a set whose members come from multiple different sources unless all those sources are already collected in a single given set. The Union Axiom is expansive: it produces a new set by pooling the contents of an entire family of sets. Without Union, you cannot guarantee that ∪X exists unless it happened to already be a subset of some known set. Separation filters; Union builds up.
A concrete illustration: to form {1,2,3} from {{1,2},{2,3}}, Separation can only restrict elements within a given set — you cannot use it to merge {1,2} and {2,3} unless you already have a set containing 1, 2, and 3. The Union Axiom provides the construction tool needed to build such a set. This is essential for constructing ordinals, cardinals, and most mathematical objects in ZFC, where sets of sets of sets appear routinely.