| 
November 3rd, 2009, 10:19 AM
| | Junior Member | | Join Date: May 2009
Posts: 58
Thanks: 9
Thanked 0 Times in 0 Posts
| | 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 
then A, B, and C must be pairwise disjoint.
Here is what I have:
Suppose A, B, and C are finite sets with  .
By inclusion/exclusion, we know that
By cancellation, we have:
I'm just not sure how to connect that to "Thus A, B, and C must be pairwise disjoint." | 
November 3rd, 2009, 10:46 AM
| | Junior Member | | Join Date: Oct 2009
Posts: 25
Thanks: 1
Thanked 5 Times in 5 Posts
| | Quote:
Originally Posted by absvalue 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 
then A, B, and C must be pairwise disjoint.
Here is what I have:
Suppose A, B, and C are finite sets with  .
By inclusion/exclusion, we know that
By cancellation, we have:
I'm just not sure how to connect that to "Thus A, B, and C must be pairwise disjoint." |
Well,  , so rearranging
since the LHS must be non negative we have  so both of those terms must be 0. You can do a similar thing with to get  proving the result. | | Thread Tools | | | | Display Modes | Linear Mode |
Posting Rules
| You may not post new threads You may not post replies You may not post attachments You may not edit your posts HTML code is Off | | | All times are GMT -7. The time now is 12:35 AM. | | |
 | |  |