Class 12 PCM . Mathematics . Mathematics Part I . Relations and Functions
Chapter 1: Relations And Functions
Ch 1
Mathematics
Class 12 PCM
Relations
A relation from a non-empty set to another non-empty set is defined as a subset of the Cartesian product . Formally,
Thus, any subset of is a relation from to .
Note: If and are finite sets with and elements respectively, then . The total number of relations from to is the number of subsets of , which is .
Domain, Range and Co-domain of a Relation
Domain: The domain of a relation from to is the set of all elements such that there exists with . Formally,
Range: The range of is the set of all elements such that there exists with . Formally,
Co-domain: The co-domain of is the set itself.
Types of Relations
- Empty Relation: .
- Universal Relation: .
- Identity Relation: Defined on as .
- Reflexive Relation: on is reflexive if for all .
- Symmetric Relation: on is symmetric if for all .
- Transitive Relation: on is transitive if and imply for all .
- Equivalence Relation: A relation that is reflexive, symmetric, and transitive.
Worked Example 1
Let , , and define \( R = \{(a,b) : a < b\} \). Find domain, range, and co-domain.
Solution:
Domain:
Range:
Co-domain:
Worked Example 2
Check if the relation on is reflexive.
Solution:
Check if for all :
, so is reflexive.
Practice Set
Level 1 – Easy
- Define the relation on and as . Find domain, range, and co-domain.
- Is the empty relation on reflexive?
Level 2 – Moderate
- Given , check if is symmetric.
- Show that the universal relation on is reflexive.
Level 3 – Challenging
- Prove that the relation on integers is an equivalence relation.
- Given , , verify if is transitive.
Answer Key
Level 1
- Domain: , Range: , Co-domain:
- No, empty relation is not reflexive as for all .
Level 2
- Yes, is symmetric because for every , .
- Universal relation contains all pairs including , so it is reflexive.
Level 3
- Reflexive: even, Symmetric: if even, then even, Transitive: sum of even numbers is even. Hence equivalence relation.
- Check transitivity: For all , holds. Hence is transitive.
Quick Reference
| Relation Type | Definition |
|---|---|
| Empty Relation | |
| Universal Relation | |
| Identity Relation | |
| Reflexive | for all |
| Symmetric | |
| Transitive | |
| Equivalence Relation | Reflexive, Symmetric, and Transitive |
Glossary
- Relation: A subset of .
- Domain: Set of first elements in relation pairs.
- Range: Set of second elements in relation pairs.
- Co-domain: The set in relation .
- Reflexive: Every element relates to itself.
- Symmetric: Relation is bidirectional.
- Transitive: Relation passes through intermediate elements.
- Equivalence Relation: Relation that is reflexive, symmetric, and transitive.
Functions
A function from a set to a set is a special type of relation where each element of is related to exactly one element of . Formally, such that for every , there exists a unique with . The element is called the image of under , denoted .
Difference Between Relation and Function
| Property | Function | Relation |
|---|---|---|
| Existence | Every has at least one with | Not necessarily |
| Uniqueness | Each has exactly one | Can have multiple for same |
Real Valued Function of a Real Variable
If the domain and range of are subsets of real numbers , then is called a real valued function of a real variable.
Common Real Functions
| Function | Expression | Domain | Range |
|---|---|---|---|
| Identity | |||
| Modulus | |||
| Greatest Integer | |||
| Signum | \( f(x) = \begin{cases} -1 & x<0 \\ 0 & x=0 \\ 1 & x>0 \end{cases} \) | ||
| Exponential | \( f(x) = a^x, a>0, a \neq 1 \) | ||
| Logarithmic | \( f(x) = \log_a x, a>0, a \neq 1 \) |
Types of Functions
- One-one (Injective) Function: is injective if for all .
- Onto (Surjective) Function: is surjective if for every , there exists such that .
- Bijective Function: A function that is both injective and surjective.
- Identity Function: defined by for all .
- Equal Functions: Two functions and are equal if for all in their domain.
Algorithms to Check Injectivity and Surjectivity
Injectivity
- Take arbitrary .
- Assume .
- Solve for . If true for all , is injective.
Surjectivity
- Take arbitrary .
- Solve for .
- If solution exists for all , is surjective.
Worked Example 1
Show that defined by is one-one.
Solution:
Assume , then
Hence, is injective.
Worked Example 2
Show that defined by and for \( x > 2 \) is onto but not one-one.
Solution:
Since , is not injective.
For any , , choose , then . Also . Hence, is onto.
Practice Set
Level 1 – Easy
- Define a function and find its domain, co-domain, and range.
- Is the function injective?
Level 2 – Moderate
- Check if from is onto.
- Show that the function is not one-one.
Level 3 – Challenging
- Prove that the function defined by is bijective.
- Find the inverse of the function and verify it is bijective.
Answer Key
Level 1
- Domain: , Co-domain: , Range depends on function definition.
- Yes, is injective.
Level 2
- is not onto because negative numbers are not in range.
- is not one-one as .
Level 3
- is bijective because it is both injective and surjective.
- Inverse: . Verified by composition.
Quick Reference
| Function Type | Condition |
|---|---|
| Injective | |
| Surjective | |
| Bijective | Both injective and surjective |
| Identity |
Glossary
- Function: Relation with unique image for each element in domain.
- Domain: Set of inputs.
- Co-domain: Set of possible outputs.
- Range: Actual set of outputs.
- Injective: One-to-one mapping.
- Surjective: Onto mapping.
- Bijective: Both injective and surjective.
- Inverse Function: Function reversing .
Mathematics — ALL CHAPTERS
1
Relations And Functions
2
Inverse Trigonometric Functions
3
Matrices
4
DETERMINANTS
5
Continuity And Differentiability
6
Application Of Derivatives
7
Integrals
8
APPLICATION OF INTEGRALS
9
DIFFERENTIAL EQUATIONS
10
VECTOR ALGEBRA
11
Three Dimensional Geometry
12
Linear Programming
13
Probability
14
Proofs In Mathematics
15
Mathematical Modelling