Milestone homework # 4

Math 283
Lyndsae Vine
April 21, 2014
lyndsaeavine@me.com
9
Each of the following statements is either true or false. If a statement is true, prove it. If a
statement is false, disprove it. These exercises are cumulative, covering all topics addressed
in Chapters 1 through 9.
#14. If A and B are sets, then P(A) P(B) = P(A B).
Proof. Let A and B be sets. First we will show that P(A)P(B) P(AB). Without loss
of generality, let set X be an arbitrary element belonging to P(A B). By the denition
of power set, every element belonging to set X also belongs to the set A B. So, every
element of X is also an element of A according to the denition of set intersect. Hence, X
is an element of P(A), by the denition of power set. Similarly, every element of X is an
element of B, and hence X is a member of P(B). Since X is an element of both P(A) and
P(B), we know that X is an element of P(A) P(B) according to the denition of set
intersect. Therefore, every element of P(A B) is an element of P(A) and P(B).
#28. Suppose a, b Z. If a|b and b|a, then a = b.
Proof. Let a and b be integers. Suppose a|b and b|a. Then, by denition of divides, there
exist integers j and k such that b = aj and a = bk, where a = 0 and b = 0. Substituting
for a into the equation b = aj we have, b = aj = (bk)j = b(kj) Since b = b(kj) and b = 0,
we can conclude kj = 1. That is, k = j = 1. Substituting 1 in for k and j into the two
equations b = aj and a = bk both yield a = b. Thus the statement is true.
10 Use the method of contrapositive proof to prove the following statements. (In each case
you should also think about how a direct proof would work. You will nd in most cases that
contrapositive is easier.)
#18. Suppose A1, A2,... An are sets in some universal set U, and n 2. Prove that
A1[A2[[An = A12.
Proof. answer here
#20. Prove that (1 + 2 + 3 + + n)
2
= 1
3
+ 2
3
+ 3
3
+ + n
3
for every n N.
Proof. answer here
1
#26. Concerning the Fibonacci sequence, prove that ....
Proof. answer here
11.0
#2. Let A = {1, 2, 3, 4, 5, 6}. Write out the relation R that expreses | (divides) on A. Then
illustrate it with a diagram.
Solution:
R = {(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (2, 4), (2, 6), (3, 3), (3, 6)}.
#6. Congruence modulo 5 is a relation on the set A = Z. In this relation xRy means
x y(mod 5). Write out the set R in set-builder notation.
Solution:
R = {(x, y) Z Z : x y (mod 5)}
11.1 Use the methods introduced in this chapter to prove the following statements.
#4. Let A = {a, b, c, d}. Suppose R is the relation
R = {(a, a), (b, b), (c, c), (d, d), (a, b), (b, a), (a, c), (c, a), (a, d), (d, a), (b, c), (c, b), (b, d), (d, b), (c, d), (d, c)}.
Is R reexive? Symmetric? Transitive? If a property does not hold, say why.
Solution:
The relation R is reexive since xRx is true for all elements in A. The relation R is sym-
metric since xRy implies yRx for every x, y A. The relation R is transitive since xRy and
yRz implies xRz holds true for every x, y, z A.
#12. Prove that the relation | (divides) on the set Z is reexive and transitive.
Reexive: Let x Z. Since x = x 1 and 1 Z, it follows from the denition of divides
that x|x.
Transitive: Let x, y, z Z. Suppose x|y and y|z. Then, by denition of divides we have
y = xq and z = yk for some q, k Z. Substituting for y we have
z = yk = (xq)k = x(qk).
Since the integers are closed under multiplication, (qk) Z. Hence, by the denition of
divides, x|z.
2
11.2
#6. There are ve dierent equivalence relations on the set A = {a, b, c}. Describe them
all. Diagrams will suce.
Solution:
The ve dierent equivalence relations are the following:
{{a}, {b}, {c}}, {{a}, {b, c}}, {{b}, {a, c}}, {{c}, {a, b}},{{a, b, c}}.
#8. Dene a relation R on Z as xRy if and only if x
2
+y
2
is even. Prove R is an equivalence
relation. Describe its equivalence classes.
Solution:
#10.Suppose R and S are two equivalence relations on a set A. Prove that RS is also an
equivalence relation.
Solution:
11.3
#2. List all the partitions of the set A = {a, b, c}. Compare your answer to the answer to
Exercise 6 of Section 11.2.
Solution:
Every partition of set A (listed below) corresponds to an equivalence relation on set A:
{{a}, {b}, {c}}, {{a}, {b, c}}, {{b}, {a, c}}, {{c}, {a, b}},{{a, b, c}}.
11.4
#4. Write the addition and multiplication tables for Z
6
.
Solution:
#8. Suppose [a], [b] Z
n
and [a] = [a

] and [b] = [b

]. Alice adds [a] and [b] as [a]+[b] = [a+b].

Bob adds them as [a

]+[b

] = [a

+b

]. Show that their answers [a+b] and [a

+b

] are the same.

Solution:
We want to show [a + b] is equal to [a

+ b

].
For [a] = [a

]
12.1
#4. There are eight dierent functions f : {a, b, c} {0, 1}. List them all. Diagrams will
suce.
3
Solution:
f
1
= {(a, 0), (b, 0), (c, 0)},
f
2
= {(a, 1), (b, 1), (c, 1)},
f
3
= {(a, 1), (b, 0), (c, 0)},
f
4
= {(a, 1), (b, 0), (c, 1)},
f
5
= {(a, 0), (b, 1), (c, 0)},
f
6
= {(a, 0), (b, 1), (c, 1)},
f
7
= {(a, 1), (b, 1), (c, 0)},
f
8
= {(a, 0), (b, 0), (c, 1)}
#10. Consider the set f = {(x
3
, x) : x R}. Is this a function from R to R? Explain.
Solution:
12.2
#6. A function f : ZZ Z is dened as f(m, n) = 3n 4m. Verify whether this function
is injective and whether it is surjective.
Solution:
The function f is not injective since it is possible to produce the same output with two
dierent inputs. Counterexample: f(0, 4) = 12 = f(3, 0). The function f is surjective
since any element in the domain can be mapped to an element in the range. This function
produces both even and odd integers due to the form of the output, 3n 4m. Because the
set of integers consist of even and odd integers, all the outputs in our range are mapped to
an element from the domain.
#10. Prove the function f : R {1} R {1} dened by f(x) =
x+1/x1
3
is bijective.
Solution:
#14 Consider the function : P(Z) P(Z) dened as (X) = X. Is injective? Is it
surjective? Bijective? Explain.
Solution:
12.3
#4. Consider a square whose side-length is one unit. Select any ve points from inside this
square. Prove that at least two of these points are within

(2)
2
units of each other.
Solution:
12.4
4
#2. Suppose A = {1, 2, 3, 4}, B = {0, 1, 2}, C = {1, 2, 3}. Let f : A B be f =
{(1, 0), (2, 1), (3, 2), (4, 0)}, and g : B C be g = {(0, 1), (1, 1), (2, 3)}. Find g f.
Solution:
g f = {(1, 1), (2, 1), (3, 3), (4, 1)}
#8. Consider the functions f, g : Z Z Z Z dened as f(m, n) = (3m 4n, 2m + n)
and g(m, n) = (5m + n, m). Find the formulas for g f and f g.
Solution:
g f = (17m19n, 3m4n)
f g = (11m + 3n, 11m + 2n)
12.5
#6. The function f : ZxZ ZxZ dened by the formula f(m, n) = (5m + 4n, 4m + 3n) is
bijective. Find its inverse.
Solution:
#8. Is the function : P(Z) P(Z) dened as (X) = X bijective? If so, what is its
inverse?
Solution:
5