Relations and Functions | CBSE
sources:
- text: Standard textbook reference
Relations and Functions
Section titled “Relations and Functions”Relations and functions form the foundation of higher mathematics. This topic covers types of relations, types of functions, composition, and invertibility.
Key Concepts
Section titled “Key Concepts”- Relation from set to set is a subset of
- Domain of :
- Range of :
- Reflexive: for all
- Symmetric:
- Transitive: and
- Equivalence relation: reflexive, symmetric, and transitive
- Function is injective (one-to-one):
- Function is surjective (onto): for every , there exists with
- Bijective function: both injective and surjective
Worked Example 1 — Types of Relations
Section titled “Worked Example 1 — Types of Relations”Problem: Let and . Determine if is reflexive, symmetric, and transitive.
Solution:
Reflexive: Check if for all : . Yes, is reflexive.
Symmetric: Check if : and . and . Yes, is symmetric.
Transitive: Check if and : and , but . No, is not transitive.
Common mistake: Assuming that if a relation is reflexive and symmetric, it must be transitive. Always check all three properties.
Worked Example 2 — Injective and Surjective Functions
Section titled “Worked Example 2 — Injective and Surjective Functions”Problem: Determine whether defined by is injective, surjective, or bijective.
Solution:
Injective: Suppose :
Since and could have opposite signs (e.g., ), is not injective.
Surjective: Is every in the range? For : , which has no real solution. So is not surjective.
Since is neither injective nor surjective, it is not bijective.
Common mistake: Forgetting that has solutions , which breaks injectivity.
Worked Example 3 — Composition of Functions
Section titled “Worked Example 3 — Composition of Functions”Problem: If and , find and .
Solution:
Note that as a rule.
Common mistake: Computing as instead of substituting into .
Practice Problems
Section titled “Practice Problems”- Let and . Is transitive?
- Show that defined by is bijective.
- Find if .
Why This Matters
Section titled “Why This Matters”Relations and functions are the language of mathematics. Every equation, mapping, and transformation in higher mathematics is expressed through functions. Understanding injectivity and surjectivity is essential for calculus, linear algebra, and abstract mathematics.
Common Exam Patterns
Section titled “Common Exam Patterns”- Equivalence relations partition a set into equivalence classes
- A function is invertible if and only if it is bijective
- Composition is not commutative:
- The number of functions from a set of elements to a set of elements is
- Practice identifying domain and range from graphs and equations
Key Formulas
Section titled “Key Formulas”- Number of relations from to :
- Number of functions from to :
- Number of one-one functions from to : (when )
- Composition:
- Inverse: if , then
Worked Example 4 — Equivalence Relation from Partition
Section titled “Worked Example 4 — Equivalence Relation from Partition”Problem: Let . Define on by if and leave the same remainder when divided by 3. Show that is an equivalence relation and find the equivalence classes.
Solution:
Remainders when divided by 3: , , , , , .
Reflexive: and leave the same remainder. Yes.
Symmetric: If and leave the same remainder, then and leave the same remainder. Yes.
Transitive: If and leave the same remainder, and and leave the same remainder, then and leave the same remainder. Yes.
Equivalence classes:
- Remainder 0:
- Remainder 1:
- Remainder 2:
Common mistake: Forgetting that equivalence classes partition the set. Each element belongs to exactly one class.
Worked Example 5 — Injective Function with Restricted Domain
Section titled “Worked Example 5 — Injective Function with Restricted Domain”Problem: Determine whether defined by is injective, surjective, or bijective.
Solution:
Injective: Suppose : Yes, is injective.
Surjective: Is every positive integer in the range? For , the range is (odd numbers greater than or equal to 3). So and are not in the range. No, is not surjective.
Since is injective but not surjective, it is not bijective.
Common mistake: Confusing the codomain with the range. The codomain is , but the range is only the odd numbers .
Worked Example 6 — Inverse Function
Section titled “Worked Example 6 — Inverse Function”Problem: Find the inverse of defined by , .
Solution:
Let .
Solve for :
Therefore:
Common mistake: Forgetting to specify the domain of the inverse function. The domain of is .
Exam Tips
Section titled “Exam Tips”- To check transitivity, look for counterexamples: find and where
- For injectivity, assume and show . If you get , the function is not injective.
- For surjectivity, try to solve for arbitrary in the codomain
- Composition order matters: , not
- A function has an inverse if and only if it is bijective; to find it, solve for
Intuition
Section titled “Intuition”A function is a machine with strict rules: Picture a vending machine — you put in a specific coin (input), and you always get the same snack (output). A function is the same: same input always produces same output. Injective means no two different coins give the same snack. Surjective means every snack in the display can be obtained. Bijective means it’s a perfect one-to-one correspondence.
Why it matters: Functions are the language of mathematics itself — every equation, mapping, and transformation is expressed through functions. Understanding injectivity and surjectivity determines whether you can invert a function, solve equations uniquely, and define meaningful compositions.
The key insight: Composition is not commutative because it’s about the order of operations — putting on socks then shoes is fundamentally different from shoes then socks.
Common Mistakes
Section titled “Common Mistakes”Mistake 1: Confusing composition order
Section titled “Mistake 1: Confusing composition order”Function composition is not commutative: is generally not equal to . Students often compute when the question asks for , or assume the order does not matter. Always write out the substitution explicitly: for , plug into , not the other way around.
Mistake 2: Assuming a relation that is reflexive and symmetric must be transitive
Section titled “Mistake 2: Assuming a relation that is reflexive and symmetric must be transitive”A relation can be reflexive and symmetric without being transitive. For example, on , the relation is reflexive and symmetric but not transitive because and are in while is not. Always check all three properties independently.
Mistake 3: Forgetting that composition is not the same as multiplication
Section titled “Mistake 3: Forgetting that composition is not the same as multiplication”Students sometimes compute as instead of . Composition means substituting the entire function into as the input variable. For example, if and , then , not .
Cross-References
Section titled “Cross-References”- Inverse Trigonometric Functions — Inverse trigonometric functions are specific examples of inverse functions, requiring understanding of bijectivity.
- Matrices — Linear transformations are functions from vectors to vectors, extending function theory to matrix algebra.
- Calculus — Derivatives measure rates of change of functions, connecting function theory to differential calculus.