Set union
The union of two sets consists of objects that belong to at least one of the sets.
On this page 7 sections
01The union keeps objects that belong to at least one set#
The union keeps objects that belong to at least one set. Here and .
For and , the labels and are shared. The label appears only in ; appears only in .
Collect the qualifying labels.
An object needs only one route into the union. Shared labels qualify too, but are written once. Combining the lists does not create a second copy of the same object.
and . Build .
Show answer and explanation
The union is . Check the stated membership rule for each candidate.
02If the sets share no members, the union still includes the members from both#
If the sets share no members, the union still includes the members from both. If one set is empty, it contributes nothing.
Combine the disjoint sets and .
A: {csv, json}; B: {json, xml}. Accept formats in either list, including both. Which set?
Show answer and explanation
Keep formats in either list.
03Check your understanding#
What is ?
Show answer and explanation
The empty set adds no members; the existing labels remain.
Check each distinct object against the two sets. Include membership in either or both, without duplicating shared objects.
- Form the union of two finite sets
Sources & further reading
- [1]OpenStax Contemporary Mathematics, 1.4 ↗OpenStax · Book