Example 8 - Chapter 1 Class 12 Relation and Functions
Last updated at April 16, 2024 by Teachoo
To prove one-one & onto (injective, surjective, bijective)
One One function
Onto function
One One and Onto functions (Bijective functions)
Example 7
Example 8 Important You are here
Example 9
Example 11 Important
Misc 2
Ex 1.2, 5 Important
Ex 1.2 , 6 Important
Example 10
Ex 1.2, 1
Ex 1.2, 12 (MCQ)
Ex 1.2, 2 (i) Important
Ex 1.2, 7 (i)
Ex 1.2 , 11 (MCQ) Important
Example 12 Important
Ex 1.2 , 9
Ex 1.2 , 3
Ex 1.2 , 4
Example 25
Example 26 Important
Ex 1.2 , 10 Important
Misc 1 Important
Example 13 Important
Example 14 Important
Ex 1.2 , 8 Important
Example 22 Important
Misc 4 Important
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
Transcript
Example 8 Show that the function f : N→ N, given by f (x) = 2x, is one-one but not onto. Given, f(x) = 2x One-One f (x1) = 2x1 f (x2) = 2x2 Putting f(x1) = f(x2) 2x1 = 2 x2 x1 = x2. Hence, if f(x1) = f(x2) , x1 = x2 function f is one-one Onto f(x) = 2x Let f(x) = y , such that y ∈ N 2x = y x = 𝑦/2 If y = 1 x = 1/2 = 0.5 , which is not possible as x ∈ N Hence, f is not onto
