Ex 1.2 , 6 - 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
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
Ex 1.2, 6 Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let f = {(1, 4), (2, 5), (3, 6)} be a function from A to B. Show that f is one-one. A = {1, 2, 3}, B = {4, 5, 6, 7}. f = {(1, 4), (2, 5), (3, 6)}. Since every element of A has a unique image. Hence , f is one-one
