Scribd
Upload
40 views

Discrete - Functions

The document discusses one-to-one and onto functions, bijective functions, and their inverses. It provides examples of determining the inverse of a relation and function. Boolean functions are also introduced, where logical operations are represented using 0 and 1 instead of True and False. An example truth table is given to represent a Boolean function.

Uploaded by

erikalast.acad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
40 views

Discrete - Functions

The document discusses one-to-one and onto functions, bijective functions, and their inverses. It provides examples of determining the inverse of a relation and function. Boolean functions are also introduced, where logical operations are represented using 0 and 1 instead of True and False. An example truth table is given to represent a Boolean function.

Uploaded by

erikalast.acad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

IT2313

COMPOSITION OF FUNCTIONS
In the previous topic, we learned that the domain and range of a given set can be categorized as injective,
surjective or bijective. In this module, we will go deeper in analyzing how these categories are involved in one-
to-one and onto functions.

One-to-One and Onto Functions


We have previously established that injections are also called one-to-one functions, primarily because each
input in the set has only one output. The mapping diagram below shows a comparison of what a one-to-one
function looks like compared to a many-to-one function.

One-to-one and many-to-one comparison. Retrieved from https://www.storyofmathematics.com/one-to-one-function/

If all elements of the range have a corresponding element in the domain, it becomes an onto function. Looking
at the image below, we see that in an onto function, all elements of Set B are used.

One-to-one and Onto Functions. Retrieved from https://www.aplustopper.com/one-to-one-and-onto-functions/

04 Handout 1 *Property of STI


 student.feedback@sti.edu Page 1 of 4
IT2313

Bijective Functions and its Inverse

A function becomes bijective if and only if it meets both requirements:


1. It is qualified as a one-to-one function; and
2. It is an onto function.

Only a bijective function can have an inverse due to the flexible nature of injective and surjective functions. It
can be acquired given the scenarios below.

Scenario 1: Given a Relation


Determine 𝑅 −1 given 𝑅 = {(6, 7), (4, 3), (10, 9), (0, 1)}.

Solution:
Interchange 𝑥 and 𝑦. The domain becomes the range, and the range becomes the domain.
𝑅 = {(6, 7), (4, 3), (10, 9), (0, 1)}
𝑅 −1 = {(7, 6), (3, 4), (9, 10), (1, 0)}

Scenario 2: Given a Function


Determine 𝑓 −1 (𝑥) given 𝑓(𝑥) = 3𝑥 + 1.

Solution:
𝑓(𝑥) = 3𝑥 + 1
𝑦 = 3𝑥 + 1 Rewrite 𝑓(𝑥) as 𝑦.
𝑥 = 3𝑦 + 1 Interchange 𝑥 and 𝑦.
𝑥 − 1 = 3𝑦 Isolate 𝑦.
𝑥−1
=𝑦
3
𝑥−1
𝑓 −1 (𝑥) = Rewrite 𝑦 as 𝑓 −1 (𝑥). This becomes the inverse of
3 the function.

All linear functions are bijections. To describe the connection between a bijection and its inverse, let us use
the same given in evaluating 𝑓(3).

𝑓(𝑥) = 3𝑥 + 1
𝑓(3) = 3(3) + 1 Evaluate the function at 𝑓(3).
𝑓(3) = 10

Since 𝑓(3) = 10, the input is 3, and the output is 10 for the function 𝑓(𝑥) = 3𝑥 + 1. If we want to go back
from the output to the input, we cannot use the same function since 𝑓(10) = 31. This is where its inverse
comes along.

Let us try evaluating 𝑓(10) in the inverse of the function 𝑓(𝑥) = 3𝑥 + 1.

𝑥−1
𝑓(𝑥) =
3
Evaluate the function at 𝑓(10).

04 Handout 1 *Property of STI


 student.feedback@sti.edu Page 2 of 4
IT2313

10 − 1
𝑓(10) =
3 Simplify.
9
𝑓(10) =
3
𝑓(10) = 3
Using the inverse of the function, we were able to go back from the output to the original input since
𝑓(10) = 3. The image below shows the connection between a function and its inverse.

Boolean Functions
Recall that logical connectives operate in the premise of {True, False}. In Boolean functions, a similar
premise is being observed in the form {0, 1}, where 0 is interpreted as ‘false’ and 1 is ‘true.’ The connection
between the two concepts is shown in the table below.

Boolean Complement Boolean Product Boolean Sum


(Logical Negation) (Logical Conjunction) (Logical Disjunction)
𝒙 ≡ ¬𝒙 𝒙∙𝒚≡𝒙∧𝒚 𝒙+𝒚≡𝒙∨𝒚
0̅ = 1 0∙0=0 0+0=0
1̅ = 0 0∙1=0 0+1=1
1∙0=0 1+0=1
1∙1=1 1+1=1

Example:
Use a table to express the values of the Boolean function 𝐹(𝑥, 𝑦) = 𝑥̅ 𝑦.

Solution:
Establish a truth table using {0, 1}.

𝒙 𝒚 ̅
𝒙 ̅𝒚
𝒙
1 1 0 0
1 0 0 0
0 1 1 1
0 0 1 0

References:
Boolean functions. (n.d.). University of Hawaii. Retrieved September 27, 2023, from
http://courses.ics.hawaii.edu/ReviewICS241/morea/boolean-algebra/BooleanFunctions-QA.pdf

04 Handout 1 *Property of STI


 student.feedback@sti.edu Page 3 of 4
IT2313

India’s no.1 Govt Exam Preparation Site: Online Course: Mock test. Testbook.com - India’s No.1 Govt Exam
Preparation Site | Online Course | Mock Test. (n.d.). https://testbook.com/maths/inverse-relation
Injective, surjective and bijective. (2017). Math is fun. Retrieved from
https://www.mathsisfun.com/sets/injective-surjective-bijective.html
Kwong, H. (2021, July 7). 6.6: Inverse functions. Mathematics LibreTexts.
https://math.libretexts.org/Bookshelves/Combinatorics_and_Discrete_Mathematics/A_Spiral_Work
book_for_Discrete_Mathematics_(Kwong)/06%3A_Functions/6.06%3A_Inverse_Functions#:~:text=T
he%20inverse%20of%20a%20bijection,f(x)%3Dy.
One to One Function – Explanation & Examples. (2020). The story of mathematics. Retrieved from
https://www.storyofmathematics.com/one-to-one-function/
One-to-one and onto functions. (2023). Aplustopper. Retrieved from https://www.aplustopper.com/one-to-
one-and-onto-functions/

04 Handout 1 *Property of STI


 student.feedback@sti.edu Page 4 of 4

You might also like