Relations & functions

Relations !∶#→% Types of Relations &∶#→% #(%)

Function
A B
Any subset of the AxB is a relation (f: A -> B)
Reflexive: If ", " ∈ % for all " ∈ &
(Domain, Range) such that all elements 1
No. of Relations: 2!" Symmetric: If ", ' ∈ % -> ', " ∈ % of set A related to only a
one element in set B. 2
Transitive: If ", ' & ', * ∈ % -> ", * ∈ %
#(%)
3 b
A B Equivalence: If R is Reflexive, Symmetric & Transitive
Vertical Line Test
Check type of relations on A = {1, 2, 3}
1 • {(1, 1), (2, 2), (3, 3)} If vertical line passes more than 1 times, it is not
a • {(1, 1), (2, 2), (3, 3), (1, 2)} a function
2 • {(1, 1), (3, 3), (1, 3), (3, 1)}
b • {(1, 2), (2, 3), (1, 3), (3, 1)}
3

DOMAIN CO-DOMAIN Equivalence Class

For an equivalence relation R , the equivalence

Types of Relations
Empty : % = ∅ class of a is: ["] = {' ∈ & ∶ (", ') ∈ %}
Universal : % = & x & A = {1, 2, 3, 4} , and R : (a, b) in R if a and b are equal
or both are even. Find the equivalence classes.
Types of Functions
Horizontal Line Test
One-One (Injective): Onto (Surjective):
If horizontal line passes more than 1 times, it is not a 1-1 function
If ' (! = ' (" , then (! = (" If Range = Co-Domain
Into
Many-One A B
A B

Eg: % !, ()*%, +,(%, |%|

1 a 1
a
2 2
b
3 b Composition of Function
3
c
fog= f(g(x)) "
• !(#) = 8#3, ' # = # # find fog(x) and gof(x)
One-One Onto
A B • !(#) = 4# – 1 ,-. '(#) = # !. Find (g o f) (2)
A B gof=g(f(x))
Eg: % ", . = %, . = 1/%

1 a 1 Finding Inverse of f(x)

a • Let A=R-{3} and B=R-{1}. ! # =
2 b 2 "#!
. IIs it invertible? If invertible,
b 1. Show f is one-one "#$
3 find inverse of f(x)
3 c • If f: R -> R defined by f(x) = 3 - 4x.
RANGE 2. Show f is onto Check if function is bijective.

• Check if f : R → R given by f (x)= 5x + 2 is 1-1 3. If f is 1-1 and onto, write g=f -1

Invertible (Bijective): a fn.
• Check if f : R → R given by f (x)= x2 s 1-1
4. Check if gof=IX and fog=IY
That is both 1-1 and onto