Chapter 17: Q31E (page 522)
If is a function, then f can be considered as a map from B to since for every . Show that the map is surjective.
Short Answer
Thus, the map is surjective.
Chapter 17: Q31E (page 522)
If is a function, then f can be considered as a map from B to since for every . Show that the map is surjective.
Thus, the map is surjective.
All the tools & learning materials you need for study success - in one app.
Get started for freeLet 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).]
Let be an matrix, be a matrix, and be a matrix. Prove that . [Hint: , where and , where . The i-j entry of is . Show that the i-j entry of is this same double sum.]
Use the principle of complete Induction to show that every integer greater than 1 is a product of primes. [Recall that a positive integer p is prime [ Recall that a positive integer p is prime
provided that p > 1 and that the only positive integer factors of p a re 1
and p.].
Prove that the following relation on the coordinate plane is an equivalence relation: if and only if x-u is an integer.
(a) Give an example of a functionthat is injective butnot surjective.
(b) Give an example of a function that is surjective but not injective.
NOTE: is the set of integers, is the set of rational numbers, and the set of real numbers.
What do you think about this solution?
We value your feedback to improve our textbook solutions.