Scribd
Upload
89 views6 pages

MATH 521 Exam I October 8th, 2018, 5:30pm-7pm

This document contains the instructions and problems for a MATH 521 exam. The exam is 90 minutes and contains 5 problems worth a total of 100 points. Problem 1 asks students to identify sets as finite, countable, or uncountable. Problem 2 asks students to identify statements about sets as true or false. Problem 3 contains parts asking students to prove statements and identify properties of sets. Problems 4 and 5 ask students to prove corollaries and statements about sets.

Uploaded by

Jose Martinez
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
89 views6 pages

MATH 521 Exam I October 8th, 2018, 5:30pm-7pm

This document contains the instructions and problems for a MATH 521 exam. The exam is 90 minutes and contains 5 problems worth a total of 100 points. Problem 1 asks students to identify sets as finite, countable, or uncountable. Problem 2 asks students to identify statements about sets as true or false. Problem 3 contains parts asking students to prove statements and identify properties of sets. Problems 4 and 5 ask students to prove corollaries and statements about sets.

Uploaded by

Jose Martinez
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/ 6

Name:

MATH 521 Exam I

October 8th, 2018, 5:30pm–7pm.


Instructions and Notes:

• This exam is 90 minutes long.

• This is a closed-book, closed-note exam. You may not use phones, calculators, or any other elec-
tronics or aids of any kind.

• There are 5 questions on the exam, roughly in increasing order of difficulty.

• The exam will be scored out of 100 points. However, you may earn up to 110 points if you answer
all questions correctly.

• Write your answer for each problem on the same page as the problem statement, below the problem
statement.

• All proofs should be written in complete sentences that make sense when read aloud.

• Write only your solutions on the exam; scratch work should be written on scratch paper. However,
any scratch paper you use should be turned in with the exam.

• Unless explicitly noted otherwise, you may use any result that has been proven in class, or which
appears in the first two chapters of Rudin’s book (this excludes exercises in Rudin).

• Unless explicitly stated otherwise, Rk is always considered as a metric space with the Euclidean
metric
v
u k
uX
d(x, y) = |x − y| = t (xj − yj )2 where x = (x1 , . . . , xk ), y = (y1 , . . . , yk ).
j=1

Problem # Score Points Possible


1 15
2 18
3 45
4 16
5 16
Total 100

1
1. (15 points) For each of the following sets, state whether they are finite, countable, or uncountable.
You do not need to prove your answers. (3 points each, no partial credit.)
(a) {x ∈ R : 0 < x < 1}.
(b) {x ∈ Q : 0 < x < 1}.
(c) The collection of all possible functions f : N → {2, 3, 4}.
(d) The collection of all possible functions f : {2, 3, 4} → N.
(e) The collection of all possible functions f : C → D, where C and D are finite sets.

For each part, circle either ‘Finite’, ‘Countable’, or ‘Uncountable’.

(a) Finite Countable Uncountable

(b) Finite Countable Uncountable

(c) Finite Countable Uncountable

(d) Finite Countable Uncountable

(e) Finite Countable Uncountable

2
2. (18 points) For each j ∈ N, let aj and bj be real numbers. Assume that for all j ∈ N, we have

• aj < 0 < bj (i.e., the aj s are all negative, the bj s are all positive),

• bj < bj+1 (i.e., the bj s are increasing as j increases).

Define the following subsets of R:


∞
\ ∞
[ ∞
\ ∞
[
A= (aj , bj ), B= (aj , bj ), C= [aj , bj ], D= [aj , bj ],
j=1 j=1 j=1 j=1

State whether the following assertions are true or false. You do not need to justify your answers (3 points
each, no partial credit.)

(a) The set of numbers aj has a greatest lower bound α in R, and α ∈ D.


(b) The set of numbers aj has a least upper bound β in R, and β ∈ C.
(c) A is open.
(d) C is compact.
(e) B is not bounded.
(f) B = D.

For each part, circle either ‘True’ or ‘False’.

(a) True False

(b) True False

(c) True False

(d) True False

(e) True False

(f) True False

3
3. (45 points) Consider the ray A = (−∞, 0) = {x ∈ R : x < 0}, and define B = A ∪ N. Recall
that if C is any subset of a metric space (X, d), then C 0 denotes the set of all limit points of C in X.

(a) (12 points) Prove that 0 is a limit point of B.


(b) (8 points) Prove that 5 is an isolated point of B.

For parts (c-f), you do not need to prove that your answers are correct.
(c) (5 points, no partial credit) What is B 0 ?
(d) (8 points) Give an example of an open cover of B in R which has no finite subcover.
(e) (7 points, no partial credit) Give an example of an infinite subset of B that has no limit point in B.
(f) (5 points, no partial credit) Does there exist a bijection f : A → B? Answer ‘Yes’ or ‘No’.

4
4. (16 points) Recall the following Theorem from class:

Theorem 0.1. Let (X, d) be a metric space and assume E ⊂ Y ⊂ X. Then E is open in Y if and only
if there exists an open set G of X such that E = Y ∩ G.

Use the Theorem above to prove the following Corollary:

Corollary 0.2. Let (X, d) be a metric space and assume E ⊂ Y ⊂ X. Assume additionally that Y is
open in X. Then E is open in Y if and only if E is open in X.

(Partial credit: 8 points for the “if” implication, 8 points for the “only if” implication.)

5
5. (16 points) Let (X, d) be a metric space and let E be a subset of X. Recall the following two facts
about E that were proved in class:

• Fact 1: E is closed in X

• Fact 2: If A is a closed set of X and A contains E, then A contains E as well.

Let F denote the collection of all closed sets which contain E:

F = {F ⊂ X : F is closed in X and F ⊃ E}.

Define \
G= F.
F ∈F

Using Fact 1 and Fact 2, show that E = G.


(Partial credit: 8 points for showing E ⊂ G, 8 points for showing E ⊃ G.)

You might also like