Consequences of the Completeness Property

Similar documents
2.2 Some Consequences of the Completeness Axiom

Testing Series with Mixed Terms

Representation of Functions as Power Series

Review of Functions. Functions. Philippe B. Laval. Current Semester KSU. Philippe B. Laval (KSU) Functions Current Semester 1 / 12

The Cross Product. Philippe B. Laval. Spring 2012 KSU. Philippe B. Laval (KSU) The Cross Product Spring /

Lecture 2. Econ August 11

5.5 Deeper Properties of Continuous Functions

Due date: Monday, February 6, 2017.

Important Properties of R

Structure of R. Chapter Algebraic and Order Properties of R

Relationship Between Integration and Differentiation

6.2 Deeper Properties of Continuous Functions

106 CHAPTER 3. TOPOLOGY OF THE REAL LINE. 2. The set of limit points of a set S is denoted L (S)

Studying Rudin s Principles of Mathematical Analysis Through Questions. August 4, 2008

MATH202 Introduction to Analysis (2007 Fall and 2008 Spring) Tutorial Note #7

Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers

1. Theorem. (Archimedean Property) Let x be any real number. There exists a positive integer n greater than x.

Describing the Real Numbers

Functions of Several Variables

REAL ANALYSIS: INTRODUCTION

Integration. Darboux Sums. Philippe B. Laval. Today KSU. Philippe B. Laval (KSU) Darboux Sums Today 1 / 13

The Real Number System

1 The Real Number System

Functions of Several Variables: Limits and Continuity

Introduction to Vector Functions

Chapter One. The Real Number System

The Laplace Transform

Functions of Several Variables

Differentiation - Important Theorems

Week 2: Sequences and Series

Introduction to Vector Functions

Chapter 1 The Real Numbers

Differentiation - Quick Review From Calculus

Analysis III. Exam 1

The Laplace Transform

THE REAL NUMBERS Chapter #4

5.5 Deeper Properties of Continuous Functions

That is, there is an element

In N we can do addition, but in order to do subtraction we need to extend N to the integers

Differentiation and Integration of Fourier Series

Integration Using Tables and Summary of Techniques

MATH 117 LECTURE NOTES

Math 320-2: Midterm 2 Practice Solutions Northwestern University, Winter 2015

Section 2.5 : The Completeness Axiom in R

Sequences: Limit Theorems

Cauchy Sequences. x n = 1 ( ) 2 1 1, . As you well know, k! n 1. 1 k! = e, = k! k=0. k = k=1

Sequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.

HW 4 SOLUTIONS. , x + x x 1 ) 2

MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 2: Countability and Cantor Sets

POL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005

2.4 The Extreme Value Theorem and Some of its Consequences

Walker Ray Econ 204 Problem Set 3 Suggested Solutions August 6, 2015

5 Set Operations, Functions, and Counting

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Lagrange s Theorem. Philippe B. Laval. Current Semester KSU. Philippe B. Laval (KSU) Lagrange s Theorem Current Semester 1 / 10

MATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals

Continuity. Chapter 4

Set Notation and the Real Numbers

Homework 1 (revised) Solutions

1 The Well Ordering Principle, Induction, and Equivalence Relations

Midterm Review Math 311, Spring 2016

MA103 Introduction to Abstract Mathematics Second part, Analysis and Algebra

Continuity. Chapter 4

M208 Pure Mathematics AA1. Numbers

1 More concise proof of part (a) of the monotone convergence theorem.

Essential Background for Real Analysis I (MATH 5210)

4130 HOMEWORK 4. , a 2

Introduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION

Metric Spaces and Topology

A LITTLE REAL ANALYSIS AND TOPOLOGY

Foundations of Mathematical Analysis

1.3. The Completeness Axiom.

Properties of the Integers

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.

Lecture 4: Completion of a Metric Space

The Lebesgue Integral

2. Two binary operations (addition, denoted + and multiplication, denoted

Consequences of Orthogonality

Arc Length. Philippe B. Laval. Today KSU. Philippe B. Laval (KSU) Arc Length Today 1 / 12

Foundations of Mathematical Analysis

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

Real Analysis Notes. Thomas Goller

DR.RUPNATHJI( DR.RUPAK NATH )

Sequences CHAPTER 3. Definition. A sequence is a function f : N R.

3 Measurable Functions

Class VIII Chapter 1 Rational Numbers Maths. Exercise 1.1

In N we can do addition, but in order to do subtraction we need to extend N to the integers

1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty.

Lecture Notes in Real Analysis Anant R. Shastri Department of Mathematics Indian Institute of Technology Bombay

Sets, Structures, Numbers

3.1 Basic properties of real numbers - continuation Inmum and supremum of a set of real numbers

We have been going places in the car of calculus for years, but this analysis course is about how the car actually works.

Numerical Sequences and Series

18.175: Lecture 2 Extension theorems, random variables, distributions

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS

Math 5052 Measure Theory and Functional Analysis II Homework Assignment 7

3 Lecture Separation

Introduction to Vector Functions

Relations. Relations. Definition. Let A and B be sets.

1 Definition of the Riemann integral

Transcription:

Consequences of the Completeness Property Philippe B. Laval KSU Today Philippe B. Laval (KSU) Consequences of the Completeness Property Today 1 / 10

Introduction In this section, we use the fact that R is complete to establish some important results. First, we will prove that Z is unbounded and establish the Archimedean principle. Second, we will prove that the rational numbers are dense in R. Finally, we will prove that Q is not complete. Philippe B. Laval (KSU) Consequences of the Completeness Property Today 2 / 10

Z Unbounded We first establish that Z is unbounded. While this result seems obvious, it turns out that it is not as easy to prove. It depends upon the completeness property of R. We establish this result by proving several lemmas and then use these lemmas to establish the main result. Lemma Every non-empty subset S of the integers which is bounded above has a largest element. How might we prove this? Philippe B. Laval (KSU) Consequences of the Completeness Property Today 3 / 10

Z Unbounded We first establish that Z is unbounded. While this result seems obvious, it turns out that it is not as easy to prove. It depends upon the completeness property of R. We establish this result by proving several lemmas and then use these lemmas to establish the main result. Lemma Every non-empty subset S of the integers which is bounded above has a largest element. How might we prove this? Let S be the subset in question, what can we say about S (remembering what we did before this)? Philippe B. Laval (KSU) Consequences of the Completeness Property Today 3 / 10

Z Unbounded We first establish that Z is unbounded. While this result seems obvious, it turns out that it is not as easy to prove. It depends upon the completeness property of R. We establish this result by proving several lemmas and then use these lemmas to establish the main result. Lemma Every non-empty subset S of the integers which is bounded above has a largest element. How might we prove this? Let S be the subset in question, what can we say about S (remembering what we did before this)? Let w = sup S. How can we prove max S exists? Philippe B. Laval (KSU) Consequences of the Completeness Property Today 3 / 10

Z Unbounded We first establish that Z is unbounded. While this result seems obvious, it turns out that it is not as easy to prove. It depends upon the completeness property of R. We establish this result by proving several lemmas and then use these lemmas to establish the main result. Lemma Every non-empty subset S of the integers which is bounded above has a largest element. How might we prove this? Let S be the subset in question, what can we say about S (remembering what we did before this)? Let w = sup S. How can we prove max S exists? How can we relate w with elements of Z at this point? Philippe B. Laval (KSU) Consequences of the Completeness Property Today 3 / 10

Z Unbounded Remark The above lemma looks very similar to the least upper bound property. But its conclusion is quite different. Lemma Every non-empty subset S of the integers which is bounded below has a smallest element. Theorem Z is unbounded both above and below. We are now ready to state the Archimedean principle. We state two versions of it. Philippe B. Laval (KSU) Consequences of the Completeness Property Today 4 / 10

Archimedean Principle Theorem For each strictly positive real number x, there exists a positive integer n such that 1 n < x. Hint for the proof: Since Z is unbounded, what can we say about 1 x? Philippe B. Laval (KSU) Consequences of the Completeness Property Today 5 / 10

Archimedean Principle Theorem For each strictly positive real number x, there exists a positive integer n such that 1 n < x. Hint for the proof: Since Z is unbounded, what can we say about 1 x? What can t 1 x be to Z if Z is unbounded? Philippe B. Laval (KSU) Consequences of the Completeness Property Today 5 / 10

Archimedean Principle Theorem For each strictly positive real number x, there exists a positive integer n such that 1 n < x. Hint for the proof: Since Z is unbounded, what can we say about 1 x? What can t 1 be to Z if Z is unbounded? x What does this imply? Philippe B. Laval (KSU) Consequences of the Completeness Property Today 5 / 10

Archimedean Principle Remark This theorem tells us that by choosing n large enough, we can make 1 as close to 0 as we want. In other words, { n } 1 inf n : n Z+ = 0 where Z + denotes the set of positive integers. We will prove this in the exercises. Theorem If x and y are real numbers, x > 0, then there exists a positive integer n such that nx > y. Philippe B. Laval (KSU) Consequences of the Completeness Property Today 6 / 10

Denseness We have already mentioned the fact that if we represented the rational numbers on the real line, there would be many holes. These holes would correspond to the irrational numbers. If we think of the rational numbers as dots on the real line and the irrational numbers as holes, one might ask how the holes are distributed with respect to the dots. The next concept gives us a partial answer. Definition A subset S of R is said to be dense in R if between any two real numbers there exists an element of S. Another way to think of this is that S is dense in R if for any real numbers a and b such that a < b, we have S (a, b). Theorem Q is dense in R. That is, between any two real numbers, there exists a rational number. Philippe B. Laval (KSU) Consequences of the Completeness Property Today 7 / 10

Denseness We outline the proof. Write what we have to prove. Philippe B. Laval (KSU) Consequences of the Completeness Property Today 8 / 10

Denseness We outline the proof. Write what we have to prove. a, b R, a < b, m, n Z, n 0 : a < m n Archimedean principle to b a. < b. Apply the Philippe B. Laval (KSU) Consequences of the Completeness Property Today 8 / 10

Denseness We outline the proof. Write what we have to prove. a, b R, a < b, m, n Z, n 0 : a < m < b. Apply the n Archimedean principle to b a. Let S = {x Z : x } n > a. Prove that S is bounded below and not empty. What does it imply? Philippe B. Laval (KSU) Consequences of the Completeness Property Today 8 / 10

Denseness We outline the proof. Write what we have to prove. a, b R, a < b, m, n Z, n 0 : a < m < b. Apply the n Archimedean principle to b a. Let S = {x Z : x } n > a. Prove that S is bounded below and not empty. What does it imply? Put everything together to finish the proof. Philippe B. Laval (KSU) Consequences of the Completeness Property Today 8 / 10

Completeness Definition A set S is said to be complete if every non-empty bounded subset of S has both a supremum and an infimum in S. Example R is complete. Example [0, 1] is complete while (0, 1) is not. Example Q is not complete. Hint, Let S = ( 0, 2 ) Q. Show 2 = sup S. Philippe B. Laval (KSU) Consequences of the Completeness Property Today 9 / 10

Exercises See the problems at the end of my notes on some consequences of the completeness property of R. Philippe B. Laval (KSU) Consequences of the Completeness Property Today 10 / 10