Math Help Forum

Math Help Forum Feed Site Feed

Go Back   Math Help Forum > University Math Help > Discrete Mathematics, Set Theory and Logic
Reply
 
Thread Tools Display Modes
  #1  
Old November 3rd, 2009, 10:19 AM
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
Advertisement
 
  #2  
Old November 3rd, 2009, 10:46 AM
Junior Member
 
Join Date: Oct 2009
Posts: 25
Thanks: 1
Thanked 5 Times in 5 Posts
gmatt is on a distinguished road
Default

Quote:
Originally Posted by absvalue View Post
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."

Well, A \cap B \cap C \subset A\cap B, so rearranging

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

since the LHS must be non negative we have |A \cap C| + |B \cap C| = 0 so both of those terms must be 0. You can do a similar thing with to get |A \cap B| = 0 proving the result.
Reply With Quote
Reply

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are Off
Pingbacks are Off
Refbacks are Off
Forum Jump


All times are GMT -7. The time now is 12:35 AM.


Powered by vBulletin® Version 3.7.3
Copyright ©2000 - 2009, Jelsoft Enterprises Ltd.
SEO by vBSEO 3.2.0 ©2008, Crawlability, Inc.
©2005 - 2009 Math Help Forum


Math Help Forum is a community of maths forums with an emphasis on maths help in all levels of mathematics.
Register to post your math questions or just hang out and try some of our math games or visit the arcade.