Sunteți pe pagina 1din 10

RELATIONS

AND
FUNCTIONS

I N TA N L A R A S AT I
PEND. MATEMATIKA N I N DY P U J I N A B I L A H
1C YO S Y C A N D R A N I N G S I H
Domain
C Co-domain

O Range

N
T Relations
E and
N Functions
T
Relations Functions
S
RELATIONS
A B
Table
Ani Bakso
Ani Nasi Goreng

A relation is a set of ordered Irfan Mie Ayam


Arman Nasi Goreng
pairs, that shows a relationship
Arman Coto
between the two values. Ahmad Ikan Bakar
Erwin Bakso
The relation can be represented as :
Grap
h

Mapping
Diagram
FUNCTIONS
A function is a relation where every x-value
corresponds to exactly one y-value.
In other words, there are no x-values are
repeated.
TYPES OF
FUNCTION
 Injective Function (One to One)

TYPES OF
FUNCTION
 Injective means that every member of "A"
(1)
has its own unique matching member in
"B".
 A function f : AB is injective, if and
only if whenever f(x) = f(y).
 Injective functions can be reversed
 Surjective Function (Onto)

TYPES OF
FUNCTION
 Surjective means that every "B" has (2)
at least one matching in “A” .
 A function f : A  B is surjective if and
only if every y in B, there is at least one x
in A such that f(x) = y, in other
words f(A) = B.
 Bijective Function (One to One
Correspondence)

TYPES OF
FUNCTION
(3)
 Bijective means both Injective and
Surjective together.
 A function f : AB is bijective if,
for every y in B, there is exactly one x
matching in A such that f(x) = y.
DOMAIN CO-DOMAIN RANGE
The set of all The set of all The set of all
possible possible “actual”
input values output values output values
THANK
YOU

S-ar putea să vă placă și