Chapter 14: Problem 7
Prove or disprove: The set \(\mathbb{Q}^{100}\) is countably infinite.
Chapter 14: Problem 7
Prove or disprove: The set \(\mathbb{Q}^{100}\) is countably infinite.
All the tools & learning materials you need for study success - in one app.
Get started for freeShow that if \(A \subseteq B\) and there is an injection \(g: B \rightarrow A,\) then \(|A|=|B|\)
Prove or disprove: The set \(A=\left\\{\frac{\sqrt{2}}{n}: n \in \mathbb{N}\right\\}\) countably infinite.
Theorem 14.5 implies that \(\mathbb{N} \times \mathbb{N}\) is countably infinite. Construct an alternate proof of this fact by showing that the function \(\varphi: \mathbb{N} \times \mathbb{N} \rightarrow \mathbb{N}\) defined as \(\varphi(m, n)=\) \(2^{n-1}(2 m-1)\) is bijective.
Show that the two given sets have equal cardinality by describing a bijection from one to the other. Describe your bijection with a formula (not as a table). \(\\{0,1\\} \times \mathbb{N}\) and \(\mathbb{Z}\)
Suppose \(B\) is an uncountable set and \(A\) is a set. Given that there is a surjective function \(f: A \rightarrow B,\) what can be said about the cardinality of \(A ?\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.