Scribd
Upload
24 views5 pages

Math330Su22MockExam1_1SOLUTIONS (1)

The document consists of solutions to various mathematical problems, including set theory, relations, functions, and logical equivalences. Key findings include the properties of certain sets and functions, the nature of relations defined on integers, and the demonstration of equivalence relations on real numbers. Additionally, the document explores the concepts of injectivity, surjectivity, and the implications of these properties in different contexts.

Uploaded by

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

Math330Su22MockExam1_1SOLUTIONS (1)

The document consists of solutions to various mathematical problems, including set theory, relations, functions, and logical equivalences. Key findings include the properties of certain sets and functions, the nature of relations defined on integers, and the demonstration of equivalence relations on real numbers. Additionally, the document explores the concepts of injectivity, surjectivity, and the implications of these properties in different contexts.

Uploaded by

alin186
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Mock Exam 1.

SOLUTIONS

Problem 1: Determine which of the following statements are true and


which are false. If they are true, give a short argument as to why. If they
are false, provide a counterexample or a reason why:

1. (A ∪ B) ∩ B = B for sets A, B.

2. f : R → R defined by f (x) = x5 + x3 + x is 1 − 1.

3. B − (B − A) = A for sets A, B where X − Y is set difference.

4. If A ⊆ B and C ⊆ D then A × C ⊆ B × D where A, B, C, D are sets.

1. This is true. Obviously (A ∪ B) ∩ B ⊆ B by definition of ∩. If x ∈ B


then x ∈ A ∪ B by definition of ∪ and so x ∈ (A ∪ B) ∩ B showing that
B ⊆ (A ∪ B) ∩ B, and so the two sets are equal.

2. f is differentiable and f ′ (x) = 5x4 + 3x2 + 1 ≥ 1 for all x. So f is


strictly increasing and hence 1 − 1.

3. This is false: let A = {1}, B = {2}. Then B − (B − A) = {2} − ({2} −


{1}) = {2} − {2} = ∅ = ̸ A.

4. This is true. Let (x, y) ∈ A × C. Then by definition of product x ∈


A, y ∈ C. But then x ∈ B and y ∈ D by definition of subset, and so
(x, y) ∈ B × D.

Problem 2: Define a relation S on the set Z as follows: aSb iff ab ≥ 0.


Determine if S is reflexive, symmetric, antisymmetric, and/or transitive.

Let a ∈ Z. Then since a · a ≥ 0 we know that aSa is true and so S is


reflexive. For a, b ∈ Z we know that ab ≥ 0 iff ba ≥ 0 and so aSb iff bSa and
S is symmetric. On the other hand, since 1S2 and 2S1 is true, but 1 ̸= 2, we

1
see that S is not antisymmetric. 2S0 and 0S(−2) but it’s false that 2S(−2)
and so S is not transitive.

Problem 3a: Show that the function f : Z × Z → Z defined by


f ((a, b)) = ab + b is onto/surjective.
To show that f is onto, let y ∈ Z. We need to find a, b so that f (a, b) =
(a + 1)b = y. One such solution is to set a = 0, b = y.
3b: Show that f is NOT 1-1/injective.
We see that f (a, 0) = 0 for every a ∈ Z so clearly f is not injective.

Problem 4: Let X = {1, 2, 3} and let

R = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 1), (1, 3)}.
Find R−1 and R ◦ R. Determine if R satisfies the indicated property making
sure to support your reasoning:

1. Reflexive

2. Transitive

3. Symmetric

4. Antisymmetric

R−1 = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 1), (1, 3)} = R,
R ◦ R = {(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3)}

1. (3, 3) ∈
/ R so it is not reflexive.

2. (1, 3) ∈ R and (3, 1) ∈ R but (3, 3) ∈


/ R so it is not transitive; we also
see that R ◦ R is not a subset of R.

3. We see that if (x, y) ∈ R that (y, x) ∈ R by inspection, so it is sym-


metric; we also see that R = R−1 .

2
4. We have (1, 2) ∈ R and (2, 1) ∈ R but 1 ̸= 2, so it is not antisymmetric.

Problem 5a: Let g : A → B where A = {1, 2, 3, 4} and B = {w, x, y, z}


be given by g(1) = w, g(2) = z, g(3) = w, g(4) = y. Find the following sets if
they are well defined; if they aren’t well defined give a reason:

1. g({1, 2, 4})

2. g −1 ({w, x})

3. g −1 (g({1}))

4. g(g −1 ({1}))

1. The image is {w, z, y}

2. The preimage is {1, 3}. Note that g −1 (x) = ∅.

3. g(1) = w so we are finding g −1 (w) = {1, 3}

4. 1 is not in the codomain of g so this does not make sense.

√
Problem 5b:√ Let j : A → R where A = [1, 50] and j(x) = x. For
example, j(2) = 2.
Find the following sets if they are well defined; if they aren’t well defined
give a reason:

1. j({1, 4, 9})

2. j −1 ({2, 4, 7})

3. j −1 ({−1})

4. j(j −1 ([−1, 4))

1. The image is {1, 2, 3}

3
2. The preimage is {4, 16, 49}

3. −1 ̸∈ im(j) so j −1 ({−1}) = ∅

4. j −1 ((−1, 4)) = j −1 ((−1, 1)) ∪ j −1 ([1, 4)) = ∅ ∪ [1, 16) so


j(j −1 ([−1, 4)) = j([1, 16)) = [1, 4)

Problem 6: Let h : X → R where X = [0, 1] ∪ [2, 3) be given by the


formula

x 0≤x≤1
h(x) =
4−x 2≤x<3
Prove that h has a left inverse. You do not need to explicitly find a left
inverse (though it is good practice...).
We show that h is 1 − 1 and hence has a left inverse. Note that h([0, 1]) =
[0, 1] and h([2, 3)) = (1, 2] so if h(x1 ) = h(x2 ), x1 , x2 must either both be in
[0, 1] or (1, 2]. But clearly h restricted to each interval is 1 − 1.

Problem 7: Let P, Q, R be statements. Show that the following two


compound statements are logically equivalent without using a truth table:

P =⇒ (Q ∧ ¬R)
and
¬(P ∧ (¬Q ∨ R)).

This can be established via a (huge) truth table. But we will use the
following equivalences: a =⇒ b iff ¬a ∨ b as well as ¬(a ∧ b) iff ¬a ∨ ¬b...
P =⇒ (Q ∧ ¬R) is hence equivalent to ¬P ∨ (Q ∧ ¬R) which is in turn
equivalent to ¬(P ∧ ¬(Q ∧ ¬R)). The latter is equivalent to ¬(P ∧ (¬Q ∨ R))
as desired.

Problem 8: Let ∼ be the relation on the set of real numbers R given


by x ∼ y iff x − y ∈ Z. Prove that this is an equivalence relation. What is
[0]? How is this related to [−130]?

4
Let x ∈ R. We have x ∼ x iff x − x ∈ Z. But x − x = 0 is an integer and
so ∼ is reflexive. Suppose that x ∼ y for some x, y ∈ R. Then x − y = k
for some integer k ∈ Z. But then y − x = −(x − y) = −k ∈ Z as well and
so y ∼ x, and so ∼ is symmetric. Lastly, suppose that we have x ∼ y and
y ∼ z for x, y, z ∈ R. Then ∃k, l ∈ Z so that x − y = k, y − z = l. But
then x − z = (x − y) + (y − z) = k + l ∈ Z as well and so x ∼ z and ∼ is
transitive. Since ∼ is reflexive, symmetric, and transitive it is an equivalence
relation. [0] = Z since [0] = {x ∈ R : x ∼ 0} = {x ∈ R : x ∈ Z}. Since
−130 ∈ Z = [0] we know [−130] = [0].

You might also like