
Abstract Algebra Abstract Algebra Math Forum 
 LinkBack  Thread Tools  Display Modes 
August 14th, 2017, 01:22 AM  #1 
Senior Member Joined: Nov 2015 From: hyderabad Posts: 206 Thanks: 2  Cardinality of union of two sets proof
Hello all I am not able to write a proof of the property $\displaystyle n(A \cup B) = n(A) + n(B)  n(A \cap B) $. I was just able to draw sets diagram and one or two steps attached. Please help me with the proof. 
August 14th, 2017, 02:25 AM  #2 
Math Team Joined: Jul 2013 From: काठमाडौं, नेपाल Posts: 872 Thanks: 60 Math Focus: सामान्य गणित 
We know, $\displaystyle n (A) = o (A) +n (A \cap B)$ $\displaystyle n (B) = o (B) +n (A \cap B)$ $\displaystyle n (A \cup B)= o (A) + n (A\cap B)+ o (B) $ So we have, $\displaystyle n (A) + n (B) = o (A) + n (A\cap B)+ o (B) +n (A \cap B)$ $\displaystyle n (A) + n (B) = n (A\cup B)+ n (A \cap B)$ $\displaystyle n (A) + n (B)  n (A\cap B) = n (A \cup B)$ 
August 14th, 2017, 02:28 AM  #3 
Senior Member Joined: Nov 2015 From: hyderabad Posts: 206 Thanks: 2 
Thanks for the reply. May i know the difference between $o(A)$ and $n(A)$. Thank you 😊 
August 14th, 2017, 02:31 AM  #4 
Math Team Joined: Jul 2013 From: काठमाडौं, नेपाल Posts: 872 Thanks: 60 Math Focus: सामान्य गणित 
o (A) = number of elements that belong to only A (should not belong to other sets) n (A) = number of elements that belong to A(may belong to other sets) 
August 14th, 2017, 06:00 AM  #5 
Member Joined: Aug 2017 From: United Kingdom Posts: 97 Thanks: 28  The issue is that $o(A)$ is always zero according to this definition: given any element of $A$, you can always make a set not equal to $A$ that contains that element. That is, there are no elements only in A that are not in any other sets.

August 14th, 2017, 07:13 AM  #6 
Math Team Joined: Jul 2013 From: काठमाडौं, नेपाल Posts: 872 Thanks: 60 Math Focus: सामान्य गणित 
By other sets I do not mean the universal set.

August 14th, 2017, 07:53 AM  #7 
Member Joined: Aug 2017 From: United Kingdom Posts: 97 Thanks: 28  You do not need the universal set here. I'll explain: If $A$ has more than one element, then consider any element $x$ in $A$. $x$ belongs to the (not universal) set $\{x\} \neq A$, so $x$ is not only in $A$. Hence $o(A) = 0$. If $A$ just has one element, say $A = \{a\}$, consider the set $B = \{a,1,2\}$. $a$ belongs to the (not universal) set $B \neq A$, so $a$ is not only in $A$. Hence $o(A) = 0$ in this case, too. And clearly $o(A) = 0$ if $A$ is the empty set. Last edited by cjem; August 14th, 2017 at 08:05 AM. 
August 14th, 2017, 10:40 AM  #8 
Math Team Joined: Jul 2013 From: काठमाडौं, नेपाल Posts: 872 Thanks: 60 Math Focus: सामान्य गणित 
I agree with your explanation but I don't get the conclusion.

August 14th, 2017, 12:05 PM  #9  
Member Joined: Aug 2017 From: United Kingdom Posts: 97 Thanks: 28  Quote:
Instead of $o(A)$, you should have been using $n(A \setminus B)$, where $\setminus$ is set difference. Last edited by cjem; August 14th, 2017 at 12:13 PM.  
August 15th, 2017, 07:36 PM  #10 
Math Team Joined: Jul 2013 From: काठमाडौं, नेपाल Posts: 872 Thanks: 60 Math Focus: सामान्य गणित 
Seems like I did not know about the correct notation


Tags 
cardinality, proof, sets, union 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
doubt about union of two complementary sets  beesee  Math  5  November 2nd, 2014 12:15 PM 
Proving these union sets with induction?  dekker11  Applied Math  0  February 27th, 2012 05:05 PM 
Sets under union  L094129  Applied Math  1  August 27th, 2011 02:01 PM 
Union Of Sets  gettingit4  Real Analysis  14  January 30th, 2011 12:07 PM 
Union Of Sets  gettingit4  Number Theory  1  December 31st, 1969 04:00 PM 