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 439: 9

Answer

See explanation

Work Step by Step

A succinct way to see that the nonnegative integers \(\{0,1,2,3,\dots\}\) have the same cardinality as the positive integers \(\{1,2,3,\dots\}\) is to give an explicit bijection. One of the simplest is: \[ f: \mathbb{Z}^+ \;\to\; \mathbb{Z}_{\ge 0}, \quad f(n) \;=\; n - 1. \] - **Injectivity**: If \(f(n_1) = f(n_2)\), then \(n_1 - 1 = n_2 - 1\), so \(n_1 = n_2\). - **Surjectivity**: Every nonnegative integer \(m \in \{0,1,2,\dots\}\) can be written as \(m = (m+1) - 1\), and \(m+1\) is a positive integer. Hence every nonnegative integer is hit by some \(n \in \mathbb{Z}^+\). Because \(f\) is both one-to-one and onto, it is a **bijection**, so the set of nonnegative integers is countable.
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.