Let A,B be infinite sets such that A∩B=∅ and |A|=|B|. Then |A∪B|=|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 X∼Y.
By Lemma, A can by partitioned into a family (Ai∣i∈I) where Ai∼N.
Thus there exist a bijection fi:N→Ai for all i∈I. Hence every a∈Ai is determined by fi(k) for a unique pair (i,k)∈I×N. It follows that A∼I×N.
We have |A|=|I×N|=|(I×N1)∪(I×N2)| where N1={n∈N∣n is even} and N2={n∈N∣n is odd}. It's clear that B∼A∼I×N∼I×N1∼I×N2.
We have:
I×N1∼A and I×N2∼B
(I×N1)∩(I×N2)=∅
A∩B=∅
Thus there is a bijection from A∪B to (I×N1)∪(I×N2) and hence A∪B∼(I×N1)∪(I×N2)
As a result, |A|=|(I×N1)∪(I×N2)|=|A∪B|.
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|=|A∪B| 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