Question

Suppose A is an infinite set and B is countable and disjoint from A. Prove that...

Suppose A is an infinite set and B is countable and disjoint from A. Prove that the union A U B is equivalent to A by defining a bijection f: A ----> A U B.

Thus, adding a countably infinite set to an infinite set does not increase its size.

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Prove that a disjoint union of any finite set and any countably infinite set is countably...
Prove that a disjoint union of any finite set and any countably infinite set is countably infinite. Proof: Suppose A is any finite set, B is any countably infinite set, and A and B are disjoint. By definition of disjoint, A ∩ B = ∅ Then h is one-to-one because f and g are one-to one and A ∩ B = 0. Further, h is onto because f and g are onto and given any element x in A ∪...
Use the fact that “countable union of disjoint countable sets is countable" to prove “the set...
Use the fact that “countable union of disjoint countable sets is countable" to prove “the set of all polynomials with rational coefficients must be countable.”
Prove that if X and Y are disjoint countably infinite sets then X ∪ Y is...
Prove that if X and Y are disjoint countably infinite sets then X ∪ Y is countably infinity (can you please show the bijection from N->XUY clearly)
a) Prove that the union between two countably infinite sets is a countably infinite set. b)...
a) Prove that the union between two countably infinite sets is a countably infinite set. b) Would the statement above hold if we instead started with an infinite amount of countably infinite sets? _________________________________________________ Thank you in advance!
Prove directly (using only the definition of the countably infinite set, without the use of any...
Prove directly (using only the definition of the countably infinite set, without the use of any theo-rems) that the union of a finite set and a countably infinite set is countably infinite.   
Problem 3 Countable and Uncountable Sets (a) Show that there are uncountably infinite many real numbers...
Problem 3 Countable and Uncountable Sets (a) Show that there are uncountably infinite many real numbers in the interval (0, 1). (Hint: Prove this by contradiction. Specifically, (i) assume that there are countably infinite real numbers in (0, 1) and denote them as x1, x2, x3, · · · ; (ii) express each real number x1 between 0 and 1 in decimal expansion; (iii) construct a number y whose digits are either 1 or 2. Can you find a way...
Prove whether or not the set ? is countable. a. ? = [0, 0.001) b. ?...
Prove whether or not the set ? is countable. a. ? = [0, 0.001) b. ? = ℚ x ℚ I do not really understand how to prove S is countable.
[Q] Prove or disprove: a)every subset of an uncountable set is countable. b)every subset of a...
[Q] Prove or disprove: a)every subset of an uncountable set is countable. b)every subset of a countable set is countable. c)every superset of a countable set is countable.
Prove Cantor’s original result: for any nonempty set (whether finite or infinite), the cardinality of S...
Prove Cantor’s original result: for any nonempty set (whether finite or infinite), the cardinality of S is strictly less than that of its power set 2S . First show that there is a one-to-one (but not necessarily onto) map g from S to its power set. Next assume that there is a one-to-one and onto function f and show that this assumption leads to a contradiction by defining a new subset of S that cannot possibly be the image of...
Prove that any countable subset of [a,b] has measure zero. Recall that a set S has...
Prove that any countable subset of [a,b] has measure zero. Recall that a set S has measure zero if  there is a countable collection of open intervals  with .