Scribd
Upload
30 views

Relations & Functions Theory - 9th May

The document provides an overview of topics to be covered in a sessions orientation, including: 1. Completing chapter theory, board level problem practice, and JEE level problem practice. 2. The topics to be covered are basics from Class 11, relations and types of relations, introduction to functions, domain and range of functions, types of functions, composition of functions, and inverse of a function. 3. Examples and definitions are provided for key concepts like Cartesian product, types of relations like empty, universal, identity, reflexive, symmetric, transitive, and equivalence relations. Types of functions like one-one, many-one, onto, into, and bijective functions are also defined.

Uploaded by

vedantu495
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
30 views

Relations & Functions Theory - 9th May

The document provides an overview of topics to be covered in a sessions orientation, including: 1. Completing chapter theory, board level problem practice, and JEE level problem practice. 2. The topics to be covered are basics from Class 11, relations and types of relations, introduction to functions, domain and range of functions, types of functions, composition of functions, and inverse of a function. 3. Examples and definitions are provided for key concepts like Cartesian product, types of relations like empty, universal, identity, reflexive, symmetric, transitive, and equivalence relations. Types of functions like one-one, many-one, onto, into, and bijective functions are also defined.

Uploaded by

vedantu495
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 44

Sessions Orientation

● Complete Chapter Theory

● Board Level Problem Practice

● JEE Level Problem Practice


t.me/vedantumath1
Topics to be covered
● Basics from Class 11
● Relations and Types of Relations
● Introduction to Functions
● Domain and Range of Functions
● Types of Functions
● Composition of functions
● Inverse of function
● Binary operation
Recall CARTESIAN PRODUCT
Class 11

Given two non-empty sets A and B, the set of all


ordered pairs (x, y), where x ∈ A and y ∈ B is
called Cartesian product of A and B; symbolically,
we write A × B = {(x, y) | x ∈ A and y ∈ B}
Recall CARTESIAN PRODUCT
Class 11

Given two non-empty sets A and B, the set of all


ordered pairs (x, y), where x ∈ A and y ∈ B is
called Cartesian product of A and B; symbolically,
we write A × B = {(x, y) | x ∈ A and y ∈ B}
Recall NOTE:
Class 11

(i) Two ordered pairs are equal, if and only if


the corresponding first elements are equal
and the second elements are also equal,
i.e. (x, y) = (u, v) if and only if x = u, y = v.

(ii) If n(A) = p and n (B) = q, then


n (A × B) = p × q.

(iii) A × A × A = {(a, b, c) : a, b, c ∈ A}.


Here (a, b, c) is called an ordered triplet
Recall CARTESIAN PRODUCT
Class 11
Consider, A = {1, 2, 3} and B = {4, 5}, then

A × B = {(1, 4), (2, 4), (3, 4), (1, 5), (2, 5), (3, 5)}
and
B × A = {(4, 1), (4, 2), (4, 3), (5, 1), (5, 2), (5, 3)}

A×B≠ B×A

n(A × B) = 6
Recall A Relation is a subset of
Class 11 RELATION a cartesian product.
R⊆A×B

If n (A) = p, n (B) = q; the total number of possible


relations from the set A to set B = 2pq.
Ex: Consider a relation R, between
Recall the two sets X = {5, 6, 7} & Y = {25, 36,
Class 11 49} where the elements of X are the
Representation positive square root of the elements
of a Relation of Y.

R {(a, b): a is the positive square root


Set Builder Form
of b, a ∈ X, b ∈ Y}

Roaster Form R = {(5, 25), (6, 36), (7, 49)}.


Recall
Class 11
RELATION

Set of first elements in the


DOMAIN
ordered pairs

Set of second elements in the


CODOMAIN
ordered pairs

RANGE Range is a subset of Codomain


Recall
Class 11
RELATION

Image source: Cuemath


TYPES OF RELATION

A Relation R from X to Y if no
EMPTY
element of X is related to any
Relation element of Y.

Example: A be the set of all students of a boys school.

→ R = {(a, b) : a is sister of b} is the empty relation


Since the school is boys school, no student of the school
can be sister of any student of the school. Hence, R = ϕ,
TYPES OF RELATION

Universal R from X to Y if each element


of X is related to every element
Relation of Y it is given by R = X × Y.

→ R’ = {(a, b} : the difference between heights of a and b is


less than 6 meters} is the universal relation.
It is also obvious that the difference between heights of any
two students of the school has to be less than 6 meters.
This shows that R’ = A × A
TYPES OF RELATION

If every element of A is
Identity related to itself only.
Relation IA = {(a, a) : a ∈ A} is called
an Identity relation on A.

EX:
A = {1, 4, 9}

R1 = {(1, 1), (4, 4), (9, 9)}


TYPES OF RELATION
If every element of A is related
Reflexive to itself, then R is reflexive.
(a, a) ∈ R, ∀ a ∈ A.

Example:

A = {1, 2, 3}

R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)}
TYPES OF RELATION

R is symmetric relation iff


Symmetric (a, b) ∈ R ⇒ (b, a) ∈ R,
∀ a, b ∈ A I.e. aRb ⇒ bRa

Example:

A = {2, 4, 6}

R1 = {(2, 4), (2, 6), (4, 4), (4, 2), (6, 2)}
TYPES OF RELATION

Relation R on set A is
transitive if
Transitive
xRy and yRz ⇒ xRz
∀ x, y, z ∈ A

Example:

A = {1, 2, 3, 4, 5}

R1 = {(1, 2), (2, 3), (1, 3)}


TYPES OF RELATION
If every element of A is related
Reflexive to itself, then R is reflexive.
(a, a) ∈ R, ∀ a ∈ A.

R is symmetric relation iff


Symmetric (a, b) ∈ R ⇒ (b, a) ∈ R,
∀ a, b ∈ A I.e. aRb ⇒ bRa

Relation R on set A is
transitive if
Transitive
xRy and yRz ⇒ xRz
∀ x, y, z ∈ A

Equivalence Relation
Relation R defined on any set A is equivalence
relation if: R is reflexive, symmetric & transitive.
Ex. Z is set of all integers &
R = {(x, y) : x - y is an integer}

Now, (x, x), say (1, 1) = x - y = 1 - 1 = 0 ∈ Z ⇒


R is reflexive.
(x, y) ∈ R and (y, x) ∈ R,
i.e., x - y and y - x are integers ⇒ R is symmetric.
(x, y) ∈ R and (y, z) ∈ R, then (x, z) ∈ R
i.e., x - y and y - z and x - z are integers.
(x, z) ∈ R ⇒ R is transitive

Therefore, R is reflexive, symmetric and transitive.


Hence R is an equivalence relation.
Inverse of Relation
If R is a relation on set A, then the relation
R−1 on A ,defined by
R−1 = {(y, x) : (x, y) ∈ R} is called an inverse
relation to A.
Clearly,
Domain (R−1) = Range of (R)
Range of (R−1) = domain of (R).
FUNCTION

Let A and B be two non-empty sets.


Then a function f : A ➝ B is a rule which
associates each element of A to unique
element of B.

f:A➝B
RESULT

Let set A has p elements and set B has q


elements; then, the number of functions
possible from A to B is qp.
TYPES OF FUNCTION
(1) One — one or (Injective):
A function f : X → Y is one - one, if
different elements of X have different
images in Y under f.
f(x1) = f(x2) ⇒ x1 = x2
TYPES OF FUNCTION

(2) Many — one:


A function f : X → Y is Many - one, if 2 or
more elements of X have the same
image in Y under f.
TYPES OF FUNCTION

(3) Onto or (Surjective):


A function f : X → Y is Onto, if for every
element of Y ∃ one element of X under f.
Range = Codomain
TYPES OF FUNCTION

(4) Into:
A function f : X → Y is into if ∃ at least
one element in Y having no preimage in
X under f.
Ex: f: N ➝ N, given by f(x) = 2x.
Show that f is one-one but not onto.
Ex: f: N ➝ N, given by f(x) = 2x.
Show that f is one-one but not onto.
Ex: f: N ➝ N, given by f(x) = 2x.
Show that f is one-one but not onto.
Ex: f: N ➝ N, given by f(x) = 2x.
Show that f is one-one but not onto.

Solution:
The function f is one-one, for f(x1) = f(x2)
⇒ 2x1 = 2x2
⇒ x1 = x2.
Further, f is not onto, as for 1 ∈ N, there
does not exist any x in N such that
f(x) = 2x = 1.
TYPES OF FUNCTION
(5) Bijective:

A function f : X → Y is Bijective, if it is
both one - one and onto function.
That is f should be both Injective &
Surjective.
Q. Given A = R - {3}, B = R - {1}.

f: A ➝ B

Show that f is bijective.


Q. Given A = R - {3}, B = R - {1}.

f: A ➝ B

Show that f is bijective.


COMPOSITION OF FUNCTIONS

Let f : A → B and g : B → C be two


functions. Then the composition of f
and g, denoted by gof, is defined as the
function gof : A → C given by
gof (x) = g(f (x)), ∀ x ∈ A.
COMPOSITION OF FUNCTIONS

If f(x) = sin x and g(x) = x2


Then,

(a) fog(x) = f(g(x))


=sin (g(x))
= sin (x2)

(b) gof(x) = g(f(x))


=g(f(x))
= (f(x))2 = (sin
x)2
Invertible Function

A function f : X → Y is invertible iff it is


Bijective.

A function f : X → Y is defined to be
invertible, if there exists a function
g : Y → X such that gof = IX and fog = IY.
The function g is called the inverse of f
and is denoted by f–1.
Inverse of a Function
Ex: Consider a function f : {1, 2, 3} ➝ {3, 6, 9}
defined as f(x) = 3x

1 3

2 6

3 9
A B

f(1) = 3, f(2) = 6 & f(3) = 9


Inverse of a Function
Consider g : {3, 6, 9} ➝ {1, 2, 3} defined as

1 3

2 6

A3 9B

g(3) = 1, g(6) = 2 & g(9) = 3


This is the concept of inverse of the function.
Here x = g(y) is inverse function of y = f(x).
RESULTS

● fog(x) = x ∀ x (i.e., fog is identity


function from B to B i.e. IB) and

● gof(x) = x ∀ x (i.e., gof is identity


function from A to A i.e. IA)

● The inverse of Bijection is unique


and is also a bijection.

● fog ≠ gof
t.me/vedantumath1
8th Jan 2020-(Shift 1)

You might also like