Cartesian Product of two sets

Let A and b be any two non empty

Domain & Range of Relation
sets. The set of all ordered pairs (a, b)
R= {(3,2), (5, 2), (5, 4), (7, 2), (7, 4),
such that a ∈ A and b ∈ B is called
(7, 6)}
as cartesian product of sets A and B
Domain= {3, 5, 7}
and is denoted by A x B. Range = {2, 4, 6}

Domain Range
A B
Relation
3 2
Every subset of A x B defines
a relation from set A to set B. RELATION
5 4

7 6

Total number of relations from A to B

 ypes of Relation
T
Let A contain “m” elements and B
Identity Relation - A Relation defined
contain “n” elements.
Hence total number of relation from on a set A is said to be an identity
A to B = 2 mn relation if every element of A is
related to itself and only to itself.

Algebra of Functions
If f & g are real valued functions of x
with domain set A, B respectively,
Representation of Function
Ordered pair f+g, f-g, (f.g) & (f/g) as follows:
Formula based (f±g) (x) = f(x) ± g(x) domain in
(uniformly/nonuniformly) each case is A ∩ B
Graphical Representation: If a (f.g) (x) = f(x) . g(x) domain is
vertical line cuts a given graph at A∩B
more than one point then it can (f/g) (x) = f(x)/g(x) domain
not be the graph of a function. A ∩ B - {x: g(x) = 0}

FUNCTION

Types of Functions

y y
f(x) = 1/x
Constant Function f(x) = const.
Rational Function

x x
O O

y y
Identity Function Modulus Function
f(x) = x f(x) = |x|

x x
O O

y
Polynomial Function Signum Function y
2 f(x) = |x| / x
f(x) = x
1 y=1

x x
O O

y = -1 -1

Greatest Integer y

Function f(x) = [x]

x
O