The Real Numbers. Chapter The Completeness Property of R

Size: px
Start display at page:

Download "The Real Numbers. Chapter The Completeness Property of R"

Transcription

1 Chapter 1 The Real Numbers 1.1 The Completeness Property of R Example (Bartle (a) Page 39). A nonempty set S 1 with a finite number of elements will have a least element, say u, and a largest element, say w. Then, u = infs 1 and w = sups 1. Both the infinimum and supremum, that is u and v, are members of S 1. Example (Bartle (b) Page 39). Given S 2 = {x : 0 x 1}. Since 0 x 1 for all x S 2, we have a lower bound 0, and an upper bound 1. If v < 1 then there exists some s S 2 such that v < s, for example s = 1. Thus, v is not an upper bound of S 2, and since v < 1 is arbitrary, we conclude that sups 2 = 1. If w > 0 then there exists some s S 2 such that s < w, for example s = w/2 < w. Thus, w is not a lower bound of S 2, and since w > 0 is arbitrary, we conclude that infs 2 = 0. Note that the infimum and supremum are members of S 2. Example (Bartle (c) Page 39). Given S 3 = {x : 0 < x < 1}. Since 0 < x < 1 for all x S 3, we have a lower bound 0, and an upper bound 1. If v < 1 there exists some s S 3 such that v < s. Thus, v is not an upper bound of S 3, and since v < 1 is arbitrary, we conclude that sups 3 = 1. If w > 0 then there exists some s S 3 such that s < w, for example s = w/2 < w. Thus, w is not a lower bound of S 3, and since w > 0 is arbitrary, we conclude that infs 3 = 0. Note that the infimum and supremum are not members of S 3. Problem 1 (Bartle Exercise 1 for Section 2.3). Let S 1 := {x R : x 0}. Show in detail that the set has lower bounds, but no upper bounds. Show that infs 1 = 0. Since x 0 for all x S 1, u = 0 is a lower bound of S 1, while S 1 has no upper bounds. If v > 0 then there exists some s S 1 such that 0 < s < v, for example s = v/2 < v. Thus, v is not a lower bound of S 1, and since v is arbitrary infs 1 = 0. Also, infs 1 S 1. Since S 1 has no upper bounds sups 1 does not exist. Problem 2 (Bartle Exercise 2 for Section 2.3). Let S 2 := {x R : x > 0}. Does S 2 have lower bounds? Does S 2 have upper bounds? Does infs 2 exist? Does sups 2 exist? Prove your statements. Since S 2 and x > 0, the set S 2 is bounded below by 0. Then, from the Completeness Property S 2 also has an infimum. For every ε > 0, there exists some s ε S 2 such that 0 < s ε < 0 + ε; for example 1

2 s ε = ε/2 < ε. Thus, 0+ε is not a lower bound, and since ε is arbitrary, infs 2 = 0. Since x > 0, the set S 2 has no upper bounds, and by definition sups 2 does not exist. Problem 3 (Bartle Exercise 3 for Section 2.3). Let S 3 := {1/n : n N}. Show that sups 3 = 1 and infs 3 0. Since 0 < 1/n 1 for all n N, the set S 3 has a lower bound 0 and an upper bound 1, and by the Completeness Property has both an infimum and a supremum. For every ε > 0 there exists some s ε S 3 such that 1 ε < s ε 1; for example s ε = 1. Thus, 1 ε is not an upper bound of S 3, and since ε is arbitrary, sups 3 = 1. Also, for every ε > 0 there exists some s ε S 3 such that 0 s ε 0+ε, say s ε = 0 or s ε = ε/2. Thus, 0+ε is not a lower bound of S 3, and since ε > 0 is arbitrary, infs 3 = 0 1. Problem 4 (Bartle Exercise 4 for Section 2.3). Let S 4 := {1 ( 1) n /n : nn}. Find infs 4 and sups 4. Since 1/2 1 ( 1) n /n 2, the set S 4 has a lower bound 1/2 and an upper bound 2, and by the Completeness Property has an infimum and supremum. For every ε > 0, there exists some s ε S 4 such that 1/2 s ε < 1/2+ε; for example s ε = 1/2+ε/2. Thus, 1/2+ε is not a lower bound, and since ε > 0 is arbitrary infs 4 = 1/2. For every ε > 0 there exists s ε S 4 such that 2 ε < s ε 2, say s ε = 2. Thus, 2 ε is not an upper bound of S 4, and since ε > 0 is arbitrary, sups 4 = 2. Problem 5 (Bartle Exercise 5(a) for Section 2.3). Let A := {x R : 2x+5 > 0}. Find the infimum and supremum, if they exist. Since 2x+5 > 0 we have x > 5/2, and so A has a lower bound 5/2, but no upper bounds. Thus, by the Completeness Property, A also has an infimum, but the supremum does not exist. For every ε > 0 there exists a ε A such that 5/2 a ε < 5/2+ε, say a ε = 5/2+ε/2. Thus, 5/2+ε is not a lower bound of A, and since ε is arbitrary, infa= 5/2. Problem 6 (Bartle Exercise 5(b) for Section 2.3). Todo... Problem 7 (Bartle Exercise 5(c) for Section 2.3). Todo... Problem 8 (Bartle Exercise 5(d) for Section 2.3). Todo... Problem 9 (Bartle Exercise 6 for Section 2.3). Let S be a nonempty subset of R that is bounded below. Prove that infs = sup{ s : s S}. Let S be a nonempty subset of R that is bounded below. Then, by the Completeness Property of R an infimum of S exists, say w := infs. Thus w s for each s S. But this implies that s w for all s S, so that if we define S := { s : s S}, then w is an upper bound for S. We must show that u is the supremum of S. Let v < w for all v S. Then w < v, and since w = infs there must exist some t S such that w < t < v. But this implies that there exists some t S such that v < t < w. Thus v is not an upper bound of S, and since v is arbitrary, w = sup S. Hence, infs = sup{ s : s S}. Problem 10 (Bartle Exercise 7 for Section 2.3). If a set S R contains one of its upper bounds, show that this upper bound is the supremum of S. Let u S be an upper bound of S. If v is any upper bound of S, then s v for all s S. But u S, so u v, and since u is an upper bound then it must be the least upper bound; that is, u := sups. Problem 11 (Bartle Exercise 8 for Section 2.3). Let S R be nonempty. Show that u R is an upper bound of S if and only if the conditions t R and t > u imply that t / S. 1 The question asks to show that inf S 3 0. The infimum infs 3 = 0 is for the case of n. If n = 2, then infs 3 = 1/2. Perhaps ask lecturer to just elaborate a little more on this problem at consultation. 2

3 Let S R be nonempty. The proof proceeds as follows: Assume u R is an upper bound of S. Then s u for all s S. Thus, if t > u for all t R, then t > s for all s S. Hence t / S. Conversely, assume that t > u t / S, and suppose, to the contrary, that u is not an upper bound of S. Then, since S is nonempty there must exist some s S such that s > u. But s > u s / S, which is a contradiction. Hence, u is an upper bound of S. Problem 12 (Bartle Exercise 9 for Section 2.3). Let S R be nonempty. Show that if u = sups, then for every n N the number u 1/n is not an upper bound of S, but the number u+1/n is an upper bound of S 2. Let S R be a nonempty set, and let u := sups. For all n N we have 1/n > 0, so that u 1/n < u for all n N. Thus, there must exist some s S such that u 1/n < s < u and so u 1/n is not an upper bound of S. However, u < u+1/n for all n N, and since u := sups, we have that s u < u+1/n for all s S. Hence, u+1/n is an upper bound of S for all n N. Problem 13 (Bartle Exercise 10 for Section 2.3). Show that if A and B are bounded subsets of R, then A B is a bounded set. Show that sup(a B) = sup{supa,supb}. Let A R and B R. Let u := supa and v := supb. Also, let w := sup{u,v}. For all a A and all b B we have a u w and b v w respectively. Thus w is an upper bound for A B. We need to show that w is the supremum (least upper bound) of A B. If z is any upper bound of A B, then z is also an upper bound of A and B; that is, u z and v z. Hence w z, and since z is any upper bound of A B, w must be the least upper bound, and we conclude that sup(a B) = sup{supa,supb}. Problem 14 (Bartle Exercise 11 for Section 2.3). Let S be a bounded set in R and let S 0 be a nonempty subset of S. Show that infs infs 0 sups. Since the set S is bounded, the Completeness Property of R ensures that S has an infimum and a supremum. If s 0 S 0, then s 0 S, so that s 0 sups for all s 0 S 0. This implies that sups 0 sups. Similarly, infs s 0 for all s 0 S 0, so that infs infs 0. Hence, infs infs 0 sups 0 sups. Problem 15 (Bartle Exercise 12 for Section 2.3). Let S R and suppose that s := sups belongs to S. If u / S, show that sup(s {u}) = sup{s,u}. Since u / S and s S we have that u s. Thus we consider only the two cases that u < s and s < u. Now, if u < s then s = sup{s,u} since s is an upper bound which is contained in the set {s,u}. Also, for all s S we have that s u < s so that s is an upper bound of the set S {u}, and since s is contained in this set, s = sup(s {u}). Similarly, if s < u, then u = sup{s,u} and consequently u = sup(s {u}). Problem 16 (Bartle Exercise 13 for Section 2.3). Todo... Problem 17 (Bartle Exercise 14 for Section 2.3). Todo Applications of the Supremum Property Example (Bartle (a) Page 40). Let S be a nonempty subset of R that is bounded above, and let a be any number in R. Define the set a+s := {a+s : s S}. Show that sup(a+s) = a+sups. Solution: Let u := sups. Then for all s S we have a+s a+u, and so a+u is an upper bound of 2 The converse is also true. See Exercise in Bartle 3

4 the set a+s. Consequently, sup(a+s) a+u. Now, if v is any upper bound of a+s, then a+s v for all s S. Thus s v a for all s S, and so v a is an upper bound for S. But since u := sups, we have that u v a, and so a+u v. Since v is any upper bound of a+s we have a+u sup(a+s). Now we have that sup(a+s) a+u and a+u sup(a+s), which means that sup(a+s) = a+sups. Example (Bartle (b) Page 41). Suppose A and B are nonempty subsets of R that satisfy the property a b for all a A,b B Prove that supa supb Solution: For any given b B we have that a b for all a A. Thus b is an upper bound of A, and so supa b, where supa is the least upper bound of A. Since supa b holds for all b B, we have that supa is a lower bound of the set B. Hence, we conclude that supa supb. Example (Bartle Page 41). Suppose that f and g are real-valued functions with common domain D R. We assume that f and g are bounded. 1. Show that if f(x) g(x) for all x D, then sup(d) supg(d). Solution: Firstly, f(x) g(x) supg(d). This implies that supg(d) is an upper bound for f(d). Hence, supf(d) supg(d). Example (Bartle (b) Page 41). Todo... Example (Bartle (c) Page 41). Todo... Problem 18 (Bartle Exercise 1 for Section 2.4). Show that sup{1 1/n : n N} = 1. Let S = {1 1/n : n N}. Since 1 1/n < 1 for all n N we have an upper bound of 1 for S. Thus the Completeness Property ensures that a supremum of S exists. For every ε > 0, the Archimedean Property implies that there exists some n ε N such that 1/ε < n ε. Thus 1/n ε < ε so that 1 ε < 1 1/n ε < 1. Since 1 1/n ε S we know that 1 ε is not an upper bound of S, and since ε > 0 is arbitrary, sups = 1. Problem 19 (Bartle Exercise 2 for Section 2.4). If S := {1/n 1/m : n,m N}, find infs and sups. Since 1 1/n 1/m 1, the set S has a lower bound 1 and an upper bound 1. By the Completenes Property the set S has an infimum and a supremum. Infimum: We have that 1/n 1/m 1/n 1 > 1. Then 1 is indeed a lower bound. For every ε > 0 there exists an n N such that 0 < 1/n < ε. Thus 1 < 1/n 1 < ε 1 = 1+ε. But 1/n 1 S. Hence, 1+ε is not a lower bound of S, and since ε > 0 is arbitrary, infs = 1. Supremum: The set S has the property S = S. Thus, we can invoke the earlier result infs = sup{ s : s S}. Since infs = 1 we have 1 = sup{ s : s S} = sup( S) = sups. This implies that sups = 1. Problem 20 (Bartle Exercise 3 for Section 2.4). Let S R be nonempty. Prove that if a number u in R has the properties: (i) for every n N the number u 1/n is not an upper bound of S, and (ii) for every number n N the number u+1/n is an upper bound of S, then u = sups. 3 3 This is the converse of Exercise in Bartle 4

5 Todo... Problem 21 (Bartle Exercise 4 (a) for Section 2.4). Let S be a nonempty bounded set in R. Let a > 0, and let as := {as : s S}. Prove that inf(as) = ainfs, sup(as) = asups Supremum: Let u := sups. Then s u for all s S, so that as au; that is, au is an upper bound for the set as. Consequently, sup(as) au. If v is any upper bound of as, then as v for all s S, and so s v/a for all s S; that is, v/a is an upper bound for S. Thus, u v/a, so that au v, and since v is any upper bound of as, we have au sup(as). Combining the inequalities sup(as) au and au sup(as), we have sup(as) = asups Infimum: Todo... Problem 22 (Bartle Exercise 4 (b) for Section 2.4). Let S be a nonempty bounded set in R. Let b < 0, and let bs := {bs : s S}. Prove that inf(bs) = bsups, sup(bs) = binfs Since b < 0, we consider b > 0 and apply the results of the previous exercise (Exercise (a) Bartle). Define S := { s : s S}. Then inf(bs) = inf( b S). But inf( b S) = binf S, so that inf(bs) = binf S. Also from an earlier result (Exercise Bartle) inf S = sups. Thus, inf(bs) = b( sups) and we have our final result inf(bs) = bsups. Todo sup(bs) = binfs... Problem 23 (Bartle Exercise 5 for Section 2.4). Let S be a set of nonnegative real numbers that is bounded above and let T := {x 2 : x S}. Prove that if u = sups, then u 2 = supt. Give an example that shows that the conclusion may be false if the restriction against negative numbers is removed. Todo... Problem 24 (Bartle Exercise 6 for Section 2.4). Let X be a nonempty set and let f : X R have bounded range in R. If a R, show that Example 2.4.1(a) (in Bartle) implies that Show that we also have sup{a+f(x) : x X} = a+sup{f(x) : x X} inf{a+f(x) : x X} = a+inf{f(x) : x X} Supremum: Let u := supx. Then f(x) u for all x X, so that a+f(x) a+u for all x X; that is, a+u is an upper bound of a+f(x) for all x X. Thus sup{a+f(x) : x X} a+u. Todo: Finish... Problem 25 (Bartle Exercise 7 for Section 2.4). Let A and B be bounded nonempty subsets of R, and let A+B := {a+b : a A,b B}. Prove that sup(a+b) = supa+supb,inf(a+b) = infa+infb Supremum: Let u := supa and v := supb. The a u for all a A and b v for all b B. Thus, a + b u + v for all a A,b B so that u + v is an upper bound for the set A + B. Hence, from the Completeness Property, a supremum for A+B exists, and sup(a+b) u+v = supa+supb. It needs to be shown that u+v is the supremum (least upper bound) of A+B. We can do so by showing that for every ε > 0 we can find a s ε A+B such that (u+v) ε < s ε u+v. If we choose a ε A such that u ε/2 < a ε u and b ε B such that v ε/2 < b ε v then we have (u ε/2)+(v ε/2) < a ε +b ε u+v, or simplified (u+v) ε < a ε +b ε u+v 5

6 But a ε +b ε A+B, and since ε > 0 is arbitrary we know that (u+v) ε is not an upper bound of A+B, so that u+v is the supremum and sup(a+b) = supa+supb Problem 26 (Bartle Exercise 8 for Section 2.4). Let X be a nonempty set, and let f and g be defined on X and have bounded ranges in R. Show that and that sup{f(x)+g(x) : x X} sup{f(x) : x X}+sup{g(X) : x X} inf{f(x) : x X}+inf{g(X) : x X} inf{f(x)+g(x) : x X} Give examples to show that each of these inequalities can be either equalities or strict inequalitles. Supremum: Let u := supf(x) and v := supg(x). Then f(x) u and g(x) v for all x X. Thus f(x)+g(x) u+v for all x X, so that u+v is an upper bound of the set {f(x)+g(x) : x X}. This implies that {f(x)+g(x) : g X} sup{f(x)+g(x) : x X} u+v. Hence, sup{f(x)+g(x) : x X} sup{f(x) : x X}+sup{g(X) : x X} Infimum: Let u := inff(x) and v := infg(x). Then u f(x) and v g(x) for all x X, and consequently u +v f(x) +g(x) for all x X. Then u+v is a lower bound of the set {f(x) + g(x) : x X}, which implies that u+v inf{f(x)+g(x) : x X} {f(x)+g(x) : g X}. Hence, inf{f(x) : x X}+inf{g(X) : x X}inf{f(x)+g(x) : x X} Problem 27 (Bartle Exercise 9 for Section 2.4). Todo... Problem 28 (Bartle Exercise 10 for Section 2.4). Todo... Problem 29 (Bartle Exercise 11 for Section 2.4). Todo... Problem 30 (Bartle Exercise 12 for Section 2.4). Todo... Problem 31 (Bartle Exercise 13 for Section 2.4). Given any x R, show that there exists a unique Z such that n 1 x < n. In the trivial case where x = 0 then n = 1 is the unique element of Z. If x > 0, then by an earlier result (Corollary in Bartle), there exists an n x N such that n x 1 < x < n x. If x < 0, then we can apply the same argument to x > 0. Thus, we know that given an arbitrary x R, there exists some n x Z such that n x n < n x. We must show that such an n x Z is unique. Suppose, without loss of generality, that m x < n x also satisfies m x 1 x < m x. Also, we know that m x n x 1 since n x,m x Z. We now have the inequality m x 1 x < m x n x 1 x < n x, which is a contradiction as it implies x < x. Hence, the assumption that there also exists m x < n x satisfying m x 1 x < m x is false, and so we have uniqueness. Problem 32 (Bartle Exercise 14 for Section 2.4). If y > 0, show that there exists n N such that 1/2 n < y. For each n N we have that n < 2 n. Thus we also have that 1/2 n < 1/n. But from an earlier result (Corollary Bartle), we know that given y > 0 there exists some n y N such that 0 < 1/n y < y. Hence, for each y > 0 we have that 0 < 1/2 n < 1/n < y; that is, 1/2 n < y. Problem 33 (Bartle Exercise 15 for Section 2.4). Todo... Problem 34 (Bartle Exercise 16 for Section 2.4). Todo... Problem 35 (Bartle Exercise 17 for Section 2.4). Todo... Problem 36 (Bartle Exercise 18 for Section 2.4). Todo... Problem 37 (Bartle Exercise 19 for Section 2.4). Since x < y and u > 0, we know that x/u < y/u. Then, by the Density Theorem, there exists some r Q such that x/u < r < y/u. But this implies that x < ru < y. Hence the set {ru : r Q} is dense in R. 6

7 1.3 Intervals Problem 38 (Bartle Exercise 1 for Section 2.5). If I := [a,b] and I := [a,b ] are closed intervals in R, show that I I if and only if a a and b b. Let I I. Then a,b I so that a a,b b, or a a and b b. Conversely, suppose a lea and b b. Then for any x I we have a x b, so that a x b. Thus x I for all x I, and hence, I I. Problem 39 (Bartle Exercise 2 for Section 2.5). If S R is nonempty, show that S is bounded if and only if there exists a closed bounded interval I such that S I. Let S be bounded by a lower bound a and an upper bound b. Then for any s S we have a s b. Hence s [a,b], and so S I where I := [a,b]. Conversely, let S I where I is the closed bound interval I := [a,b]. But then a s b for all s S. Hence, S is bounded. Problem 40 (BartleExercise3forSection2.5). If S R is a nonempty bounded set, and I S := [infs,sups], show that S I s. Moreover, if J is any closed bounded interval containing S, show that I S J. The set S is nonempty and bounded, so the Completeness Property ensures that the infimum and supremum of S exist. Since infs s sups for all s S, we know that s I S = [infs,sups] for all s S. Hence, S I S. Since J is any closed bounded interval, let J := [a,b]. If S J then a s b for all s S. Thus a is a lower bound of S and b is an upper bound of S, and by the Completeness Property, the infimum and supremum of S exist. Thus a infs and sups b. But I S = [infs,sups], so by Exercise Bartle, I S J. Problem 41 (Bartle Exercise 4 for Section 2.5). Leave. Problem 42 (Bartle Exercise 5 for Section 2.5). Leave. Problem 43 (Bartle Exercise 6 for Section 2.5). Todo... Problem 44 (Bartle Exercise 7 for Section 2.5). Let I n := [0,1/n] for n N. Prove that n=1i n = {0}. Since 0 [0,1/n] for all n N, we know that {0} n=1 I n. Thus we know that n=1 I n is nonempty and contains {0}. Let x n=1 (x is arbitrary). But this is only true if x [0,1/n], so that 0 x 1/n for all n N. We must show that x = 0. From the Archimedean Property implies that for every ε > 0 there exists some n ε N such that 0 < 1/n ε < ε. Thus we now have that 0 x 1/n ε < ε. But since ε > 0 is arbitrary, we can make it as small as we like, and hence, x = 0. Problem 45 (Bartle Exercise 8 for Section 2.5). Todo... Problem 46 (Bartle Exercise 9 for Section 2.5). Todo... Problem 47 (Bartle Exercise 10 for Section 2.5). Todo... Problem 48 (Bartle Exercise 11 for Section 2.5). Todo... Problem 49 (Bartle Exercise 12 for Section 2.5). Todo... Problem 50 (Bartle Exercise 13 for Section 2.5). Todo... Problem 51 (Bartle Exercise 14 for Section 2.5). Todo... Problem 52 (Bartle Exercise 15 for Section 2.5). Todo... Problem 53 (Bartle Exercise 16 for Section 2.5). Todo... Problem 54 (Bartle Exercise 17 for Section 2.5). Todo... 7

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

MATH202 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 information

Structure of R. Chapter Algebraic and Order Properties of R

Structure 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 information

2.2 Some Consequences of the Completeness Axiom

2.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 information

Due date: Monday, February 6, 2017.

Due 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 information

Suppose R is an ordered ring with positive elements P.

Suppose 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 information

Sequences. 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 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 information

1. 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. 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 information

Econ Lecture 2. Outline

Econ Lecture 2. Outline Econ 204 2010 Lecture 2 Outline 1. Cardinality (cont.) 2. Algebraic Structures: Fields and Vector Spaces 3. Axioms for R 4. Sup, Inf, and the Supremum Property 5. Intermediate Value Theorem 1 Cardinality

More information

MATH 131A: REAL ANALYSIS (BIG IDEAS)

MATH 131A: REAL ANALYSIS (BIG IDEAS) MATH 131A: REAL ANALYSIS (BIG IDEAS) Theorem 1 (The Triangle Inequality). For all x, y R we have x + y x + y. Proposition 2 (The Archimedean property). For each x R there exists an n N such that n > x.

More information

Problem Set 2 Solutions Math 311, Spring 2016

Problem Set 2 Solutions Math 311, Spring 2016 Problem Set 2 Solutions Math 311, Spring 2016 Directions: Name: You must complete (at least) a total of 8 problems, some of which have multiple parts. You may complete more than 8 problems, for possible

More information

Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.

Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall. .1 Limits of Sequences. CHAPTER.1.0. a) True. If converges, then there is an M > 0 such that M. Choose by Archimedes an N N such that N > M/ε. Then n N implies /n M/n M/N < ε. b) False. = n does not converge,

More information

Supremum and Infimum

Supremum and Infimum Supremum and Infimum UBC M0 Lecture Notes by Philip D. Loewen The Real Number System. Work hard to construct from the axioms a set R with special elements O and I, and a subset P R, and mappings A: R R

More information

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

In 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 information

MATH 117 LECTURE NOTES

MATH 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 information

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

In 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 information

Economics 204 Summer/Fall 2011 Lecture 2 Tuesday July 26, 2011 N Now, on the main diagonal, change all the 0s to 1s and vice versa:

Economics 204 Summer/Fall 2011 Lecture 2 Tuesday July 26, 2011 N Now, on the main diagonal, change all the 0s to 1s and vice versa: Economics 04 Summer/Fall 011 Lecture Tuesday July 6, 011 Section 1.4. Cardinality (cont.) Theorem 1 (Cantor) N, the set of all subsets of N, is not countable. Proof: Suppose N is countable. Then there

More information

Logical Connectives and Quantifiers

Logical 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 information

M17 MAT25-21 HOMEWORK 6

M17 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 information

Lecture 2. Econ August 11

Lecture 2. Econ August 11 Lecture 2 Econ 2001 2015 August 11 Lecture 2 Outline 1 Fields 2 Vector Spaces 3 Real Numbers 4 Sup and Inf, Max and Min 5 Intermediate Value Theorem Announcements: - Friday s exam will be at 3pm, in WWPH

More information

Chapter 5. Measurable Functions

Chapter 5. Measurable Functions Chapter 5. Measurable Functions 1. Measurable Functions Let X be a nonempty set, and let S be a σ-algebra of subsets of X. Then (X, S) is a measurable space. A subset E of X is said to be measurable if

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

More information

Chapter 1 The Real Numbers

Chapter 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 information

Characterisation of Accumulation Points. Convergence in Metric Spaces. Characterisation of Closed Sets. Characterisation of Closed Sets

Characterisation of Accumulation Points. Convergence in Metric Spaces. Characterisation of Closed Sets. Characterisation of Closed Sets Convergence in Metric Spaces Functional Analysis Lecture 3: Convergence and Continuity in Metric Spaces Bengt Ove Turesson September 4, 2016 Suppose that (X, d) is a metric space. A sequence (x n ) X is

More information

Consequences of the Completeness Property

Consequences 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 information

1 Homework. Recommended Reading:

1 Homework. Recommended Reading: Analysis MT43C Notes/Problems/Homework Recommended Reading: R. G. Bartle, D. R. Sherbert Introduction to real analysis, principal reference M. Spivak Calculus W. Rudin Principles of mathematical analysis

More information

Principle of Mathematical Induction

Principle of Mathematical Induction Advanced Calculus I. Math 451, Fall 2016, Prof. Vershynin Principle of Mathematical Induction 1. Prove that 1 + 2 + + n = 1 n(n + 1) for all n N. 2 2. Prove that 1 2 + 2 2 + + n 2 = 1 n(n + 1)(2n + 1)

More information

Introduction to Mathematical Analysis I. Second Edition. Beatriz Lafferriere Gerardo Lafferriere Nguyen Mau Nam

Introduction to Mathematical Analysis I. Second Edition. Beatriz Lafferriere Gerardo Lafferriere Nguyen Mau Nam Introduction to Mathematical Analysis I Second Edition Beatriz Lafferriere Gerardo Lafferriere Nguyen Mau Nam Introduction to Mathematical Analysis I Second Edition Beatriz Lafferriere Gerardo Lafferriere

More information

Lecture 10. Riemann-Stieltjes Integration

Lecture 10. Riemann-Stieltjes Integration Lecture 10 Riemann-Stieltjes Integration In this section we will develop the basic definitions and some of the properties of the Riemann-Stieltjes Integral. The development will follow that of the Darboux

More information

REVIEW OF ESSENTIAL MATH 346 TOPICS

REVIEW 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 information

MATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals

MATH 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 information

MATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE

MATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE MATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE SEBASTIEN VASEY These notes describe the material for November 26, 2018 (while similar content is in Abbott s book, the presentation here is different).

More information

Solution. 1 Solutions of Homework 1. 2 Homework 2. Sangchul Lee. February 19, Problem 1.2

Solution. 1 Solutions of Homework 1. 2 Homework 2. Sangchul Lee. February 19, Problem 1.2 Solution Sangchul Lee February 19, 2018 1 Solutions of Homework 1 Problem 1.2 Let A and B be nonempty subsets of R + :: {x R : x > 0} which are bounded above. Let us define C = {xy : x A and y B} Show

More information

EC9A0: Pre-sessional Advanced Mathematics Course. Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1

EC9A0: Pre-sessional Advanced Mathematics Course. Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1 EC9A0: Pre-sessional Advanced Mathematics Course Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1 1 Infimum and Supremum Definition 1. Fix a set Y R. A number α R is an upper bound of Y if

More information

Generell Topologi Exercise Sheet 2

Generell Topologi Exercise Sheet 2 Generell Topologi Exercise Sheet 2 Richard Williamson February 11, 2013 Guide To help you to decide which questions to focus on, I have made a few remarks below. A question which is important for one of

More information

This exam contains 5 pages (including this cover page) and 4 questions. The total number of points is 100. Grade Table

This exam contains 5 pages (including this cover page) and 4 questions. The total number of points is 100. Grade Table MAT25-2 Summer Session 2 207 Practice Final August 24th, 207 Time Limit: Hour 40 Minutes Name: Instructor: Nathaniel Gallup This exam contains 5 pages (including this cover page) and 4 questions. The total

More information

6.2 Deeper Properties of Continuous Functions

6.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 information

Introduction to Real Analysis

Introduction to Real Analysis Christopher Heil Introduction to Real Analysis Chapter 0 Online Expanded Chapter on Notation and Preliminaries Last Updated: January 9, 2018 c 2018 by Christopher Heil Chapter 0 Notation and Preliminaries:

More information

Chapter 6. Integration. 1. Integrals of Nonnegative Functions. a j µ(e j ) (ca j )µ(e j ) = c X. and ψ =

Chapter 6. Integration. 1. Integrals of Nonnegative Functions. a j µ(e j ) (ca j )µ(e j ) = c X. and ψ = Chapter 6. Integration 1. Integrals of Nonnegative Functions Let (, S, µ) be a measure space. We denote by L + the set of all measurable functions from to [0, ]. Let φ be a simple function in L +. Suppose

More information

MATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions.

MATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions. MATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions. Continuity Definition. Given a set E R, a function f : E R, and a point c E, the function f is continuous at c if

More information

Selected Solutions. where cl(ω) are the cluster points of Ω and Ω are the set of boundary points.

Selected Solutions. where cl(ω) are the cluster points of Ω and Ω are the set of boundary points. Selected Solutions Section 9 (Open and Closed Sets) 9K. Let Ω R p. The original problem asks: Show a point belongs to Ω if and only if it is an interior point. Let nt(ω) be the set of all interior point

More information

Iowa State University. Instructor: Alex Roitershtein Summer Homework #1. Solutions

Iowa State University. Instructor: Alex Roitershtein Summer Homework #1. Solutions Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 EXERCISES FROM CHAPTER 1 Homework #1 Solutions The following version of the

More information

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.

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. 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 information

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

Sequences CHAPTER 3. Definition. A sequence is a function f : N R. CHAPTER 3 Sequences 1. Limits and the Archimedean Property Our first basic object for investigating real numbers is the sequence. Before we give the precise definition of a sequence, we will give the intuitive

More information

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real 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 information

Homework 1 (revised) Solutions

Homework 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 information

2.4 The Extreme Value Theorem and Some of its Consequences

2.4 The Extreme Value Theorem and Some of its Consequences 2.4 The Extreme Value Theorem and Some of its Consequences The Extreme Value Theorem deals with the question of when we can be sure that for a given function f, (1) the values f (x) don t get too big or

More information

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 :

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 information

CHAPTER 7. Connectedness

CHAPTER 7. Connectedness CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set

More information

5.5 Deeper Properties of Continuous Functions

5.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 information

Continuity. Chapter 4

Continuity. Chapter 4 Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of

More information

8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x)

8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x) 8. Limit Laws 8.1. Basic Limit Laws. If f and g are two functions and we know the it of each of them at a given point a, then we can easily compute the it at a of their sum, difference, product, constant

More information

Continuity. Chapter 4

Continuity. Chapter 4 Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of

More information

Analysis Part 1. 1 Chapter Q1(q) 1.2 Q1(r) Book: Measure and Integral by Wheeden and Zygmund

Analysis Part 1. 1 Chapter Q1(q) 1.2 Q1(r) Book: Measure and Integral by Wheeden and Zygmund Analysis Part 1 www.mathtuition88.com Book: Measure and Integral by Wheeden and Zygmund 1 Chapter 1 1.1 Q1(q) Let {T x k } be a sequence of points of T E. Since E is compact, {x k } has a subsequence {x

More information

U e = E (U\E) e E e + U\E e. (1.6)

U e = E (U\E) e E e + U\E e. (1.6) 12 1 Lebesgue Measure 1.2 Lebesgue Measure In Section 1.1 we defined the exterior Lebesgue measure of every subset of R d. Unfortunately, a major disadvantage of exterior measure is that it does not satisfy

More information

Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 5 December 2010

Advanced 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 information

REAL AND COMPLEX ANALYSIS

REAL AND COMPLEX ANALYSIS REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any

More information

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

3.1 Basic properties of real numbers - continuation Inmum and supremum of a set of real numbers Chapter 3 Real numbers The notion of real number was introduced in section 1.3 where the axiomatic denition of the set of all real numbers was done and some basic properties of the set of all real numbers

More information

Week 2: Sequences and Series

Week 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 information

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

MAT 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 information

Econ Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n

Econ Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n Econ 204 2011 Lecture 3 Outline 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n 1 Metric Spaces and Metrics Generalize distance and length notions

More information

DR.RUPNATHJI( DR.RUPAK NATH )

DR.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 information

Chapter 3 Continuous Functions

Chapter 3 Continuous Functions Continuity is a very important concept in analysis. The tool that we shall use to study continuity will be sequences. There are important results concerning the subsets of the real numbers and the continuity

More information

van Rooij, Schikhof: A Second Course on Real Functions

van Rooij, Schikhof: A Second Course on Real Functions vanrooijschikhofproblems.tex December 5, 2017 http://thales.doa.fmph.uniba.sk/sleziak/texty/rozne/pozn/books/ van Rooij, Schikhof: A Second Course on Real Functions Some notes made when reading [vrs].

More information

MATH 409 Advanced Calculus I Lecture 9: Limit supremum and infimum. Limits of functions.

MATH 409 Advanced Calculus I Lecture 9: Limit supremum and infimum. Limits of functions. MATH 409 Advanced Calculus I Lecture 9: Limit supremum and infimum. Limits of functions. Limit points Definition. A limit point of a sequence {x n } is the limit of any convergent subsequence of {x n }.

More information

van Rooij, Schikhof: A Second Course on Real Functions

van Rooij, Schikhof: A Second Course on Real Functions vanrooijschikhof.tex April 25, 2018 van Rooij, Schikhof: A Second Course on Real Functions Notes from [vrs]. Introduction A monotone function is Riemann integrable. A continuous function is Riemann integrable.

More information

REAL ANALYSIS: INTRODUCTION

REAL 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 information

ABSTRACT INTEGRATION CHAPTER ONE

ABSTRACT INTEGRATION CHAPTER ONE CHAPTER ONE ABSTRACT INTEGRATION Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Suggestions and errors are invited and can be mailed

More information

MA677 Assignment #3 Morgan Schreffler Due 09/19/12 Exercise 1 Using Hölder s inequality, prove Minkowski s inequality for f, g L p (R d ), p 1:

MA677 Assignment #3 Morgan Schreffler Due 09/19/12 Exercise 1 Using Hölder s inequality, prove Minkowski s inequality for f, g L p (R d ), p 1: Exercise 1 Using Hölder s inequality, prove Minkowski s inequality for f, g L p (R d ), p 1: f + g p f p + g p. Proof. If f, g L p (R d ), then since f(x) + g(x) max {f(x), g(x)}, we have f(x) + g(x) p

More information

Copyright c 2007 Jason Underdown Some rights reserved. statement. sentential connectives. negation. conjunction. disjunction

Copyright c 2007 Jason Underdown Some rights reserved. statement. sentential connectives. negation. conjunction. disjunction Copyright & License Copyright c 2007 Jason Underdown Some rights reserved. statement sentential connectives negation conjunction disjunction implication or conditional antecedant & consequent hypothesis

More information

F (x) = P [X x[. DF1 F is nondecreasing. DF2 F is right-continuous

F (x) = P [X x[. DF1 F is nondecreasing. DF2 F is right-continuous 7: /4/ TOPIC Distribution functions their inverses This section develops properties of probability distribution functions their inverses Two main topics are the so-called probability integral transformation

More information

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

Analysis 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 information

REAL VARIABLES: PROBLEM SET 1. = x limsup E k

REAL VARIABLES: PROBLEM SET 1. = x limsup E k REAL VARIABLES: PROBLEM SET 1 BEN ELDER 1. Problem 1.1a First let s prove that limsup E k consists of those points which belong to infinitely many E k. From equation 1.1: limsup E k = E k For limsup E

More information

Selected solutions for Homework 9

Selected solutions for Homework 9 Math 424 B / 574 B Due Wednesday, Dec 09 Autumn 2015 Selected solutions for Homework 9 This file includes solutions only to those problems we did not have time to cover in class. We need the following

More information

4th Preparation Sheet - Solutions

4th Preparation Sheet - Solutions Prof. Dr. Rainer Dahlhaus Probability Theory Summer term 017 4th Preparation Sheet - Solutions Remark: Throughout the exercise sheet we use the two equivalent definitions of separability of a metric space

More information

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

Walker Ray Econ 204 Problem Set 3 Suggested Solutions August 6, 2015 Problem 1. Take any mapping f from a metric space X into a metric space Y. Prove that f is continuous if and only if f(a) f(a). (Hint: use the closed set characterization of continuity). I make use of

More information

1 Numbers and Functions

1 Numbers and Functions 1 Numbers and Functions Let us begin at the beginning. When we learn the script of a language, such as the English language, we begin with the letters of the alphabet A, B, C,...; when we learn the sounds

More information

3 Measurable Functions

3 Measurable Functions 3 Measurable Functions Notation A pair (X, F) where F is a σ-field of subsets of X is a measurable space. If µ is a measure on F then (X, F, µ) is a measure space. If µ(x) < then (X, F, µ) is a probability

More information

G1CMIN Measure and Integration

G1CMIN Measure and Integration G1CMIN Measure and Integration 2003-4 Prof. J.K. Langley May 13, 2004 1 Introduction Books: W. Rudin, Real and Complex Analysis ; H.L. Royden, Real Analysis (QA331). Lecturer: Prof. J.K. Langley (jkl@maths,

More information

Real Analysis A.A Giuseppe De Marco

Real Analysis A.A Giuseppe De Marco Real Analysis A.A 213 14 Giuseppe De Marco 1. Prolegomena 1.1. The extended real line. The extended real line R = R {, } = [, ] is constantly used in this text. As an ordered set with < x < for every x

More information

Real Variables: Solutions to Homework 9

Real Variables: Solutions to Homework 9 Real Variables: Solutions to Homework 9 Theodore D Drivas November, 20 xercise 0 Chapter 8, # : For complex-valued, measurable f, f = f + if 2 with f i real-valued and measurable, we have f = f + i f 2

More information

Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011

Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011 Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011 Section 2.6 (cont.) Properties of Real Functions Here we first study properties of functions from R to R, making use of the additional structure

More information

A lower bound for X is an element z F such that

A lower bound for X is an element z F such that Math 316, Intro to Analysis Completeness. Definition 1 (Upper bounds). Let F be an ordered field. For a subset X F an upper bound for X is an element y F such that A lower bound for X is an element z F

More information

Abstract. In this paper, the concepts and the properties of conjugate maps and directional derivatives of convex vector functions from a subset of

Abstract. In this paper, the concepts and the properties of conjugate maps and directional derivatives of convex vector functions from a subset of ACTA MATHEMATICA VIETNAMICA Volume 25, Number 3, 2000, pp. 315 344 315 ON CONJUGATE MAPS AND DIRECTIONAL DERIVATIVES OF CONVEX VECTOR FUNCTIONS NGUYEN XUAN TAN AND PHAN NHAT TINH Abstract. In this paper,

More information

MAS221 Analysis Semester Chapter 2 problems

MAS221 Analysis Semester Chapter 2 problems MAS221 Analysis Semester 1 2018-19 Chapter 2 problems 20. Consider the sequence (a n ), with general term a n = 1 + 3. Can you n guess the limit l of this sequence? (a) Verify that your guess is plausible

More information

MATHS 730 FC Lecture Notes March 5, Introduction

MATHS 730 FC Lecture Notes March 5, Introduction 1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists

More information

Introduction to Real Analysis Alternative Chapter 1

Introduction to Real Analysis Alternative Chapter 1 Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces

More information

Metric Space Topology (Spring 2016) Selected Homework Solutions. HW1 Q1.2. Suppose that d is a metric on a set X. Prove that the inequality d(x, y)

Metric Space Topology (Spring 2016) Selected Homework Solutions. HW1 Q1.2. Suppose that d is a metric on a set X. Prove that the inequality d(x, y) Metric Space Topology (Spring 2016) Selected Homework Solutions HW1 Q1.2. Suppose that d is a metric on a set X. Prove that the inequality d(x, y) d(z, w) d(x, z) + d(y, w) holds for all w, x, y, z X.

More information

4130 HOMEWORK 4. , a 2

4130 HOMEWORK 4. , a 2 4130 HOMEWORK 4 Due Tuesday March 2 (1) Let N N denote the set of all sequences of natural numbers. That is, N N = {(a 1, a 2, a 3,...) : a i N}. Show that N N = P(N). We use the Schröder-Bernstein Theorem.

More information

Solution of the 7 th Homework

Solution of the 7 th Homework Solution of the 7 th Homework Sangchul Lee December 3, 2014 1 Preliminary In this section we deal with some facts that are relevant to our problems but can be coped with only previous materials. 1.1 Maximum

More information

2MA105 Algebraic Structures I

2MA105 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 information

1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),

1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989), Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer

More information

Lecture 8. Q = [a 1, b 1 ] [a n, b n ], (3.10) width(q) = sup(b i a i ). (3.12) i. from which we define the lower and upper Riemann sums,

Lecture 8. Q = [a 1, b 1 ] [a n, b n ], (3.10) width(q) = sup(b i a i ). (3.12) i. from which we define the lower and upper Riemann sums, Lecture 8 3.2 iemann Integral of Several Variables Last time we defined the iemann integral for one variable, and today we generalize to many variables. Definition 3.3. A rectangle is a subset of n of

More information

Egoroff Theorem for Operator-Valued Measures in Locally Convex Cones

Egoroff Theorem for Operator-Valued Measures in Locally Convex Cones Iranian Journal of Mathematical Sciences and Informatics Vol. 12, No. 2 (2017), pp 117-125 DOI: 10.7508/ijmsi.2017.2.008 Egoroff Theorem for Operator-Valued Measures in Locally Convex Cones Davood Ayaseh

More information

1 Definition of the Riemann integral

1 Definition of the Riemann integral MAT337H1, Introduction to Real Analysis: notes on Riemann integration 1 Definition of the Riemann integral Definition 1.1. Let [a, b] R be a closed interval. A partition P of [a, b] is a finite set of

More information

1 The Real Number System

1 The Real Number System 1 The Real Number System The rational numbers are beautiful, but are not big enough for various purposes, and the set R of real numbers was constructed in the late nineteenth century, as a kind of an envelope

More information

Midterm 1. Every element of the set of functions is continuous

Midterm 1. Every element of the set of functions is continuous Econ 200 Mathematics for Economists Midterm Question.- Consider the set of functions F C(0, ) dened by { } F = f C(0, ) f(x) = ax b, a A R and b B R That is, F is a subset of the set of continuous functions

More information

HOMEWORK ASSIGNMENT 6

HOMEWORK ASSIGNMENT 6 HOMEWORK ASSIGNMENT 6 DUE 15 MARCH, 2016 1) Suppose f, g : A R are uniformly continuous on A. Show that f + g is uniformly continuous on A. Solution First we note: In order to show that f + g is uniformly

More information

u( x) = g( y) ds y ( 1 ) U solves u = 0 in U; u = 0 on U. ( 3)

u( x) = g( y) ds y ( 1 ) U solves u = 0 in U; u = 0 on U. ( 3) M ath 5 2 7 Fall 2 0 0 9 L ecture 4 ( S ep. 6, 2 0 0 9 ) Properties and Estimates of Laplace s and Poisson s Equations In our last lecture we derived the formulas for the solutions of Poisson s equation

More information

Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization

Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Compiled by David Rosenberg Abstract Boyd and Vandenberghe s Convex Optimization book is very well-written and a pleasure to read. The

More information

Proof. We indicate by α, β (finite or not) the end-points of I and call

Proof. We indicate by α, β (finite or not) the end-points of I and call C.6 Continuous functions Pag. 111 Proof of Corollary 4.25 Corollary 4.25 Let f be continuous on the interval I and suppose it admits non-zero its (finite or infinite) that are different in sign for x tending

More information