Enumerable disjoint subsets whose union is equal to the union of the sets
-
04-11-2019 - |
문제
I'm given that two sets, $A$ and $B$ are enumerable. I have to show that there exist subsets $A \supset C$ and $B \supset D$ ($C$ and $D$ also enumerable) such that $C$ and $D$ are disjoint and $A\cup B = C \cup D$. I was thinking to take $A=B=\{0,1\}$ and define $C=\{n : f(n)=1\}$, $D=\{n: f(n)=0\}$. Do you think this is right?
올바른 솔루션이 없습니다
제휴하지 않습니다 cs.stackexchange