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 AA to set BB is a subset of the Cartesian product A×BA \times B, consisting of ordered pairs (a,b)(a, b) where a∈Aa \in A and b∈Bb \in B. A function is a special type of relation where each element of AA is related to exactly one element of BB.

Concept Explanation

Given two non-empty sets AA and BB, the Cartesian product A×BA \times B is defined as:

A×B={(a,b):a∈A,b∈B}A \times B = \{ (a, b) : a \in A, b \in B \}

This set contains all ordered pairs where the first element is from AA and the second from BB. A relation RR from AA to BB is any subset of A×BA \times B.

The domain of a relation RR is the set of all first elements of the ordered pairs in RR, and the range is the set of all second elements:

Domain(R)={a:(a,b)∈R}andRange(R)={b:(a,b)∈R}\text{Domain}(R) = \{ a : (a, b) \in R \} \quad \text{and} \quad \text{Range}(R) = \{ b : (a, b) \in R \}

The codomain is the set BB itself.

Types of Relations

  • Void Relation: The empty set ∅\emptyset is a relation with no elements.
  • Universal Relation: The entire Cartesian product A×BA \times B.
  • Identity Relation: IA={(a,a):a∈A}I_A = \{ (a, a) : a \in A \}.
  • Reflexive Relation: Every element relates to itself: (a,a)∈R,∀a∈A(a, a) \in R, \forall a \in A.
  • Symmetric Relation: If (a,b)∈R(a, b) \in R, then (b,a)∈R(b, a) \in R.
  • Anti-Symmetric Relation: If (a,b)∈R(a, b) \in R and (b,a)∈R(b, a) \in R, then a=ba = b.
  • Transitive Relation: If (a,b)∈R(a, b) \in R and (b,c)∈R(b, c) \in R, then (a,c)∈R(a, c) \in R.
  • 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 A={1,2,3}A = \{1, 2, 3\} and B={f,g}B = \{f, g\}. The Cartesian product A×BA \times B is:

A×B={(1,f),(1,g),(2,f),(2,g),(3,f),(3,g)}A \times B = \{ (1, f), (1, g), (2, f), (2, g), (3, f), (3, g) \}

A relation RR could be {(1,f),(2,g),(3,f)}\{ (1, f), (2, g), (3, f) \}. The domain of RR is {1,2,3}\{1, 2, 3\}, and the range is {f,g}\{f, g\}.

Solved Example

Example: Determine if the relation R={(1,1),(2,2),(3,3),(1,2)}R = \{(1,1), (2,2), (3,3), (1,2)\} on A={1,2,3}A = \{1, 2, 3\} is reflexive, symmetric, and transitive.

Solution:

  • Reflexive: Check if (a,a)∈R(a, a) \in R for all a∈Aa \in A. Here, (1,1),(2,2),(3,3)∈R(1,1), (2,2), (3,3) \in R, so RR is reflexive.
  • Symmetric: For each (a,b)∈R(a, b) \in R, check if (b,a)∈R(b, a) \in R. (1,2)∈R(1,2) \in R but (2,1)∉R(2,1) \notin R, so RR is not symmetric.
  • Transitive: Check if whenever (a,b)∈R(a, b) \in R and (b,c)∈R(b, c) \in R, then (a,c)∈R(a, c) \in R. (1,2)∈R(1,2) \in R and (2,2)∈R(2,2) \in R, so (1,2)∈R(1,2) \in R which is true. No other pairs violate transitivity, so RR is transitive.

Practice Set

Level 1 – Easy

  • Find the Cartesian product of A={x,y}A = \{x, y\} and B={1,2}B = \{1, 2\}.
  • Identify the domain and range of R={(a,3),(b,4),(c,3)}R = \{(a, 3), (b, 4), (c, 3)\}.
  • Is the relation R={(1,1),(2,2)}R = \{(1,1), (2,2)\} on {1,2}\{1,2\} reflexive?

Level 2 – Moderate

  • Given R={(1,2),(2,3),(1,3)}R = \{(1,2), (2,3), (1,3)\} on {1,2,3}\{1,2,3\}, check if RR is transitive.
  • Determine if R={(a,a),(b,b),(a,b)}R = \{(a,a), (b,b), (a,b)\} on {a,b}\{a,b\} is symmetric.
  • Find the number of elements in A×BA \times B if n(A)=4n(A) = 4 and n(B)=3n(B) = 3.

Level 3 – Challenging

  • Prove that the identity relation on a set AA is an equivalence relation.
  • Show that the empty relation on AA is symmetric and transitive but not reflexive.
  • Given RR is a partial order on AA, prove that RR is reflexive, anti-symmetric, and transitive.

Answer Key

  • Level 1:
    • A×B={(x,1),(x,2),(y,1),(y,2)}A \times B = \{(x,1), (x,2), (y,1), (y,2)\}
    • Domain = {a,b,c}\{a, b, c\}, Range = {3,4}\{3, 4\}
    • Yes, RR is reflexive on {1,2}\{1,2\}
  • Level 2:
    • RR is transitive because (1,2)(1,2) and (2,3)(2,3) imply (1,3)(1,3) which is in RR
    • RR is not symmetric because (a,b)∈R(a,b) \in R but (b,a)∉R(b,a) \notin R
    • Number of elements in A×B=4×3=12A \times B = 4 \times 3 = 12
  • 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 (a,a)(a,a) not in ∅\emptyset.
    • By definition, partial order is reflexive, anti-symmetric, and transitive.

Quick Reference

TermDefinition
Cartesian ProductSet of all ordered pairs (a,b)(a,b) with a∈Aa \in A, b∈Bb \in B
RelationSubset of A×BA \times B
FunctionRelation with exactly one output for each input
DomainSet of all first elements in relation
RangeSet of all second elements in relation
Reflexive(a,a)∈R(a,a) \in R for all aa
SymmetricIf (a,b)∈R(a,b) \in R, then (b,a)∈R(b,a) \in R
TransitiveIf (a,b)(a,b) and (b,c)(b,c) in RR, then (a,c)(a,c) in RR

Glossary

  • Ordered Pair: A pair (a,b)(a,b) 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 aa relates to bb, then bb relates to aa.
  • Transitive Relation: Relation where if aa relates to bb and bb relates to cc, then aa relates to cc.
  • 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 ff from set AA to set BB, denoted f:A→Bf : A \to B, assigns to each element a∈Aa \in A exactly one element b∈Bb \in B, called the image of aa, written f(a)=bf(a) = b. The set AA is the domain, BB is the codomain, and the set of all images f(a)f(a) is the range.

Concept Explanation

Functions can be classified based on their mapping properties:

  • One-One (Injective): Different elements in AA map to different elements in BB.
  • Onto (Surjective): Every element in BB is an image of some element in AA.
  • One-One Onto (Bijective): Both injective and surjective.
  • Many-One: Multiple elements in AA map to the same element in BB.

Formula Derivation

Number of functions from a set AA with pp elements to a set BB with qq elements is:

qpq^p

since each element of AA can be mapped to any of the qq elements of BB.

Worked Illustrations

Identity Function: f:R→Rf : \mathbb{R} \to \mathbb{R}, defined by f(x)=xf(x) = x. Graph is a straight line through origin with slope 1.

Constant Function: f(x)=cf(x) = c, where cc is constant. Graph is a horizontal line at y=cy = c.

Modulus Function: f(x)=∣x∣f(x) = |x|, 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: f(x)=∣x∣xf(x) = \frac{|x|}{x} for x≠0x \neq 0, and f(0)=0f(0) = 0. It takes values −1,0,1-1, 0, 1 depending on sign of xx.

Greatest Integer Function: f(x)=[x]f(x) = [x], the greatest integer less than or equal to xx. Graph is a step function.

Polynomial Functions: Examples include f(x)=x2f(x) = x^2 (parabola) and f(x)=x3f(x) = x^3 (cubic curve).

Exponential Function: f(x)=axf(x) = a^x, where \(a > 0, a \neq 1\). Domain is R\mathbb{R}, range is (0,∞)(0, \infty).

Natural Exponential Function: f(x)=exf(x) = e^x, where e≈2.718e \approx 2.718.

Logarithmic Function: f(x)=log⁡axf(x) = \log_a x, inverse of exponential function, with domain (0,∞)(0, \infty) and range R\mathbb{R}.

Solved Examples

Example 1: Find the domain and range of f(x)=∣x∣f(x) = |x|.

Solution: Domain is all real numbers R\mathbb{R}. Range is [0,∞)[0, \infty) since absolute value is always non-negative.

Example 2: Determine if f(x)=x3f(x) = x^3 is one-one and onto from R\mathbb{R} to R\mathbb{R}.

Solution: f(x)=x3f(x) = x^3 is strictly increasing, so it is one-one. For any real yy, x=y3x = \sqrt[3]{y} satisfies f(x)=yf(x) = y, so it is onto. Hence, ff is bijective.

Practice Set

Level 1 – Easy

  • Find the range of f(x)=5f(x) = 5 for all real xx.
  • Evaluate f(−3)f(-3) for f(x)=∣x∣f(x) = |x|.
  • Is f(x)=x2f(x) = x^2 one-one on R\mathbb{R}?

Level 2 – Moderate

  • Find the domain and range of f(x)=log⁡2xf(x) = \log_2 x.
  • Show that f(x)=exf(x) = e^x is one-one and onto (0,∞)(0, \infty).
  • 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 f(x)=5f(x) = 5 is {5}\{5\}.
    • f(−3)=∣−3∣=3f(-3) = |-3| = 3.
    • f(x)=x2f(x) = x^2 is not one-one on R\mathbb{R} because f(2)=f(−2)=4f(2) = f(-2) = 4.
  • Level 2:
    • Domain of log⁡2x\log_2 x is (0,∞)(0, \infty), range is R\mathbb{R}.
    • f(x)=exf(x) = e^x is one-one because it is strictly increasing; onto (0,∞)(0, \infty) because \(e^x > 0\) for all xx.
    • Number of functions = 23=82^3 = 8.
  • 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 ff and gg satisfies (f+g)(−x)=f(−x)+g(−x)=f(x)+g(x)=(f+g)(x)(f+g)(-x) = f(-x) + g(-x) = f(x) + g(x) = (f+g)(x).

Quick Reference

Function TypeDefinitionDomainRange
Identityf(x)=xf(x) = xR\mathbb{R}R\mathbb{R}
Constantf(x)=cf(x) = cR\mathbb{R}\{c\}
Modulusf(x)=∣x∣f(x) = |x|R\mathbb{R}[0,∞)[0, \infty)
Signumf(x)=∣x∣xf(x) = \frac{|x|}{x}R∖{0}\mathbb{R}\setminus\{0\}\{-1, 1\}
Greatest Integerf(x)=[x]f(x) = [x]R\mathbb{R}Z\mathbb{Z}
Exponential\(f(x) = a^x, a>0, a \neq 1\)R\mathbb{R}(0,∞)(0, \infty)
Logarithmic\(f(x) = \log_a x, a>0, a \neq 1\)(0,∞)(0, \infty)R\mathbb{R}

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: f(−x)=f(x)f(-x) = f(x).
  • Odd Function: f(−x)=−f(x)f(-x) = -f(x).

Mathematics — ALL CHAPTERS

1

Sets

View

2

Relations And Functions

View

3

Trigonometric Functions

View

4

Complex Numbers And Quadratic Equations

View

5

Linear  Inequalities

View

6

Permutations And Combinations

View

7

Binomial Theorem

View

8

Sequences And Series

View

9

Straight Lines

View

10

Conic Sections

View

11

Introduction To Three Dimensional Geometry

View

12

Limits And Derivatives

View

13

Statistics    

View

14

Probability

View
Relations and Functions Notes – Class 11 Mathematics | Prepzy