974 views
2 votes
2 votes

Let f : AB and g : BC denote two functions. Consider the following two statements:
S1 : If both f and g are injections then the composition function gof: AC is an injection.
S2 : If the function gof: A → C is surjection and g is an injection then the function f is a surjection.
S3 : If h(a) = g(f(a)) and h(a) is onto then g must be onto, where ∀a, aA.
Which of the above statements are valid?

please give explanation

1 Answer

0 votes
0 votes
all are valid

Related questions

141
views
1 answers
0 votes
Deepak Poonia asked May 5
141 views
Let $f : X \rightarrow Y$ and $g : Y \rightarrow Z$ be functions. We can define the composition of $f$ and $g$ ... $f$ and $g$? Explain.
1.3k
views
1 answers
0 votes
aishwarydewangan asked Sep 18, 2017
1,326 views
For gof to be one-to-one, f must be one-to-one but reverse is not true.Is the above statement correct?According to me both f and g must be one-to- ... which implies that gof is one-to-one.Are above examples correct? If yes, please explain.
1.9k
views
1 answers
1 votes
Mk Utkarsh asked Feb 12, 2018
1,878 views
There exist 3 sets(A,B,C) and 2 functions f and g.g be a function from set A to set Bf be a function from set B to set Cthen composition of ... functions for the existence of $g \circ f$a) Injectionb) Surjectionc) Bijectiond) None of these
3.4k
views
0 answers
0 votes
Markzuck asked Jan 10, 2019
3,423 views
How to take composition of a Relation? here used concept of function but when to go with the transitivity rule concept as mentioned below?Please clarify in general when to use which method