Class 12 Maths - PUNJAB
Relations and Functions
The chapter 'Relations and Functions' in Class 12 Mathematics builds upon the foundational concepts of sets learned in previous grades. It explores advanced types of relations such as reflexive, symmetric, transitive, and equivalence relations. Furthermore, it delves deep into functions, focusing on one-one (injective), onto (surjective), and bijective functions, along with the concept of invertible functions and composition of functions. For Punjab (PSEB) board exams, this chapter is crucial as it forms the basis of calculus and algebra, frequently featuring in both short-answer and long-answer questions.
Start Learning FreeKey Concepts
Reflexive Relation
A relation R on a set A is reflexive if every element relates to itself, meaning (a, a) belongs to R for all a in A.
Symmetric Relation
A relation R is symmetric if whenever (a, b) is in R, then (b, a) must also be in R for all a, b in A.
Transitive Relation
A relation R is transitive if whenever (a, b) and (b, c) are in R, then (a, c) must also be in R.
Equivalence Relation
A relation is called an equivalence relation if it is simultaneously reflexive, symmetric, and transitive.
One-One Function (Injective)
A function f: A -> B is one-one if distinct elements in A have distinct images in B, i.e., f(x1) = f(x2) implies x1 = x2.
Onto Function (Surjective)
A function f: A -> B is onto if every element in the co-domain B has at least one pre-image in the domain A.
Important Formulas
Board Exam Info
In the Punjab (PSEB) Class 12 Mathematics board examination, the chapter 'Relations and Functions' typically carries around 6 to 8 marks. Common question types include checking whether a given relation is an equivalence relation, proving a function is one-one and onto, and finding the inverse or composition of given functions.
Frequently Asked Questions
How do I prove a relation is an equivalence relation?
You must separately prove that the relation is reflexive, symmetric, and transitive by applying the definition of each using general elements.
What is the easiest way to check if a function is one-one?
Assume f(x1) = f(x2) for two elements in the domain, and algebraically simplify it to show that x1 must equal x2.
Is the composition of functions commutative?
No, generally (f o g)(x) is not equal to (g o f)(x) unless specified otherwise or for very specific functions.
Learn Relations and Functions with Your AI Tutor
10 different ways to study this chapter. Free for 3 chapters per day.
Lecture
Key Points
Interactive
Quiz
Flashcards