Scribd
Upload
8 views

MATH1152 - Functions Notes

The document discusses functions and their properties. It defines what a function is and describes one-to-one, onto, and bijective functions. It also discusses inverse functions and provides an example to show a function is bijective and to find its inverse.

Uploaded by

Rohan Bassarath
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

MATH1152 - Functions Notes

The document discusses functions and their properties. It defines what a function is and describes one-to-one, onto, and bijective functions. It also discusses inverse functions and provides an example to show a function is bijective and to find its inverse.

Uploaded by

Rohan Bassarath
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Functions - Weeks 6-7

Thursday, October 12, 2023 8:23 AM

A function is a mapping from a set A to a set B which has the property that each element
of A is mapped to a unique element of B.
We write f: A → B.
A is called the domain, and B is called the codomain of f.

If (a, b) ∈ f then the b is unique. This means if (a, b) ∈ f and (a, c) ∈ f then b = c.
b is called the image of a and we write b = f(a).
Each a ∈ A, has an image f(a). (at most one)
The elements of B which are images of some element of A constitute the range of f.
If range f = B, we say that f is an onto function.

One to One functions:


A function f is one-one if and only if different elements of the domain have different
images.
This mean that f(a) = f(b) ⇒ a = b

Inverse Mapping:
If f: A → B is a function, we can obtain an inverse mapping g: B → A by reversing the
ordered pairs that define f. The inverse mapping may not be a function.

Types of Functions:
Inverse Functions:
If f: A → B is a function that is one-to-one and onto, then the inverse mapping g: B → A is a
function. This will be called the inverse function.

A function which is one-to-one and onto is called a bijective function or a bijection.


• Injective means one to one
• Surjective means onto
• Bijective means both 1-1 and onto.

For example:
Let A = {x ∈ ℝ | 0 < x < 1} and B = {y ∈ ℝ | 0 < y < 1/2} and let f: A → B be the function
defined by:
𝑥
𝑓 (𝑥 ) = , 𝑥 ∈ 𝐴.
1+𝑥

Show that f is bijective and find its inverse.

Solution:
To show one-to-one:
Suppose f(a) = f(b)
𝑎 𝑏
⇒ =
1+𝑎 1+𝑏
⇒ 𝑎(1 + 𝑏) = 𝑏(1 + 𝑎)
⇒ 𝑎 + 𝑎𝑏 = 𝑏 + 𝑎𝑏
⇒ 𝑎 = 𝑏.
Therefore, f is one-to-one.

To show onto:
Let y ∈ B, i.e. 0 < y < ½.
𝑥
𝑓 (𝑥 ) = 𝑦 ⇔ = 𝑦 ⇔ 𝑥 = 𝑦(1 + 𝑥 ) ⇔ 𝑥 = 𝑦 + 𝑥𝑦
1+𝑥
𝑦
⇔ 𝑥 − 𝑥𝑦 = 𝑦 ⇔ 𝑥(1 − 𝑦) = 𝑦 ⇔ 𝑥 = .
1−𝑦

We need to show: 0 < < 1.


Now, 0 < y < ½ ⇒ 1 – y > ½ ⇒ 0 < < 1.
This is so as the numerator is smaller than the denominator, so we get a value less than 1.
As both the numerator and denominator is positive, we will get a number greater than 0.
So for any y ∈ B, there is an x ∈ A, given by 𝑥 = , such that f(x) = y.
Therefore, f is onto and the Inverse function is given by:
𝑦
𝑓 (𝑦) = .
1−𝑦

You might also like