The Real Number System
|
|
- Barnaby Rose
- 6 years ago
- Views:
Transcription
1 MATH 337 The Real Number System Sets of Numbers Dr. Neal, WKU A set S is a well-defined collection of objects, with well-defined meaning that there is a specific description from which we can tell precisely whether or not an element is in S. The collection of large numbers does not constitute a well-defined set. The set P of prime numbers is well-defined: P is the collection of integers n that are greater than 1 for which the only positive divisors of n are 1 and n. So we can tell precisely whether or not an object is in P. For instance, 13 P but 14 P because 14 = 7 2. The set of rational numbers Q is also well-defined. A rational number is an expression of the form a / b, where a and b are integers with b 0. Two rational numbers a / b and c / d are said to be equal if and only if ad = bc. It is an easy exercise to show that the sum and product of two rational numbers are also rational numbers. The set of integers Z is a subset of Q because an integer n can be written as n / 1. Proposition 1.1. Let x and y be rational numbers with x < y. There exists another rational number z such that x < z < y. Proof. Let z = (x + y) / 2. Because x, y, and 1/2 are rational, x + y is rational, thus so is 1 2 ( x + y) = z. Moreover, x = 1 2 (x + x ) < 1 2 (x + y) < 1 (y + y) = y ; thus, x < z < y. QED 2 Existence of Irrational Numbers The Pythagorean Theorem states: In a right triangle, the square of the hypotenuse equals the sum of the squares of the other two sides. So if we let c be the length of the hypotenuse of a right triangle with two other sides of length 1, then c 2 = = 2. Thus, c is a positive number such that c 2 = 2; that is, c = 2, which exists as a physical length. But we have already proven using only facts about integers that 2 cannot be written as a ratio of integers. Thus, c is not a rational number; therefore we call it irrational. The set of real numbers R is now the union of the Rationals and Irrationals. Ordered Sets Definition 1.1. An order on a set S is a relation on S that satisfies two properties: (i) (Trichotomy) For all x, y S, exactly one of the following is true: x y or x = y or y x. (ii) (Transitive) For all x, y, z S, if x y and y z, then x z. We write x y to denote that either x y or x = y. Clearly is also transitive. That is, if x y and y z, then x z.
2 In general, x y is read as x precedes y thus indicating an ordering to the set. For example, let S be the set of standard lower-case English letters. Then a c, c f, and a f. We are most concerned with the ordering on the set of real numbers R, and its various subsets such as the natural numbers ℵ, the integers Z, and the rational numbers Q. The ordering used for these sets is the relation < (less than). For any two real numbers x and y, we say x < y if and only if 0 < y x (i.e., y x is positive). Then the relation < satisfies the two properties of an order. With numbers, we read x < y as x is less than y and x y is read as x is less than or equal to y. Definition 1.2. Let E be a non-empty subset of an ordered set S. We say that x is the least (first) element of E provided x E and x y for all other y E. We say that x is the greatest (last) element of E provided x E and y x for all other y E. Proposition 1.2. Let E = { x 1,..., x n } be a finite subset of n distinct elements from an ordered set. There exists a first (least) element and a last (greatest) element in E. Proof. If n = 1, then x 1 is both the least and greatest element in E. If n = 2, then the result follows from the Trichotomy axiom of order. Now assume the result holds for some n 2, and assume that x 1 is the least element and x n is the greatest element in E. Now consider the set E = { x 1,..., x n, x n+1 } with a new distinct element x n+1. If x n+1 x 1, then x n+1 is the least element and x n is the greatest element in E. If x 1 x n+1 x n, then x 1 is the least element and x n is the greatest element in E. If x n x n+1, then x 1 is the least element and x n+1 is the greatest element in E. With all cases being exhausted, we see that the result holds for a set of cardinality n + 1 provided it holds for a set of cardinality n. By induction, the proposition holds for all n 1. QED Upper and Lower Bounds Definition 1.3. Let E be a subset of an ordered set S. (a) We say that E is bounded above if there exists an element β in S such that x β for all x E. Such an element β is called an upper bound of E. (b) An element β in S is called the least upper bound of E or supremum of E, denoted by lub E or sup E, if (i) β is an upper bound of E and (ii) if λ is a different upper bound of E, then β λ. Note: Suppose β = sup E and λ β. Then λ cannot be an upper bound of E. Thus there must be an element x E such that λ x. { } Example 1.1. Let E = , , ,...,9 + n n + 1,... sup E = 10. R. We claim that
3 First, 9 + n n +1 < 9 + n + 1 = 10 for all integers n 1; thus, 10 is an upper bound of E. n + 1 Next, suppose λ is a different upper bound of E but λ < 10. Obviously 9 < λ or else it would not be an upper bound of E. Then 9 < λ < 10, which makes 0 < λ 9 < 1. n Because lim = 1, we can choose an integer n large enough such that n n + 1 λ 9 < n n < 1. But then λ < 9 + < 10, which contradicts the fact that λ is an n + 1 n + 1 upper bound of E. So we must have 10 < λ which makes 10 = sup E. Proposition 1.3. Let β be an upper bound of a subset E of an ordered set S. If β E, then β = sup E. Proof. Let λ be a different upper bound of E. Then either λ β or β λ due to the Trichotomy. But if λ β, then λ would not be an upper bound of E because β E. So we must have β λ. Therefore, β is the least upper bound of E. QED Definition 1.4. Let E be a subset of an ordered set S. (a) We say that E is bounded below if there exists an element α in S such that α x for all x E. Such an element α is called a lower bound of E. (b) An element α in S is called the greatest lower bound of E or infimum of E, denoted by glb E or inf E, if (i) α is a lower bound of E and (ii) if λ is a different lower bound of E, then λ α. Note: Suppose α = inf E and α λ. Then λ cannot be a lower bound of E. Thus there must be an element x E such that x λ. Example 1.2. Let E = { 1 / n n ℵ} = {1, 1/2, 1/3, 1/4,... } R. Then sup E = 1, which is in E (see Proposition 1.3), but inf E = 0 which is not in E. Proposition 1.4. Let α be a lower bound of a subset E of an ordered set S. If α E, then α = inf E. (We leave the proof as an exercise.) The Least Upper Bound Property Definition 1.5. An ordered set S is said to have the least upper bound property if the following condition holds: Whenever E is a non-empty subset of S that is bounded above, then sup E exists and is an element in S.
4 Proposition 1.5. The set of integers Z has the least upper bound property. Proof. Let E be a non-empty subset of the integers Z that is bounded above. Then there exists an integer N such that n N for all n E. Because E is non-empty, there is an integer n E with n N. By Prop. 1.3, if n is an upper bound of E, then n = sup E which exists as an element in Z. If n is not an upper bound of E, then by Prop we pick the greatest element in E from among the finite number of integers in E that are from n to N. By Prop. 1.3, this greatest element in E is sup E and is an integer because it was chosen from E. QED In the proof of Proposition 1.5, we found the least upper bound of the non-empty subset E and in fact sup E is an element of E. If E were bounded below, then we also would have inf E E. We therefore can state: Proposition 1.6. (The Well-Ordering Principle of Z ). (a) Let E be a non-empty subset of the integers that is bounded above. Then E has a greatest element within the set E. (b) Let E be a non-empty subset of the integers that is bounded below. Then E has a least element within the set E. The Well-Ordering Principle is essential for the study of limits of sequences, and we often shall use it implicitly in the manner illustrated in the following example: Example of the Well-Ordering Principle: Let {a n } n =1 be a sequence of real numbers that increases to infinity. Then we can choose the smallest integer N such that a N 100. Because the sequence is increasing to infinity, we have a 1 < a 2 < a 3 <...< a n <... and at some point we must have 100 a k < a k+1 < a k +2 <.... The Well-Ordering Principle is then applied to the set of indices, not to the actual sequence values. Let E = {k : 100 a k }, which is the set of indices k for which a k 100. Then E is a non-empty subset of the integers that is bounded below by 1 (the first index). By the Well-Ordering Principle, E has a least element within E. Thus, there exists a smallest index N such that a N 100. Example 1.3. The set of rational numbers Q does not have the least upper bound property. As an example, let E Q be defined as follows: E = { 1. 4, 1. 41, , , ,...} = 1 + a a k 10 k k 1, where a i is the ith decimal place value in 2. Then E is a non-empty subset of the rational numbers and E is bounded above by 2. In fact 2 = sup E, but 2 is not a rational number. Thus, Q does not have the least upper bound property.
5 The Greatest Lower Bound Property Definition 1.6. An ordered set S is said to have the greatest lower bound property if the following condition holds: Whenever E is a non-empty subset of S that is bounded below, then inf E exists and is an element in S. Example 1.4. The set of integers Z has the greatest lower bound property, but the set of rational numbers Q does not. These results follow from Proposition 1.5, Example 1.3, and the following theorem: Theorem 1.1. Let S be an ordered set. Then S has the greatest lower bound property if and only if S has the least upper bound property. Partial Proof. Assume S has the least upper bound property and let E be a non-empty subset of S that is bounded below. Let L be the set of all elements in S that are lower bounds of E. Then L because E is bounded below. Because E is non-empty, there exists an element x 0 in E. By definition of L, x 0 is an upper bound of L; so L is bounded above. By the least upper bound property of S, α = sup L exists and is an element of S. We claim that α = inf E. sup L = α = inf E L (All lower bounds of E) E First, let x E. By definition of L, x is an upper bound of L; thus, α x because α is the least upper bound of L. Thus α is also a lower bound of E. But suppose λ is another (different) lower bound of E. Then λ L. But then λ α because α = sup L. But because λ is different than α, we must have λ α due to the properties of an order. Thus, α is in fact the greatest lower bound of E and it exists in S. Thus, S has the greatest lower bound property. (We leave the proof of the converse as an exercise.) S Decimal Expansions: Rational vs. Irrational A commonly used result is that a rational number has a decimal expansion that terminates, such as 4.0 (an integer) or (a regular number), or has a decimal expansion that recurs such as This property characterizes rational numbers and therefore provides another distinction between rational and irrational numbers. Theorem 1.2. A real number is rational if and only if it has a decimal expansion that either terminates or recurs.
6 Proof. Assume first that we have a real number x with a decimal expansion that either terminates or recurs. If it terminates, then x has the form x = ±(n. a 1 a 2...a k ), where n,a 1,..., a k are all non-negative integers, and 0 a i 9 for 1 i k. Thus, x = ± n + a a k 10 k is the sum of rational numbers which is rational. (If all a i are 0, then x = ±n is an integer and thus is a rational number.) If the decimal expansion is recurring, then x has the form x = ±n. a 1...a j a j+1...a j+k a j+1... a j+ k a j+1... a j+k... = ± n + a a j 10 j + 1 a j+1 10 j a j+k 10 k + 1 a j+1 10 j 10 k a j+k 10 2k +... = ± n + a a j 10 j + a j j k a j+k k+1 10 j 10 k k k = ± n + a a j 10 j + a i j j+1 10 k a i j+k 1 i = 0 10 j+k 10 k i= 0 = ± n + a a j 10 j + a j+1 10 j a j+k i 1 10 j+ k 10 k i= 0 = ± n + a a j 10 j + 1 a j+1 10 j a j+k 10 k 10k 10 k, which is rational. 1 Conversely, let x = c / d be a rational number. We must obtain its decimal expansion. By dividing d into c, we may assume that x is of the form x = ±(n + a / b), where n,a,b are non-negative integers with b 0 and 0 a < b. If a = 0, then x = ±n is a terminating decimal expansion. If a 0, then let r 0 = a and divide b into 10r 0 to obtain 10r 0 = a 1 b + r 1 where 0 r 1 < b and 0 a 1 9 because 0 r 0 < b. Then divide b into 10r 1 to obtain 10r 1 = a 2 b + r 2 where 0 r 2 < b and 0 a 2 9 because 0 r 1 < b. Continue dividing b into 10r j to obtain 10r j = a j+1 b + r j+1 where 0 r j+1 < b and 0 a j+1 9 because 0 r j < b. Because all remainders r i must be from 0 to b 1, there can be at most b distinct remainders. At some point, we will have 10r k = a k+1 b + r k +1, where r k +1 = r i for some previous remainder r i. Because the next step of dividing 10r i by b yields the same quotient a i+1 and remainder as before, the pattern recurs for the successive divisions. We now claim that x = ±(n. a 1 a 2... a i a i+1..a k +1 a i+1.. a k+1 a i+1.. a k+1... ) To see this result, we first use 10a = 10r 0 = a 1 b + r 1. Dividing by 10b gives
7 a b = a r 1 b But then 10r 1 = a 2 b + r 2, which gives r 1 b = a r 2 b ; hence, a b = a a r 2 10 b = a a r b. Continuing, we obtain a b = a a a i 10 i + a i+1 10 i a k k r k k +1 b, where r k +1 = r i. But then we have a b = a a a i 10 i + a i+1 10 i a k k+1 + a i+1 10 k r i+1 10 k +2 b = a a a i 10 i + a i+1 10 i a k k+1 + a i+1 10 k +2 + a i k r i+3 10 k +3 b = a a a i 10 i + a i+1 10 i a k k+1 + a i+1 10 k +2 + a i k a k (k+1) i 1 r + k (k+1) i b By recursion, we obtain a recurring decimal expansion of x that terminates if b ever divides evenly into a remainder. QED Example 1.5 (a) Find the rational form of expansion of 3/8. (c) Find the decimal expansion of 3/14. (b) Find the decimal Solution. (a) By Theorem 1.2, we have = = = = (b) For a / b = 3 / 8, we first divide 8 into 10 3 to obtain the next remainder r 1, then continue dividing 8 into 10r i until we obtain a 0 remainder or a repeated remainder. The decimal terms of 3/8 come from the successive quotients:
8 30 = = = = Thus, 3/8 = (c) For a / b = 3 / 14, we first divide 14 into 10 3 to obtain the next remainder r 1, then continue dividing 14 into 10r i until we obtain a 0 remainder or a repeated remainder. The decimal terms of 3/14 come from the successive quotients: 30 = = = = = = = repeated remainder 20 = repeated quotient Thus, 3/14 = Note: The decimal expansion of a rational number is not unique. An expansion that terminates also can be written as an expansion that ends in a string of all 9's. Specifically, the decimal x = n.a 1 a 2... a k, where 1 a k 9, can be re-written as x = n.a 1 a 2... (a k 1) This result follows from the geometric series 1 9 i 10 i= k +1 = 9 (1 / 10)k / 10 = 9 (1 / 10)k+1 9 / 10 1 = k. 10 For example, with k = 3 we have = As another example, we have = By convention, we always shall assume that a rational number never ends in a string of all 9's.
9 An immediate consequence to Theorem 1.2 is the following result: Dr. Neal, WKU Corollary 1.1. A number is irrational if and only if it has a decimal expansion that neither terminates nor recurs. We have already seen that 2 is irrational. An example of another irrational number is x = Another Construction of the Reals Theorem 1.2 and Corollary 1.1 give a method of constructing the real numbers based on the natural numbers. A brief outline of the steps follows: I. Let 0 denote no length and let 1 denote a fixed unit of length. II. By extending the initial length of 1 by incremental successive lengths of 1, we obtain the natural numbers ℵ = {1, 2, 3,...}. Including 0 gives us the whole numbers W. III. By considering all quotients a / b of natural numbers, we obtain the positive rational numbers Q +. Also allowing a = 0 gives us the non-negative rational numbers. IV. Every element in Q + a can be written uniquely in the form n + i i= 110 i, where n W, 0 a i 9 for all i, the sequence {a i } either terminates by ending in all 0's or is recurring, and the sequence {a i } does not end in a string of all 9's. V. Let the non-negative irrational numbers I + be defined by all values of the form a n + i i= 110 i, where n W, 0 a i 9 for all i, and the sequence {a i } neither terminates nor recurs. (In particular, irrational numbers also cannot end in a string of all 9's.) VI. Let the positive real numbers be defined by R + = Q + I +. a VII. Negative numbers can be written in the form n ± i i=1 10 i. A real number is therefore either rational or irrational. By comparing the decimal expansions of any two real numbers x and y, we can see that either x < y, x = y, or y < x. Thus, the Reals are ordered. The next results prove that both the rational numbers and the irrational numbers are dense within the Reals.
10 Theorem 1.3. Let x and y be any two real numbers with 0 x < y. (a) There exists a rational number z such that x < z < y. (b) There exists an irrational number w such that x < w < y. Proof. Let x = m. a 1 a 2 a 3... and y = n. b 1 b 2 b 3... be the decimal forms of x and y where 0 m n. Suppose first that m < n. Because x cannot end in a string of all 9's, let a i be the first decimal place value such that a i < 9. Then change a i to a i + 1 and let z = m. a 1 a 2 a 3...(a i + 1), which is rational, and let w = m. a 1 a 2 a 3...(a i + 1)c 1 c 2 c 3..., where the sequence {c i } neither terminates nor recurs, so that w is irrational. We then have x < z < y and x < w < y. Next assume that m = n. Because x < y, we must have a 1 b 1. We now choose the smallest index i such that a i < b i. Then we must have a j = b j for 1 j < i or else x would be larger than y. Now because x cannot end in a string of all 9's, choose the least k i such that a k < 9. Now let z = m. a 1 a 2 a 3...a i...(a k + 1). Then z is rational and x < z < y. Finally, let w = m. a 1 a 2 a 3...a i... (a k + 1)c 1 c 2 c 3... where the sequence {c i } neither terminates nor recurs, so that w is irrational. Then x < w < y. QED Corollary 1.2. Let x and y be any two real numbers with x < y. (a) There exists a rational number z such that x < z < y. (b) There exists an irrational number w such that x < w < y. Proof. If 0 x < y, then the result is proved in Theorem 1.3. If x < 0 < y, then by Theorem 1.3, we can find such z and w such that x < 0 < z < y and x < 0 < w < y. If x < y 0, then 0 y < x. So we can apply Theorem 1.3 to find a rational z and an irrational w such that y < z < x and y < w < x. But then z is rational and w is irrational with x < z < y and x < w < y. QED Example 1.6. Apply Theorem 1.3 to x = and y = 9.01 assuming x is rational and assuming x is irrational. Solution. Let z = 8.995, which is rational. Then x < z < y regardless of whether x is rational or irrational. If x is irrational, then let w = x , which is irrational. Then x < w < y. However if x is rational, then let w = ( 2 1) / 1000 = , which is irrational. (This expression simply appends the decimal digits of ) Then x < w < y. 2 to the end of We continue with two of the most important property of real numbers:
11 Theorem 1.4. The set of real numbers has the greatest lower bound property. Dr. Neal, WKU Proof. Let E a non-empty subset of R that is bounded below. Let r R be a lower bound of E and let F be the set of all integers k such that k r. Then r is an upper bound of F ; thus, by Prop. 1.6, we can choose a greatest element n in F. Then n r, so n is also a lower bound of E. By Prop. 1.4, if n E, then n = inf E. Otherwise, we continue: Choose the greatest integer a 1 from 0 to 9 such that n + a 1 / 10 is a lower bound of E. If n + a 1 / 10 E, then n + a 1 / 10 = inf E. Otherwise, choose the greatest integer a 2 from 0 to 9 such that n + a 1 / 10 + a 2 / 10 2 is a lower bound of E. Continuing, we thereby obtain a real number α = n + i=1a i / 10 i with α n + 1. k We claim α = inf E. So let x E. By construction, n + i=1a i / 10 i x for all k 1. In particular, n x. If n + 1 x, then α n + 1 x. But suppose x < n + 1 with x = n + i=1b i / 10 i where the string {b i } does not end in all 9's. If we had x < α, then we must have b k < a k for some k and we can choose the smallest integer k for which k this occurs. But then we would have x < n + i=1a i / 10 i, which is a contradiction. Thus, α x ; that is, α is a lower bound of E. Next, suppose λ is a different lower bound of E. We must show that λ < α. So write λ = m + i=1c i / 10 i Then m λ, so m is also a lower bound of E. By the choice of n above, we must have m n. If m < n, then λ < α. So suppose m = n. Now if a k < c k for some k and we choose the smallest k where this occurs, then we would k have n + c i / 10 i λ x for all x E. But then this c k contradicts the choice of a k. i= 1 So we must have c k a k for all k. That is, λ α. But because λ is different that α, we must have λ < α. That is, α = inf E. QED From Theorems 1.1 and 1.4, we obtain: Corollary 1.2. The set of real numbers has the least upper bound property. That is, any non-empty subset of R that is bounded above has a least upper bound in R. An important consequence of the glb and lub properties of the real line is the fact that the intersection of a nested decreasing sequence of closed intervals is non-empty: [a 1, b 1 ] [a 2, b 2 ] [a 3, b 3 ]... [sup{a i }, inf{b i }] a 1 a 2 a 3... a i... sup{a i } inf{b i }... b i... b 3 b 2 b 1 Theorem 1.5. (Nested Interval Property) Let [a i, b i ] be a nested decreasing sequence of closed intervals. Then [sup{a i }, inf{b i }] [a i, b i ]. In particular, [a i, b i ]. i=1 i=1
12 Proof. Because the intervals are nested decreasing, we have a i a i+1 b i+1 b i for i 1. So the set of points {a i } is bounded above by each b i and the set of points {b i } is bounded below by each a i ; hence a = sup{a i } and b = inf{b i } exist by the least upper bound and greatest lower bound properties of R. Because each b i is an upper bound of {a i } and a is the least upper bound of {a i }, we have a b i for all i 1. But then a becomes a lower bound of the {b i }; so a b because b is the greatest lower bound of the {b i }. For all i 1, we then have a i a b b i ; thus, [a, b] [a i, b i ]. In particular, [a i, b i ] contains a and b. QED i=1 i=1 Exercises 1. Prove: If c is rational, c 0, and x is irrational, then c x and c + x are irrational. 2. Prove that 12 is irrational. 3. Let E be a non-empty subset of an ordered set. Suppose α is a lower bound of E and β is an upper bound of E. Prove that α β. 4. Let E be a non-empty subset of an ordered set S that has the least upper bound property. Suppose E is bounded above and below. Prove that inf E sup E. 5. Let S be a non-empty subset of the real numbers that is bounded below. Define S by S = { x x S }. Prove: (i) S is bounded above. (ii) lub( S) = glbs. 6. Prove: Let α be a lower bound of a subset E of an ordered set S. If α E, then α = inf E. 7. Let S be an ordered set with the greatest lower bound property. Prove that S has the least upper bound property. 8. Find a rational number and an irrational number between x = and y = Let a,b R with a < b, (i) For the open interval E = (a, b), prove that inf E = a and sup E = b. (ii) For the closed interval F = [a, b], prove that inf F = a and sup F = b.
Definition 2.1. A metric (or distance function) defined on a non-empty set X is a function d: X X R that satisfies: For all x, y, and z in X :
MATH 337 Metric Spaces Dr. Neal, WKU Let X be a non-empty set. The elements of X shall be called points. We shall define the general means of determining the distance between two points. Throughout we
More informationREAL ANALYSIS: INTRODUCTION
REAL ANALYSIS: INTRODUCTION DR. RITU AGARWAL EMAIL: RAGARWAL.MATHS@MNIT.AC.IN MALVIYA NATIONAL INSTITUTE OF TECHNOLOGY JAIPUR Contents 1. The real number system 1 2. Field Axioms 1 3. Order Axioms 2 4.
More informationStructure of R. Chapter Algebraic and Order Properties of R
Chapter Structure of R We will re-assemble calculus by first making assumptions about the real numbers. All subsequent results will be rigorously derived from these assumptions. Most of the assumptions
More informationChapter 1 The Real Numbers
Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus
More information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationMATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals
MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Properties of Real Numbers Some Fundamentals The whole course will be based entirely on the study of sequence of numbers and functions defined on the real
More informationSEVENTH EDITION and EXPANDED SEVENTH EDITION
SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 5-1 Chapter 5 Number Theory and the Real Number System 5.1 Number Theory Number Theory The study of numbers and their properties. The numbers we use to
More informationChapter One. The Real Number System
Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and
More informationMATH202 Introduction to Analysis (2007 Fall and 2008 Spring) Tutorial Note #7
MATH202 Introduction to Analysis (2007 Fall and 2008 Spring) Tutorial Note #7 Real Number Summary of terminology and theorems: Definition: (Supremum & infimum) A supremum (or least upper bound) of a non-empty
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationEssential Background for Real Analysis I (MATH 5210)
Background Material 1 Essential Background for Real Analysis I (MATH 5210) Note. These notes contain several definitions, theorems, and examples from Analysis I (MATH 4217/5217) which you must know for
More informationHomework 1 (revised) Solutions
Homework 1 (revised) Solutions 1. Textbook, 1.1.1, # 1.1.2 (p. 24) Let S be an ordered set. Let A be a non-empty finite subset. Then A is bounded and sup A, inf A A Solution. The hint was: Use induction,
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationDescribing the Real Numbers
Describing the Real Numbers Anthony Várilly Math 25a, Fall 2001 1 Introduction The goal of these notes is to uniquely describe the real numbers by taking certain statements as axioms. This exercise might
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationWeek 2: Sequences and Series
QF0: Quantitative Finance August 29, 207 Week 2: Sequences and Series Facilitator: Christopher Ting AY 207/208 Mathematicians have tried in vain to this day to discover some order in the sequence of prime
More informationPOL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005
POL502: Foundations Kosuke Imai Department of Politics, Princeton University October 10, 2005 Our first task is to develop the foundations that are necessary for the materials covered in this course. 1
More informationM17 MAT25-21 HOMEWORK 6
M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute
More informationThat is, there is an element
Section 3.1: Mathematical Induction Let N denote the set of natural numbers (positive integers). N = {1, 2, 3, 4, } Axiom: If S is a nonempty subset of N, then S has a least element. That is, there is
More informationConsequences of the Completeness Property
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
More informationImportant Properties of R
Chapter 2 Important Properties of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference
More informationReal Analysis - Notes and After Notes Fall 2008
Real Analysis - Notes and After Notes Fall 2008 October 29, 2008 1 Introduction into proof August 20, 2008 First we will go through some simple proofs to learn how one writes a rigorous proof. Let start
More informationWORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:
WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their
More informationAnalysis I. Classroom Notes. H.-D. Alber
Analysis I Classroom Notes H-D Alber Contents 1 Fundamental notions 1 11 Sets 1 12 Product sets, relations 5 13 Composition of statements 7 14 Quantifiers, negation of statements 9 2 Real numbers 11 21
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationMATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 2: Countability and Cantor Sets
MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION Chapter 2: Countability and Cantor Sets Countable and Uncountable Sets The concept of countability will be important in this course
More informationStudying Rudin s Principles of Mathematical Analysis Through Questions. August 4, 2008
Studying Rudin s Principles of Mathematical Analysis Through Questions Mesut B. Çakır c August 4, 2008 ii Contents 1 The Real and Complex Number Systems 3 1.1 Introduction............................................
More information1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty.
1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty. Let E be a subset of R. We say that E is bounded above if there exists a real number U such that x U for
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationREVIEW OF ESSENTIAL MATH 346 TOPICS
REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations
More informationQuantitative Aptitude
WWW.UPSCMANTRA.COM Quantitative Aptitude Concept 1 1. Number System 2. HCF and LCM 2011 Prelims Paper II NUMBER SYSTEM 2 NUMBER SYSTEM In Hindu Arabic System, we use ten symbols 0, 1, 2, 3, 4, 5, 6, 7,
More informationSequences. 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.
Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence
More informationADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS
ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
More informationContents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3
Analysis Math Notes Study Guide Real Analysis Contents Ordered Fields 2 Ordered sets and fields 2 Construction of the Reals 1: Dedekind Cuts 2 Metric Spaces 3 Metric Spaces 3 Definitions 4 Separability
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationAdvanced Calculus: MATH 410 Real Numbers Professor David Levermore 5 December 2010
Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 5 December 2010 1. Real Number System 1.1. Introduction. Numbers are at the heart of mathematics. By now you must be fairly familiar with
More informationClass IX Chapter 1 Number Sustems Maths
Class IX Chapter 1 Number Sustems Maths Exercise 1.1 Question Is zero a rational number? Can you write it in the form 0? and q, where p and q are integers Yes. Zero is a rational number as it can be represented
More informationAssociative property
Addition Associative property Closure property Commutative property Composite number Natural numbers (counting numbers) Distributive property for multiplication over addition Divisibility Divisor Factor
More informationEDULABZ INTERNATIONAL NUMBER SYSTEM
NUMBER SYSTEM 1. Find the product of the place value of 8 and the face value of 7 in the number 7801. Ans. Place value of 8 in 7801 = 800, Face value of 7 in 7801 = 7 Required product = 800 7 = 00. How
More informationALTERNATIVE SECTION 12.2 SUPPLEMENT TO BECK AND GEOGHEGAN S ART OF PROOF
ALTERNATIVE SECTION 12.2 SUPPLEMENT TO BECK AND GEOGHEGAN S ART OF PROOF MICHAEL P. COHEN Remark. The purpose of these notes is to serve as an alternative Section 12.2 for Beck and Geoghegan s Art of Proof.
More informationa = qb + r where 0 r < b. Proof. We first prove this result under the additional assumption that b > 0 is a natural number. Let
2. Induction and the division algorithm The main method to prove results about the natural numbers is to use induction. We recall some of the details and at the same time present the material in a different
More informationA LITTLE REAL ANALYSIS AND TOPOLOGY
A LITTLE REAL ANALYSIS AND TOPOLOGY 1. NOTATION Before we begin some notational definitions are useful. (1) Z = {, 3, 2, 1, 0, 1, 2, 3, }is the set of integers. (2) Q = { a b : aεz, bεz {0}} is the set
More informationnot to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results
REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results Euclid s Division Lemma : Given two positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 r < b. Euclid s Division
More information2. Two binary operations (addition, denoted + and multiplication, denoted
Chapter 2 The Structure of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference between
More informationCHAPTER 8: EXPLORING R
CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed
More informationSolutions to Assignment 1
Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive
More informationAxioms for the Real Number System
Axioms for the Real Number System Math 361 Fall 2003 Page 1 of 9 The Real Number System The real number system consists of four parts: 1. A set (R). We will call the elements of this set real numbers,
More informationNUMBERS( A group of digits, denoting a number, is called a numeral. Every digit in a numeral has two values:
NUMBERS( A number is a mathematical object used to count and measure. A notational symbol that represents a number is called a numeral but in common use, the word number can mean the abstract object, the
More informationMAT115A-21 COMPLETE LECTURE NOTES
MAT115A-21 COMPLETE LECTURE NOTES NATHANIEL GALLUP 1. Introduction Number theory begins as the study of the natural numbers the integers N = {1, 2, 3,...}, Z = { 3, 2, 1, 0, 1, 2, 3,...}, and sometimes
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationSection 2.5 : The Completeness Axiom in R
Section 2.5 : The Completeness Axiom in R The rational numbers and real numbers are closely related. The set Q of rational numbers is countable and the set R of real numbers is not, and in this sense there
More informationa + 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.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationSolutions for Homework Assignment 2
Solutions for Homework Assignment 2 Problem 1. If a,b R, then a+b a + b. This fact is called the Triangle Inequality. By using the Triangle Inequality, prove that a b a b for all a,b R. Solution. To prove
More informationWe want to show P (n) is true for all integers
Generalized Induction Proof: Let P (n) be the proposition 1 + 2 + 2 2 + + 2 n = 2 n+1 1. We want to show P (n) is true for all integers n 0. Generalized Induction Example: Use generalized induction to
More informationSuppose R is an ordered ring with positive elements P.
1. The real numbers. 1.1. Ordered rings. Definition 1.1. By an ordered commutative ring with unity we mean an ordered sextuple (R, +, 0,, 1, P ) such that (R, +, 0,, 1) is a commutative ring with unity
More informationMA131 - Analysis 1. Workbook 6 Completeness II
MA3 - Analysis Workbook 6 Completeness II Autumn 2004 Contents 3.7 An Interesting Sequence....................... 3.8 Consequences of Completeness - General Bounded Sequences.. 3.9 Cauchy Sequences..........................
More informationSTA2112F99 ε δ Review
STA2112F99 ε δ Review 1. Sequences of real numbers Definition: Let a 1, a 2,... be a sequence of real numbers. We will write a n a, or lim a n = a, if for n all ε > 0, there exists a real number N such
More informationLecture Notes in Real Analysis Anant R. Shastri Department of Mathematics Indian Institute of Technology Bombay
Lecture Notes in Real Analysis 2010 Anant R. Shastri Department of Mathematics Indian Institute of Technology Bombay August 6, 2010 Lectures 1-3 (I-week) Lecture 1 Why real numbers? Example 1 Gaps in the
More informationREAL NUMBERS. Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b.
REAL NUMBERS Introduction Euclid s Division Algorithm Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b. Fundamental
More informationTenth Bit Bank Mathematics Real Numbers
Tenth Bit Bank Mathematics Real Numbers 1. The rational number among the following is... i) 4.28 ii) 4.282828... iii) 4.288888... A) i) & ii) B) ii) & iii) C) i) & iii) D) All the above 2. A rational number
More informationDR.RUPNATHJI( DR.RUPAK NATH )
Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology
More informationWe have been going places in the car of calculus for years, but this analysis course is about how the car actually works.
Analysis I We have been going places in the car of calculus for years, but this analysis course is about how the car actually works. Copier s Message These notes may contain errors. In fact, they almost
More informationDue date: Monday, February 6, 2017.
Modern Analysis Homework 3 Solutions Due date: Monday, February 6, 2017. 1. If A R define A = {x R : x A}. Let A be a nonempty set of real numbers, assume A is bounded above. Prove that A is bounded below
More informationSequences. We know that the functions can be defined on any subsets of R. As the set of positive integers
Sequences We know that the functions can be defined on any subsets of R. As the set of positive integers Z + is a subset of R, we can define a function on it in the following manner. f: Z + R f(n) = a
More informationFoundations of Discrete Mathematics
Foundations of Discrete Mathematics Chapter 0 By Dr. Dalia M. Gil, Ph.D. Statement Statement is an ordinary English statement of fact. It has a subject, a verb, and a predicate. It can be assigned a true
More informationMathematical Reasoning & Proofs
Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0
More informationMATH 215 Final. M4. For all a, b in Z, a b = b a.
MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More informationChapter 5: The Integers
c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition
More informationTheorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers
Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower
More information5.5 Deeper Properties of Continuous Functions
5.5. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 195 5.5 Deeper Properties of Continuous Functions 5.5.1 Intermediate Value Theorem and Consequences When one studies a function, one is usually interested
More informationFundamentals of Mathematics (MATH 1510)
Fundamentals of Mathematics (MATH 1510) Instructor: Lili Shen Email: shenlili@yorku.ca Department of Mathematics and Statistics York University September 11, 2015 About the course Name: Fundamentals of
More informationHomework 1 Real Analysis
Homework 1 Real Analysis Joshua Ruiter March 23, 2018 Note on notation: When I use the symbol, it does not imply that the subset is proper. In writing A X, I mean only that a A = a X, leaving open the
More informationWORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}
WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not
More informationMath 110 (S & E) Textbook: Calculus Early Transcendentals by James Stewart, 7 th Edition
Math 110 (S & E) Textbook: Calculus Early Transcendentals by James Stewart, 7 th Edition 1 Appendix A : Numbers, Inequalities, and Absolute Values Sets A set is a collection of objects with an important
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationSets, Structures, Numbers
Chapter 1 Sets, Structures, Numbers Abstract In this chapter we shall introduce most of the background needed to develop the foundations of mathematical analysis. We start with sets and algebraic structures.
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationRelations. Relations. Definition. Let A and B be sets.
Relations Relations. Definition. Let A and B be sets. A relation R from A to B is a subset R A B. If a A and b B, we write a R b if (a, b) R, and a /R b if (a, b) / R. A relation from A to A is called
More information6.2 Deeper Properties of Continuous Functions
6.2. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 69 6.2 Deeper Properties of Continuous Functions 6.2. Intermediate Value Theorem and Consequences When one studies a function, one is usually interested in
More informationNumbers. 2.1 Integers. P(n) = n(n 4 5n 2 + 4) = n(n 2 1)(n 2 4) = (n 2)(n 1)n(n + 1)(n + 2); 120 =
2 Numbers 2.1 Integers You remember the definition of a prime number. On p. 7, we defined a prime number and formulated the Fundamental Theorem of Arithmetic. Numerous beautiful results can be presented
More information2MA105 Algebraic Structures I
2MA105 Algebraic Structures I Per-Anders Svensson http://homepage.lnu.se/staff/psvmsi/2ma105.html Lecture 12 Partially Ordered Sets Lattices Bounded Lattices Distributive Lattices Complemented Lattices
More informationComplete Induction and the Well- Ordering Principle
Complete Induction and the Well- Ordering Principle Complete Induction as a Rule of Inference In mathematical proofs, complete induction (PCI) is a rule of inference of the form P (a) P (a + 1) P (b) k
More informationAdvanced Calculus: MATH 410 Real Numbers Professor David Levermore 1 November 2017
Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 1 November 2017 1. Real Number System 1.1. Introduction. Numbers are at the heart of mathematics. By now you must be fairly familiar with
More informationMATHEMATICS X l Let x = p q be a rational number, such l If p, q, r are any three positive integers, then, l that the prime factorisation of q is of t
CHAPTER 1 Real Numbers [N.C.E.R.T. Chapter 1] POINTS FOR QUICK REVISION l Euclid s Division Lemma: Given two positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 r
More informationMATH1050 Greatest/least element, upper/lower bound
MATH1050 Greatest/ element, upper/lower bound 1 Definition Let S be a subset of R x λ (a) Let λ S λ is said to be a element of S if, for any x S, x λ (b) S is said to have a element if there exists some
More informationmeans is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.
1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for
More informationA number that can be written as, where p and q are integers and q Number.
RATIONAL NUMBERS 1.1 Definition of Rational Numbers: What are rational numbers? A number that can be written as, where p and q are integers and q Number. 0, is known as Rational Example:, 12, -18 etc.
More information{x : P (x)} P (x) = x is a cat
1. Sets, relations and functions. 1.1. Set theory. We assume the reader is familiar with elementary set theory as it is used in mathematics today. Nonetheless, we shall now give a careful treatment of
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More information4. Number Theory (Part 2)
4. Number Theory (Part 2) Terence Sim Mathematics is the queen of the sciences and number theory is the queen of mathematics. Reading Sections 4.8, 5.2 5.4 of Epp. Carl Friedrich Gauss, 1777 1855 4.3.
More informationCHAPTER 1 REAL NUMBERS KEY POINTS
CHAPTER 1 REAL NUMBERS 1. Euclid s division lemma : KEY POINTS For given positive integers a and b there exist unique whole numbers q and r satisfying the relation a = bq + r, 0 r < b. 2. Euclid s division
More informationTHE REAL NUMBERS Chapter #4
FOUNDATIONS OF ANALYSIS FALL 2008 TRUE/FALSE QUESTIONS THE REAL NUMBERS Chapter #4 (1) Every element in a field has a multiplicative inverse. (2) In a field the additive inverse of 1 is 0. (3) In a field
More informationMathematics Foundation for College. Lesson Number 1. Lesson Number 1 Page 1
Mathematics Foundation for College Lesson Number 1 Lesson Number 1 Page 1 Lesson Number 1 Topics to be Covered in this Lesson Sets, number systems, axioms, arithmetic operations, prime numbers and divisibility,
More informationLogical Connectives and Quantifiers
Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then
More informationSome Background Material
Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important
More informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More informationChapter 4. Measure Theory. 1. Measure Spaces
Chapter 4. Measure Theory 1. Measure Spaces Let X be a nonempty set. A collection S of subsets of X is said to be an algebra on X if S has the following properties: 1. X S; 2. if A S, then A c S; 3. if
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Theorems Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More information