Scribd
Upload
86 views2 pages

18.100C Lecture 1 Summary

This lecture summary discusses sets, ordered sets, and countable sets. It defines the concepts of maximum, minimum, finite sets, and countable sets. It then presents several theorems: that any subset of the natural numbers is either finite or countable; that the union of two countable sets is countable; that the natural numbers squared and the Cartesian product of two countable sets are countable; and that the union of countably many countable sets is countable. It uses these theorems to show that the integers and product of countable sets are countable.

Uploaded by

Lionel Carlos
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
86 views2 pages

18.100C Lecture 1 Summary

This lecture summary discusses sets, ordered sets, and countable sets. It defines the concepts of maximum, minimum, finite sets, and countable sets. It then presents several theorems: that any subset of the natural numbers is either finite or countable; that the union of two countable sets is countable; that the natural numbers squared and the Cartesian product of two countable sets are countable; and that the union of countably many countable sets is countable. It uses these theorems to show that the integers and product of countable sets are countable.

Uploaded by

Lionel Carlos
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.

100C Lecture 1 Summary

Sets. Ordered sets. Examples. Ordering pairs of numbers. Largest element


(maximum) and smallest element (minimum) of a subset of an ordered set.
Fact 1.1. Every nonempty subset of N has a least element.
Finite sets. Countable sets.
Theorem 1.2. Any subset of N is either nite or countable.
Hence, any subset of a countable set is nite or countable.
Theorem 1.3. If S1 and S2 are countable, S1 S2 is countable.
Hence, Z is countable.
Theorem 1.4. N2 is countable.
Corollary 1.5. If S1 and S2 are countable, S1 S2 is countable.

Corollary 1.6. If S1 , S2 , . . . are countable sets, k=1 Sk is countable.

MIT OpenCourseWare
http://ocw.mit.edu

18.100C Real Analysis


Fall 2012

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

You might also like