WELCOME
To Our Presentation
Function
Content courtesy (Partial) – Prof. Margaret (Maggie) H.
Dunham
Department of Software Engineering – Discrete Mathematics 1
Daffodil International University
(DIU)
Department of Software Engineering (SWE)
Discrete
Mathematics
Fall 2024
Instructor: Mohammad Azam
Khan, PhD Department of Software Engineering – Discrete Mathematics
Functions
Functions are special relations.
Functions make up a subset of all relations.
Every set of ordered pairs is a relation, but every relation is
not a function
A function is defined as a relation that is either one to one or
many to one., i.e., no ordered pairs have the same first
element.
Department of Software Engineering – Discrete Mathematics 2
Functions: Formal Definition
a relation where for every element a∈A, there exists a unique
A function f from set A to set B, written as f : A → B, is defined as
element b∈B such that f(a)=b.
In other words, a function is a relation between two sets that
assigns each element of the first set (called the domain) to
exactly one element of the second set (called the codomain).
Department of Software Engineering – Discrete Mathematics 3
Functions: Graphical Representation
Functions can be represented graphically in several ways:
f A B
f • • y
• • • •
a b • •
• x
•
•
A B
Like Venn diagrams Graph Plot
Department of Software Engineering – Discrete Mathematics 4
Functions: Key Concepts
Domain: The set of all possible inputs. For f : A→B,
A is the domain.
Codomain: The set of potential outputs. For f : A→B, B
is the codomain.
Range: The actual set of outputs generated by the
function. It’s a subset of the codomain.
Department of Software Engineering – Discrete Mathematics 5
Properties of Functions
Injective (One-to-One)
I. Different elements in the domain map to different elements in
the codomain.
Surjective (Onto)
I. Every element in the codomain is mapped by at least one
element in the domain.
II. The range of f equals the codomain.
Bijective:
I. Both injective and surjective
II. Forms a one-to-one correspondence between the domain
and codomain.
Department of Software Engineering – Discrete Mathematics 6
Injective (One-to-One) Function
An injective function (also called a one-to-one function) is a function
where each output value is linked to only one unique input value. This
means that no two different inputs can give the same output.
A = {a, b, c}
B = {1, 2, 3, 4}
A B
Department of Software Engineering – Discrete Mathematics 9
Surjective (Onto) Function
If every element in the function's target set (also called the codomain)
has at least one element from the input set (domain) mapping to it. In
other words, a function
f : A→B is surjective if, for every y in B, there is some x in A such that
f(x)=y
A = {a, b, c}
B = {1, 2}
A B
Department of Software Engineering – Discrete Mathematics 10
Bijective (One-to-One and Onto) Function
It’s a function mixer of both injective and surjective function. So, a
bijective function perfectly "pairs" each input with a unique output, and
every output is covered. In other words, a bijective function has an
inverse function.
A = {a, b, c}
B = {1, 2, 3}
A B
Department of Software Engineering – Discrete Mathematics 11
THANK YOU
For Your Patience
