Let f: A → B be an onto (or surjective) function, where A and B are nonempty…
PYQ GATE 2023
Let f: A → B be an onto (or surjective) function, where A and B are nonempty sets. Define an equivalence relation ∼ on the set A as
a₁ ∼ a₂ if f(a₁) = f(a₂),
where a₁, a₂ ∈ A. Let 𝓔 = {[x] : x ∈ A} be the set of all the equivalence classes under ∼. Define a new mapping F: 𝓔 → B as
F([x]) = f(x), for all the equivalence classes [x] in 𝓔.
Which of the following statements is/are TRUE?
- A.
F is NOT well-defined.
- B.
F is an onto (or surjective) function.
- C.
F is a one-to-one (or injective) function.
- D.
F is a bijective function.
Attempted by 162 students.
Sign up free to check your answer
Sign up freeLoading lesson…

