Scribd
Upload
73 views10 pages

Function(s) PDF

The document defines and provides examples of different types of functions: - A function maps each element in its domain to a unique element in its range. - A one-to-one function maps each domain element to a unique range element. - An onto function maps the entire domain onto the entire range such that every range element corresponds to a domain element. - A bijective function is both one-to-one and onto, providing a perfect pairing between domain and range elements.

Uploaded by

Ravi Ranjan
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
73 views10 pages

Function(s) PDF

The document defines and provides examples of different types of functions: - A function maps each element in its domain to a unique element in its range. - A one-to-one function maps each domain element to a unique range element. - An onto function maps the entire domain onto the entire range such that every range element corresponds to a domain element. - A bijective function is both one-to-one and onto, providing a perfect pairing between domain and range elements.

Uploaded by

Ravi Ranjan
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/ 10

Engineering Mathematics I

Function

Rakesh Prasad Badoni, Ph.D.


Xavier School of Computer Science and Engineering
Xavier University Bhubaneswar
Odisha − 752050, India
Function(s)
 A function is a set of ordered pairs in which no two ordered
pairs that have the same first component have different second
components.
 Given any x, there is only one y that can be paired with that x.
 In these diagrams, set A is the domain of the function and set B
is the range of the function.
One-to-One function: A function f from A to B is called one-to-
one (or 1 − 1) if whenever f(a) = f(b) then a = b. No element of
B is the image of more than one element in A.
 In a one-to-one function, given any y value, there is only one x
that can be paired with the given y. Such functions are also
referred to as Injective.
Function (cont.…)
 When working on the coordinate plane, a function is a one-to-one when it
will pass the vertical line test (to make it a function) and also a horizontal
line test (to make it one-to-one).
 When working in the coordinate plane, the sets A (the domain) and B (the
range) will most often both become the Real Numbers, stated as f: ℝ → ℝ.
Geometrically: For a function f to be Function f: One-to-One
one-to-one, each horizontal line should Each y value that is used,
not contain more than on point of f. is used only once.

Example) Is f(x) = x³ a one-to-one function where


f: ℝ → ℝ.
This cubic function is indeed a “function” as it
passes the vertical line test.
In addition, this function possesses the property
that each x-value has one unique y-value that is not Function g: NOT One-to-One
used by any other x-element. This characteristic is The y − value of 4 is used
referred to as being a 1 − 1 function. more than once.
Function (cont.…)
Example) Is g(x) = |x − 2| a one-to-one function where g: ℝ → ℝ?
 This absolute value function passes the vertical line test to be a
function.
 In addition, this function has y-values that are paired with more than
one x-value, such as (4,2) and (0,2). This function is not one-to-one.
 This function passes a vertical line test (to be a function) but not a
horizontal line test (for on-to-one function).

Problem) Is g(x) = |x − 2| a one-to-one function where g: ℝ → [0, ∞)?


 This question is changing the RANGE, not the DOMAIN.
 It may be possible to adjust a function in some manner so that the function becomes a one-
to-one function.
 In this case, with set B (the range set) redefined to be [0, ∞), function g(x) will still be NOT
one-to-one since we still have (0,2) and (4,2).
Function (cont.…)
Onto function: A function f from A to B is called onto if for all b in B there is an a in A such
that whenever f a = b. All elements in B are used.
 In an onto function, all possible y − values are used. Such functions are also referred to as
surjective.

Function f: Onto (as all Function f: NOT Onto (as


elements in B are used). 6 in B is not used).
Not one-to-one. It is one-to-one.

 To determine if a function is onto, you need to know information about both set A and set B.
Function (cont.…)
Geometrically: For a function to be onto, each horizontal line
contains at least one point of g (i.e., the function).
Example) Is g(x) = x² − 2 an onto function where g: ℝ → ℝ?
 This function (a parabola) is NOT ONTO.
 Values less than −2 on the y-axis are never used. Since only
certain y-values belonging to the set of ALL Real numbers are
used, we see that not ALL possible y-values are used (such as,
− 3, −4, …).
 In addition, this parabola also has y-values that are paired
with more than one x-value, such as (3, 7) and (−3, 7) (i.e.,
horizontal line test!).
 This function will not be one-to-one.
Function (cont.…)
Example) Is g(x) = x² − 2 an onto function where g: ℝ → [−2, ∞)?
 If set B (the range) is redefined to [−2, ∞), ALL the possible y-values are now used, and
function g(x) (under this conditions) is ONTO.
Note: This function is still NOT one-to-one.
 To make this function both onto and one-to-one, we would also need to restrict A, the domain.
Question) What change(s) we should make in the domain of above example to make it one-to-one.
 What about g: [0, ∞) → [−2, ∞)?
One-to-one correspondence (or both one-to-one and onto functions): A function f from A (the
domain) to B (the range) is BOTH one-to-one and onto when no element of B is the image of more
than one element in A, AND all elements in B are used (i.e., all the elements of B has a pre-image).
 to as Bijective. Functions which are both, one-to-one (Injective) and onto (Surjective), are
referred
Function (cont.…)
Question) Determine whether the following function is one-to-one:
f = {(1,2), (3,4), (5,6), (8,6), (10, −1)}
Question) Prove that the function f(n) = n2 is one-to-one.
Proof) Aim: To prove that whenever f(m) = f(n) ⟹ m = n.
Function f: BOTH One-to-one and Onto
Each used element of B is used only once Assume that f(m) = f(n) for two numbers m, n ∈ ℕ. Therefore,
f x1 = f x2 ⇒ x1 = x2
All elements in B are used
m2 = n2 ⟹ m = ±n
∀y ∈ B ∃x ∈ A: f x = y Next, splitting cases on n, we have
For n ≠ 0, −n ∉ ℕ, therefore m = n for this case.
For n = 0, we have m = n = 0. Therefore, it follows that m = n
for both cases.

Function f: NOT BOTH (One-to-one but NOT Onto)


Each used element of B is used only once
There exists some elements of B, which are not used
Example: 6 ∈ B is not used, as ∄x ∈ A: f x = 6
Function (cont.…)
Classify the following functions fj : ℕ → ℕ between natural numbers as one-to-one and onto.

𝐟𝐟𝐣𝐣 One-to-One? Onto?


f1 n = n2 Yes No
f2 n = n + 3 Yes No
f3 n = ⌊ n⌋ No Yes
n − 1, n is odd Yes Yes
f4 n = �
n + 1, n is even

 f1 is not onto because it does not have any element n such that f1 n = 3.
 f2 is not onto because there exists no element n such that f2 (n) = 1.
 f3 is not one-to-one since f3 (2) = f3 (1) = 1.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy