Discrete Mathematics with Applications 4th Edition

Published by Cengage Learning
ISBN 10: 0-49539-132-8
ISBN 13: 978-0-49539-132-6

Chapter 7 - Functions - Exercise Set 7.4 - Page 440: 30

Answer

See explanation

Work Step by Step

Recall that we have already shown that: 1. The set of rational numbers, \(\mathbb{Q}\), is countable. 2. The union of two countable sets is countable. Also, it is well known (via Cantor's diagonal argument, for example) that the set of real numbers, \(\mathbb{R}\), is uncountable. Now, notice that every real number is either rational or irrational. That is, \[ \mathbb{R} = \mathbb{Q} \cup \bigl(\mathbb{R}\setminus\mathbb{Q}\bigr), \] where \(\mathbb{R}\setminus\mathbb{Q}\) is the set of all irrational numbers. Suppose, for the sake of contradiction, that the set of irrational numbers is countable. Then both \(\mathbb{Q}\) (by known result) and \(\mathbb{R}\setminus\mathbb{Q}\) (by assumption) are countable. But then their union, being the disjoint union of two countable sets, would also be countable. That is, \[ \mathbb{R} = \mathbb{Q} \cup (\mathbb{R}\setminus\mathbb{Q}) \] would be countable. However, we know that \(\mathbb{R}\) is uncountable. This contradiction implies that our assumption must be false. Therefore, the set of all irrational numbers is uncountable.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.