Suppose f : A → B and g : B → C are both surjective functions.Prove that g ◦ f : A → C is surjective
Question
Suppose f : A → B and g : B → C are both surjective functions.Prove that g ◦ f : A → C is surjective
Solution
To prove that the composition of two surjective functions is also surjective, we need to show that for every element 'c' in the set C, there exists an element 'a' in the set A such that (g ◦ f)(a) = c.
Here are the steps:
-
Since g : B → C is surjective, for every 'c' in C, there exists an element 'b' in B such that g(b) = c.
-
Now, since f : A → B is surjective, for this 'b' in B, there exists an element 'a' in A such that f(a) = b.
-
Substituting f(a) = b into g(b) = c, we get g(f(a)) = c, which is the same as (g ◦ f)(a) = c.
-
Therefore, for every 'c' in C, we have found an 'a' in A such that (g ◦ f)(a) = c.
-
Hence, g ◦ f : A → C is surjective.
This completes the proof.
Similar Questions
If f A —> B and g : B —> C are injectivefunction, then gof: A —> C is an injectivefunction. Prove or disprove.
Let f : X → Y and g : Y → X. If g ◦ f is an identity function on X and f ◦ g is an identityfunction on Y , then, show that(a) f is one-one(b) f is onto(c) g = f −1
Let X, Y and Z be any non-empty sets and let f and g be one-one functions of X onto Y andY onto Z respectively so that f and g are both invertible. Then, show that(a) g ◦ f is one-one(b) g ◦ f is onto(c) (g ◦ f )−1 = f −1 ◦g−1
Suppose A = {a, b, c}. Let f : A → A be the function f = {(a, c), (b, c), (c, c)}, and letg : A → A be the function g = {(a, a), (b, b), (c, a)}. Find g ◦ f and f ◦ g
If f: A →B is an onto function then range of f is
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.