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.3 - Page 427: 19

Answer

Yes. If \(g \circ f\) is onto \(Z\), then \(g\) itself must also be onto \(Z\).

Work Step by Step

## Proof Suppose \(g \circ f\) is onto \(Z\). By definition, for **every** \(z \in Z\), there exists some \(x \in X\) such that \[ (g \circ f)(x) \;=\; z. \] That means \[ g\bigl(f(x)\bigr) \;=\; z. \] Set \(y = f(x)\). Since \(f(x)\in Y\), we have \(y \in Y\) and \(g(y) = z\). Hence, for **each** \(z \in Z\), we found a \(y \in Y\) with \(g(y) = z\). That is exactly the definition that \(g\) is onto \(Z\). Therefore, whenever \(g \circ f\) is onto, \(g\) must also be onto.
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.