You are here
Question 2 - Composite functions and one-one onto - Chapter 1 Class 12 Relation and Functions
Last updated at August 2, 2026 by Teachoo
Composite functions and one-one onto
Chapter 1 Class 12 Relation and Functions
Concept wise
- Relations - Definition
- Empty and Universal Relation
- To prove relation reflexive, transitive, symmetric and equivalent
- Finding number of relations
- Function - Definition
- To prove one-one & onto (injective, surjective, bijective)
- Composite functions
-
Composite functions and one-one onto
- Finding Inverse
- Inverse of function: Proof questions
- Binary Operations - Definition
- Whether binary commutative/associative or not
- Binary operations: Identity element
- Binary operations: Inverse
Take a fresh quiz. Then take another.
Every attempt is a new AI-adaptive Teachoo quiz with 3 questions, selected from your answers, mistakes, and progress.
Transcript
Question 2 Show that if f : A → B and g : B → C are one-one, then gof : A → C is also one-one. Checking gof one-one We need to prove that If gof (x1) = gof (x2), then x1 = x2 Suppose gof (x1) = gof (x2) g (f (x1)) = g(f (x2)) Given g is one-one So, f (x1) = f (x2), And f is also one-one x1 = x2 Hence, gof is one-one.
