Scribd
Upload
8 views3 pages

Inverse Function Examples

The document discusses various examples of functions and their properties, including injectivity, surjectivity, and bijectivity. It provides specific functions and analyzes whether they meet the criteria for being injective or surjective, along with justifications. Additionally, it explores the existence of inverse functions for certain mappings.

Uploaded by

hmfahadbinibrahim
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
8 views3 pages

Inverse Function Examples

The document discusses various examples of functions and their properties, including injectivity, surjectivity, and bijectivity. It provides specific functions and analyzes whether they meet the criteria for being injective or surjective, along with justifications. Additionally, it explores the existence of inverse functions for certain mappings.

Uploaded by

hmfahadbinibrahim
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

Example -1: Let f be the function from {a, b, c, d} to {1, 2, 3} defined by f (a) = 3, f (b) = 2,

f (c) = 1, and f (d) = 3. Find out whether f is an injective or surjective function.

Solution: Mapping diagram of the above function -

Injective: A function is injective, if an element of the codomain has a preimage, then it is a unique preimage.
But here, we see in the co-domain 3 has multiple preimages (a and d). Therefore, this f is not injective.

Surjective: A function is surjective, if each element of the codomain has at least one preimage in the domain.
Here, we see each element in the codomain is mapped to by at least one element from the domain. Therefore, this f
is surjective.

Example -2: let, f: N→N be a function defined by f(x)=x2 for every natural number x. Determine
whether the function 𝑓 is Injective (one-to-one), Surjective (onto), Bijective (both one-to-one and
onto). Justify your answer with proper reasoning.
Solution:

Injective:
🔢 Try with Sample Inputs
Let’s evaluate f(x) for the first few natural numbers:

x f(x) = x²
1 1
2 4
3 9
4 16
5 25
6 36
---

✅ Check Injectivity
Injective means: if f(x₁) = f(x₂), then x₁ = x₂.

From the table:


- All outputs are distinct: 1, 4, 9, 16, 25, 36
- No two different inputs give the same output

So, f is injective

❌ Check Surjectivity
Surjective means: every natural number must be hit by some input.

Let’s look at the codomain ℕ = {1, 2, 3, 4, 5, 6, …}

From the table:


- Outputs are: 1, 4, 9, 16, 25, 36
- Numbers like 2, 3, 5, 6, 7, 8, 10, etc. are not squares of any natural number

So, f is not surjective

🧠 Final Verdict
- Injective: Yes
- Surjective: No
- Bijective: No (because not surjective)
Example -3: Explain whether there exists an inverse function of this given function or not. Find
the inverse function if exists. Let f be the function from {a, b, c, d} to {1, 2, 3} defined by f (a) =
3, f (b) = 2, f(c) = 1, and f (d) = 3.

Example -4: Determine the type of each function (One-to-One, Onto, or One-to-One
correspondence) defined as ƒ: ℝ → ℝ

ƒ(x) = 3x+5

Example -5: Explain the reason to the following questions if a function 𝑓: R+ → R+ is defined by
(𝑥)=𝑥4. Here R+ is the set of all positive real numbers.

i) Is 𝑓 onto? ii) Is 𝑓 bijective?

Example - 6: Linear Function Let 𝒇: ℝ → ℝ be defined by 𝒇(𝒙) = 𝟑𝒙 − 𝟕. Show 𝒇 is a bijection


and find 𝒇-1(𝒙).

You might also like