Q.Show that for any sets A and B, A = ( A ∩ B ) ∪ ( A – B ) and A ∪ ( B – A ) = ( A ∪ B )
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: and .
Why This Works: The Logic of Set Difference
Set difference, (also written ), picks out everything in that is not in . So when you look at any element in , there are exactly two possibilities: either is also in , or is not in . There is no third option. This is a fundamental partition of into two disjoint pieces: the part that overlaps with () and the part that is exclusive to (). The first identity simply says that putting these two pieces back together gives you the original set .
The second identity is about what happens when you take and add the part of that is not already in . That is exactly the definition of the union — everything in plus everything in that isn't already covered.
Let's prove both formally.
1. Proving
We show two-way inclusion: every element of the left side is in the right side, and vice versa.
Step 1a: Show
Take any . There are two cases:
- Case 1: . Then , so .
- Case 2: . Then , so .
Since every falls into one of these two cases, we have .
Step 1b: Show
Take any . Then either:
- , which implies (and ), or
- , which implies (and ).
In either case, . So .
Since both inclusions hold, .
This is a partition of into two disjoint subsets. Notice that and have no elements in common — an element cannot be both in and not in at the same time. So the union is actually a disjoint union.
2. Proving
Again, we prove two-way inclusion.
Step 2a: Show …
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.