Example 13 - Chapter 1 Class 12 Relation and Functions
Last updated at Dec. 16, 2024 by Teachoo
To prove one-one & onto (injective, surjective, bijective)
One One function
You are here
You are here
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 13 (Method 1) Show that an onto function f : {1, 2, 3} → {1, 2, 3} is always one-one. Since f is onto, all elements of {1, 2, 3} have unique pre-image. Following cases are possible Since every element 1,2,3 has either of image 1,2,3 and that image is unique f is one-one Since every element 1, 2, 3 has either of image 1, 2, 3 and that image is unique ∴ f is one-one Example 13 (Method 2) Show that an onto function f : {1, 2, 3} → {1, 2, 3} is always one-one. Suppose f is not one-one, So, atleast two elements will have the same image If 1 & 2 have same image 1, & 3 has image 3 Then, 2 has no pre-image, Hence, f is not onto. But, given that f is onto, So, f must be one-one
