View Single Post
  #1  
Old November 3rd, 2009, 09:19 AM
absvalue absvalue is offline
Junior Member
 
Join Date: May 2009
Posts: 58
Thanks: 9
Thanked 0 Times in 0 Posts
absvalue is on a distinguished road
Default Inclusion/Exclusion

I've been working on this problem for a while. Could someone show me how to connect the last part?

Let A, B, and C be finite sets. Prove:
If |A \cup B \cup C| = |A| + |B| + |C|
then A, B, and C must be pairwise disjoint.


Here is what I have:

Suppose A, B, and C are finite sets with |A \cup B \cup C| = |A| + |B| + |C|.

By inclusion/exclusion, we know that

|A \cup B \cup C| = |A| + |B| + |C| - |A \cap B| - |A \cap C| - |B \cap C| + |A \cap B \cap C|

By cancellation, we have:

|A \cap B \cap C| - |A \cap B| - |A \cap C| - |B \cap C| = 0

I'm just not sure how to connect that to "Thus A, B, and C must be pairwise disjoint."
Reply With Quote