Skip to content
Miscellaneous Exercise · Q6

Q.Show that for any sets A and B, A = ( A ∩ B ) ∪ ( A – B ) and A ∪ ( B – A ) = ( A ∪ B )

Punjab PsebTextbookSubjective· 3mImportance★★★★★est
53% · 70/132 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

The key idea is to rewrite a set as the union of its intersection with another set and its difference from that set. This works because every element of A either belongs to B or does not. The two identities are: A=(A∩B)∪(A−B)A = (A \cap B) \cup (A - B) and A∪(B−A)=A∪BA \cup (B - A) = A \cup B.

Why This Works: The Logic of Set Difference

Set difference, A−BA - B (also written A∖BA \setminus B), picks out everything in AA that is not in BB. So when you look at any element xx in AA, there are exactly two possibilities: either xx is also in BB, or xx is not in BB. There is no third option. This is a fundamental partition of AA into two disjoint pieces: the part that overlaps with BB (A∩BA \cap B) and the part that is exclusive to AA (A−BA - B). The first identity simply says that putting these two pieces back together gives you the original set AA.

The second identity is about what happens when you take AA and add the part of BB that is not already in AA. That is exactly the definition of the union A∪BA \cup B — everything in AA plus everything in BB that isn't already covered.

Let's prove both formally.


1. Proving A=(A∩B)∪(A−B)A = (A \cap B) \cup (A - B)

We show two-way inclusion: every element of the left side is in the right side, and vice versa.

Step 1a: Show A⊆(A∩B)∪(A−B)A \subseteq (A \cap B) \cup (A - B)

Take any x∈Ax \in A. There are two cases:

  • Case 1: x∈Bx \in B. Then x∈A∩Bx \in A \cap B, so x∈(A∩B)∪(A−B)x \in (A \cap B) \cup (A - B).
  • Case 2: x∉Bx \notin B. Then x∈A−Bx \in A - B, so x∈(A∩B)∪(A−B)x \in (A \cap B) \cup (A - B).

Since every x∈Ax \in A falls into one of these two cases, we have A⊆(A∩B)∪(A−B)A \subseteq (A \cap B) \cup (A - B).

Step 1b: Show (A∩B)∪(A−B)⊆A(A \cap B) \cup (A - B) \subseteq A

Take any x∈(A∩B)∪(A−B)x \in (A \cap B) \cup (A - B). Then either:

  • x∈A∩Bx \in A \cap B, which implies x∈Ax \in A (and x∈Bx \in B), or
  • x∈A−Bx \in A - B, which implies x∈Ax \in A (and x∉Bx \notin B).

In either case, x∈Ax \in A. So (A∩B)∪(A−B)⊆A(A \cap B) \cup (A - B) \subseteq A.

Since both inclusions hold, A=(A∩B)∪(A−B)A = (A \cap B) \cup (A - B). □\square

Tip

This is a partition of AA into two disjoint subsets. Notice that (A∩B)(A \cap B) and (A−B)(A - B) have no elements in common — an element cannot be both in BB and not in BB at the same time. So the union is actually a disjoint union.


2. Proving A∪(B−A)=A∪BA \cup (B - A) = A \cup B

Again, we prove two-way inclusion.

Step 2a: Show A∪(B−A)⊆A∪BA \cup (B - A) \subseteq A \cup B …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.