If A is an uncountable set and B is a countable set, must A-B be uncountable?
1
Expert's answer
2020-10-19T17:17:25-0400
Yes, A∖B must be uncountable.
Proof. Assume A∖B is countable. Then, we can express A as (A∖B)⋃B. Since the union of two countable sets is countable, A must be countable. This is a contradiction, and so A∖B is uncountable.
Comments