Student Code: 73937822

Instructor: Ivan Matic

Homework Assignment 1
1. Consider the functions from S = { 2, 1, 0, 1, 2} to T = {1, 2, 3, 4, 5}
defined by f (x) = x + 3, and g(x) = x5 5x3 + 5x + 3. Write down the set
of ordered pairs (x, f (x)) for x S and the set of ordered pairs (x, g(x)) for
x S. Are the two functions the same or different?
Answer:
Ordered pairs corresponding to f (x): (2, 1), (1, 2), (0, 3), (1, 4), and
(2, 5).
Ordered pairs corresponding to g(x): (2, 1), (1, 2), (0, 3), (1, 4), and
(2, 5).
Since the image of any x S under the mapping f (x) is equal to its image
under the mapping g(x), these two functions are considered equal.
2. Here are some questions that will help you get used to the formal idea of
a relation and the related formal idea of a function. S will stand for a finite
set of size s and T will stand for a finite set of size t.
(a) What is the size of the largest relation from S to T ?
Answer:
Let S T = {(x, y) | x S and y T }. Since S has s elements and T has t
elements, any ordered pair (x, y) S T x has a total of s different possible
values for x and t possible values for y. Then the largest relation from S to
T has s t elements.
(b) What is the size of the smallest relation from S to T ?
Answer:
The size of the smallest possible relation from S to T is 0, or in other words
a relation that yields . A relation from a set A to another set B is defined
as any set C such that C A B, and by definition A( A).
(c) The relation of a function f : S T is the set of all ordered pairs
(x, f (x)) with x S. What is the size of the relation of a function from S to
T ? That is, how many ordered pairs are in the relation of a function from

S to T ?
Answer:
The size of the relation of a function f : S T is s. For any function f , we
have x S((f (x) = y and f (x) = z) y = z), or that the image of any element of S under f is unique. Then if an ordered pair (x, y) {(x, y) | x S
and y = f (x)}, it will have s elements.
(d) We say f is a one-to-one function or injection from S to T if each member of S is related to a different element of T . How many different elements
must appear as second elements of the ordered pairs in the relation of a
one-to-one function from S to T ?
Answer:
The number of different second elements that must appear in the relation of an injection f : S T is s. If f is an injection, then we have
x1 , x2 S(x1 6= x2 f (x1 ) 6= f (x2 )). Then every ordered pair (x, y)
will be unique, meaning that there will be s different second elements to
correspond to each element in S.
(e) A function f : S T is called an onto function or surjection if each
element of T is f (x) for some x S. What is the minimum size that S can
have if there is a surjection from S to T ?
Answer:
The minimum size that the relation of a surjection f : S T is t. If f is
a surjection, then we have that y T x S(y = f (x)), or in other words
that every element of T is the image of some x S under f . Since it is the
case that each ordered pair (x, y) with x S and y = f (x) has only one y
corresponding to each x, the relation of the surjection f must have at least
t elements.
3. When f is a function from S to T , the sets S and T play a big role in
determining whether a function is one-to-one or onto (as defined in Problem
2). For the remainder of this problem, let S and T stand for the set of
nonnegative real numbers.
(a) If f : S T is given by f (x) = x2 , is f one-to-one? Is f onto?
Answer:
2
Let x and y be arbitrary elements of R+
0 and suppose that y = x . Then
2

x = y and x = y, but since we are only considering y R+

0we have

x = y. By hypothesis we have y 0, so y 0 and therefore y R+

0.
Since y was arbitrary, we may conclude that f is surjective.
Now suppose that y = a2 and y = b2 , where a, b R+
0 . Then we have

that a = y = b, and therefore a = b. This shows uniqueness, and we may

conclude that f is injective.
(b) Now assume for the rest of the problem that S 0 is the set of all real
numbers and g : S 0 T is given by g(x) = x2 . Is g one-to-one? Is g onto?
Answer:
Let x be an arbitrary element of R and let y be an arbitrary element of R+
0

and suppose that y = x2 . Then |x| = y, so this equation is satisfied by

both x = y and x = y. Then we have x1 6= x2 , but g(x1 ) = g(x2 ).

Therefore g is not injective(one-to-one), but since y was arbitrary we may
conclude that g is surjective.
(c) Assume for the rest of the problem that T 0 is the set of all real numbers
and h : S T 0 is given by h(x) = x2 . Is h one-to-one? Is h onto?
Answer:
Let x 6= 0 be an arbitrary
element
of R+
0 and let y = x. Then the solutions

2
to y = x are x = x and x = x. But since x 6= 0, there is no x R+
0
that satisfy satisfy this equation. Therefore h is not surjective.
Now suppose that y = a2 and y = b2 , where a, b R+
0 . Then we have

that a = y = b, and therefore a = b. This shows uniqueness, and we may

conclude that h is injective.
(d) And if the function j : S 0 T 0 is given by j(x) = x2 , is j one-to-one?
Is j onto?
Answer:
Let x 6= 0 be an arbitrary
element of
R and let y = x. Then the solutions

to y = x2 are x = x and x = x. But since x 6= 0, there is no value

x R+
0 that satisfy satisfy this equation. Therefore j is not surjective.
Now suppose that suppose that y = x2 where x and y are arbitrary

elements of R. Then |x| = y, so this equation is satisfied by both x = y

and x = y. Then we have x1 6= x2 , but g(x1 ) = g(x2 ). Therefore g is

not injective.

4. If f : S T is a function, we say that f maps x to y as another way to

say that f (x) = y. Suppose S = T = {1, 2, 3}. Give a function from S to
T that is not onto. Notice that two different members of S have mapped to
the same element of T . Thus when we say that f associates one and only
one element of T to each element of S, it is quite possible that the one and
only one element f (1) that f maps 1 to is exactly the same as the one and
only one element f (2) that f maps 2 to.
Answer:
Let : S T be given by (x) = x2 mod 2 + 1. Then (1) = 2, (2) = 1,
and (3) = 2. Under this mapping there is no x S such that (x) = 3,
and therefore is not surjective (onto).
5. Assume that S = {1, 2, 3, 4, 9} and T = {2, 3, 5, 6, 7}.
(a) Provide an example of a function f : S T that is one-to-one.
Answer:
Let : S T be given by (1) = 2, (2) = 3, (3) = 5, (5) = 6, and
(9) = 7. Since for any x1 6= x2 we have (x1 ) 6= (x2 ), we may conclude
that is injective (one-to-one).
(b) Provide an example of a function f : S T that is not one-to-one.
Answer:
Let : S T be given by (1) = 2, (2) = 2, (3) = 5, (5) = 6, and
(9) = 7. Since we have 1 6= 2 but (1) = (2), we may conclude that is
not injective (one-to-one).
6. (a) Determine the number of functions f : {1, 2, 3, 6, 7, 8} {1, 2} that
are one-to-one.
Answer:
The number of functions f : {1, 2, 3, 6, 7, 8} {1, 2} that are injective(oneto-one) is 0. The definition of a function states that for sets A and B, with
sizes a and b respectively, a mapping : A B that x A!y B((x) =
y). So if we have we have a > b then there will be some x1 , x2 A that
will be mapped to the same element and by definition cannot be injective. Since {1, 2, 3, 6, 7, 8} has more elements than {1, 2}, it then follows
that there are no functions f : {1, 2, 3, 6, 7, 8} {1, 2} that are injective.

(b) Determine the number of functions f : {1, 2, 3, 6, 7, 8} {1, 2} that are

onto.
Answer:
The number of functions f : {1, 2, 3, 6, 7, 8} {1, 2} that are surjective) is
62. With a function f that maps {1, 2, 3, 6, 7, 8} to {1, 2}, by having elements in {1, 2, 3, 6, 7, 8} choose elements in {1, 2} we have a total of 26 = 64
outcomes. However, the only functions not to be taken into consideration
are those where every element in {1, 2, 3, 6, 7, 8} is mapped to either 1 or
2, and there are only 2 ways that this can occur. Therefore the number of
surjective functions f : {1, 2, 3, 6, 7, 8} {1, 2} is 64 2 = 62 ways.
7. Determine the number of onto functions f : {1, 2, 3, 4, 5} {2, 1, 0, 1}
such that f (1) = 2, f (2) = 1, and f (3) = 1.
Answer:
The number of surjective functions with this constraint is 7. Since the only
elements of {1, 2, 3, 4, 5} that need to be taken into consideration are 4 and
5 and one of them must be mapped to 0, we have a total of 4 choices when
the image of 4 under f is 0 and 4 choices when the image of 5 under f
is 0. However, the mapping containing 4 and 5 both being mapped to 0
is counted twice and must be subtracted. Therefore the total number of
surjective functions f : {1, 2, 3, 4, 5} {2, 1, 0, 1} such that f (1) = 2,
f (2) = 1, and f (3) = 1 is 7.