Scribd
Upload
46 views2 pages

MATH 1302-01 Discussion Forum Unit 2

The document discusses the properties of a function defined from set A to set B, demonstrating that it is a function, injective, surjective, and bijective, with an inverse function provided. It further explains the definitions of functions, injective, surjective, and bijective functions with examples and counterexamples. The references used for this analysis are from Herman & Strang (2020).

Uploaded by

KILLIAN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
46 views2 pages

MATH 1302-01 Discussion Forum Unit 2

The document discusses the properties of a function defined from set A to set B, demonstrating that it is a function, injective, surjective, and bijective, with an inverse function provided. It further explains the definitions of functions, injective, surjective, and bijective functions with examples and counterexamples. The references used for this analysis are from Herman & Strang (2020).

Uploaded by

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

Response to the Assignment

(i) Two-Lined Representation of a Function

Let A={1,2,3,4}A = \{1, 2, 3, 4\} and B={5,10,15,20}B = \{5, 10, 15, 20\}.
Define f:A→Bf : A \to B by:

f(x)={5xif x∈Af(x) = \begin{cases} 5x & \text{if } x \in A \end{cases}

Thus, f(1)=5, f(2)=10, f(3)=15, f(4)=20f(1) = 5, \, f(2) = 10, \, f(3) = 15, \, f(4) = 20.

1. Function Determination:
ff is a function because each element in AA has one and only one corresponding value in BB.
There are no cases where one element in AA maps to multiple values in BB, satisfying the
definition of a function (Herman & Strang, 2020).

2. Injective Analysis:
ff is injective because every element in AA maps to a unique value in BB. For instance,
f(1)≠f(2)f(1) \neq f(2), and so on. This uniqueness confirms the one-to-one property (Herman
& Strang, 2020).

3. Surjective Analysis:
ff is surjective because every element in BB is the image of some element in AA. For
example, 5,10,15,5, 10, 15, and 2020 are all outputs of f(x)f(x) for x∈Ax \in A (Herman &
Strang, 2020).

4. Inverse Function:
Since ff is both injective and surjective (bijective), it has an inverse. The inverse is defined as
f−1(y)=y5f^{-1}(y) = \frac{y}{5} for y∈By \in B (Herman & Strang, 2020).

5. Images:
The images of AA under ff are {5,10,15,20}\{5, 10, 15, 20\}, precisely matching BB.

(ii) Explanation of Functions

1. Function:
A function f:A→Bf : A \to B assigns every element of AA to one and only one element in BB.
Example: f(x)=x2f(x) = x^2, where A={−1,1},B={1}A = \{-1, 1\}, B = \{1\}.
Counterexample: g(x)=±xg(x) = \pm \sqrt{x}, as each xx in BB maps to two elements in AA
(Herman & Strang, 2020).

2. Injective Function:
A function is injective (one-to-one) if every element in AA maps to a unique element in BB.
Example: f(x)=x+3f(x) = x+3, A={1,2,3},B={4,5,6}A = \{1, 2, 3\}, B = \{4, 5, 6\}.
Counterexample: g(x)=x2g(x) = x^2, A={−2,2},B={4}A = \{-2, 2\}, B = \{4\}, as g(−2)=g(2)=4g(-
2) = g(2) = 4 (Herman & Strang, 2020).

3. Surjective Function:
A function is surjective (onto) if every element in BB is mapped by at least one element in
AA.
Example: f(x)=x−1f(x) = x-1, A={2,3,4},B={1,2,3}A = \{2, 3, 4\}, B = \{1, 2, 3\}.
Counterexample: g(x)=2xg(x) = 2x, A={1,2,3},B={2,4,6,8}A = \{1, 2, 3\}, B = \{2, 4, 6, 8\}, as
8∉Im(g)8 \notin \text{Im}(g) (Herman & Strang, 2020).

4. Bijective Function:
A function is bijective if it is both injective and surjective.
Example: f(x)=x+2f(x) = x+2, A={1,2,3},B={3,4,5}A = \{1, 2, 3\}, B = \{3, 4, 5\}.
Counterexample: g(x)=x2g(x) = x^2, A={−2,2},B={4}A = \{-2, 2\}, B = \{4\} (Herman & Strang,
2020).

References

Herman, E., & Strang, G. (2020). Calculus Volume 1. OpenStax.

You might also like