Course contentsShow
← Mathematics
Lesson 2524 of 3,12151. Discrete Math — Sets, Relations, FunctionsFree lesson

Union of Sets

Learn the union operation that combines all elements from two or more sets without duplication.

Union of Sets

You'll learn how to combine two or more sets into one by taking all their elements, counting each unique element only once.

What Is the Union Operation?

The union of two or more sets is a new set containing every element that appears in at least one of the original sets. We use the symbol ∪ to denote union.

If you have sets A and B, their union A ∪ B includes:

  • Everything in A
  • Everything in B
  • No duplicates (each element appears once, even if it was in both sets)

Notation and Definition

For sets A and B:

A ∪ B = {x : x ∈ A or x ∈ B}

This reads: "A union B equals the set of all x such that x is in A or x is in B (or both)."

Examples

Let A = {1, 2, 3} and B = {3, 4, 5}

Then A ∪ B = {1, 2, 3, 4, 5}

Notice that 3 appears in both sets, but we list it only once in the union.

Multiple Sets

The union operation extends naturally:

A ∪ B ∪ C includes every element from A, B, or C.

Analogy

Think of union like pouring different bags of fruit into one bowl. If the first bag has apples and oranges, and the second has oranges and bananas, your bowl contains apples, oranges, and bananas—you don't count the oranges twice.

Properties

  • Commutative: A ∪ B = B ∪ A
  • Associative: (A ∪ B) ∪ C = A ∪ (B ∪ C)
  • Identity: A ∪ ∅ = A (union with the empty set changes nothing)

Key Takeaway: The union A ∪ B combines all elements from both sets without duplication, creating a set of everything that belongs to A, B, or both.