Scribd
Upload
1K views9 pages

Relation and Function - PDF

This document discusses relations and functions in mathematics. It defines relations as sets of ordered pairs that show relationships between inputs and outputs, while functions are special relations where each input has a single output. The document outlines different types of relations like empty, universal, identity, inverse, reflexive, symmetric and transitive relations. It also defines the domain, codomain and range of a function. Finally, it describes different types of functions such as one-to-one, onto, into, bijective and many-to-one functions.

Uploaded by

Devansh Pandey
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
1K views9 pages

Relation and Function - PDF

This document discusses relations and functions in mathematics. It defines relations as sets of ordered pairs that show relationships between inputs and outputs, while functions are special relations where each input has a single output. The document outlines different types of relations like empty, universal, identity, inverse, reflexive, symmetric and transitive relations. It also defines the domain, codomain and range of a function. Finally, it describes different types of functions such as one-to-one, onto, into, bijective and many-to-one functions.

Uploaded by

Devansh Pandey
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/ 9

Relation and Functions

Compiled by :

1. Anshika Sharma
2. Aayushi Shukla
3. Vaibhav Srivastava
4. Lavish Tripathi
5. Anandan K. Babu
6. Shubhagyta Pandey
7. Devansh Pandey
8. Navneet Singh(II)

Class : 12th Sec : A


Acknowledgement

I would like to express my special thanks of gratitude to my maths teacher


Mr. Hemant Kumar and our school principal Ms. Sonia Varghese who gave
us the golden opportunity to do this project on the topic Relation and
Function. It helped us in doing a lot of Research and we came to know about
a lot of things related to this topic. Finally, we would also like to thank our
parents and friends who directly or indirectly helped us a lot in finalizing this
project within the limited time frame.

Thanking you for your kind Efforts!!!!


 Relation and Function
One of the most important topics in algebra .Relation and Function are the
two different words having two different meanings mathematically. So before
we go deeper, let’s understand the difference between both with a simple
example.

 Difference between Relation and Functions…

The Relation shows the relationship between INPUT and OUTPUT.


Whereas, a Function is a relation which derives one OUTPUT for each
given INPUT. In other words, Relation can have many outputs for a single
input but a Function has a single output for a single output.

NOTE: All functions are relations, but not all relations are functions.
 Relation
It is a subset of the Cartesian product. Or simply, a bunch of points
(ordered pairs). In other words, the relation between the two sets is
defined as the collection of the ordered pair, in which the ordered pair
is formed by the object from each set.
Example: {(-2, 1), (4, 3), (7, -3)}, usually written in set notation form with
curly brackets.

 Relation Representation

There are other ways too to write the relation, apart from set notation such as
through tables, plotting it on XY- axis or through mapping diagram.

Types of Relations

Different types of relations are as follows:

 Empty Relations
 Universal Relations
 Identity Relations
 Inverse Relations
 Reflexive Relations
 Symmetric Relations
 Transitive 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.

 Universal Relation

R is a relation in a set, let’s say A is a universal relation because, in this full


relation, every element of A is related to every element of A . i.e R = A × A.
It’s a full relation as every 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.

I={(A, A), ∈ a}.

 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 iIf 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.

 Function

A function is a relation which describes that there should be only one output
for each input (or) we can say that a special kind of relation (a set of ordered
pairs), which follows a rule i.e., every X-value should be associated with only
one y-value is called a function.

 Domain, Codomain and Range of Function

Domain - It is a collection of the first values in the ordered pair.

Codomain – The set into which all the output of the function is constrained
to fall.
Range - It is a collection of the second values in the ordered pair.

 Types of Functions

 One-One function or Injective function :


A function f : X → Y is defined to be One-One or injective, if the images of
distinct elements of X under f are distinct, i.e., for every x1 , x2 ∈ X , f(x1 ) =
f(x2 ) implies x1 = x2 .

Condition: Every element of the domain has a single image with codomain after
mapping.
 Onto or Surjective Fumction :

A function f: X → Y is said to be onto or surjective , if every element of Y is


the image of some element of X under f, i.e., for every y ∈ Y, there exists an
element x in X such that f(x) = y.

 Into Function :

A Function f: X ―> Y is said to be an Into Function if there exists at


least one element or more than one element in Y, which do not have any
pre-image in X, which simply means that every element of the codomain
are not mapped with the elements of the domain.
 One-One and Onto Function or Bijective Function :

A function f: X → Y is said to be one-one and onto or bijective, if


function f is both one-one and onto.

 Many - One Function :

If the function is not one to one function then it should be many to one
function means every element of the domain has more than one image
at codomain after mapping.

You might also like