Wednesday, 27 March 2013

elementary set theory - Let A,B be infinite sets such that AcapB=emptyset and |A|=|B|. Then |AcupB|=|A|




Let A,B be infinite sets such that AB= and |A|=|B|. Then |AB|=|A|.








My Attempt:



Lemma: Any infinite set can be partitioned into a family of countably infinite sets. (I presented a proof here)



We denote X and Y are equinumerous by XY.



By Lemma, A can by partitioned into a family (AiiI) where AiN.




Thus there exist a bijection fi:NAi for all iI. Hence every aAi is determined by fi(k) for a unique pair (i,k)I×N. It follows that AI×N.



We have |A|=|I×N|=|(I×N1)(I×N2)| where N1={nNn is even} and N2={nNn is odd}. It's clear that BAI×NI×N1I×N2.



We have:




  1. I×N1A and I×N2B


  2. (I×N1)(I×N2)=


  3. AB=





Thus there is a bijection from AB to (I×N1)(I×N2) and hence AB(I×N1)(I×N2)



As a result, |A|=|(I×N1)(I×N2)|=|AB|.







Does this proof look fine or contain gaps? Do you have suggestions? Many thanks for your dedicated help!




Answer



(if A,B disjoint we have |A|+|B|=|AB| if not |A|+|B|=|(A×{0})(B×{1})|, we have |A|=|A×{a}|so we can always assume the two are disjoint)



(|A||B|=|A×B|)



Assuming A and B are not the empty set.



max




The only inequality you need to be concern about is




|A|+|B|\le|A|\cdot|B|




Try to prove it yourself.



This shows that for A,B such that |A|\ne0\ne|B| and |A| or |B| are infinite then |A|+|B|=|A|\cdot|B|=\max\{|A|,|B|\}.


No comments:

Post a Comment

real analysis - How to find lim_{hrightarrow 0}frac{sin(ha)}{h}

How to find \lim_{h\rightarrow 0}\frac{\sin(ha)}{h} without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...