Chapter 17: 27E (page 521)
Let and be functions. Prove:
(a) If f and g are injective, then is injective.
(b) If f and g are surjective, thenis surjective.
Short Answer
- It is proved that is inject.
- It is proved that is surjective.
Chapter 17: 27E (page 521)
Let and be functions. Prove:
(a) If f and g are injective, then is injective.
(b) If f and g are surjective, thenis surjective.
All the tools & learning materials you need for study success - in one app.
Get started for freeProve thatfor every nonnegative integer is n. [Recall that 0! = 1 and for n > 0 ,n!=1.2.3...(n-1)n .]
Prove that the given function is surjective.
(a)
(b)
(c)
(d)
Let denote the positive real numbers. Does the following rule define a function from to R: assign to each positive real number c the real number whose square is c?
Let be a symmetric and transitive relation on a set A. What is wrong with the following “proof” that is reflexive:role="math" localid="1659504197825" impliesrole="math" localid="1659504216047" by symmetry; then and imply by transitivity. [Also see Exercise 8(f).]
(a) Prove that the following relation on the set R of real numbers is an equivalence relation: if and only if .
(b) Describe the equivalence class of 0 and the equivalence class of .
What do you think about this solution?
We value your feedback to improve our textbook solutions.