0% found this document useful (0 votes)
5 views

Relations_and_Functions_Formula_Booklet_Class_Notes_VEDxTXT_Bot

The document discusses relations and functions, defining key concepts such as ordered pairs, Cartesian products, and types of relations including equivalence relations. It also covers various types of functions, including constant, identity, polynomial, rational, exponential, logarithmic, and trigonometric functions, along with their properties. Additionally, it explains specific functions like absolute value, greatest integer, and fractional part functions, as well as odd and even functions.

Uploaded by

Cartilage Gaming
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views

Relations_and_Functions_Formula_Booklet_Class_Notes_VEDxTXT_Bot

The document discusses relations and functions, defining key concepts such as ordered pairs, Cartesian products, and types of relations including equivalence relations. It also covers various types of functions, including constant, identity, polynomial, rational, exponential, logarithmic, and trigonometric functions, along with their properties. Additionally, it explains specific functions like absolute value, greatest integer, and fractional part functions, as well as odd and even functions.

Uploaded by

Cartilage Gaming
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Relations and Functions

Relation

01 04
Ordered Pair Properties of Cartesian Product
An ordered pair consists of two objects or elements grouped in a For three sets A, B and C,
particular order. (i ) n( A × B )= n( A) × n( B)
(ii ) A × B = f ,if either A or B is an empty set.
(iii ) A × ( B ∪ C ) = ( A × B ) ∪ ( A × C )
(iv) A × ( B ∩ C ) = ( A × B ) ∩ ( A × C )
(v ) A × ( B − C ) = ( A × B ) − ( A × C )
02
(vi ) ( A × B ) ∩ (C × D) = ( A ∩ C ) × ( B ∩ D)
Equality of Ordered Pairs (vii ) A × ( B′ ∪ C ′ )=′ ( A × B ) ∩ ( A × C )
Two ordered pairs (a1, b1) and (a2, b2) are equal iff a1 = a2 and b1 = b2. (viii ) A × ( B′ ∩ C ′ )=′ ( A × B ) ∪ ( A × C )
(ix) If A ⊆ B and C ⊆ D, then( A × C ) ⊆ ( B × D)
( x) If A ⊆ B, then A × A ⊆ ( A × B ) ∩ ( B × A)
( xi ) If A ⊆ B, then A × C ⊆ B × C for any set C.
( xii ) A× B = B × A ⇔ A = B
03 ( xiii ) If A ≠ B, then A × B ≠ B × A
(xiv) If either A or B is an infinite set, then A × B is an infinite set.
Cartesian (or Cross) Product of Sets
(xv) If A and B be any two non-empty sets having n elements in
common, then A × B and B × A have n2 elements in common.
For two non-empty sets A and B, the set of all ordered pairs (a, b)
such that a ∈ A and b ∈ B is called Cartesian product A × B, i.e.,
A × B = {(a, b) : a ∈ A and b ∈ B}
05
06
Relation
Types of Relations
If A and B are two non-empty sets, then a relation R from A to B is a
subset of A × B. (i) Empty or Void Relation As f ⊆ A × A, for any set A, so f is a
If R ⊆ A × B and (a, b) ∈ R, then we say that a is related to b by the relation on A, called the empty or void relation.
relation R, written as aRb. (ii) Universal Relation Since, A × A ⊆ A × A, so A × A is a relation
If R ⊆ A × A, then we simply say R is a relation on A. on A, called the universal relation.
(iii) Identity Relation The relation IA = {(a, a): a ∈ A} is called the
identity relation on A.
(iv) Reflexive Relation A relation R on a set A is said to be reflexive
07 relation, if every element of A is related to itself.
Thus, (a, a) ∈ R, ∀ a ∈ A ⇒ R is reflexive.
Equivalence Relation (v) Symmetric Relation A relation R on a set A is said to be symmetric
relation iff (a, b) ∈ R ⇒ (b, a) ∈ R, ∀ a, b ∈ A
A relation R on a set A is said to be an equivalence relation, if it is i.e. a R b ⇒ b R a, ∀ a, b ∈ A
simultaneously reflexive, symmetric and transitive on A. (vi) Transitive Relation A relation R on a set A is said to be transitive
relation, iff (a, b) ∈ R and (b, c) ∈ R
⇒ (a, c) ∈ R, ∀ a, b, c ∈ A
08
Inverse Relation
10
If A and B are two non-empty sets and R be a relation from A to B,
then the inverse of R, denoted by R–1, is a relation from B to A and is Important Results on Relation
defined by R–1 = {(b, a):(a, b) ∈ R}.
(i) If R and S are two equivalence relations on a set A, then R ∩ S is
also an equivalence relation on A.
(ii) The union of two equivalence relations on a set is not necessarily
09 an equivalence relation on the set.
(iii) If R is an equivalence relation on a set A, then R–1 is also an
Composition of Relation
equivalence relation on A
(vi) Let A and B be two non-empty finite sets consisting of m and n
Let R and S be two relations from sets A to B and B to C respectively,
elements, respectively. Then, A × B consists of mn ordered pairs.
then we can define relation SoR from A to C such that (a, c) ∈ SoR ⇔
So, the total number of relations from A to B is 2nm.
∃ b ∈ B such that (a, b) ∈ R and (b, c) ∈ S.
(v) If a set A has n elements, then number of reflexive relations from
This relation SoR is called the composition of R and S. 2

(i) RoS ≠ SoR A to A is 2n − n .


(ii) (SoR)–1 = R–1oS–1 known as reversal rule.
Function

11 13
Function Exponential function

Let A and B be two non-empty sets, then a function f from set A to set f(x) = ax, a > 0, a ≠ 1.
B is a rule which associates each element of A to a unique element 0<a<1 a>1
f
of B. It is represented as f : A → B or A  → B and function is also
called the mapping.

12
Classification of Function
Domain = R, Range = (0, ∞)
1. Constant function
f (x) = k, k is a constant
2. Identity function
The function y = f (x) = x, ∀x∈R 14
Here domain & Range both R
Logarithmic function
3. Polynomial function
y = f(x) = a0 xn + a1 xn–1 +...+ an, n is non negative integer, ai f (x) = loga x [a > 0, a ≠ 1]
are real constants. Given a0 ≠ 0, n is the degree of polynomial 0<a<1 a>1
function
There are two polynomial functions, f (x) = 1 + xn & f (x) = 1 − xn
1 1
satisfying the relation: f ( x) ⋅ f   =f ( x) + f  
 x  x
where ‘n’ is a positive integer

4. Rational functions
It is defined as the ratio of two polynomials.
P( x)
f ( x) = provided Q(x) ≠ 0
Q( x) Domain = (0, ∞), Range = R
Dom {f (x)} is all real numbers except
when denominator is zero [ i,e, Q(x) ≠ 0]
15 16
Proprieties of Log. Functions Trigonometric Functions

1. loga (xy) = loga | x | + loga | y | , where a > 0, a ≠ 1 and xy > 0 Sine function Cosecant Function
1
2. loga = for a > 0, a ≠ 1 and x > 0, x ≠ 1
log x a
x x
3. log a  =  log a | x | − log a | y | , where a > 0, a ≠ 1 and > 0
 y y
4. loga (x ) = n loga | x |, where a > 0, a ≠ 1 and x > 0
n n
f (x) = sin x.
m f (x) = cosec x
5. log an x
= m
log|a| | x | , where a > 0, a ≠ 1 and x > 0 Dom (f ) = R Dom (f ) = R –{np, n ∈ z }
n Ran (f ) = [–1, 1] Ran (f ) = R – (–1, 1)
6.= x loga y y loga x where x > 0, y > 0, a > 0, a ≠ 1
7. If a >1 , then the values of f(x)= loga x increase with the increase Cosine function Secant Function
in x.
i.e. x < y ⇔ loga x < loga y
< 0 for 0 < x < 1

Also,= log a x  0= for x 1
> 0 for x > 1 f (x) = cos x
 f (x) = sec x

{ }
8. If , 0 < a <1, then the values of f (x) = loga x decrease with the Dom (f ) = R p
increase in x . Ran (f ) = [–1, 1]. Dom (s)= R − ( 2n + 1) | n ∈ Z
2
i.e. x < y ⇔ loga x > loga y
Tangent function Ran (f ) = R – (–1, 1).
> 0 for 0 < x < 1
 Cotangent function
log a x  0=
Also,= for x 1
< 0 for x > 1

f (x) = tan x
 (2n + 1)p 
Dom (f ) =
R− ,n ∈ z
 2  f (x) = cot (x)
Ran (f) = R Dom (f ) = R –{nπ | n ∈ Z}
Ran (f ) = R.
17 18

Absolute Value Function Signum Function

 x, x > 0
y= f ( x=
) | x=| 
 − x, x < 0 | x |
 if x ≠ 0
=y sgn(
= x)  x
0 if x = 0

1. | x |2 = x 2
2. x 2 =| x |
19
3. =
| x | max{− x, x}
Greatest Integer Function
4. − | x =| min{− x, x}
a +b a −b f(x) = [x] the integral part of x,
5. max(=
a, b) +
2 2 which is nearest & smaller integer
a +b a −b 1. [ x]x < [ x] + 1
6. min(=
a, b) − 2. x − 1 < [ x] < x
2 2
7. | x+ y|≤| x|+| y| 3. I ≤ x < I + 1 ⇒ [ x] =I
8. | x + y | = | x | + | y | if xy > 0  2 x, x∈I
4. [ x] − [− x] =
9. |x− y|= | x | + | y | if xy  0 2 x + 1, x ∉ I
10. | x |  a (is − ve) x ∈ R  0, x ∈ I , x ∈ I
5. [ x] + [− x] =
11. a ≤ | x |  b ⇒ −b ≤ x ≤ −a or a ≤ x ≤ b.x ∈ [−b, − a ] ∪ [a, b]. −1, x ∉ I , x ∉ I
6. [ x] ≤ n ⇔ x < n + 1, n ∈ I
7. [ x] < n ⇔ x < n
 x   x + 1
8. =[ x]   +  
2  2 
 n + 1  n + 2   n + 4 
9.  + +  +…= n
 2   4   8 
10. [ x] + [ y ]  [ x + y ]  [ x] + [ y ] + 1
 1  2  n − 1
11. [ x] +  x +  +  x +  +  +  x + [nx]
=
 n  n  n 
20 21
Fractional Part Function Odd and Even Function

y ={x} fractional part of x. 1. if f(–x) = –f(x) ∀x ∈R then f is an odd function, odd functions are
y = {x} = x – [x] symmetrical in opposite quadrants or about origin.
1. {x} = x, 0 ≤ x < 1. 2. If f(–x) = f(x). then even. It is symmetric about y axis.
2. {x} = 0, x ∈ I
3. {-x} = 1-{x}, x ∉ I Properties
4. {x ± integer} = {x} 1. Product of two odd or two even function is an even function.
2. Product of odd & even function is an odd function.
3. Every function can be expressed as the sum of an even and odd
f ( x) + f (− x) f ( x) − f (− x)
function,
= i.e, f ( x) +
2 2
22 4. Derivative of an odd function is an even function and of an even
Periodic function is odd.

f (x) is periodic if f (x + T) = f (x) ∀ x ∈ R , T = period

Functions Period 23
sin x, cosn x, secn x, cosecn x
n
π(n is even), 2π(n odd/ fraction Composition of Function
tann x, cotn x π
|trig function| π
x −[x] 1.
f (x) = constant Periodic with no fundamental
period.
• h(x) = g f (x) = (gof) (x).
Properties of Periodic functions • gof ≠ fog.
If f (x) is periodic with period T, then • Composition of two bijection is a bijection.
1. c. f (x) is periodic with period T Properties of Composite Function
2. f (x + c) is periodic with period T.
3. f (x) ± c is periodic with period T. f g fog
T even even even
4. kf (cx + d) has period period is only affected by coefficient of
x. | c | odd odd odd
even odd even
odd even even
24 25
Kinds of Mapping Number of functions

1. One-one/Injective/Homomorphic: f (x) = f (y) ⇒ x = y, then


one-one Graphically, if no line parallel to x-axis meets the graph
of function at more than one point.
2. Onto/Surjective: If range = co-domain. Method to show
subjectivity: Finding the range of y = f (x) & Showing range of
f = co-domain of f
3. Many-one mapping:If two or more element in domain have
same image in co-domain. Total no of functions = mn
4. Into Function : There's an element in B not having a pre image
 m Pn , m ≥ n
in A under f. [f : A → B]. Number of One to one functions = 
0, m<n
m n − m Pn , m  n
No. of many one functions = n
 m , m<n
26 No. of constant function = m.

Inverse of a function  n
∑ (−1) Cr (m − r ) , n ≥ m
r m n

No. of onto function =  r = 0


g : B → A , f (x) = y ⇔ g(y) = x ∀ x ∈ A and y ∈ B. mn , n<m

Then g is inverse of f
1. Inverse of a bijection is unique. No. of one-to-one onto functions = n!, if m = n
2. If f : A → B is a bijection g : B → A is the inverse of f, then fog =
IB , gof = IA , where IA & IB are identity function
3. The inverse of a bijection is also a bijection (gof)–1 = f –1 og–1.
27
Hyperbolic functions

e x − e− x e x − e− x
sinh x = tanh x = x
2 e + e− x

e x + e− x e x + e− x
cosh x = coth x = x
2 e − e− x
28 29
Elementary Transformation of Graphs Things to remember

1. Drawing the graph of y = |f (x)| from the


1. Range of a cos x + b sin x is  − a + b , a + b 
2 2 2 2
 

2. Range of f ( x) = a − x + x − b if a > b > 0 is a − b + 2(a − b)

 1 1
3. Range of  x +  + is (−∞, −2.5] ∪ [2.5, ∞)
 x  1
x+ 
 f ( x) if f ( x)0  x
| f ( x) |= 
− f ( x) if f ( x) < 0

2. Drawing graph of y = f (|x|) from the known graph of y = f (x).

30
Functional Equation

1. f ( x + y ) f ( x)=
= f ( y ), then f ( x) a x
Neglect the curve for x <0 & take the images of curve for x  0 2. f ( xy ) = f ( x) + f ( y ), then f ( x) =log a x
about y axis.  x + y  f ( x) + f ( y )
3. f = , then f ( =
x) mx + c
 2  2
3. Drawing graph of |y| = f (x) from the know m graph of y = f (x).
1
4. f ( x) f   = 1, then f ( x) = ± x n
 x

Remove portion that lies below x axis. Plot the remaining portion
of the graph & also its mirror image in x-axis.
Questions
1. If [x]2 – 5[x] + 6 = 0, where [ . ] denote the greatest integer function, x
then 6. Let f : R → R be defined by f (x) = 3x2 – 5 and g: R → R by g ( x) = 2 .
x +1
(a) x ∈ [3, 4] (b) x ∈ (2, 3] Then gof is
(c) x ∈ [2, 3] (d) x ∈ [2, 4) 3x 2 − 5 3x 2 − 5
(a) (b)
9 x 4 − 30 x 2 + 26 9 x 4 − 6 x 2 + 26
1
2. Range of f ( x) = is 3x 2 3x 2
1 − 2 cos x (c) 4 (d)
x + 2x2 − 4 9 x 4 + 30 x 2 − 2
1
  1
(a)  ,1 (b)  −1,  7. Which of the following functions from Z into Z are bijections?
3   3
(a) f (x) = x (b) f (x) = x + 2
 1
(c) (−∞, −1] ∪ , ∞   
(d) − ,11  (c) f (x) = 2x + 1 (d) f (x) = x2 + 1
 3   3 
1
x2 + 2x + 1 8. A function f is defined by f ( x)= x + . Consider the following.
3. The domain of the function f given by f ( x) = 2 x
x − x−6 (1) (f (x))2 = f (x2) + 2
(a) R – {3, –2} (b) R – {–3, 2} (2) (f (x))3 = f (x3) + 3f (x)
(c) R – [3, –2] (d) R – (3, –2) Which of the above is/are correct?
(a) 1 only (b) 2 only
4. The domain and range of the function f given by f (x) = 2 – |x – 5| is (c) Both 1 and 2 (d) Neither 1 nor 2
(a) Domain = R , Range = (–∞, 1]
+

(b) Domain = R, Range = (–∞, 2] 9. If a set A contains 4 elements, then what is the number of elements in
(c) Domain = R, Range = (–∞, 2) A × P(A) ?
(d) Domain = R+, Range = –∞, 2] (a) 16 (b) 32
(c) 64 (d) 128
1
5. Let f : R → R be defined by f ( x) = ∀x ∈ R . Then f is
x 10. Let R = {x | x ∈ N, x is a multiple of 3 and x ≤ 100} S = {x | x ∈ N, x
(a) one-one (b) onto is a multiple of 5 and x ≤ 100}. What is the number of elements in (R
(c) Bijective (d) f is not defined × S) ∩ (S × R) ?
(a) 36 (b) 33
(c) 20 (d) 6
Answer Key

1. (c)

2. (b)

3. (a)

4. (b)

5. (d)

6. (a)

7. (b)

8. (c)

9. (c)

10. (a)

You might also like