3al15_2016.pdf

# 3al15_2016.pdf - 1/31 1 Lecture 13 Sequences Finale and...

• 31

This preview shows pages 1–8. Sign up to view the full content.

1/31 1 Lecture 13 Sequences Finale and Topology of R Sequences Finale Topology of R 2 Lecture 14 Topology of R II 3 Lecture 15 Topology of R III Instructor: David Earn Mathematics 3A03 Real Analysis I

This preview has intentionally blurred sections. Sign up to view the full version.

2/31 Thinking About Graduate School? Come find out more at the Grad Info Session! When: Wednesday, October 19, 2016 Time: 4:00 pm – 5:00 pm Where: HH 302 and the Math Café Bartosz Protas and Roman Viveros will talk about graduate programs in Math and Stats, Computational Science and Engineering at McMaster and elsewhere. Miroslav Lovric will also talk about applying to teachers’ college. Current grad students will be present to talk about life in grad school. PIZZA will be served! See you there! Instructor: David Earn Mathematics 3A03 Real Analysis I
Lecture 13 Sequences Finale and Topology of R 3/31 Mathematics and Statistics Z M d ω = Z M ω Mathematics 3A03 Real Analysis I Instructor: David Earn Lecture 13 Topology of R Wednesday 5 October 2016 Instructor: David Earn Mathematics 3A03 Real Analysis I

This preview has intentionally blurred sections. Sign up to view the full version.

Lecture 13 Sequences Finale 4/31 Sequences Finale! Instructor: David Earn Mathematics 3A03 Real Analysis I
Lecture 13 Sequences Finale 5/31 Countability Sequences { s n } n =1 are generalizations of the intuitive notion of sets whose elements can be counted. Definition (Countable set) A set is countable if it is finite or is the range a sequence. A set that is not countable is uncountable . Theorem The natural numbers N are countable. (solution on board) Theorem The rational numbers Q are countable. (solution on board) What about R ?. . . Instructor: David Earn Mathematics 3A03 Real Analysis I

This preview has intentionally blurred sections. Sign up to view the full version.

Lecture 13 Sequences Finale 6/31 Countability Theorem (Cantor) The real numbers R are uncountable. (solution on board) Notes : The main argument in the proof is known as “Cantor’s diagonal argument”. We can infer that not only are some real numbers not rational, but there are “many more” real numbers than rational numbers. Cantor’s proof depends on there being a binary expansion for any real number number. . . Instructor: David Earn Mathematics 3A03 Real Analysis I
Lecture 13 Sequences Finale 7/31 Countability Theorem (Existence and uniqueness of binary expansions) If x [0 , 1) then there is a sequence { a n } such that a n ∈ { 0 , 1 } ∀ n and x = X n = 1 a n 2 n . Specifically, a n = \$ x - n - 1 X i = 1 a i 2 i !

This preview has intentionally blurred sections. Sign up to view the full version.

This is the end of the preview. Sign up to access the rest of the document.
• Fall '13

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern