MATH 1302 - Unit 2 Discussion Assignment

(i) Two-Lined Representation of a Function Using Sets A and B
Let us define two sets A and B:

 Set A={1,2,3}
 Set B={4,5,6}
Now, we define a function f:A→B as follows:
f ( 1 ) =4 , f ( 2 )=5 , f (3)=6
This two-lined representation of the function shows that:
f: ( 14 2 3
5 6 )
Here, the top row corresponds to elements of set A, and the bottom row represents their images
in set B under the function f.
Is it a Function?
To determine whether this is indeed a function:
 A function is a rule that assigns exactly one output in set B for each input in set A.
 In this case, for every element in set A, there is a corresponding unique element in set B.
Hence, f is a function.
Is it One-One (Injective)?
 A function is one-one (injective) if each element of the domain A is mapped to a distinct
element in the codomain B.
 In this case, f(1)=4, f(2)=5, and f(3)=6, meaning no two elements of A are mapped to the
same element in B.
 Therefore, f is injective.
Is it Onto (Surjective)?
 A function is onto (surjective) if every element of the codomain B has a preimage in the
domain A.
 Here, every element in B (i.e., 4,5,6) is the image of an element in A, meaning f covers
the entire codomain B.
 Therefore, f is surjective.
Does it Have an Inverse?
 A function has an inverse if it is both injective (one-one) and surjective (onto), i.e., it
must be bijective.
 Since f is both injective and surjective, it is bijective, and thus, it has an inverse.
The inverse function f −1 : B → A would be:
f −1 ( 4 )=1 f −1 ( 5 )=2 f −1 ( 6 )=3

The two-lined representation of the inverse function is:
f: ( 41 5 6
2 3 )
Images of Each Element in the Function:
The image of each element in A under f is:
 Image of 1 is f(1)=4,
 Image of 2 is f(2)=5,
 Image of 3 is f(3)=6.
Each element of A has a unique image in B, which shows that the function is injective and
surjective.
(ii) Explanation of Functions, Injective, Surjective, and Bijective Functions

1. Function (Mapping)
A function f:A→B is a rule that assigns each element in set A (the domain) to exactly one
element in set B (the codomain). Formally, for every x∈A, there is a unique y∈B such that
f(x)=y.
Example:
Let A={1,2,3} and B={4,5,6}. The function f defined as:
f ( 1 ) =4 f ( 2 )=5 f ( 3 )=6
is a valid function because every element of A has a unique image in B.

Counterexample:
Let A={1,2} and B={4}, and define f as:
f ( 1 ) =4 f ( 2 )=4
This is still a function, even though both elements in A map to the same element in B, but it is
not injective.
2. Injective Function (One-One)
A function f:A→B is injective (one-one) if different elements in A are mapped to different
elements in B. Formally, for all x 1 , x 2 ∈ A i f f ( x 1 )=f ( x 2 ) then x1 =x2
Example:
Let A={1 , 2, 3 }∧B={4 ,5 , 6 }, withf (1)=4 , f (2)=5 , f (3)=6. This function is injective because
every element in A maps to a distinct element in B.
Counterexample:
Let f:{1,2}→{3} be defined as f(1)= 3 and f(2)=3. This is not injective because both 1 and 2
map to the same element in B, violating the one-to-one condition.
3. Surjective Function (Onto)

A function f:A→B is surjective (onto) if for every element y∈B, there is at least one x∈A such
that f(x)=y. In other words, the function "covers" all elements of the codomain B.
Example:
Let A={1,2,3} and B={4,5,6}, with f(1)=4, f(2)=5, f(3)=6. This function is surjective because
every element in B has a preimage in A.
Counterexample:
Let A={1,2} and B={4,5,6}, with f(1)=4, f(2)=5. This function is not surjective because there is
no element in A that maps to 6∈B.
4. Bijective Function (One-One and Onto)

A function f:A→B is bijective if it is both injective and surjective. This means that every
element in A maps to a unique element in B, and every element in B is covered.
Example:
Let A={1,2,3} and B={4,5,6}, with f(1)=4, f(2)=5, f(3)=6. This function is bijective because it is
both one-to-one and onto.
Counterexample:
Let A={1,2,3} and B={4,5}, with f(1)=4, f(2)=5, f(3)=4. This function is neither injective nor
surjective. It is not injective because both 1 and 3 map to 4, and it is not surjective because there
are more elements in A than in B.

MATH 1302 - Unit 2 Discussion Assignment

Uploaded by

Copyright:

Available Formats

MATH 1302 - Unit 2 Discussion Assignment

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MATH 1302 - Unit 2 Discussion Assignment

Uploaded by

Copyright:

Available Formats

(i) Two-Lined Representation of a Function Using Sets A and B

Let us define two sets A and B:

f −1 ( 4 )=1 f −1 ( 5 )=2 f −1 ( 6 )=3

(ii) Explanation of Functions, Injective, Surjective, and Bijective Functions

is a valid function because every element of A has a unique image in B.

3. Surjective Function (Onto)

4. Bijective Function (One-One and Onto)

You might also like