Functions TN F-1 PDF
Functions TN F-1 PDF
RELATIONS
This chapter deals with establishing binary relation between elements of one set and
elements of another set according to some particular rule of relationship.
1. CARTESIAN PRODUCT:
The Cartesian product of two sets A, B is a non-void set of all ordered pairs (a, b),
where a A and b B. This is denoted by A × B
A × B = {(a, b) | a A and b B}
e.g. A = {1, 2}, B = {a, b}
A × B = {(1, a), (1, b), (2, a), (2, b)}
Number of elements in set A n(A) = p
n(B) = q
n(A × B) = pq
2. RELATION:
Every non-zero subset of A × B defined a relation from set A to set B.
If R is a relation from A B
R : {(a, b) | (a, b) A × B and a R b}
Note that while defining there is no constraints. One element may be related with two or
more.
EXAMPLES:
(1) A = {1, 2, 3, 4, 5} and B = {2, 4, 5}
[Sol. aRb a and b are relatively prime or co-prime (i.e. HCF is 1)
R = {(1, 2), (1, 4), (1, 5), (2, 5), (3, 2), (3, 4), (3, 5), (4, 5), (5, 2), (5, 4)} ]
(2) A = {Jaipur, Patna, Kanpur, Lucknow} and B = {Rajasthan, Uttar Pradesh, Bihar}
[Sol. aRb a is capital of b, a A and b B
R = {(Jaipur, Rajasthan), (Patna, Bihar), (Lucknow, Uttar Pradesh) }
Basically relation is the number of subsets of A × B
number of relations = no. of ways of selecting a non zero subset of A × B
= mnC1 + mnC2 + ........ + mnCmn
= 2mn – 1 ]
Empty relation: No elements of A is related to any elements of A.
Children
e.g. boys School
aRb a is the subset of b.
Universal relation: Each elements of A is related to every element of A
e.g. a R b Þ difference between the subsets of 'a' and 'b' is 3
3. DOMAIN AND RANGE OF RELATION:
If R: A B (R is a relation defined from set A to set B) then the domain of this relation is
Domain: Set of all the first entries in R
{a | (a, b) R}
Range: Set of all the second entries in R
{b | (a, b) R}
e.g. If A = {1, 3, 5, 7}, B = {2, 4, 6, 8}
Relation is aRb a > b, a A, b B
R = {(3, 2), (5, 2), (5, 4), (7, 2), (7, 4), (7, 6) }
Domain = {3, 5, 7}
Range = {2, 4, 6}
Bansal Classes Page # 1
4. INVERSE RELATION:
If relation R is defined from A to B then the inverse relation would be defined from B to
A, i.e
R: A B aRb where a A, b B
R :BA
–1 bRa where a A, b B
Doman of R = Range of R–1
and Range of R = Domain of R–1
R–1 = {(b, a) | (a, b) R}
A relation R is defined on the set of 1st ten natural numbers.
e.g. N is a set of first 10 natural nos. N = {1, 2, 3, ..., 10} & a, b N
aRb a + 2b = 10
R = {(2, 4), (4, 3), (6, 2), (8, 1)}
R–1 = {(4, 2), (3, 4), (2, 6), (1, 8)}
5. IDENTITY RELATION:
A relation defined on a set A is said to be an Identity relation if each & every element of
A is related to itself & only to itself.
e.g. A relation defined on the set of natural nos. is
aRb a = b where a & b N
R = {(1, 1), (2, 2), (3, 3), .........}
R is an Identity relation
6. CLASSIFICATION OF RELATIONS:
(i) Reflexive: A relation defined on a set A is said to be an Identity relation if each & every
element ofA is related to itself.
i.e. if (a, b) R then (a, a) R. However if there is a single ordered pair of
(a, b) R such (a, a) R then R is not reflexive.
e.g. A relation defined on (set of natural numbers)
aRb 'a' divides 'b' a, b N
R would always contain (a, a) because every natural number divides itself and hence it
is a reflexive relation.
Note: Every Identity relation is a reflexive relation but every reflexive relation need not
be an Identity.
(ii) Symmetric: A relation defined on a set is said to be symmetric if aRb bRa.
If (a, b) R then (b, a) must be necessarily there in the same relation.
EXAMPLES:
A relation defined on the set of lines.
(1) aRb a || b
It is a symmetric relation because if line is | | to 'b' then the line 'b' is | | to 'a'.
where (a, b) L {L is a set of | | lines}
(2) L1RL2 L1 L2 It is a symmetric relation
L1, L2 L {L is a set of lines}
(3) aRb 'a' is borther of 'b' is not a symmetric relation as 'a' may be sister of 'b'.
(4) aRb 'a' is a cousin of 'b'. This is a symmetric relation.
EXAMPLES:
(1) A relation R defined on a set of natural numbers N with rule aRb a<b
R: {(1, 2), (1, 1)}.
In this relation a, b, c are not distinct but it is transitive. It is reflexive but not symmetric
as (2, 1) is missing. Minium number of ordered pair that must be added to make it
reflexive, symmetric and transitive is 2 i.e. (2, 1) and (2, 2).
(2) Only Transitive R = {(x, y) | x < y, x N, y N}
Only Symmetric R = {(x, y) | x + y = 10, x N, y N}
Only Reflexive R = {(x, y) | x = y or x – y = 1, x N, y N}
6. EQUIVALENCE RELATION:
If a relation is Reflexive, Symmetric and Transitive then it is said to be an equivalence
relation.
EXAMPLES:
(1) A relation defined on N
xRy x=y
R is an equivalence relation.
(2) A relation defined on a set of | | lines in a plane
aRb a||b
It is an equivalence relation.
(3) Relation defined on the set of integer (I)
Prove that: xRy (x – y) is even is an equivalence relation.
[Proof:
Asking: A = {1, 2, 3, 4}; R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)} then
(A) R S T (B*) R T S (C) S T R (D) R S T
(4) R = {(1, 2), (2, 3)} add minimum number of ordered pairs to make it an equivalence
relation.
{(1, 1), (2, 2), (3, 3), (2, 1), (3, 2), (1, 3), (3, 1)} = 7
cos x (1 2) 5
(x) f(x) = ; S 2K + < x < 2K + , K +1, +2, +3 ...........
6 35x 6 x 2 3 3
x ln( 2 1)if x 0
dt x 2| x|
(xi) f(x) = = ln = not defined at x 0
x2 t2 | x|
0 ln ( 2 1)if x 0
x
[Ans. Domain is R– {0} ; Range is consists of two ln ( 2 1), ln ( 2 1) ; ln t x 2 t 2 ]
0
0
dt 1
Note : f (0) = | t | , as is not defined at x = 0 hence f (0) is not defined.
0 |t|
2
(xii) f(x) = log x 2 2 9 x {Ans. (2, 3] }
x 3
1 1 1
(xiii) f(x) = [x] + log1 – {x}(x2 – 3x + 10) + + sec(sin x)
2| x|
[Ans: (–2, –1) (–1, 0) (1, 2)]
1
D : x R, Range 3 , 3 fig(xiii)
ax b
[Note: Graph of f (x) = is always monotonic. ]
cx d
x
(xiv) f(x) = [Range : (–, 0) U [e, ) ] fig (xiv)
nx
F 7 I
[Ans. range : GH , JK ; Domain is (–1,1) – {0} ]
4 8
2x
(xvi) f(x) = tan–1 ; range = 4 , 4
1 x2
Bansal Classes Page # 8
Examples on Domain & Range
1
(i) f(x) = ; Domain : (0, 1) (1, ) ; Range : R – {0}
ln x
1
(ii) f(x) = D : x R; R : [1, 2]
sin x cos 4 x
4
sin x cos x 3 2
(iii) f(x) = log2 2
D: x R ; R : [1, 2]
5
(iv) f(x)=logcosec x – 1(2 –[sin x]–[sin x]2) D: x , , ; 0<x < ; Range: (–) T/S
6 6 2
( x 2)( x 1) 2 (2 x 1)
(v) f(x) = x ( x 1) ; f’(x) = [ x( x 1)]2
x 2 5x 4 ( x 4) ( x 1)
(vi) f(x) = 2 = ( x 3) ( x 1)
x 2x 3
3 7
[Ans: (vii) D = R – {1, –3}; Range = R – ,1 ; f (x) = (x 3) 2 ]
4
1
f(x) = logex ; g(x) = log e (N.I.)
x
OR
Note:
(i) A continuous function which is always increasing or decreasing in whole domain, then
f(x) is oneone.
(ii) A function is one to one if and only if a horizontal line intersects its graph at most once.
Manyone function: (not injective)
A function f : A B is said to be a many one function if two or more elements
of A have the same f image in B. Thus f : A B is many one if for;
x1, x2 A , f(x1) = f(x2) but x1 x2.
Examples : R R f (x) = [ x ] ; f (x) = | x | ; f (x) = ax2 + bx + c ; f (x) = sin x
Diagramatically a many one mapping can be shown as
OR
Note:
(i) Any continuous function which has atleast one local maximum or local minimum, then
f(x) is manyone. In other words, if a line parallel to xaxis cuts the graph of the
function atleast at two points, then f is manyone.
(ii) If a function is oneone, it cannot be manyone and vice versa.
One One + Many One = Total number of mappings.
Onto function (Surjective mapping) :
If the function f : A B is such that each element in B (codomain) is the f image of
atleast one element in A, then we say that f is a function of A 'onto' B. Thus
f : A B is surjective iff b B, some a A such that f (a) = b.
f : R R f (x) = 2x +1; f : R R+ f (x) = ex; f : R+ R f (x) = ln x
Diagramatically surjective mapping can be shown as
OR
OR
Note that: If a function is onto, it cannot be into and vice versa . A polynomial of
degree even define from R R will always be into & a polynomial of degree odd
defined from R R will always be onto.
Thus a function can be one of these four types :
(3) I f the f uncti on f (x) = x2 + bx + 3 is not injective for values of x in the interval 0 x 1
then b lies in
(A) (– , ) (B) (–2, ) (C*) (–2, 0) (D) (– , 2)
(4) Let f: {x, y, z} {a, b, c} be a one–one function.
It is known that only one of these statements is true
and the remaining two are false.
(i) f(x) b (ii) f(y) = b; (iii) f(z) a find f (x) / f –1(x)
2x 2 x 5
(5) f : R R f(x) = is many one into
7x 2 2x 10
(Note denominator & numerator both +ve f(x) is always +ve )
x 2 2mx 1 for x 0
(6)
f : R R is defined as f (x) = .
mx 1 for x 0
If f (x) is one-one then m must lies in the interval
(A*) (– , 0) (B) (– , 0] (C) (0, ) (D) [0, )
Only for 13th
xm for x 1
(7) Let a function f defined from R R as: f (x) =
2mx 1 for x 1
If the function is surjective on R then m must lie in the interval
(A*) (0, 2] (B) (– , 0] (C) (– , 0) (D) (0, )
(3)90 Let f (x) and g (x) be functions which take integers as arguments.
Let f (x + y) = f (x) + g (y) + 8 for all integer x and y. Let f (x) = x for all negative
integers x, and let g (8) = 17. The value of f (0) is
(A*) 17 (B) 9 (C) 25 (D) – 17
(4)47 Let f (x) = ax7 + bx3 + cx – 5, where a, b and c are constants. If f (–7) = 7, then f (7)
equals
(A*) –17 (B) –7 (C) 14 (D) 21
(5) The function f : R R satisfies the condition m f (x – 1) + n f (– x) = 2 | x | + 1.
If f (–2) = 5 and f (1) = 1, then (m + n) equals
(A*) 4/3 (B) 3 (C) 4 (D) 6
7. COMPOSITE OF UNIFORMLY & NON-UNIFORMLY DEFINED FUNCTIONS:
Let f : A B & g : B C be two functions. Then the function gof : A C defined
by (gof) (x) = g (f(x)) x A is called the composite of the two functions f & g.
f (x )
Diagramatically x g (f(x)).
Thus the image of every x A under the function gof is the gimage of the
fimage of x.
Note that gof is defined only if x A, f(x) is an element of the domain of g so that
we can take its gimage. Hence for the product gof of two functions f & g, the range
of f must be a subset of the domain of g. Note that gof in general not equal to fog.
EXAMPLES ON COMPOSITE FUNCTION:
(1) If f(x) = x2 and g(x) = x – 7 find gof and fog (x2 – 7; (x – 7)2)
h:Q R h(x) = e x
(hog)of = ho(gof) = e2x
(iii) The composite of two bijections is a bijection i.e. if f and g are two bijections such
that gof is defined, then gof is also a bijection.
Proof: Let f : A B and g : B C be two bijections. Then gof exists such that
gof : A C
We have to prove that gof is one-one and onto.
One-one : Let a1, a2 A such that (gof)(a1) = (gof)(a2), then
(gof) (a1) = (gof) (a2) g [f (a1)] = g [ f (a2)]
f (a1) = f (a2) [ g is one-one]
a1 = a2 [ f is one-one]
gof is also one-one function.
Onto : Let c C, then
c C b B s.t. g (b) = c [ g is onto]
and b B a A s.t. f (a) = b [ f is onto]
Therefore, we see that
c C a A s.t. (gof) (a) = g[f(a)] = g(b) = c
i.e. every element of C is the gof image of some element of A. As such gof is
onto function. Hence gof befing one-one and onto, is a bijection.
Bansal Classes Page # 15
Examples on Composite of nonuniformly defined function
1 x if 0 x 2
(1)(a) f(x) =
3 x if 2 x 3
find fof
x if 0 x 1
1 x if 0 x 1 2 x
x 2 if 1 x 2 if 1 x 2
[H.W.] (b) f(x) = find (fof) (x) [Ans: (fof) (x) = 6 x if 2 x 3 ]
4 x if 2 x 4 x 3 if 3 x 4
2 if x 2
1 x if x 0 x if x 1
(c) f (x) = 2 and g (x) = find (fog)(x) and (gof)(x)
x if x 0 1 x if x 1
[T/S, Q.11, Ex-1, and not to be taken in illustration]
x if x 0 2
x 2 if 0 x 1 x if x 0
[Ans. (gof)(x) = ; (fog)(x) = 1 x if 0 x 1 ]
1 x 2 if x 1 x if x 1
x if x 0
(d) f(x) = x 0 x 1 find (fof) (x) [T/S]
2 x x 1
f (x) 1 x 2 , 0 x 4
[H.W.] (e) find gof and fog
g(x) 2 x , 1 x 3
1 x 0 x 1
1 x0
3 x 1 x 2 L
[Ans: gof(x) = ; ( fog) ( x) M (1 x) 1 x 0 ]
x 1 2 x 3 MN x 1
0 x2
5x 3 x 4
1 x3 x 0 (x 1)1/ 3 x 0
(f) f(x) = and g(x) = find g (f(x))
x2 1 x 0 (x 1)1/ 2 x 0
ASKING:
1 7
(g)(i) If 2 f (x) – 3 f x = x2 (x 0) find f (2). [Ans. – ]
4
(ii) Let f be a real valued function of real and positive argument such that
1
f (x) + 3x f x = 2(x + 1) for all real x > 0. The value of f (10099) is
(A) 550 (B) 505 (C*) 5050 (D) 10010
x
(h) Let f : R R be a function such that f ( x 3 1) 5 , x (0, ) then the value of
27
27 y 3 y
f
y3
for y (0, ) is equal to
(A) 5 (B) 52 (C*) 53 (D) 56
8. GENERAL DEFINTION:
(i) HOMOGENEOUS FUNCTIONS :
A function is said to be homogeneous with respect to any set of variables when each
of its terms is of the same degree with respect to those variables.
For example 5x2 + 3y2 – xy is homogeneous in x & y. Symbolically if,
f (tx, ty) = tn . f (x , y) then f (x , y) is homogeneous function of degree n.
Bansal Classes Page # 16
Example on Homogeneous function
x y cos x
f (x, y) = is not a homogeneous function and
y sin x x
x y y x y
f (x, y) = y ln x x ln y ; x 2 y 2 + x ; x + y cos are homogeneous functions of
x
degree one.
(ii)BOUNDED FUNCTION :
A function is said to be bounded if f(x) M , where M is a finite quantity.
EXAMPLES:
(1) Which of the following function(s) is(are) bounded on the intervals as indicated
1
x 1 1
(A*) f(x) = 2 on (0, 1) (B) g(x) = x cos on (–)
x
EXAMPLES :
(1) If f (x) = (a – 2)x + 3a – 4 is even/odd. Find 'a'. [Ans. Even (a=2), Odd (a=4/3)]
2 x (sin x tan x )
(2) Prove that f (x) = 2[2 ( x )] 3 is always odd.
9. INVERSE OF A FUNCTION :
Let f : A B be a oneone & onto function, then their exists a unique function
g : B A such that f(x) = y g(y) = x, x A & y B. Then g is said to be
inverse of f. Thus g = f1 : B A = {(f(x), x) (x, f(x)) f}.
Note: To find the inverse
Step-1: write y = f (x)
Step-2: solve this equation for x in terms of y (if possible)
Step-3: To express f –1 as a function of x, interchange x and y.
Example: Compute the inverse of the following bijective.
(a) f : R R+, f(x) = 10x + 1 ; (b) f : (– 2, ) R, f(x) = 1 + ln (x + 2)
2x x 1
(c) f : R (0, 1), f(x) = ; (d) f : R – {1} [–1, 3], f(x) = 1 + 2 sin
1 2x x 1
x
[ Ans : (a) y = log10 x 1; (b) y = 2 + ex 1; (c) y = log2 1 x ;]
Note: For finding inverse express x in term of y. Also use y = f (x) x = f –1(y)
PROPERTIES OF INVERSE FUNCTION:
(i) The inverse of a bijection is unique.
Proof:
(ii) If f : A B is a bijection & g : B A is the inverse of f, then fog = IB and
gof = IA, where IA & IB are identity functions on the sets A & B respectively.
Note that the graphs of f & g are the mirror images of each other in the line y = x. As
shown in the figure given below a point (x ', y' ) corresponding to
y = x2(x>0) changes to (y', x') corresponding to y x , the changed form of x = y .