Scribd
Upload
18 views13 pages

11th Math

Uploaded by

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

11th Math

Uploaded by

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

Topic: What is Relation and Function

Relation and Functions are the ways of mapping the establishing link between two entities
in mathematics. They are used to establish mathematical relations between two terms.
Relation and Function are studied under algebra and also used in calculus to find
integration and differentiation.

 Relation Definition
Relation is defined as a relationship between a non-empty set A to no-empty set B such that
Relation from A to B is a subset of Cartesian Product of A and B i.e. R ⊆ A × B.

 Cartesian Product
Let’s assume A and B to be two non-empty sets, the sets of all ordered pairs (x, y) where x
∈ A and y ∈ B is called a Cartesian product of the sets. A × B = {(x, y) | x ∈ A and y ∈ B}

For Example if A = {a, b, c} and B = {p, q, r},


Then A × B = {(a, p), (a, q), (a, r), (b, p), (b, q), (b, r), (c, p), (c, q), (c, r)}.
If there is another set are that is defined as R = {(a, p), (b, q), (c, r)} then we see that R is a
subset of A × B.
Hence, R is a relation from set A to set B.
Function Definition
Function is a special type of relation in which the two entities are exclusively related to
each other only. A relation from set A to set B is defined as function if all the elements of
set A are related to at least one element of B and no two elements of B are related to a
single element of A.
A function is represented as
f:A→B indicates that f is a function from set A (domain) to set B (codomain).
In other words a function in a mapping from a non- empty set A to another non- empty s ay
B
Here, the element of set A are called pre-image and the element of set B are called
image. Hence a function from A to B is defined only when each pre-image in set A has an
image in B and no two different images in B has a single pre-image in A.

It should be noted that every function is a relation but not every relation is a
function.
Topic: Difference Between Relation and Function
Relation and Function are basically the same but they differ from each other in some
manner. Let’s understand the difference between them from the table given below:

Relation Function
Relation is defined a non-empty set Function is a special type of relation from set A to
A to non-empty set B such that set B where all the elements of set A are related to
Relation from A to B is a subset of some or all elements of set B and no two elements of
A × B i.e. R ⊆ A × B set B is related to a common element in set A.

In case of relation of the pre-image


In case of function all pre-image must have an image
may or may not have an image

In case of relation a pre-image can In case of function no two image can have a common
have two or more image pre-image

A relation can or can not be a


A function is always a relation.
function

Topic : Representation of Relation and Function


Relation and Function are in general the same with some basic difference. They both take
input, process it and relates to output. They can be represented in the following forms:

A. Roster Form
In roster form the elements of two sets among which relation is defined are written in the
form of ordered pair.
B. Set Builder Form
In set builder form the relation is not written in expanded pair form rather it is written in
compressed form using an algebraic expression to define the relation between two sets.
Example: Set Builder Form

C. Arrow Diagram
In arrow diagram the relation is shown using connecting the elements of the sets which are
contained in the box using arrows.
For Example, if A = {-1, 0, 1, 2} and B = {0, 1, 2, 3, 4} and set A is related to set B as a2 =
b where a is an element of set A and b is an element of set B then Relation in Arrow
Diagram is given as follows:
Topic: Terms Related to Relation and Function
Some of the commonly used terms associated with Relation and Function are discussed
below:

 Domain
Domain of Relation or a function is the set of inputs for which the outputs are obtained.
For

 Codomain
Codomain is the set of outputs or the image of the relation and function. Codomain may
contain exact or more number of elements than the output. For Example, in A = {-1, 0, 1,
2} and B = {0, 1, 2, 3, 4} and set A is related to set B as a2 = b, set B is the codomain. In
set B there is element 3 which is not a perfect square hence it will not have a pre-image.

 Range
Range is the set of all outputs which has a pre image. In range all elements are related.
Hence, it has has exact number of elements for which relation is defined. Thus, Range is
subset of codomain. For Example, in A = {-1, 0, 1, 2} and B = {0, 1, 2, 3, 4} and set A is
related to set B as a 2 = b, Range is {0, 1, 4}.
Topic: Types of Relation and Function
Relation and Function are classified on the basis of the input it take and output it gives for
a given relation. The different types of Relation and Function are discussed separately
below:

Types of Relation

There are eight different types of relations which are listed below:
 Empty Relation- There is no relation between any elements of a set.
 Universal Relation- Every element of the set is related to each other.
 Identity Relation- In an identity relation, every element of a set is related to itself only.
 Inverse Relation- Inverse relation is seen when a set has elements that are inverse pairs
of another set.
 Reflexive Relation- In a reflexive relation, every element maps to itself.
 Symmetric Relation- In asymmetric relation, if a=b is true then b=a is also true.
 Transitive Relation- For transitive relation, if (x, y) ∈ R, (y, z) ∈ R, then (x, z) ∈ R.
 Equivalence Relation- A relation that is symmetric, transitive, and reflexive at the same
time.
Topic: The inverse of a Relation

Topic: Functions
A relation ‘f’ from set A to set B is said to be a function if every element of set A has one
and only one image in set B.
The rule for Finding Range

Topic: Relations Which Cannot be Categorized as a Function


Topic: Types of Function
We know that in a function no two images can have one common pre-image and all the
pre-images must have an image. A function ‘f’ defined from A × B is classified as follows
 One-One Function(Injection): A function ‘f’ from A to B is said to be One-One or
Injection if each element of A is mapped with a different element in B. One-One
Function is also called an Injective Function.
 Many-One Function: A function ‘f’ from A to B is said to be Many-One or
Injection if two or more elements of A is mapped with a common element in B.
 Onto Function(Surjective): A function ‘f’ from A to B is said to be Onto
Function if all the elements of set B has a pre-image in set A i.e. no element in set B
remains unmapped.
 Into Function: A function ‘f’ from A to B is said to be Into Function if at least one
image in set B does not have a pre-image in set A i.e. one element of set B remains
unmapped.
 One-One Onto/ Bijective Function: A function ‘f’ from A to B is said to be
One-One Onto function if all the elements of set A has a unique image in set B and all
the elements of set B has a pre-image in set A. This type of function exhibits
characteristics of One One Function and Onto Function.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy