2. Give an example of a function g from set A to one of the sets that is surjective but not injective. (No answer given) $g(1) =$ (No answer given) $g(14) =$ A $g(15) =$ B $g: A \to C$ $g(17) =$ C
Added by Cindy D.
Close
Step 1
A function is surjective if every element in the codomain (the set that the function maps to) is mapped to by at least one element in the domain (the set that the function maps from). In other words, every element in the codomain has a preimage in the domain. Show more…
Show all steps
Your feedback will help us improve your experience
Gregory Higby and 63 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Give an example of a function f : [0, 1] → [0, 1] which is surjective but not injective.
Adi S.
Give an example of a set X and functions f: X→X, g: X→X such that g ◦ f is bijective but neither f nor g are bijective
Supreeta N.
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD