Scribd
Upload
19 views2 pages

MATH 1302 Discussion Forum Unit 2

The document defines a function f from set A to set B, demonstrating that it is a function since each element in A maps to one in B. It explains that f is not injective as multiple elements in A map to the same element in B, but it is surjective since all elements in B are covered. Additionally, it provides definitions and examples of functions, injective, surjective, and bijective functions, along with counterexamples.

Uploaded by

Li Mei You
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
19 views2 pages

MATH 1302 Discussion Forum Unit 2

The document defines a function f from set A to set B, demonstrating that it is a function since each element in A maps to one in B. It explains that f is not injective as multiple elements in A map to the same element in B, but it is surjective since all elements in B are covered. Additionally, it provides definitions and examples of functions, injective, surjective, and bijective functions, along with counterexamples.

Uploaded by

Li Mei You
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
You are on page 1/ 2

(i)

Let's define a function f: A → B where A = {1, 2, 3, 4} and B = {a, b, c} as follows:

f = {(1, a), (2, b), (3, a), (4, c)}

To determine that it is a function, we need to make sure that each element in set A is mapped to exactly
one element in set B. In this case, each element in set A has only one mapping in set B, so it is a function.

The function f is not one-one (injective) because multiple elements in set A are mapped to the same
element in set B. For example, both 1 and 3 from set A are mapped to a in set B.

The function f is onto (surjective) because every element in set B has at least one element in set A that
maps to it. All elements in set B (a, b, c) are covered by the mapping of elements from set A.

Since the function is not one-one, it does not have an inverse. To have an inverse, each element in set B
must be mapped to exactly one element in set A.

The images of each element in the function f are: f(1) = a, f(2) = b, f(3) = a, f(4) = c

(ii)

Function: A function is a relation between a set of inputs (domain) and a set of possible outputs
(codomain) where each input is related to exactly one output.

Example: f: {1, 2, 3} → {a, b, c} where f = {(1, a), (2, b), (3, c)}

Counterexample: g: {1, 2} → {a, b, c} where g = {(1, a), (2, a)}

Injective function: An injective function (one-one function) is a function where each element in the
domain maps to a unique element in the codomain.

Example: h: {1, 2, 3} → {a, b, c} where h = {(1, a), (2, b), (3, c)}
Counterexample: k: {1, 2, 3} → {a, b} where k = {(1, a), (2, a), (3, b)}

Surjective function: A surjective function (onto function) is a function where every element in the
codomain has at least one pre-image in the domain.

Example: l: {1, 2, 3} → {a, b, c} where l = {(1, a), (2, a), (3, b)}

Counterexample: m: {1, 2} → {a, b, c} where m = {(1, a), (2, b)}

Bijective function: A bijective function is both injective and surjective, meaning each element in the
domain maps to a unique element in the codomain and every element in the codomain has at least one
pre-image in the domain.

Example: n: {1, 2, 3} → {a, b, c} where n = {(1, a), (2, b), (3, c)}

You might also like