0% found this document useful (0 votes)
36 views2 pages

MIT18 100BF10 Pset5

This document is the homework assignment for the course 18.100B Analysis I. It contains 5 problems: 1. Show that the human ancestry relation is reflexive and symmetric but not transitive. 2. For a Cauchy sequence in the rational numbers that does not converge to 0, show that its terms are eventually bounded away from 0 and constant in sign for large indices, and that the reciprocal sequence is also Cauchy. 3. Solve problem 4 on page 78 of Rudin regarding subsequences of a sequence. 4. Show that the definition of limit inferior from lectures agrees with Rudin's definition. 5. Show that the relation of finite symmetric difference on subsets of the natural

Uploaded by

rohitkyadav0999
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
0% found this document useful (0 votes)
36 views2 pages

MIT18 100BF10 Pset5

This document is the homework assignment for the course 18.100B Analysis I. It contains 5 problems: 1. Show that the human ancestry relation is reflexive and symmetric but not transitive. 2. For a Cauchy sequence in the rational numbers that does not converge to 0, show that its terms are eventually bounded away from 0 and constant in sign for large indices, and that the reciprocal sequence is also Cauchy. 3. Solve problem 4 on page 78 of Rudin regarding subsequences of a sequence. 4. Show that the definition of limit inferior from lectures agrees with Rudin's definition. 5. Show that the relation of finite symmetric difference on subsets of the natural

Uploaded by

rohitkyadav0999
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/ 2

18.

100B : Fall 2010 : Section R2


Homework 5
Due Tuesday, October 12, 1pm

Reading: Tue Oct.5 : completeness, Rudin 3.8-20


Thu Oct.7 : construction of the real numbers, notes

1 . Let H be the set of all human beings (past and present). Let R be the usual family relation
on H; that is, for h, k ∈ H we have (h, k) ∈ R if and only if h and k have a common
ancestor. Show that R is reflexive and symmetric, but not transitive.

2 . (a) Let (an ) be a Cauchy sequence in Q, such that an does not converge to 0. Show that
there is an ω > 0 and an N ∈ N so that |an | > ω for all n ≥ N. Moreover, show that
the sign of an is constant for large n.
(b) Following part (a), show that if (an ) is a Cauchy sequence in Q that does not converge
to 0, then (1/an ) is a Cauchy sequence in Q. [Remark: it would be tempting to solve this
problem by noting that, thinking of (an ) living in the bigger complete metric space R,
we can replace the word ”Cauchy” by ”convergent”, which makes for an easy proof.
That is not the intention of the problem; you should work directly within Q.]

3 . Problem 4, p. 78 in Rudin. (Hint: consider the two subsequences given by the odd and
even terms – you can find relations between the lim sup of these two.)

4 . Let (sn )n∈N be a sequence in R. Show that the definition of lim inf in the lecture coincides
with the s∗ of Rudin 3.16. In the lecture, we defined

⎨ n→∞ inf{sk | k ≥ n} ; if limit of infima exists,
⎪lim
lim inf sn := −∞ ; if (sn ) is not bounded below;
n→∞ ⎪
∞ ; if sn → ∞.

5 . Let P(N) denote the set of all subsets of N. Define a relation D on P(N) as follows:
(A, B) ∈ D if the symmetric difference
AΔB := (A ∪ B) \ (A ∩ B)
is finite. (That is: A and B only differ by finitely many numbers.)
(a) Show that D is an equivalence relation.
(b) Show that all finite subsets of N are in the same equivalence class of D.
(c) Show that each equivalence class of D is a countable family of subsets.
(n)
[Hint: fix any subset A0 ∈ P(N), and for each n ∈ N consider the classes A0 =
(n)
{A ⊆ N ; A differs from A0 by n numbers}. Show that A0 is countable, and that the
(n)
equivalence class [A0 ]D is the union of the countably-many A0 .]
not for credit: Conclude that there are uncountably many equivalences classes of D.
MIT OpenCourseWare
http://ocw.mit.edu

18.100B Analysis I
Fall 2010

For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

You might also like