Scribd
Upload
78 views1 page

HW1 Fall 2017

This document outlines 5 problems for an introductory real analysis problem set. The problems cover proving that the square root of 3 is irrational, showing there is no rational number r such that 2r=3, determining the truth value of statements about set relationships, constructing an infinite collection of disjoint sets with their union equal to the natural numbers, and proving De Morgan's laws for sets. An optional challenge problem discusses limits of using induction to prove statements for infinite sets.

Uploaded by

Srini Sundaravaradhan
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
78 views1 page

HW1 Fall 2017

This document outlines 5 problems for an introductory real analysis problem set. The problems cover proving that the square root of 3 is irrational, showing there is no rational number r such that 2r=3, determining the truth value of statements about set relationships, constructing an infinite collection of disjoint sets with their union equal to the natural numbers, and proving De Morgan's laws for sets. An optional challenge problem discusses limits of using induction to prove statements for infinite sets.

Uploaded by

Srini Sundaravaradhan
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/ 1

PROBLEM SET 1

INTRO TO REAL ANALYSIS

√ √
Problem 1. Prove that 3 is irrational. Does√a similar argument work to show that 6 is irra-
tional? Where does your proof break down for 9?
Problem 2. Show that there is no rational number r satisfying 2r = 3.
Problem 3. Decide which of the following represent true statements about the nature of sets. For
any that are false, provide a specific counterexample.
(a) If A1 ⊇ A2 T ⊇ A3 ⊇ A4 · · · are all sets containing an infinite number of elements, then the
∞
intersection n=1 An is infinite as well.
If A1 ⊇ A2 ⊇ A3 ⊇ A4 · · · are all finite, nonempty sets of real numbers, then the intersection
(b) T
∞
n=1 An is finite and nonempty.
(c) A ∩ (B ∪ C) = (A ∩ B) ∪ C.
(d) A ∩ (B ∩ C) = (A ∩ B) ∩ C.
(e) A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C).
Problem 4. Produce an infinite collection of sets A1 , A2 , A3 , . . . with
S∞ the property that every Ai
has an infinite number of elements, Ai ∩ Aj = ∅ for all i 6= j, and i=1 Ai = N.
Problem 5 (De Morgan’s Laws). Let A and B be subsets of R.
(a) If x ∈ (A ∩ B)c , explain why x ∈ Ac ∪ B c . This shows that (A ∩ B)c ⊆ Ac ∪ B c .
(b) Prove the reverse inclusion (A ∩ B)c ⊇ Ac ∪ B c , and conclude that (A ∩ B)c = Ac ∪ B c .
(c) Prove that (A ∪ B)c = Ac ∩ B c .

The following problem is optional. It will not contribute to or detract from your
grade, but you are encouraged to attempt it.

Challenge 1. (a) Show how induction can be used to conclude that


(A1 ∪ A2 ∪ · · · ∪ An )c = Ac1 ∩ Ac2 · · · ∩ Acn
for any finite n ∈ N.
(b) It is tempting to appeal to induction to conclude
∞
!c ∞
[ \
Ai = Aci ,
i=1 i=1
but induction does not apply here. In general, induction can only prove that a particular
statement holds for every value of n ∈ N, but this does not necessarily imply the T infinite case.
n
To illustrate this point, find a collection of sets
T∞ B1 , B2 , B3 , . . . where the statement i=1 Bi 6= ∅
is true for every n ∈ N, but the statement i=1 Bi 6= ∅ fails.
(c) Nevertheless, the infinite version of De Morgan’s Law stated in (b) is a valid statement. Provide
a proof that does not use induction.

*All questions taken from Understanding Analysis: 2nd Edition by Stephen Abbott.

Date: August 7, 2017.


1

You might also like