微积分讲义Chap Completeness axiom of R.docVIP

Chapter 1 The real number system 1.3. Completeness axiom of R 1.16 Definition Let and . (i).The set E is said to be bounded above if there is an s.t for all . (ii).A number M is called an upper bound of the set E if for all . (iii).A number S is called a supremum of the set E if S satisfies the following conditions (1) if , (2) if M is an upper bound of E then . Remark The supremum is also called the least upper bound. 1.17: Example If E=[0,1], prove that 1 is a supremum of E. Proof. 1. . 2. let M be an upper bound then for all . We derive the result. 1.18: Remark If a set has one upper bound, it has infinitely many upper bounds Proof:. Let E be a subset of R. Let for all . Then M is an upper bound. Let then M+b is also an upper bound. So, E has infinitely many upper bounds. 1.19 . Theorem. Let E be a nonempty subset of R. Then the least upper bound of E is unique if it exists. Proof. Suppose that are the least upper bounds of E. Then are upper bounds of E. . Notation The supremum is also called least upper bound . We use supE to denote the supremum of nonempty set E. 1.20. Theorem [Approximation property] exists. Then s.t . Proof:. Suppose the conclusion is false. There is an such that . is an upper bound. s.t 1.21. Theorem If has a supremum, then Proof. Let supE=s. By Approximation property, there s.t . If then is obvious. If , then s.t . 1. . 2. . It is a contradiction. ● [Complete axiom of R] Every nonempty subset E of R that is bounded above, then E has the least upper bound. . 1.22 :[Archimedean Principle] s.t bna. Proof: If ba, then take n=1. If ab , let . . E is bounded above. By Completeness of R, supE exists. take n=supE+1 1.23: Example. Let and prove that supA=supB =1