Prove |X| = |Y| When X\Y and Y\X are Equipotent Sets

  • MHB
  • Thread starter Guest2
  • Start date
  • Tags
    Sets
In summary, the conversation discusses proving that if two sets, X\Y and Y\X, are equipotent, then their cardinalities must be equal. It is suggested to use a bijection between the two sets and to consider the sets as a union of disjoint sets. An example of a possible one-to-one correspondence is given using married couples and their children.
  • #1
Guest2
193
0
Prove that if X\Y and Y\X are equipotent sets then |X| = |Y|.

The problem is that I've no clue where to start...

(Futile) attempt: There is bijection $f: X\backslash Y \to Y\backslash X$. For every $r_1 \in X\backslash Y$ there exists $r_2$ s.t. $r_2 \in Y\backslash X$. That's $r_1 \in X$ and $r_2 \in Y$. So there's a bijection $f: X \to Y$. :confused:
 
Physics news on Phys.org
  • #2
Note that $X=(X\setminus Y)\sqcup (X\cap Y)$ where $\sqcup$ denotes the union of disjoint sets, and similarly $Y=(Y\setminus X)\sqcup (X\cap Y)$.
 
  • #3
Evgeny.Makarov said:
Note that $X=(X\setminus Y)\sqcup (X\cap Y)$ where $\sqcup$ denotes the union of disjoint sets, and similarly $Y=(Y\setminus X)\sqcup (X\cap Y)$.
I'm not really sure how to use that.
 
  • #4
Suppose that you have several married couples with kids. Let $X$ be the set of husbands and children and $Y$ be the set of wives and children. Then, obviously, $X\setminus Y$ (the set of husbands) is in natural one-to-one correspondent with $Y\setminus X$ (the set of wives). Can't you construct a one-to-one correspondence between $X$ and $Y$?
 

FAQ: Prove |X| = |Y| When X\Y and Y\X are Equipotent Sets

What does it mean for two sets to be equipotent?

Two sets are equipotent if there exists a bijective function between them, meaning that every element in one set has a unique corresponding element in the other set.

How can we prove that two sets are equipotent?

To prove that two sets are equipotent, we must show that there exists a bijective function between them. This can be done by constructing a function that maps every element in one set to a unique element in the other set, and vice versa.

What does it mean for two sets to be equivalent in cardinality?

Two sets are equivalent in cardinality if they have the same number of elements, regardless of the specific elements in each set. This is another way of saying that the sets are equipotent.

How does proving that |X| = |Y| show that X and Y are equipotent?

Proving that |X| = |Y| means that there exists a bijective function between the two sets, which demonstrates that they are equipotent. This is because a bijective function ensures that every element in one set has a unique corresponding element in the other set, fulfilling the definition of equipotent sets.

Can two sets be equipotent if they have different elements?

Yes, two sets can be equipotent even if they have different elements. The key factor in determining equipotence is whether there exists a bijective function between the two sets, not the specific elements in each set. This means that sets with the same number of elements, but different elements, can still be equipotent.

Similar threads

Replies
9
Views
2K
Replies
5
Views
2K
Replies
10
Views
1K
Replies
4
Views
2K
Replies
2
Views
2K
Replies
1
Views
2K
Back
Top