Class 11 PCM . Mathematics . Mathematics . Relations and Functions
Chapter 2: Relations And Functions
Ch 2
Mathematics
Class 11 PCM
Relations and Functions
Relations and functions are fundamental concepts in mathematics that describe connections between elements of sets. A relation from set to set is a subset of the Cartesian product , consisting of ordered pairs where and . A function is a special type of relation where each element of is related to exactly one element of .
Concept Explanation
Given two non-empty sets and , the Cartesian product is defined as:
This set contains all ordered pairs where the first element is from and the second from . A relation from to is any subset of .
The domain of a relation is the set of all first elements of the ordered pairs in , and the range is the set of all second elements:
The codomain is the set itself.
Types of Relations
- Void Relation: The empty set is a relation with no elements.
- Universal Relation: The entire Cartesian product .
- Identity Relation: .
- Reflexive Relation: Every element relates to itself: .
- Symmetric Relation: If , then .
- Anti-Symmetric Relation: If and , then .
- Transitive Relation: If and , then .
- Equivalence Relation: A relation that is reflexive, symmetric, and transitive.
- Partial Order Relation: Reflexive, anti-symmetric, and transitive.
- Total Order Relation: A partial order relation where every pair of elements is comparable.
Worked Illustration
Let and . The Cartesian product is:
A relation could be . The domain of is , and the range is .
Solved Example
Example: Determine if the relation on is reflexive, symmetric, and transitive.
Solution:
- Reflexive: Check if for all . Here, , so is reflexive.
- Symmetric: For each , check if . but , so is not symmetric.
- Transitive: Check if whenever and , then . and , so which is true. No other pairs violate transitivity, so is transitive.
Practice Set
Level 1 – Easy
- Find the Cartesian product of and .
- Identify the domain and range of .
- Is the relation on reflexive?
Level 2 – Moderate
- Given on , check if is transitive.
- Determine if on is symmetric.
- Find the number of elements in if and .
Level 3 – Challenging
- Prove that the identity relation on a set is an equivalence relation.
- Show that the empty relation on is symmetric and transitive but not reflexive.
- Given is a partial order on , prove that is reflexive, anti-symmetric, and transitive.
Answer Key
- Level 1:
- Domain = , Range =
- Yes, is reflexive on
- Level 2:
- is transitive because and imply which is in
- is not symmetric because but
- Number of elements in
- Level 3:
- Identity relation is reflexive, symmetric, and transitive by definition.
- Empty relation has no elements, so symmetric and transitive hold vacuously, but not reflexive as not in .
- By definition, partial order is reflexive, anti-symmetric, and transitive.
Quick Reference
| Term | Definition |
|---|---|
| Cartesian Product | Set of all ordered pairs with , |
| Relation | Subset of |
| Function | Relation with exactly one output for each input |
| Domain | Set of all first elements in relation |
| Range | Set of all second elements in relation |
| Reflexive | for all |
| Symmetric | If , then |
| Transitive | If and in , then in |
Glossary
- Ordered Pair: A pair where order matters.
- Subset: A set all of whose elements belong to another set.
- Reflexive Relation: Relation where every element relates to itself.
- Symmetric Relation: Relation where if relates to , then relates to .
- Transitive Relation: Relation where if relates to and relates to , then relates to .
- Equivalence Relation: Relation that is reflexive, symmetric, and transitive.
- Partial Order: Relation that is reflexive, anti-symmetric, and transitive.
Functions and Their Types
A function from set to set , denoted , assigns to each element exactly one element , called the image of , written . The set is the domain, is the codomain, and the set of all images is the range.
Concept Explanation
Functions can be classified based on their mapping properties:
- One-One (Injective): Different elements in map to different elements in .
- Onto (Surjective): Every element in is an image of some element in .
- One-One Onto (Bijective): Both injective and surjective.
- Many-One: Multiple elements in map to the same element in .
Formula Derivation
Number of functions from a set with elements to a set with elements is:
since each element of can be mapped to any of the elements of .
Worked Illustrations
Identity Function: , defined by . Graph is a straight line through origin with slope 1.
Constant Function: , where is constant. Graph is a horizontal line at .
Modulus Function: , defined as:
\[ f(x) = \begin{cases} x, & x \geq 0 \\ -x, & x < 0 \end{cases} \]
Graph is V-shaped with vertex at origin.
Signum Function: for , and . It takes values depending on sign of .
Greatest Integer Function: , the greatest integer less than or equal to . Graph is a step function.
Polynomial Functions: Examples include (parabola) and (cubic curve).
Exponential Function: , where \(a > 0, a \neq 1\). Domain is , range is .
Natural Exponential Function: , where .
Logarithmic Function: , inverse of exponential function, with domain and range .
Solved Examples
Example 1: Find the domain and range of .
Solution: Domain is all real numbers . Range is since absolute value is always non-negative.
Example 2: Determine if is one-one and onto from to .
Solution: is strictly increasing, so it is one-one. For any real , satisfies , so it is onto. Hence, is bijective.
Practice Set
Level 1 – Easy
- Find the range of for all real .
- Evaluate for .
- Is one-one on ?
Level 2 – Moderate
- Find the domain and range of .
- Show that is one-one and onto .
- Find the number of functions from a set with 3 elements to a set with 2 elements.
Level 3 – Challenging
- Prove that the composition of two one-one functions is one-one.
- Show that the inverse of a bijective function is also a function.
- Prove that the sum of two even functions is even.
Answer Key
- Level 1:
- Range of is .
- .
- is not one-one on because .
- Level 2:
- Domain of is , range is .
- is one-one because it is strictly increasing; onto because \(e^x > 0\) for all .
- Number of functions = .
- Level 3:
- Composition of one-one functions is one-one by definition.
- Inverse of bijection is well-defined and a function.
- Sum of even functions and satisfies .
Quick Reference
| Function Type | Definition | Domain | Range |
|---|---|---|---|
| Identity | |||
| Constant | \{c\} | ||
| Modulus | |||
| Signum | \{-1, 1\} | ||
| Greatest Integer | |||
| Exponential | \(f(x) = a^x, a>0, a \neq 1\) | ||
| Logarithmic | \(f(x) = \log_a x, a>0, a \neq 1\) |
Glossary
- Domain: Set of inputs for a function.
- Range: Set of outputs of a function.
- Codomain: Target set of a function.
- One-One (Injective): Different inputs map to different outputs.
- Onto (Surjective): Every element of codomain is an output.
- Bijective: Both one-one and onto.
- Composition: Applying one function after another.
- Even Function: .
- Odd Function: .
Mathematics — ALL CHAPTERS
1
Sets
2
Relations And Functions
3
Trigonometric Functions
4
Complex Numbers And Quadratic Equations
5
Linear Inequalities
6
Permutations And Combinations
7
Binomial Theorem
8
Sequences And Series
9
Straight Lines
10
Conic Sections
11
Introduction To Three Dimensional Geometry
12
Limits And Derivatives
13
Statistics
14
Probability