Question

Prove for each: a. Proposition: If A is finite and B is countable, then A ∪...

Prove for each:

a. Proposition: If A is finite and B is countable, then A ∪ B is countable.

b. Proposition: Every subset A ⊆ N is finite or countable. [Similarly if A ⊆ B with B countable.]

c. Proposition: If N → A is a surjection, then A is finite or countable. [Or if countable B → A surjection.]

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
[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 the union of a finite collection of countable sets is countable.
Prove the union of a finite collection of countable sets is countable.
Prove that a countable union of countable sets countable; i.e., if {Ai}i∈I is a collection of...
Prove that a countable union of countable sets countable; i.e., if {Ai}i∈I is a collection of sets, indexed by I ⊂ N, with each Ai countable, then union i∈I Ai is countable. Hints: (i) Show that it suffices to prove this for the case in which I = N and, for every i ∈ N, the set Ai is nonempty. (ii) In the case above, a result proven in class shows that for each i ∈ N there is a...
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.
Is the set of all finite subsets of N countable or uncountable? Give a proof of...
Is the set of all finite subsets of N countable or uncountable? Give a proof of your assertion.
Prove: Proposition 11.13. Congruence modulo n is an equivalence relation on Z : (1) For every...
Prove: Proposition 11.13. Congruence modulo n is an equivalence relation on Z : (1) For every a ∈ Z, a = a mod n. (2) If a = b mod n then b = a mod n. (3) If a = b mod n and b = c mod n, then a = c mod n
Prove that a subset of a countably infinite set is finite or countably infinite.
Prove that a subset of a countably infinite set is finite or countably infinite.
Let S denote the set of all possible finite binary strings, i.e. strings of finite length...
Let S denote the set of all possible finite binary strings, i.e. strings of finite length made up of only 0s and 1s, and no other characters. E.g., 010100100001 is a finite binary string but 100ff101 is not because it contains characters other than 0, 1. a. Give an informal proof arguing why this set should be countable. Even though the language of your proof can be informal, it must clearly explain the reasons why you think the set should...
Assume that X and Y are finite sets. Prove the following statement: If there is a...
Assume that X and Y are finite sets. Prove the following statement: If there is a bijection f:X→Y then|X|=|Y|. Hint: Show that if f : X → Y is a surjection then |X| ≥ |Y| and if f : X → Y is an injection then |X| ≤ |Y |.
If A and B are two finite sets. Prove that |A ∪ B| = |A| +...
If A and B are two finite sets. Prove that |A ∪ B| = |A| + |B| − |A ∩ B| is true.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT