Question:

Let S, T, U be three non-void sets and f : S $\to$ T,g : T $\to$ U is surjective. Then

Updated On: Apr 27, 2024
  • g and f are both surjective
  • g is surjective, f may not be so
  • f is surjective, g may not be so
  • f and g both may not be surjective
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is B

Solution and Explanation

g o f : S $\to$ U is onto Let z be an arbitrary element of U $\because$ g o f : S $\to$ U onto there exists x $\in$ S g o f(x) = z $\Rightarrow $ g(f(x)) = z;g(y) = z , where y = f(x) $\in$ T for all z $\in$ U, there exists y = f(x) $\in$ T such that g(y) = z g : T $\to$ U onto.
Was this answer helpful?
0
0

Concepts Used:

Relations and functions

A relation R from a non-empty set B is a subset of the cartesian product A × B. The subset is derived by describing a relationship between the first element and the second element of the ordered pairs in A × B.

A relation f from a set A to a set B is said to be a function if every element of set A has one and only one image in set B. In other words, no two distinct elements of B have the same pre-image.

Representation of Relation and Function

Relations and functions can be represented in different forms such as arrow representation, algebraic form, set-builder form, graphically, roster form, and tabular form. Define a function f: A = {1, 2, 3} → B = {1, 4, 9} such that f(1) = 1, f(2) = 4, f(3) = 9. Now, represent this function in different forms.

  1. Set-builder form - {(x, y): f(x) = y2, x ∈ A, y ∈ B}
  2. Roster form - {(1, 1), (2, 4), (3, 9)}
  3. Arrow Representation