Homepage › Solution manuals › Terence Tao › Analysis I › Exercise 3.3.2 (Composition preserves injectivity/surjectivity)
Exercise 3.3.2 (Composition preserves injectivity/surjectivity)
Let and be functions. Show that if and are both injective, then so is ; similarly, show that if and are both surjective, then so is .
Answers
0.0.1 Injection
Let and such that and and . Since is injective, and since is injective . Therefore and so is injective.
0.0.2 Surjection
Suppose is not surjective. Then there exists some such that . Since is surjective, there is some for which . And similarly, since is surjective, there is some such that . This implies which contradicts the claim that .
Comments
Proof.
- 1.
- ( is injective) By Definition 3.3.14, to show that is injective, we have to demonstrate that for any . Since and are both injective, we have for all . Therefore, we have and thus, for any and Thus, we can conclude that is injective.
- 2.
- ( is surjective)
Since
and we
have
By Definition 3.3.17, we have to show that for every
there
exists
such that
Figure 1: The idea of the proof is to fix and then go to the previous set since surjectivity guarantees that we can always go backwards at any point in the range. Let be arbitrary. Since is surjective we have such that Since is surjective, for that particular we have such that In other words, we have found a such that , as desired.