• Practice
  • About 14 min
  • 5 practice questions

Set operations and identities: quick simplification

Simplify set expressions with the distributive, absorption and De Morgan laws, check them with the Venn region method and avoid the usual difference traps.

If something looks wrong, please tell us.

Many questions ask you to simplify an expression like (A ∪ B) ∩ (A ∪ B') or to pick which of four identities is true. Expanding by laws works, but under time pressure a second method is faster and safer: number the regions of a Venn diagram and see which regions each side contains. This lesson gives you both methods and the traps where intuition goes wrong.

The laws you need

  • Distributive: A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C) and A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C).
  • Absorption: A ∪ (A ∩ B) = A and A ∩ (A ∪ B) = A.
  • De Morgan: (A ∪ B)' = A' ∩ B' and (A ∩ B)' = A' ∪ B'.
  • Difference: A − B = A ∩ B'.
  • Splitting: A = (A − B) ∪ (A ∩ B), and the two parts are disjoint.

The region method

For two sets, a Venn diagram has four regions. Call them 1 for A only, 2 for both, 3 for B only and 4 for outside both. Now every expression is a set of region numbers: A = {1, 2}, B = {2, 3}, A ∩ B = {2}, A ∪ B = {1, 2, 3}, A' = {3, 4}, B' = {1, 4}, A − B = {1} and (A ∪ B)' = {4}. Two expressions are equal for all sets exactly when they give the same regions. For three sets the same idea uses eight regions. This turns every identity question into a few seconds of bookkeeping.

Worked example 1: simplify by laws and by regions

Simplify (A ∪ B) ∩ (A ∪ B'). By the distributive law in reverse, this is A ∪ (B ∩ B') = A ∪ ∅ = A. By regions: A ∪ B = {1, 2, 3} and A ∪ B' = {1, 2} ∪ {1, 4} = {1, 2, 4}. The common regions are {1, 2}, which is A. Both methods give A.

Worked example 2: a distributive law with numbers

Let A = {1, 2, 3, 4, 5}, B = {4, 5, 6, 7} and C = {5, 7, 9}. Check A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C). Left: B ∪ C = {4, 5, 6, 7, 9}, and its common part with A is {4, 5}. Right: A ∩ B = {4, 5} and A ∩ C = {5}, whose union is {4, 5}. Both sides are {4, 5}. A numerical check like this is also how you reject a false option: one counter-example is enough to show an identity fails.

The traps

First, a difference is not undone by a union: (A − B) ∪ B = A ∪ B, not A. In regions, A − B = {1} and B = {2, 3}, giving {1, 2, 3}, which is A ∪ B. It equals A only when B ⊆ A. Second, order matters in a difference: A − B = {1} and B − A = {3} are different regions. Third, the complement of an intersection is a union, not an intersection, and options often swap them. Fourth, A ∪ (A' ∩ B) is A ∪ B, not B: regions {1, 2} ∪ {3} = {1, 2, 3}.

Worked example 3: De Morgan with numbers

Let U = {1, 2, ..., 10}, A = {1, 2, 3, 4} and B = {3, 4, 5, 6}. Find A' ∩ B' without listing both complements. By De Morgan, A' ∩ B' = (A ∪ B)'. A ∪ B = {1, 2, 3, 4, 5, 6}, so the answer is {7, 8, 9, 10}. One union and one complement replace two complements and an intersection, which halves the work.

Reading conditions backwards

Some questions give a condition and ask what follows. A ∩ B = A means every element of A is in B, so A ⊆ B. A ∪ B = A means B ⊆ A. A − B = ∅ means A ⊆ B. A ∩ B = ∅ means the sets are disjoint, which is the same as A ⊆ B' and as A − B = A. In regions, each condition says that some region is empty, and the conclusion follows by deleting that region.

Number the regions (1 A only, 2 both, 3 B only, 4 outside) and compare region lists. (A − B) ∪ B = A ∪ B, and A ∪ (A' ∩ B) = A ∪ B.

— Rule to remember

Key takeaways

Use laws when the structure is obvious and regions when it is not. One counter-example with small sets kills a false identity. Watch differences: they are not undone by unions and they depend on order. Translate conditions such as A ∩ B = A into subset statements before doing anything else.

Check your understanding

  1. 1. For all sets A and B, (A ∪ B) ∩ (A ∪ B') equals

    1. B
    2. A
    3. A ∪ B
    4. ∅
    Show answer

    Answer: B. By the distributive law it is A ∪ (B ∩ B') = A ∪ ∅ = A. In regions: {1, 2, 3} ∩ {1, 2, 4} = {1, 2} = A.

  2. 2. For all sets A and B, A ∩ (A ∪ B) equals

    1. B
    2. A ∩ B
    3. A ∪ B
    4. A
    Show answer

    Answer: D. This is the absorption law. Regions: {1, 2} ∩ {1, 2, 3} = {1, 2}, which is A.

  3. 3. For all sets A and B, (A − B) ∪ B equals

    1. A
    2. B
    3. A − B
    4. A ∪ B
    Show answer

    Answer: D. A − B is region 1 and B is regions 2 and 3, so the union is {1, 2, 3} = A ∪ B. It equals A only when B ⊆ A.

  4. 4. U = {1, 2, ..., 10}, A = {1, 2, 3, 4} and B = {3, 4, 5, 6}. What is A' ∩ B'?

    1. {1, 2, 5, 6}
    2. {3, 4}
    3. {7, 8, 9, 10}
    4. {1, 2, 3, 4, 5, 6}
    Show answer

    Answer: C. A' ∩ B' = (A ∪ B)'. A ∪ B = {1, 2, 3, 4, 5, 6}, so the complement is {7, 8, 9, 10}.

  5. 5. If A ∩ B = A, which of these must be true?

    1. B ⊆ A
    2. A ∩ B = ∅
    3. A ⊆ B
    4. A ∪ B = A
    Show answer

    Answer: C. A ∩ B = A means every element of A is also in B, so A ⊆ B. The other statements need not hold, for example A = {1}, B = {1, 2}.

Privacy · Terms · Refunds · Delivery