Let A = (1, 2, 3, 4, 5) and B = {a, b, c) and f = {(1, a), (2, a), (3, b), (4, b). (5, b)}. Choose the BEST answer. %3D f is NOT onto. (I.e., f is not an "onto" function.) f is every-where defined. All of them are true. of is a function, but f is NOT invertible.

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter1: Fundamentals
Section1.3: Properties Of Composite Mappings (optional)
Problem 10E: Let g:AB and f:BC. Prove that f is onto if fg is onto.
icon
Related questions
Question
Let A = {1, 2, 3, 4, 5) and B = {a, b, c) and f = {(1, a), (2, a). (3, b), (4, b). (5, b)}. Choose
the BEST answer.
%3D
f is NOT onto. (I.e., f is not an "onto" function.)
f is every-where defined.
All of them are true.
f is a function, but f is NOT invertible.
Transcribed Image Text:Let A = {1, 2, 3, 4, 5) and B = {a, b, c) and f = {(1, a), (2, a). (3, b), (4, b). (5, b)}. Choose the BEST answer. %3D f is NOT onto. (I.e., f is not an "onto" function.) f is every-where defined. All of them are true. f is a function, but f is NOT invertible.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer