Scribd
Upload
7 views4 pages

Relation and Function 12

The document discusses relations and functions, defining key concepts such as reflexive, symmetric, and transitive relations, along with equivalence relations and their classes. It explains different types of functions, including one-one, many-one, onto, and bijective functions, and provides formulas for calculating the number of functions between sets. Additionally, it covers properties of composite functions and invertible functions, along with tests for determining function characteristics.

Uploaded by

aman489022
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
7 views4 pages

Relation and Function 12

The document discusses relations and functions, defining key concepts such as reflexive, symmetric, and transitive relations, along with equivalence relations and their classes. It explains different types of functions, including one-one, many-one, onto, and bijective functions, and provides formulas for calculating the number of functions between sets. Additionally, it covers properties of composite functions and invertible functions, along with tests for determining function characteristics.

Uploaded by

aman489022
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/ 4

RELATION AND FUNCTION XII

Relation : the number of subset of A×B is known as the relation from A to B

Remark :If Set A has ‘m’ elements and set B has ‘n’ elements, then the number of relation from A to B
will be 2 mn

Types of Relation

Let R be a relation on a (non-empty) set A, then R is called:-

Reflexive: if any element of a set is related to itself for all a A

Symmetric: if a R b  b R a , for all a,bA

Transitive: if a R b and b R c  a R c for all a, b and c A

Remark: If a R b exist but there is no b R c then by contra-positive also it is considered as transitive

Equivalence relation: A relation R on a (non-empty) set A is called equivalence relation iff it is reflexive,
symmetric and transitive

Equivalence classes

For example the relation R on the set Z (of integers) given by R = { (a,b): a,b Z, a-b is divisible by 2} is
equivalence relation .

In this we notice that all even integers are related to zero ,and all odd integers are related to 1, and they are
not related to any other, therefore E (even integers) and O (odd integers) are the subsets of Z satisfy the
following condition

(i) All elements of E are related to each other and all elements of O are related to each other.
(ii) No element of E is related to O or vice-versa.
(iii)E and O are disjoint, EO =  and E O = Z

The subset E is called equivalence class containing 0 and is denoted by [0]. The subset O is equivalence class
containing 1 and is denoted by [1].

Functions:

One-One functions (injective) f:X Y ,iff different element of X have different image in Y

Many-One functionf:X Y ,iff different element of X have same image in Y

Remember

(i) Linear function is always one-one


(ii) One-one + many –one = total number of mappings.

1|Page
(iii) If a continuous function, which is always increasing or decreasing in whole domain, then that
function is one-one.

Onto function (surjective) f:X Y iff each element of Y is the image of atleast one element of X (i.e.
codomain of f = range of f ) other-wise it is into function.

Remember

(i) A polynomial of degree even defined from R R will always be into.


(ii) A polynomial of degree odd defined from RR will always be onto

One-one correspondence a function f: X  Y is called one-one correspondence (or bijective) if f is both


one –one and onto

If A and B are (non-empty) finite sets containing ‘m’ and ‘n’ elements respectively, then

(i) The number of functions from A to B will be nm


(ii) The number of one-one function from A to B will be ; n Pm if m ≤ n, other-wise zero

 (1)
n
(iii) The number of onto functions from A to B will be nr n
C r r m if n ≤ mother-wise zero.
r 1

For example if n =2 and m ≥ 2 then number of onto functions from A to B = 2 m -2

For example if n =3 and m≥ 3 then number of onto functions from A to B = 3 m-3(2m-1)

(iv) The number of one-one onto functions (bijective) from A to B will be m! if m =nother-wise zero.

Vertical line test :this is to check whether the given relation(from its graph) is function or not.

If the vertical line cuts the graph at more than one point then it is not a function other wise it’s a function.

Eg.
Function Not a function

Horizontal line Test: it is to check whether the given function is is one –one or not. If the horizontal line
cuts the graph at more than one point then it’s not one-one, otherwise its one –one function.

Eg.
One-One function
Not One-One function

2|Page
Composition of functions

If A, B and C are three non-empty functions f : A B and g : B C then we can combine these functions to
get a new function such as fog(x) = f(g(x)) and gof(x) = g(f(x))

Note that for the composite function gof to exist, it is essential that range of f must be a subset of domain
of g.(Rf  Dg). if RfDg =  then gof will not be defined.

Properties of composite function

(i) Composition of function is Associative


(ii) If f and g both are one-one, then gof is also one-one, but converse is not true
(iii) If f and g both are onto, then gof is also onto, but converse is not true
(iv) Consider a function defined from A B as f: AB and two identity functions IA: AA and IB:
BB then foIA = IBof = f
(v) Consider two function f and g such that f: AB, g : B A and the composite function gof is an
identity function on the set A i.e. gof = IA f is one-one and g is onto.

Inverse of function

If f: XY is bijective then f-1: YX is called its inverse , only one –one and onto function has inverse
possible.

Note that if f: XY is one-one onto, then we can define a function g: Y X ; we notice that gof: X X
and fog: YY both exists. As gof = Ix and fog = Iy. even the converse is true

Therefore a function f:XY is called invertible if there exists g: YX such that gof = Ix and fog = Iy then
the function g is called the inverse of f and is denoted by f -1

Properties of invertible function

(i) Inverse of bijective function is unique.


(ii) Inverse of bijective function is also bijective (f-1)-1 = f.
(iii) If f: AB is bijective , then f-1of = IA and fof-1 = IB
(iv) If f: AB and g : BC are both bijectives then , gof: AC is also bijective and (gof)-1 = f-1og-1
(v) Let A be a non-empty set and f:AA , g : AA be two functions such that gof = IA= fog, then f and g
are both bijective and g = f-1.

Remember:

(i) Even function is symmetric about y –axis.


(ii) Odd function is symmetric about origin.
(iii) Every function can be expressed as the sum of an even and odd function. Eg. F(x) =
f ( x)  f ( x) f ( x)  f ( x)

  2     2  
Even Odd

3|Page
(iv) The only function which is defined on the entire number line and is even as well as odd at
the same time is f(x) = 0

f(x) g(x) f(x)+g(x) f(x) -g(x) f(x).g(x) f ( x) gof(x) fog(x)


g ( x)
odd odd odd odd even even odd odd
even even even even even even even even
odd even Neither even Neither odd odd even even
nor odd even nor
odd
even odd Neither even Neither odd odd even even
nor odd even nor
odd

4|Page

You might also like