Scribd
Upload
573 views

Relation and Functions

The document summarizes a student project on relations and functions. It includes a certificate stating that three students - Gurkeerat, Sneha, and Anubhav - completed the project under the guidance of their teacher, Mrs. Parul Gupta. The project defines relations and functions, describes different types of relations like reflexive and symmetric relations, and types of functions like one-to-one and onto functions. It also discusses topics like binary operations, composition of functions, and invertible functions. The students thank their teacher and parents for their support and guidance in completing the project.

Uploaded by

Arpit Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
573 views

Relation and Functions

The document summarizes a student project on relations and functions. It includes a certificate stating that three students - Gurkeerat, Sneha, and Anubhav - completed the project under the guidance of their teacher, Mrs. Parul Gupta. The project defines relations and functions, describes different types of relations like reflexive and symmetric relations, and types of functions like one-to-one and onto functions. It also discusses topics like binary operations, composition of functions, and invertible functions. The students thank their teacher and parents for their support and guidance in completing the project.

Uploaded by

Arpit Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

RELATIONS

Holiday homework project


Session 2022- 23

FUNCTIONS
We would like to express our gratitude to our teacher Mrs. Parul
gupta our maths teacher for providing support and guidance. We got
to learn a lot more about this project which will be very helpful for
us.
In the end, we would like to thank our parents. Without them, we
would not have been able to complete this project.
THANKS AGAIN TO ALL THOSE WHO HELPED US…….
Certificate

This is to certify that we ( Gurkeerat, Sneha, Anubhav) of class 12th


Science has successfully completed this project on topic Relation and
Functiona as prescribed by Parul Ma’am during the academic year
2022- 23.
Sign of Teacher

Teacher’s name
(Mrs. Parul Gupta) )
What is Relation?

A relation R from set X to a set Y is defined as a subset of the cartesian product X × Y. We


can also write it as R ⊆ {(x, y) ∈ X × Y : xRy}.

Note: If n(A) = p and n(B) = q from set A to set B, then n(A × B) = pq and number of relations =
2^pq.

A relation assigns the x’s with y’s

1 2
2 4
3 6
4 8
5 10

Domain (set of all x’s) Range (set of y’s)

This relation can be written { (1,6),(2,2),(3,4),(4,8),(5,10)}


Examples of relations:

❑ {(a, b) ∈ A × B: a is the brother of b},


❑ {(a, b) ∈ A × B: a is the sister of b},
❑ {(a, b) ∈ A × B: age of a is greater than the age of b},
❑ {(a, b) ∈ A × B: total marks obtained by a in the final examination is less than
the total marks obtained by b in the final examination},
❑ {(a, b) ∈ A × B: a lives in the same locality as b}. However, abstracting from
this, we define mathematically a relation R from A to B as an arbitrary
subset of Ax
Types of relations:
Types of Relation

1.Reflexive Relation: A relation R defined on a set A is said to be reflexive, if


(x, x) ∈ R, ∀ x ∈ A or
xRx, ∀ x ∈ R

2. Symmetric Relation: A relation R defined on a set A is said to be symmetric, if


(x, y) ∈ R ⇒ (y, x) ∈ R, ∀ x, y ∈ A or
xRy ⇒ yRx, ∀ x, y ∈ R.

3. Transitive Relation: A relation R defined on a set A is said to be transitive, if


(x, y) ∈ R and (y, z) ∈ R ⇒ (x, z) ∈ R, ∀ x, y, z ∈ A
or xRy, yRz ⇒ xRz, ∀ x, y,z ∈ R.
4. Empty Relation: A relation R in a set X, is called an empty relation, if no
element of X is related to any element of X,
i.e. R = Φ ⊂ X × X
5. Universal Relation: A relation R in a set X, is called universal relation, if
each element of X is related to every element of X,
i.e. R = X × X
6. Equivalence Relation: A relation R defined on a set A is said to be an
equivalence relation if R is reflexive, symmetric and transitive.
Function
Let X and Y be two non-empty sets. A function or mapping f from X into Y written as f : X → Y is a
rule by which each element x ∈ X is associated to a unique element y ∈ Y. Then, f is said to be a
function from X to Y.
The elements of X are called the domain of f and the elements of Y are called the codomain of f.
The image of the element of X is called the range of X which is a subset of Y.

Note: Every function is a relation but every relation is not a function .

1 2

2 4

3 6

4 8

5 10
Types of Functions
One-one Function or Injective Function: A function f : X → Y is said to be
a one-one function, if the images of distinct elements of x under f are distinct, i.e. f(x1) = f(x2
) ⇔ x1 = x2, ∀ x1, x2 ∈ X
A function which is not one-one, is known as many-one function.

Onto Function or Surjective Function: A function f : X → Y is said to be onto


function or a surjective function, if every element of Y is image of some element of set X
under f, i.e. for every y ∈ y, there exists an element X in x such that f(x) = y.
In other words, a function is called an onto function, if its range is equal to the codomain.

Bijective or One-one and Onto Function: A function f : X → Y is said to be a


bijective function if it is both one-one and onto.
Composition of functions
The composition of functions f : A → B and g : B → C is the function gof : A → C given by

gof(x) = g(f(x)) ∀ x ∈ A.
(i) In general, fog(x) ≠ gof(x).
(ii) In general, gof is one-one implies that f is one-one and gof is onto implies that g is onto.
(iii) If f : X → Y, g : Y → Z and h : Z → S are functions, then ho(gof) = (hog)of.

A f g
B C

x g(f(x))
f(x)

gof
Invertible Function:
A function f : X → Y is said to be invertible, if there exists a function g : Y → X
such that gof = Ix and fog = Iy. The function g is called inverse of function f and
is denoted by f-1.
Note
(i) To prove a function invertible, one should prove that, it is both one-one or
onto, i.e. bijective.
(ii) If f : X → V and g : Y → Z are two invertible functions, then gof is also
invertible with (gof)^-1 = f^-1og-1

A f B

x y

𝑔 = 𝑓 −1
Binary Operation
A binary operation can be defined as the set of operations such as addition, subtraction, division and
multiplication that are usually carried out to an arbitrary set called ‘X’. The operations that ensue, in
order to obtain a result for the following pair of elements such a, b from X to another element of X is
called as a binary operation.
A binary operation ∗ on a set A is a function ∗ from A × A to A.

Properties
An element e ∈ X is the identity element for binary operation ∗ : X × X → X, if a ∗ e = a = e ∗ a ∀ a ∈ X
An element a ∈ X is invertible for binary operation ∗ : X × X → X, if there exists b ∈ X such that a ∗ b = e =
b ∗ a where, e is the identity for the binary operation ∗. The element b is called inverse of a and is
denoted by a–1 .
An operation ∗ on X is commutative if a ∗ b = b ∗ a ∀ a, b in X.
An operation ∗ on X is associative if (a ∗ b) ∗ c = a ∗ (b ∗ c)∀ a, b, c in X.
Made by:
➢SNEHA BHOLA
➢ANUBHAV BINJOLA
➢GURKEERAT KAUR

THANK
YOU

You might also like