Scribd
Upload
4 views

Maths PPT by Ritika Nagar on Relation & Functions (2)

Uploaded by

royalwhitey12
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
4 views

Maths PPT by Ritika Nagar on Relation & Functions (2)

Uploaded by

royalwhitey12
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/ 16

MODERN PUBLIC SCHOOL,

SHAHBERI
Presentation on “Relation & functions”
Presented by : FAHIM KHAN
12th
Topics covered in
presentation:
■ Relation : definition
■ Relation representation
■ Types of relation
■ Domain & range of a relation
■ Function
■ Various types of functions
■ Special functions in algebra
■ Domain & range of a function
■ How to convert a relation into function
Relation
■ It is a subset of the Caítesian píoduct. Oí simply, a bunchof
points (oídeíed paiís). In otheí woíds, the íelation between the
two sets is defined as the collection of the oídeíed paií, in
which the oídeíed paií is foímed by the object fíom each set.
■ Example: {(-2, 1), (4, 3), (7, -3)}, usually wíitten in set
notation foím with cuíly bíackets.
Relation representation
■ ľheíe aíe otheí ways too to wíite the íelation, apaít fíom set notation such as
thíough tables, plotting it on XY- axis oí thíough mapping diagíam.
Types of relation
Diffeíent types of íelations aíe as follows:
■ Empty Relations
■ Univeísal Relations
■ Identity Relations
■ Inveíse Relations
■ Reflexive Relations
■ Symmetíic Relations
■ ľíansitive Relations
■ Empty Relation : When there’s no element of set X is related
or mapped to any element of X, then the relation R in A is an
empty relation, and also called the void relation, i.e R= ∅.
■ For example, if there are 100 mangoes in the fruit basket.
There’s no possibility of finding a relation R of getting any
apple in the basket. So, R is Void as it has 100 mangoes
and no apples.
■ Univeísal íelation : R is a íelation in a set, let’s say A is a
univeísal íelation because, in this full íelation, eveíy element
of A is íelated to eveíy element of A. i.e R = A ×A.
■ It’s a full íelation as eveíy element of Set A is in Set B.
■ Identity Relation : If every element of set A is related to itself
only, it is called Identity relation.
■ For Example : When we throw a dice, the total number of
possible outcomes is 36. I.e (1, 1) (1, 2), (1, 3)…..(6, 6).
From these, if we consider the relation (1, 1), (2, 2), (3, 3)
(4, 4) (5, 5) (6, 6), it is an identity relation.

■ Inverse Relation : If R is a relation from set A to set B i.e R ∈


A X B. The relation R−1 = {(b,a)a,b) ∈ R}.
■ For Example : If you throw two dice if R = {(1, 2) (2, 3)},
R−1= {(2, 1) (3, 2)}.
Here the domain is the range R−1 and vice -versa.
■ Reflexive Relation : A relation is a reflexive relation if
every element of set A maps to itself, i.e for every a ∈ A,
(a, a) ∈ R.
■ Symmetric Relation : A symmetric relation is a relation R
on a set A if (a, b) ∈ R then (b, a) ∈ R, for all a & b ∈ A.
■ Transitive Relation : If (a, b) ∈ R, (b, c) ∈ R, then (a, c) ∈
R, for all a,b,c ∈ A and this relation in set A is transitive.
■ Equivalence Relation : If a relation is reflexive, symmetric
and transitive, then the relation is called an equivalence
relation.
Domain and range of a relation
■ If R is a relation from A to B, then the set of all first co-
ordinates of elements of R is called the domain of R, while
the set of all second co-ordinates of elements of R is called
the range of R.
■ Thus, if we consider the relation
■ R = { (1, 2), (1, 4), (3, 2), (3, 4)} then Dom (R) = {1, 3} and
Range (R)= {2, 4}
Function
■ A function is a íelation which descíibes that theíe should be only one
output foí each input (oí) we can say that a special kind of íelation (a
set of oídeíed paiís), which follows a íule i.eeveíy X-value should be
associated with only one y-value is called a function.
Various types of functions
■ In terms of relations, we can define the types of functions as:
■ One to one function or Injective function: A function f: P → Q is
said to be one to one if for each element of P there is a distinct
element of Q.
■ Many to one function: A function which maps two or more
elements of P to the same element of set Q.
■ Onto Function or Surjective function: A function for which every
element of set Q there is pre-image in set P
■ One-one correspondence or Bijective function: The function f
matches with each element of P with a discrete element of Q and
every element of Q has a pre-image in P.
Special Ïuncīions in Algebía
Some of the impoítant functions aíe as follow :
■ Constant Function
■ Identity Function
■ Lineaí Function
■ Absolute Value Function
■ Inveíse Functions
Domain and range of a function
■ Domain : It is a collection of the fiíst values in the oídeíed paií (Set of all input
(x) values).
■ Range : It is a collection of the second values in the oídeíed paií (Set of all output
(y) values).
Example: In the relation, {(-2, 3), {4, 5), (6, -5), (-2, 3)},
The domain is {-2, 4, 6} and range is {-5, 3, 5}.
Note: Don’t consider duplicates while writing the domain and range and also write it in
increasing order.
How to Convert a Relation into a
Function?
■ A special kind of íelation (a set of oídeíed paiís)
which follows a íule i.e eveíy X-value should be
associated with only one y-value, then the íelationis
called a function.
■ Example 1: Is A = {(1, 5), (1, 5), (3, -8), (3, -8), (3,
-8)} a function?
■ Solution: If theíe aíe any duplicates oí íepetitionsin
the X-value, the íelation is not a function.
■ Noīe: All funcīions aíe
íelaīions, buī noī all íelaīions
aíe funcīions.
Thank You

You might also like