# Mathematical Methods of Engineering Analysis

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000

2 Contents Sets and Functions 1 1 Sets Subsets Set Operations Disjoint Sets Products of Sets Functions and Sequences Injections, Surjections, Bijections Sequences Countability On the Real Line Positive and Negative Increasing, Decreasing Bounds Supremum and Infimum Limits Convergence of Sequences Series Ratio Test, Root Test Power Series Absolute Convergence Rearrangements Metric Spaces 23 6 Euclidean Spaces Inner Product and Norm Euclidean Distance Metric Spaces Usage Distances from Points to Sets and from Sets to Sets Balls Open and Closed Sets Closed Sets Interior, Closure, and Boundary i

3 Open Subsets of the Real Line Convergence Subsequences Convergence and Closed Sets Completeness Cauchy Sequences Complete Metric Spaces Compactness Compact Subspaces Cluster Points, Convergence, Completeness Compactness in Euclidean Spaces Functions on Metric Spaces Continuous Mappings Continuity and Open Sets Continuity and Convergence Compositions Real-Valued Functions R n -Valued Functions Compactness and Uniform Continuity Uniform Continuity Sequences of Functions Cauchy Criterion Continuity of Limit Functions Spaces of Continuous Functions Convergence in C Lipschitz Continuous Functions Completeness Functionals Differential and Integral Equations Contraction Mappings Fixed Point Theorem Systems of Linear Equations Maximum Norm Manhattan Metric Euclidean Metric Conclusion Integral Equations Fredholm Equation Volterra Equation Generalization of the Fixed Point Theorem Differential Equations ii

4 Convex Analysis Convex Sets and Convex Functions Projection Supporting Hyperplane Theorem Measure and Integration Motivation Algebras Monotone Class Theorem Measurable Spaces and Functions Measurable Functions Borel Functions Compositions of Functions Numerical Functions Positive and Negative Parts of a Function Indicators and Simple Functions Approximations by Simple Functions Limits of Sequences of Functions Monotone Classes of Functions Notation Measures Arithmetic of Measures Finite, σ-finite, Σ-finite measures Specification of Measures Image of Measure Almost Everywhere Integration Definition of the Integral Integral over a Set Integrability Elementary Properties Monotone Convergence Theorem Linearity of Integration Fatou s Lemma Dominated Convergence Theorem iii

5 Sets and Functions This introductory chapter is devoted to general notions regarding sets, functions, sequences, and series. The aim is to introduce and review the basic notation, terminology, conventions, and elementary facts. 1 Sets A set is a collection of some objects. Given a set, the objects that form it are called its elements. Given a set A, we write x A to mean that x is an element of A. To say that x A, we also use phrases like x is in A, x is a member of A, x belongs to A, and A includes x. To specify a set, one can either write down all its elements inside curly brackets (if this is feasible), or indicate the properties that distinguish its elements. For example, A = {a, b, c} is the set whose elements are a, b, and c, and B = {x : x > 2.7} is the set of all numbers exceeding 2.7. The following are some special sets: : The empty set. It has no elements. N = {1, 2, 3,...}: Set of natural numbers. Z = {0, 1, 1, 2, 2,...}: Set of integers. Z + = {0, 1, 2,...}: Set of positive integers. Q = { m n : m Z, n N}: Set of rationals. R = (, ) = {x : < x < + }: Set of reals. [a, b] = {x R : a x b}: Closed intervals. (a, b) = {x R : a < x < b}: Open intervals. R + = [0, ) = {x R : x 0}: Set of positive reals. 1

6 2 SETS AND FUNCTIONS Subsets A set A is said to be a subset of a set B if every element of A is an element of B. We write A B or B A to indicate it and use expressions like A is contained in B, B contains A, to the same effect. The sets A and B are the same, and then we write A = B, if and only if A B and A B. We write A B when A and B are not the same. The set A is called a proper subset of B if A is a subset of B and A and B are not the same. The empty set is a subset of every set. This is a point of logic: let A be a set; the claim is that A, that is, that every element of is also an element of A, or equivalently, there is no element of that does not belong to A. But the last is obviously true simply because has no elements. Set Operations Let A and B be sets. Their union, denoted by A B, is the set consisting of all elements that belong to either A or B (or both). Their intersection, denoted by A B, is the set of all elements that belong to both A and B. The complement of A in B, denoted by B \ A, is the set of all elements of B that are not in A. Sometimes, when B is understood from context, B \ A is also called the complement of A and is denoted by A c. Regarding these operations, the following hold: Commutative laws: A B = B A, A B = B A. Associative laws: (A B) C = A (B C), (A B) C = A (B C). Distributive laws: A (B C) = (A B) (A C), A (B C) = (A B) (A C). The associative laws show that A B C and A B C have unambiguous meanings. Definitions of unions and intersections can be extended to arbitrary collections of sets. Let I be a set. For each i I, let A i be a set. The union of the sets A i, i I, is the set A such that x A if and only if x A i for some i in I. The following notations are used to denote the union and intersection respectively: A i, i I A i. i I

7 1. SETS 3 When I = N = {1, 2, 3,...}, it is customary to write A i, i=1 A i. All of these notations follow the conventions for sums of numbers. For instance, n A i = A 1 A n, i=1 13 i=5 i=1 A i = A 5 A 6 A 13 stand, respectively, for the union over I = {1,..., n} and the intersection over I = {5, 6,..., 13}. Disjoint Sets Two sets are said to be disjoint if their intersection is empty; that is, if they have no elements in common. A collection {A i : i I} of sets is said to be disjointed if A i and A j are disjoint for all i and j in I with i j. Products of Sets Let A and B be sets. Their product, denoted by A B, is the set of all pairs (x, y) with x in A and y in B. It is also called the rectangle with sides A and B. If A 1,..., A n are sets, then their product A 1 A n is the set of all n-tuples (x 1,..., x n ) where x 1 A 1,..., x n A n. This product is called, variously, a rectangle, or a box, or an n-dimensional box. If A 1 = = A n = A, then A 1 A n is denoted by A n. Thus, R 2 is the plane, R 3 is the three-dimensional space, R 2 + is the positive quadrant of the plane, etc. Exercises: 1.1 Let E be a set. Show the following for subsets A, B, C, and A i of E. Here, all complements are with respect to E; for instance, A c = E \ A. 1. (A c ) c = A 2. B \ A = B A c 3. (B \ A) C = (B C) \ (A C) 4. (A B) c = A c B c 5. (A B) c = A c B c 6. ( i I A i) c = i I Ac i 7. ( i I A i) c = i I Ac i 1.2 Let a and b be real numbers with a < b. Find [a + 1 n, b 1 n ], [a 1 n, b + 1 n ] n=1 n=1

8 4 SETS AND FUNCTIONS 1.3 Describe the following sets in words and pictures: 1. A = {x R 2 : x x 2 2 < 1} 2. B = {x R 2 : x x 2 2 1} 3. C = B \ A 4. D = C B 5. S = C C 1.4 Let A n be the set of points (x, y) R 2 lying on the curve y = 1/x n, 0 < x <. What is n 1 A n? 2 Functions and Sequences Let E and F be sets. With each element x of E, let there be associated a unique element f(x) of F. Then f is called a function from E into F, and f is said to map E into F. We write f : E F to indicate it. Let f be a function from E into F. For x in E, the point f(x) in F is called the image of x or the value of f at x. Similarly, for A E, the set {y F : y = f(x) for some x A} is called the image of A. In particular, the image of E is called the range of f. Moving in the opposite direction, for B F, 2.1 f 1 (B) = {x E : f(x) B} is called the inverse image of B under f. Obviously, the inverse of F is E. Terms like mapping, operator, transformation are synonyms for the term function with varying shades of meaning depending on the context and on the sets E and F. We shall become familiar with them in time. Sometimes, we write x f(x) to indicate the mapping f; for instance, the mapping x x from R into R is the function f : R R defined by f(x) = x Injections, Surjections, Bijections Let f be a function from E into F. It is called an injection, or is said to be injective, or is said to be one-to-one, if distinct points have distinct images (that is, if x y implies f(x) f(y)). It is called a surjection, or is said to be surjective, if its range is F, in which case f is said to be from E onto F. It is called a bijection, or is said to be bijective, if it is both injective and surjective. These terms are relative to E and F. For examples, x e x is an injection from R into R, but is a bijection from R into (0, ). The function x sin x from R into R is neither injective nor surjective, but it is a surjection from R onto [ 1, 1].

9 2. FUNCTIONS AND SEQUENCES 5 Sequences A sequence is a function from N into some set. If f is a sequence, it is customary to denote f(n) by something like x n and write (x n ) or (x 1, x 2,...) for the sequence (instead of f). Then, the x n are called the terms of the sequence. For instance, (1, 3, 4, 7, 11,...) is a sequence whose first, second, etc. terms are x 1 = 1, x 2 = 3,.... If A is a set and every term of the sequence (x n ) belongs to A, then (x n ) is said to be a sequence in A or a sequence of elements of A, and we write (x n ) A to indicate this. A sequence (x n ) is said to be a subsequence of (y n ) if there exist integers 1 k 1 < k 2 < k 3 < such that x n = y kn for each n. For instance, the sequence (1, 1/2, 1/4, 1/8,...) is a subsequence of (1, 1/2, 1/3, 1/4, 1/5,...). Exercises: 2.1 Let f be a mapping from E into F. Show that 1. f 1 ( ) =, 2. f 1 (F ) = E, 3. f 1 (B \ C) = f 1 (B) \ f 1 (C), 4. f 1 ( i I B i) = i I f 1 (B i ), 5. f 1 ( i I B i) = i I f 1 (B i ), for all subsets B, C, B i of F. 2.2 Show that x e x is a bijection from R + onto (0, 1]. Show that x log x is a bijection from (0, ) onto R. (Incidentally, log x is the logarithm of x to the base e, which is nowadays called the natural logarithm. We call it the logarithm. Let others call their logarithms unnatural. ) 2.3 Let f be defined by the arrows below: This defines a bijection from N onto Z. Using this, construct a bijection from Z onto N. 2.4 Let f : N N N be defined by the table below where f(i, j) is the entry in the i th row and the j th column. Use this and the preceding exercise to construct a bijection from Z Z onto N.

10 6 SETS AND FUNCTIONS... j i Functional Inverses. Let f be a bijection from E onto F. Then, for each y in F there is a unique x in E such that f(x) = y. In other words, in the notation of (2.1), f 1 ({y}) = {x} for each y in F and some unique x in E. In this case, we drop some brackets and write f 1 (y) = x. The resulting function f 1 is a bijection from F onto E; it is called the functional inverse of f. This particular usage should not be confused with the general notation of f 1. (Note that (2.1) defines a function f 1 form F into E, where F is the collection of all subsets of F and E is the collection of all subsets of E.) 3 Countability Two sets A and B are said to have the same cardinality, and then we write A B, if there exists a bijection from A onto B. Obviously, having the same cardinality is an equivalence relation; it is 1. reflexive: A A, 2. symmetric: A B B A, 3. transitive: A B and B C A C. A set is said to be finite if it is empty or has the same cardinality as {1, 2,..., n} for some n in N; in the former case it has 0 elements, in the latter exactly n. It is said to be countable if it is finite or has the same cardinality as N; in the latter case it is said to have a countable infinity of elements. In particular, N is countable. So are Z, N N in view of exercises 2.3 and 2.4. Note that an infinite set can have the same cardinality as one of its proper subsets. For instance, Z N, R + (0, 1], R R + (0, 1); see exercise 2.2 for the latter. Incidentally, R +, R, etc. are uncountable, as we shall show shortly. A set is countable if and only if it can be injected into N, or equivalently, if and only if there is a surjection from N onto it. Thus, a set A is countable if and only if there is a sequence (x n ) whose range is A. The following lemma follows easily from these remarks.

11 3. COUNTABILITY LEMMA. If A can be injected into B and B is countable, then A is countable. If A is countable and there is a surjection from A onto B, then B is countable. 3.2 THEOREM. The product of two countable sets is countable. PROOF. Let A and B be countable. If one of them is empty, then A B is empty and there is nothing to prove. Suppose that neither is empty. Then, there exist injections f : A N and g : B N. For each pair (x, y) in A B, let h(x, y) = (f(x), g(y)); then h is an injection from A B into N N. Since N N is countable (see Exercise (2.4)), this implies via the preceding lemma that A B is countable 3.3 COROLLARY. The set of all rational numbers is countable. PROOF. Recall that the set Q of all rationals consists of ratios m/n with m Z and n N. Thus, f(m, n) = m/n defines a surjection from Z N onto Q. Since Z and N are countable, so is Z N by the preceding theorem. Hence, Q is countable by Lemma THEOREM. The union of a countable collection of countable sets is countable. PROOF. Let I be a countable set, and let A i be a countable set for each i in I. The claim is that A = i I A i is countable. Now, there is a surjection f i : N A i for each i, and there is a surjection g : N I; these follow from the countability of I and the A i. Note that, then, h(m, n) = f g(m) (n) defines a surjection h from N N onto A. Since N N is countable, this implies via Lemma 3.1 that A is countable. The following theorem exhibits an uncountable set. As a corollary, we show that R is uncountable. 3.5 THEOREM. Let E be the set of all sequences whose terms are the digits 0 and 1. Then, E is uncountable. PROOF. Let A be a countable subset of E. Let x 1, x 2,... be an enumeration of the elements of A, that is, A is the range of (x n ). Note that each x n is a sequence of zeros and ones, say x n = (x n,1, x n,2,...) where each term x n,m is either 0 or 1. We define a new sequence y = (y n ) by letting y n = 1 x n,n. The sequence y differs from every one of the sequences x 1, x 2,... in at least one position. Thus, y is not in A but is in E. We have shown that if A E and is countable, then there is a y E such that y A. If E were countable, the preceding would hold for A = E, which would be

12 8 SETS AND FUNCTIONS absurd. Hence, E must be uncountable. 3.6 COROLLARY. The set of all real numbers is uncountable. PROOF. It is enough to show that the interval [0, 1) is uncountable. For each x [0, 1), let 0.x 1 x 2 x 3 be the binary expansion of x (in case x is dyadic, say x = k/2 n for some k and n in N, there are two such possible binary expansions, in which case we take the expansion with infinitely many zeros), and we identify the binary expansion with the sequence (x 1, x 2,...) in the set E of the preceding theorem. Thus, to each x in [0, 1) there corresponds a unique element f(x) of E. In fact, f is a surjection onto the set E \ D where D denotes the set of all sequences of zeros and ones that are eventually all ones. It is easy to show that D is countable and hence that E \ D is uncountable. From this it follows that [0, 1) is uncountable. Exercises: 3.1 Dyadics. A number is said to be dyadic if it has the form k/2 n for some integers k and n in Z +. Show that the set of all dyadic numbers is countable. Of course, every dyadic number is rational. 3.2 Let D denote the set of all sequences of zeros and ones that are eventually all ones. Show that D is countable. 3.3 Suppose that A is uncountable and that B is countable. Show that A \ B is uncountable. 3.4 Let x be a real number. For each n Z +, let x n be the smallest dyadic number of the form k/2 n that exceeds x. Show that x 0 x 1 x 2 and that x n > x for each n. Show that, for every ɛ > 0, there is an n ɛ such that x n x < ɛ for all n n ɛ. 4 On the Real Line The object is to review some facts and establish some terminology regarding the set R of all real numbers and the set R = [, + ] of all extended real numbers. The extended real number system consists of R and two extra symbols, and. The relation < is extended to R by postulating that < x < + for every real number x. The arithmetic operations are extended to R as follows: for each x R, x + = x ( ) = x + ( ) = x = { if x > 0 x = if x < 0

13 4. ON THE REAL LINE 9 x ( ) = ( x) x/ = x/( ) = 0 + = ( ) + ( ) = = ( ) ( ) = ( ) =. The operations 0 (± ), ( ) ( ), + /+, and / are undefined. Positive and Negative We call x in R positive if x 0 and strictly positive if x > 0. By symmetry, then, x is negative if x 0 and strictly negative if x < 0. A function f : E R is said to be positive if f(x) 0 for all x in E and strictly positive if f(x) > 0 for all x in E. Negative and strictly negative functions are defined similarly. This usage is in accord with modern tendencies, though at variance with common usage 1. Increasing, Decreasing A function f : R R is said to be increasing if f(x) f(y) whenever x y. It is said to be strictly increasing if f(x) < f(y) whenever x < y. Decreasing and strictly decreasing functions are defined similarly by reversing the inequalities. These notions carry over to functions f : E R with E R. In particular, since a sequence is a function on N, these notions apply to sequences in R. Thus, for example, (x n ) R is increasing if x 1 x 2 and is strictly decreasing if x 1 > x 2 >. Bounds Let A R. A real number b is called an upper bound for A provided that A [, b], and then A is said to be bounded above by b. Lower bounds and being bounded below are defined similarly. The set A is said to be bounded if it is bounded above and below; that is, if A [a, b] for some real interval [a, b]. These notions carry over to functions and sequences as follows. Given f : E R, the function f is said to be bounded above, below, etc. according as its range is bounded above, below, etc. Thus, for instance, f is bounded if there exist real numbers a b such that a f(x) b for all x in E. Supremum and Infimum If A R is bounded above, then it has a least upper bound, that is, an upper bound b such that no number less than b is an upper bound; we call that least upper bound the supremum of A. If A is not bounded above, we define the supremum to be +. The 1 Often used concepts should have the simpler names. Mindbending double negatives should be avoided, and as much as possible, the mathematical usage should not conflict with the ordinary language.

14 10 SETS AND FUNCTIONS infimum of A is defined similarly; it is if A has no lower bound and is the greatest lower bound otherwise. We let inf A, sup A denote the infimum and supremum of A, respectively. For example, inf{1, 1/2, 1/3,...} = 0, sup{1, 1/2, 1/3,...} = 1, inf(a, b] = inf[a, b] = a, sup(a, b) = sup(a, b] = b. In particular, inf = + and sup =. If A is finite, then inf A is the smallest element of A, and sup A is the largest. Even when A in infinite, it is possible that inf A is an element of A, in which case it is called the minimum of A. Similarly, if sup A is an element of A, then it is also called the maximum of A. If f : E R, it is customary to write inf f(x) = inf{f(x) : x D} x D and call it the infimum (or maximum) of f over D E, and similarly with the supremum. In the case of sequences (x n ) R, inf x n, sup x n denote, respectively, the infimum and supremum of the range of (x n ). Other such notations are generally self-explanatory; for example, Limits inf x n = inf{x k, x k+1,...}, n k sup x nk = sup{x n1, x n2,...}. k 1 If (x n ) is an increasing sequence in R, then sup x n is also called the limit of (x n ) and is denoted by lim x n. If it is a decreasing sequence, then inf x n is called the limit of (x n ) and again denoted by lim x n. Let (x n ) R be an arbitrary sequence. Then 4.1 x m = inf n m x n, x m = sup x n, m N, n m define two sequences; (x n ) is increasing, and ( x n ) is decreasing. Their limits are called the limit inferior and the limit superior, respectively, of the sequence (x n ): lim inf x n = lim x n = sup m lim sup x n = lim x n = inf m inf x n, n m sup x n, n m Figure 1 is worthy of careful study. Note that, in general, 4.4 lim inf x n lim sup x n +. If lim inf x n = lim sup x n, then the common value is called the limit of (x n ) and is denoted by lim x n. Otherwise, if limits inferior and superior are not equal, the sequence (x n ) does not have a limit.

15 4. ON THE REAL LINE 11 Figure 1: Lim Sup and Lim Inf. The pairs (n, x n ) are connected by the solid lines for clarity. The pairs (n, x n ) form the lower dotted line and (n, x n ) the upper dotted line. Convergence of Sequences A sequence (x n ) of real numbers is said to be convergent if lim x n exists and is a real number. An examination of Figure 1 shows that this is equivalent to the classical definition of convergence: (x n ) converges to x if for every ɛ > 0, there is an n ɛ such that x n x < ɛ for all n n ɛ. The phrase there is n ɛ... for all n n ɛ can be expressed in more geometric terms by phrases like the number of terms outside (x ɛ, x + ɛ) is finite, or all but finitely many terms are in (x ɛ, x + ɛ), or x n x < ɛ for all n large enough. The following is a summary of the relations between convergence and algebraic operations. The proof will be omitted. 4.5 THEOREM. Let (x n ) and (y n ) be convergent sequences with limits x and y respectively. Then, 1. lim cx n = cx, 2. lim(x n + y n ) = x + y, 3. lim x n y n = xy, 4. lim x n /y n = x/y provided that y n, y 0. In practice, we do not have the sequence laid out before us. Instead, some rule is given for generating the sequence and the object is to show that the resulting sequence will converge. For instance, a function may be specified somehow and a procedure described to find its maximum; starting from some point, the procedure will give the

16 12 SETS AND FUNCTIONS successive points x 1, x 2,... which are meant to form the sequence that converges to the point x where the maximum is achieved. Often, to find the limit of (x n ), one starts with a search for sequences that bound (x n ) from above and below and whose limits can be computed easily: suppose that y n x n z n for all n, lim y n = lim z n, then lim x n exists and is equal to the limit of the other two. The art involved is in finding such sequences (y n ) and (z n ). 4.6 EXAMPLE. This example illustrates the technique mentioned above. We want to show that (n 1/n ) converges. Note that n 1/n 1 always, and put x n = n 1/n 1, and consider the sequnce (x n ). Now, (1 + x n ) n = n, and by the binomial theorem (a + b) n = a n + na n 1 n(n 1) b + a n 2 b b n 2 n(n 1) a n 2 b 2 2 for a, b 0 and n 2. So, or n = (1 + x n ) n It follows that lim x n = 0, and hence 0 x n n(n 1) x 2 2 n, 2 n 1. lim n 1/n = 1. Exercises: 4.1 Show that if A B then inf A inf B sup B sup A. Use this to show that, if A 1 A 2, then inf A 1 inf A 2 inf A n sup A n sup A 2 sup A 1. Use this to show that (x n ) is increasing, ( x n ) is decreasing, and lim x n lim x n (see (4.1) (4.3) for definitions). 4.2 Show that sup( x n ) = inf x n for any sequence (x n ) in R. Conclude that lim sup( x n ) = lim inf x n.

17 4. ON THE REAL LINE Cauchy Criterion. Sequence (x n ) is convergent if and only if for every ɛ > 0 there is an n ɛ such that x m x n ɛ for all m n n ɛ. Prove this by examining Figure 1 on the definition of the limit. 4.4 Monotone Sequences. If (x n ) is increasing, then lim x n exists (but could be + ). Thus, such a sequence converges if and only if it is bounded above. Show this. State the version of this for decreasing sequences. 4.5 Iterative Sequences. Often, x n+1 is obtained from x n via some rule, that is, x n+1 = f(x n ) for some function f. If (x n ) is so obtained from some function f, it is said to be iterative. If (x n ) is such and f is continuous and lim x n = x exists, then x = f(x). This works well for identifying the limit especially when f is simple and x = f(x) has only one solution. In general, with complicated functions f, the reverse is true: To find x satisfying x = f(x), one starts at some point x 0, computes x 1 = f(x 0 ), x 2 = f(x 1 ),..., and tries to show that x = lim x n exists and satisfies x = f(x). 4.6 Domination. A sequence (x n ) is said to be dominated by a sequence (y n ) if x n y n for each n. Show that, if so 1. inf x n inf y n, 2. sup x n sup y n, 3. lim inf x n lim inf y n, 4. lim sup x n lim sup y n. In particular, if the limits exist, lim x n lim y n. Incidentally, (x n ) defined by (4.1) is the maximal increasing sequence dominated by (x n ), and ( x n ) is the minimal decreasing sequence dominating (x n ). 4.7 Comparisons. Let (x n ) be a positive sequence. Then, (x n ) converges to 0 if and only if it is dominated by a sequence (y n ) with lim sup y n = 0. Show this. Favorite sequences (y n ) used in this role are given by y n = 1/n, y n = r n for some fixed number r (0, 1), and y n = n p r n with p (, + ) and r (0, 1). 4.8 Existence of Least Upper Bounds. Let A be a nonempty subset of R and let B = {b : b is an upper bound of A}. Assuming that B is nonempty, show that B has a minimum element.

18 14 SETS AND FUNCTIONS 5 Series Given a sequence (x n ) R, the sequence (s n ) defined by 5.1 s n = n i=1 x i is called the sequence of partial sums of (x n ), and the symbolic expression 5.2 xn is called the series associated with (x n ). The series is said to converge to s, and then we write 5.3 x n = s 1 if and only if the sequence (s n ) converges to s. Sometimes, we write x 1 +x 2 + for the series (5.2). Sometimes, for convenience of notation, we shall consider series of the form 0 or m, depending on the index set. Here are a few examples: x n = n=0 n=0 n=1 x n n! 1 1 x = e x for x R, 1 n 2 = π2 6, x n = n=m x m 1 x for x ( 1, 1), for x ( 1, 1). The following result is obtained by applying the Cauchy Criterion (Exercise 4.3) to the sequence of partial sums. 5.4 THEOREM. The series x n converges if and only if for every ɛ > 0 there is an n ɛ such that m 5.5 x i ɛ for all m n n ɛ. i=n In particular, taking m = n in (5.5) we obtain x n ɛ. Thus we have obtained the following: 5.6 COROLLARY. If x n converges, then lim x n = 0.

19 5. SERIES 15 The converse is not true. For example, lim 1/n = 0 but 1/n is divergent. In the case of series with positive terms, partial sums form an increasing sequence, and hence, the following holds (see Exercise 4.4): 5.7 PROPOSITION. Suppose that the x n are positive. Then x n converges if and only if the sequence of partial sums is bounded. In many cases, we encounter series whose terms are positive and decreasing. The following theorem due to Cauchy is helpful in such cases, especially if the terms involve powers. Note the way a rather thin sequence determines the convergence or divergence of the whole series. 5.8 THEOREM. Suppose that (x n ) is decreasing and positive. Then x n converges if and only if the series x 1 + 2x 2 + 4x 4 + 8x 8 + converges. PROOF. Let s n = x x n as usual and put t k = x 1 + 2x k x 2 k. Now, for n 2 k, since x 1 x 2 0, s n x 1 + (x 2 + x 3 ) + (x 4 + x 7 ) + + (x 2 k + + x 2 k+1 1) = t k, and for n 2 k, x 1 + 2x 2 + 4x k x 2 k s n x 1 + x 2 + (x 3 + x 4 ) + (x 5 + x 8 ) + + (x 2 k x 2 k) 1 2 x 1 + x 2 + 2x k 1 x 2 k = 1 2 t k. Thus, the sequences (s n ) and (t n ) are either both bounded or both unbounded, which completes the proof via Proposition EXAMPLE. 1/n p converges if p > 1 and diverges if p 1. For p 0, the claim is trivial to see. For p > 0, the terms x n = 1/n p form a decreasing positive sequnce, and thus, the preceding theorem applies. Now, 2 k x 2 k = (2 1 p ) k, k=0 which converges if 2 1 p < 1 and diverges otherwise. Since 2 1 p < 1 if and only if p > 1, we are done.

20 16 SETS AND FUNCTIONS 5.10 EXAMPLE. The series 2 1 n(log n) p converges if p (1, ) and diverges otherwise. Here we start the series with n = 2 since log 1 = 0. Since the logarithm function is monotone increasing, Theorem 5.8 applies. Now, x n = 1/n(log n) p and so 2 k x 2 k = k=1 1 2 k 1 2 k (log 2 k ) p = 1 (log 2) p 1 1 k p, which converges if and only if p > 1 in view of the preceding example. Ratio Test, Root Test The ratio test ties the convergence of x n to the behavior of the ratios x n+1 /x n for large n; it is highly useful THEOREM. 1. If lim sup x n+1 /x n < 1, then x n converges. 2. If lim inf x n+1 /x n > 1, then x n diverges. PROOF. (1) If lim sup x n+1 /x n < 1, then there is a number r [0, 1) and an integer n 0 such that x n+1 /x n r for all n n 0. Thus x n0+k x n0 r k for all k 0, and therefore, for m > n > n 0, m x i x i x n0 i=n i=n i=n r i n0 = x n0 rn n0 1 r. Given ɛ > 0 choose n ɛ so that x n0 r nɛ n0 /(1 r) < ɛ. Then Cauchy s criterion works with this n ɛ and x n converges. (2) If lim inf x n+1 /x n > 1 then there is an integer n 0 such that x n+1 x n for all n n 0. Hence, x n x n0 for all n n 0 which shows that (x n ) does not converge to 0 as it must in order for x n to converge (see Corollary 5.6). The preceding test gives no information in cases where lim inf x n+1 /x n 1 lim sup x n+1 /x n.

21 5. SERIES 17 For instance, for the two series 1/n and 1/n 2, both the lim inf and the lim sup are equal to 1, but the first series diverges whereas the second converges. Also, the series obviously converges to 3/2; yet, the ratio test is miserably inconclusive: lim inf x n+1 x n ( ) n 2 = lim = 0 3 lim sup x n+1 x n = lim ( ) n 3 =. 2 The following test, called the root test, is a stronger test if the ratio test works, so does the root test. But the root test works in some situations where the ratio test fails; for example, the root test works for the series (5.12) THEOREM. Let a = lim sup x n 1/n. Then x n converges if a < 1, and diverges if a > 1. PROOF. Suppose that a < 1. Then, there is a b (a, 1) such that x n 1/n b for all n n 0, where n 0 is some integer. Then, x n b n for all n n 0, and comparing xn with the geometric series b n shows that x n converges. Suppose that a > 1. Then, a subsequence of x n must converge to a > 1, which means that x n 1 for infinitely many n. So, (x n ) does not converge to zero, and hence, x n cannot converge. Power Series Given a sequence (c n ) of complex numbers, the series 5.14 c n z n 0 is called a power series. The numbers c 0, c 1,... are called the coefficients of the power series; here z is a complex number. In general, the series will converge or diverge, depending on the choice of z. As the following theorem shows, there is a number r [0, ], called the radius of convergence, such that the series converges if z < r and diverges if z > r. The behavior for z = r is much more complicated and cannot be described easily THEOREM. Let a = lim sup c n 1/n and r = 1/a. 1. If z < r, then c n z n converges.

22 18 SETS AND FUNCTIONS 2. If z > r, then c n z n diverges. PROOF. Put x n = c n z n and apply the root test with lim sup x n 1/n = z lim sup c n 1/n = a z = z r EXAMPLE. 1. z n /n! = e z and r =. 2. z n converges for z < 1 and diverges for z 1; r = z n /n 2 converges for z 1 and diverges for z > 1; r = z n /n converges for z < 1 and diverges for z > 1; r = 1; for z = 1 the series diverges, but for z = 1 but z 1 it converges. Absolute Convergence The series x n is said to converge absolutely if x n is convergent. If the x n are all positive numbers, then absolute convergence is the same as convergence. Using Cauchy s criterion (see Theorem 5.4) on both sides of m m x i x i i=n shows that if x n converges absolutely then it converges. But the converse is not true: for example, ( 1) n /n i=n converges but is not absolutely convergent. The comparison tests above, as well as the root and ratio tests, are in fact tests for absolute convergence. If a series is not absolutely convergent, one has to study the sequence of partial sums to determine whether the series converges at all.

23 5. SERIES 19 Rearrangements Let (k 1, k 2,...) be a sequence in which every integer n 1 appears once and only once, that is, n k n is a bijection from N onto N. If y n = x kn, n N, for such a sequence (k n ), then we say that (y n ) is a rearrangement of (x n ). Let (y n ) be a rearrangement of (x n ). In general, the series y n and x n are quite different. However, if x n is absolutely convergent, then so is y n and it converges to the same number as does x n. The converse is also true: if every rearrangement of the series x n converges, then the series x n is absolutely convergent and all its rearrangements converge (to the same sum). On the other hand, if x n is not absolutely convergent, its various rearrangements may converge or diverge, and in the case of convergence, the sum generally depends on the rearrangement chosen. For instance, is convergent, but not absolutely so. Its rearrangement (with pattern) is again convergent, but not to the same sum. In fact, the following theorem due to Riemann shows that one can create rearrangements that are as bizarre as one wants THEOREM. Let x n be convergent but not absolutely. Then, for any two numbers a b in R there is a rearrangement y n of x n such that lim inf n y i = a, 1 lim sup n y i = b. We omit the proof. Note that, in particular, taking a = b we can find a rearrangement yn with sum a, no matter what a is. Exercises: 5.1 Determine the convergence or divergence of the following: 1. ( n + 1 n) 2. ( n + 1 n)/n 3. (sin n)/(n n) 4. ( 1) n n/(n 2 + 1). In case of convergence, indicate whether it is absolute convergence. 1

24 20 SETS AND FUNCTIONS 5.2 Show that if x n converges then so does xn /n. 5.3 Show that if x n converges and (y n ) is bounded and monotone (either increasing or decreasing), then x n y n converges. 5.4 Find the radius of convergence of each of the following power series: 1. n 2 z n, 2. 2 n z n /n!, 3. 2 n z n /n 2, 4. n 3 z n /3 n. 5.5 Suppose that f(z) = c n z n. Express the sum of the even terms, c 2n z 2n, and the sum of the odd terms, c 2n+1 z 2n+1, in terms of f. 5.6 Suppose that f(z) = c n z n. Express c 3n z 3n in terms of f. 5.7 Rearrangements. Let x n be a series that converges absolutely. Prove that every rearrangement of x n converges, and that they all converge to the same sum. 5.8 Riemann s Theorem. Prove Riemann s theorem 5.17 by filling in the details in the following outline: 1. Let (x + n ) denote the subsequence consisting of the positive elements of (x n ) and let (x n ) denote the subsequence of negative elements of (x n ). Both of these sequences must be infinite. 2. Both sequences (x + n ) and (x n ) converge to zero. 3. Both series x + n and x n diverge. 4. Suppose that a, b R and define a rearrangement as follows: start with the positive elements and choose elements from this set until the partial sum exceeds b. Then, choose elements from the set of negative elements until the partial sum is less than a. Then, choose elements from the set of positive elements until the partial sum exceeds b. Continue this proceedure of alternating between elements of the positive and negative sets indefinitely. 5. Prove that the procedure described above can be continued ad infinitum. 6. Prove that this rearrangement has the properties stated in Riemann s theorem. 7. Extend the above arguments to the case where a, b = ±. 5.9 Poisson distribution. Let p n = e λ λ n /n! where λ is a positive real. Show that 1. p n > 0,

25 5. SERIES n=0 p n = 1, 3. n=0 np n = λ Borel Summability. Consider a series n=0 x n with partial sums s n = n i=0 x i. We say that the series is Borel summable if lim λ n=0 s n p n converges, where p n are the Poisson probabilities defined in Exercise 5.9. For what values of z is the geometric series n=0 zn Borel summable?

26 22 SETS AND FUNCTIONS

27 Metric Spaces Basic questions of analysis on the real line are tied to the notions of closeness and distances between points. The same issue of closeness comes up in more complicated settings, for instance, like when we try to approximate a function by a simpler function. Our aim is to introduce the idea of distance in general, so that we can talk of the distance between two functions with the same conceptual ease as when we talk of the distance between two points in the plane. After that, we discuss the main issues: convergence, continuity, approximations. All along, there will be examples of different spaces and different ways of measuring distances. 6 Euclidean Spaces This section is to review the space R n together with its Euclidean distance. Recall that each element of R n is an n-tuple x = (x 1,..., x n ), where the x i are real numbers. The elements of R n are called points or vectors, and we are familiar with the operations like addition of vectors and multiplication by scalars. Inner Product and Norm For x and y in R n, their inner product x y is the number 6.1 x y = n x i y i. If we regard x and y as column vectors, then x y = x T y. For x in R n, the norm of x is defined to be the positive number x = x x = n 1 x2 i. The norm satisfies the following: x 0 for every x in R n, x = 0 if and only if x = 0, x + y x + y for all x and y in R n. 23

28 24 METRIC SPACES Of these, 6.3 and 6.4 are obvious, and 6.5 is immediate from the following, which is called the Schwartz inequality. 6.6 PROPOSITION. x y x y for all x and y in R n. PROOF. Consider the function f(λ) = λy x 2 = λ 2 y 2 2λ(x y) + x 2. This function is clearly positive and quadratic and its minimum occurs at λ = x y y 2. For this value of λ we have 0 f( x y y)2 ) = (x y 2 y 2 + x 2 from which Schwartz s inequality follows immediately. Euclidean Distance For x and y in R n, the Euclidean distance between x and y is defined to be the number x y. It follows from the properties given above that, for all x, y, z in R n, 1. x y 0, 2. x y = y x, 3. x y = 0 if and only if x = y, 4. x y + y z x z. The last is called the triangle inequality: on R 2, if the points x, y, z are the vertices of a triangle, this is simply the well-known fact that the sum of the lengths of two sides is greater than or equal to the length of the third side. The set R n together with the Euclidean distance is called n-dimensional Euclidean space. The Euclidean spaces are important examples of metric spaces. Exercises: 6.1 Show that the mapping (x, y) x y from R n R n into R is a linear transformation in x and is a linear transformation in y (and therefore is said to be bilinear). Conclude that (x + y) (x + y) = x x + 2x y + y y. Use this and the Schwartz inequality to prove (6.5).

29 7. METRIC SPACES Show that x + y 2 + x y 2 = 2 x y 2. Interpret this in geometric terms, on R 2, as a statement about parallelograms. 6.3 Points x and y are said to be orthogonal if x y = 0. Show that this is equivalent to saying that the lines connecting the origin to x and y are perpendicular. In general, letting α be the angle between the lines through x and y, we have x y = x y cos α. 7 Metric Spaces Let E be a set. A metric on E is a function d : E E R + that satisfies the following for all x, y, z in E: 1. d(x, y) = d(y, x), 2. d(x, y) = 0 if and only if x = y, 3. d(x, y) + d(y, z) d(x, z). A metric space is a pair (E, d) where E is a set and d is a metric on E. In this context, we think of E as a space, call the elements of E points, and refer to d(x, y) as the distance from x to y. EXAMPLES. 7.1 Euclidean spaces. Consider R n with the Euclidean distance d(x, y) = x y on it. It follows from (1) (4) that d is a metric on R n. Thus, (R n, d) is a metric space and is called n-dimensional Euclidean space. 7.2 Manhattan metric. On R n define a metric d by d(x, y) = n x i y i. 1 This d is called the Manhattan metric, or l 1 -metric, on R n, and (R n, d) is a metric space again. Note that for n > 1 this metric is different from the Euclidean metric of the preceding example. 7.3 Space C. Let C denote the set of all continuous functions from the interval [0, 1] into R. For x and y in C, let d(x, y) = sup x(t) y(t). 0 t 1

30 26 METRIC SPACES It is clear that d(x, y) is a positive real number, that d(x, y) = d(y, x), and that d(x, y) = 0 if and only if x = y. As for the triangle inequality, we note that x(t) z(t) x(t) y(t) + y(t) z(t) d(x, y) + d(y, z) for every t in [0, 1], from which we have d(x, y) + d(y, z) d(x, z). Thus, d is a metric on C, and (C, d) is a metric space. This metric space is important in analysis. Usage In the literature, it is common practice to call E a metric space if (E, d) is a metric space for some metric d. If there is only one metric under consideration, this is harmless and saves time. For instance, the phrase Euclidean space R n refers to (R n, d) where d is the Euclidean metric. For a while at least, we shall indicate the metric involved in each case in order to avoid all possible confusion. Distances from Points to Sets and from Sets to Sets Let (E, d) be a metric space. For x in E and A E, let 7.4 d(x, A) = inf{d(x, y) : y A}; this is called the distance from the point x to the set A. For A E and B E, the distance from A to B is defined by 7.5 d(a, B) = inf{d(x, y) : x A, y B}. The diameter of a set A E is defined to be 7.6 diam A = sup{d(x, y) : x A, y A}. A set is said to be bounded if its diameter is finite. Balls Let (E, d) be a metric space. For x in E and r in (0, ), 7.7 B(x, r) = {y E : d(x, y) < r} is called the open ball with center x and radius r, and 7.8 B(x, r) = {y E : d(x, y) r} is the corresponding closed ball. For example, if E = R 3 and d is the usual Euclidean metric, then B(x, r) becomes the set of all points inside the sphere with center x and radius r, and B(x, r) is the set of all points inside or on that sphere. Exercises and Complements:

31 7. METRIC SPACES Discrete metric. Let E be an arbitrary set. Define [ 1 if x y, d(x, y) = 0 if x = y. Show that this d is a metric on E. It is called the discrete metric on E. 7.2 Metrics on R n. For each number p 1, d p (x, y) = ( n x i y i p ) 1/p 1 defines a metric d p on R n. Note that d 1 is the Manhatten metric, and d 2 is the Euclidean metric. Finally, is again a metric on R n. Show this. d (x, y) = sup x i y i 1 i n 7.3 Equivalent Metrics. Two metrics d and d are equivalent if there exist strictly positive constants c 1 and c 2 such that for all x, y: c 1 d (x, y) d(x, y) c 2 d (x, y). Show that d 1, d 2, and d are all equivalent to each other. 7.4 Weighted Metrics on R n. The metrics introduced in the preceding exercise treat all components of x y equally. This is reasonable if R n is thought of geometrically and the selection of a coordinate system is unimportant. On the other hand, if x = (x 1,..., x n ) stands for a shopping list that requires buying x 1 units of product one, and x 2 units of product two, and so on, then it would make much better sense to define the distance between two shopping lists x and y by d(x, y) = n w i x i y i 1 where x 1,..., w n are fixed, strictly positive numbers, with w i being the value of one unit of product i. Show that this d is indeed a metric. More generally, paralleling the metrics introduced in the previous exercise, d p (x, y) = ( n w i x i y i p ) 1/p, x, y R n, i is a metric on R n for each p 1 and each fixed, strictly positive vector w (the latter means w 1 > 0,..., w n > 0).

32 28 METRIC SPACES 7.5 l 2 -Spaces. Instead of R n, now consider the space R of all infinite sequences in R, that is, each x in R is a sequence x = (x 1, x 2,...) of real numbers. In analogy with the d 2 metrics introduced on R n in Exercises 7.2 and 7.4, we define d 2 (x, y) = ( x i y i 2 ) 1/2. 1 This d 2 satisfies all the conditions for a metric except that d 2 (x, y) can be for some x and y. To remedy the latter, we let E be the set of all x in R with x 2 i <. 1 Then, by an easy generalization of the Schwartz inequality, it follows that d 2 (x, y) < for all x and y in E. Thus, (E, d 2 ) is a metric space. It is generally denoted by l Metrics on C. Consider the set C of all continuous functions from [0, 1] into R. The interval [0, 1] can be replaced by any bounded interval [a, b], in which case one writes C([a, b]). A number of metrics can be defined on C in analogy with those in Exercise 7.2. The analogy is provided by the following observation: every x in R n can be thought of as a function x from { 1 n, 2 n,..., n n } into R, namely, the function x with x(t) = x i for t = i/n. Thus, replacing the set { 1 2 n n,..., n n } with the interval [0, 1] and replacing the summation by integration, we obtain d p (x, y) = ( 1 0 x(t) y(t) p dt) 1/p for all x and y in C. Since any continuous function on [0, 1] is bounded, the integral here is finite and it is easy to check the conditions for this d p to be a metric, except perhaps for the triangle inequality. So, for each p 1, this d p is a metric on C. Incidentally, the metric of Example 7.3 can be denoted by d in analogy with d in Exercise Open Balls. Let E = R 2. Describe the open ball B(x, r), for fixed x and r, under each of the following metrics: 1. d 2 of Exercise d 1 of Exercise d of Exercise d 2 of Exercise 7.4 with w 1 = 1 and w 2 = Open Balls in C. For the metric space of Example 7.3, describe B(x, r) for a fixed function x and fixed number r > 0. Draw pictures!

33 8. OPEN AND CLOSED SETS Product Spaces. Let (E 1, d 1 ) and (E 2, d 2 ) be arbitrary metric spaces. Let E = E 1 E 2 and define, for x = (x 1, x 2 ) in E and y = (y 1, y 2 ) in E, d(x, y) = [d 1 (x 1, y 1 ) 2 + d 2 (x 2, y 2 ) 2 ] 1/2. Show that d is a metric on E. The metric space (E, d) is called the product of the metric spaces (E 1, d 1 ) and (E 2, d 2 ). 8 Open and Closed Sets Let (E, d) be a metric space. All points mentioned below are points of E, all sets are subsets of E. Recall the definition 7.7 of the open ball B(x, r) with center x and radius r. 8.1 DEFINITION. A set A is said to be open if for every x in A there is an r > 0 such that B(x, r) A. A set is said to be closed if its complement is open. For example, if E = R with the usual distance, the intervals (a, b), (, b), (a, ) are open, the intervals [a, b], (, b], [a, ) are closed, and the interval (a, b] is neither open nor closed. 8.2 PROPOSITION. Every open ball is open. PROOF. Fix x and r. To show that B(x, r) is open, we need to show that for every y in B(x, r) there is a q > 0 such that B(y, q) B(x, r). This is accomplished by picking q = r d(x, y). Since y is in B(x, r), we have d(x, y) < r and, hence, q > 0. And, every point of B(y, q) is a point of B(x, r), because z B(y, q) means d(z, y) < q which implies that d(z, x) d(z, y) + d(y, x) < q + d(y, x) = r. 8.3 THEOREM. The sets and E are open. The intersection of a finite number of open sets is open. The union of an arbitrary collection of open sets is open. PROOF. The first assertion is trivial from the definition. We prove the second assertion for the intersection of two open sets. The general case follows from the repeated aplication of the case for two. Let A and B be open. Let x A B. Since A is open and x is in A, there is p > 0 such that B(x, p) A.

### Course 221: Analysis Academic year , First Semester

Course 221: Analysis Academic year 2007-08, First Semester David R. Wilkins Copyright c David R. Wilkins 1989 2007 Contents 1 Basic Theorems of Real Analysis 1 1.1 The Least Upper Bound Principle................

### x if x 0, x if x < 0.

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

### Course 421: Algebraic Topology Section 1: Topological Spaces

Course 421: Algebraic Topology Section 1: Topological Spaces David R. Wilkins Copyright c David R. Wilkins 1988 2008 Contents 1 Topological Spaces 1 1.1 Continuity and Topological Spaces...............

### Metric Spaces. Chapter 7. 7.1. Metrics

Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

### NOTES ON MEASURE THEORY. M. Papadimitrakis Department of Mathematics University of Crete. Autumn of 2004

NOTES ON MEASURE THEORY M. Papadimitrakis Department of Mathematics University of Crete Autumn of 2004 2 Contents 1 σ-algebras 7 1.1 σ-algebras............................... 7 1.2 Generated σ-algebras.........................

### 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

### Sequences and Convergence in Metric Spaces

Sequences and Convergence in Metric Spaces Definition: A sequence in a set X (a sequence of elements of X) is a function s : N X. We usually denote s(n) by s n, called the n-th term of s, and write {s

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### Metric Spaces. Chapter 1

Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence

### Limits and convergence.

Chapter 2 Limits and convergence. 2.1 Limit points of a set of real numbers 2.1.1 Limit points of a set. DEFINITION: A point x R is a limit point of a set E R if for all ε > 0 the set (x ε,x + ε) E is

### Compactness in metric spaces

MATHEMATICS 3103 (Functional Analysis) YEAR 2012 2013, TERM 2 HANDOUT #2: COMPACTNESS OF METRIC SPACES Compactness in metric spaces The closed intervals [a, b] of the real line, and more generally the

### 6. Metric spaces. In this section we review the basic facts about metric spaces. d : X X [0, )

6. Metric spaces In this section we review the basic facts about metric spaces. Definitions. A metric on a non-empty set X is a map with the following properties: d : X X [0, ) (i) If x, y X are points

### MAT2400 Analysis I. A brief introduction to proofs, sets, and functions

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

### Notes on metric spaces

Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.

### This chapter describes set theory, a mathematical theory that underlies all of modern mathematics.

Appendix A Set Theory This chapter describes set theory, a mathematical theory that underlies all of modern mathematics. A.1 Basic Definitions Definition A.1.1. A set is an unordered collection of elements.

### Sets and functions. {x R : x > 0}.

Sets and functions 1 Sets The language of sets and functions pervades mathematics, and most of the important operations in mathematics turn out to be functions or to be expressible in terms of functions.

### BANACH AND HILBERT SPACE REVIEW

BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but

### No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

### Double Sequences and Double Series

Double Sequences and Double Series Eissa D. Habil Islamic University of Gaza P.O. Box 108, Gaza, Palestine E-mail: habil@iugaza.edu Abstract This research considers two traditional important questions,

### Linear Algebra I. Ronald van Luijk, 2012

Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.

### Metric Spaces Joseph Muscat 2003 (Last revised May 2009)

1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of

### k=1 k2, and therefore f(m + 1) = f(m) + (m + 1) 2 =

Math 104: Introduction to Analysis SOLUTIONS Alexander Givental HOMEWORK 1 1.1. Prove that 1 2 +2 2 + +n 2 = 1 n(n+1)(2n+1) for all n N. 6 Put f(n) = n(n + 1)(2n + 1)/6. Then f(1) = 1, i.e the theorem

### Series. Chapter Convergence of series

Chapter 4 Series Divergent series are the devil, and it is a shame to base on them any demonstration whatsoever. Niels Henrik Abel, 826 This series is divergent, therefore we may be able to do something

### 1. R In this and the next section we are going to study the properties of sequences of real numbers.

+a 1. R In this and the next section we are going to study the properties of sequences of real numbers. Definition 1.1. (Sequence) A sequence is a function with domain N. Example 1.2. A sequence of real

### 1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

### Chapter 2 Limits Functions and Sequences sequence sequence Example

Chapter Limits In the net few chapters we shall investigate several concepts from calculus, all of which are based on the notion of a limit. In the normal sequence of mathematics courses that students

### INTRODUCTORY SET THEORY

M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

### God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

### CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

### x = (x 1,..., x d ), y = (y 1,..., y d ) x + y = (x 1 + y 1,..., x d + y d ), x = (x 1,..., x d ), t R tx = (tx 1,..., tx d ).

1. Lebesgue Measure 2. Outer Measure 3. Radon Measures on R 4. Measurable Functions 5. Integration 6. Coin-Tossing Measure 7. Product Measures 8. Change of Coordinates 1. Lebesgue Measure Throughout R

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied

### CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify

### Classical Analysis I

Classical Analysis I 1 Sets, relations, functions A set is considered to be a collection of objects. The objects of a set A are called elements of A. If x is an element of a set A, we write x A, and if

### Introduction to Topology

Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................

### n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...

6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence

### {f 1 (U), U F} is an open cover of A. Since A is compact there is a finite subcover of A, {f 1 (U 1 ),...,f 1 (U n )}, {U 1,...

44 CHAPTER 4. CONTINUOUS FUNCTIONS In Calculus we often use arithmetic operations to generate new continuous functions from old ones. In a general metric space we don t have arithmetic, but much of it

### SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces

### Chap2: The Real Number System (See Royden pp40)

Chap2: The Real Number System (See Royden pp40) 1 Open and Closed Sets of Real Numbers The simplest sets of real numbers are the intervals. We define the open interval (a, b) to be the set (a, b) = {x

### 2 Sequences and Accumulation Points

2 Sequences and Accumulation Points 2.1 Convergent Sequences Formally, a sequence of real numbers is a function ϕ : N R. For instance the function ϕ(n) = 1 n 2 for all n N defines a sequence. It is customary,

### MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

### Problem Set. Problem Set #2. Math 5322, Fall December 3, 2001 ANSWERS

Problem Set Problem Set #2 Math 5322, Fall 2001 December 3, 2001 ANSWERS i Problem 1. [Problem 18, page 32] Let A P(X) be an algebra, A σ the collection of countable unions of sets in A, and A σδ the collection

### Infinite product spaces

Chapter 7 Infinite product spaces So far we have talked a lot about infinite sequences of independent random variables but we have never shown how to construct such sequences within the framework of probability/measure

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### 3.1. Sequences and Their Limits Definition (3.1.1). A sequence of real numbers (or a sequence in R) is a function from N into R.

CHAPTER 3 Sequences and Series 3.. Sequences and Their Limits Definition (3..). A sequence of real numbers (or a sequence in R) is a function from N into R. Notation. () The values of X : N! R are denoted

### Structure of Measurable Sets

Structure of Measurable Sets In these notes we discuss the structure of Lebesgue measurable subsets of R from several different points of view. Along the way, we will see several alternative characterizations

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

### Math212a1010 Lebesgue measure.

Math212a1010 Lebesgue measure. October 19, 2010 Today s lecture will be devoted to Lebesgue measure, a creation of Henri Lebesgue, in his thesis, one of the most famous theses in the history of mathematics.

### Sets and Cardinality Notes for C. F. Miller

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

### Prof. Girardi, Math 703, Fall 2012 Homework Solutions: Homework 13. in X is Cauchy.

Homework 13 Let (X, d) and (Y, ρ) be metric spaces. Consider a function f : X Y. 13.1. Prove or give a counterexample. f preserves convergent sequences if {x n } n=1 is a convergent sequence in X then

### CHAPTER 3. Sequences. 1. Basic Properties

CHAPTER 3 Sequences We begin our study of analysis with sequences. There are several reasons for starting here. First, sequences are the simplest way to introduce limits, the central idea of calculus.

ADVANCED CALCULUS Lecture notes for MA 440/540 & 441/541 2015/16 Rudi Weikard log x 1 1 2 3 4 5 x 1 2 Based on lecture notes by G. Stolz and G. Weinstein Version of September 3, 2016 1 Contents First things

### Chapter 2 Sequences and Series

Chapter 2 Sequences and Series 2. Sequences A sequence is a function from the positive integers (possibly including 0) to the reals. A typical example is a n = /n defined for all integers n. The notation

### Chapter 6 SEQUENCES. sn 1+1,s 1 =1 is again an abbreviation for the sequence { 1, 1 2, 1 } n N ε,d (s n,s) <ε.

Chapter 6 SEQUENCES 6.1 Sequences A sequence is a function whose domain is the set of natural numbers N. If s is a sequence, we usually denote its value at n by s n instead of s (n). We may refer to the

### Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

### 1 Norms and Vector Spaces

008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)

### Solutions to Homework 10

Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x

### Chapter 1. Metric Spaces. Metric Spaces. Examples. Normed linear spaces

Chapter 1. Metric Spaces Metric Spaces MA222 David Preiss d.preiss@warwick.ac.uk Warwick University, Spring 2008/2009 Definitions. A metric on a set M is a function d : M M R such that for all x, y, z

### In mathematics you don t understand things. You just get used to them. (Attributed to John von Neumann)

Chapter 1 Sets and Functions We understand a set to be any collection M of certain distinct objects of our thought or intuition (called the elements of M) into a whole. (Georg Cantor, 1895) In mathematics

### Ri and. i=1. S i N. and. R R i

The subset R of R n is a closed rectangle if there are n non-empty closed intervals {[a 1, b 1 ], [a 2, b 2 ],..., [a n, b n ]} so that R = [a 1, b 1 ] [a 2, b 2 ] [a n, b n ]. The subset R of R n is an

### It is not immediately obvious that this should even give an integer. Since 1 < 1 5

Math 163 - Introductory Seminar Lehigh University Spring 8 Notes on Fibonacci numbers, binomial coefficients and mathematical induction These are mostly notes from a previous class and thus include some

### ) + ˆf (n) sin( 2πnt. = 2 u x 2, t > 0, 0 < x < 1. u(0, t) = u(1, t) = 0, t 0. (x, 0) = 0 0 < x < 1.

Introduction to Fourier analysis This semester, we re going to study various aspects of Fourier analysis. In particular, we ll spend some time reviewing and strengthening the results from Math 425 on Fourier

### A sequence of real numbers or a sequence in R is a mapping f : N R.

A sequence of real numbers or a sequence in R is a mapping f : N R. A sequence of real numbers or a sequence in R is a mapping f : N R. Notation: We write x n for f(n), n N and so the notation for a sequence

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### TOPIC 3: CONTINUITY OF FUNCTIONS

TOPIC 3: CONTINUITY OF FUNCTIONS. Absolute value We work in the field of real numbers, R. For the study of the properties of functions we need the concept of absolute value of a number. Definition.. Let

### SETS, RELATIONS, AND FUNCTIONS

September 27, 2009 and notations Common Universal Subset and Power Set Cardinality Operations A set is a collection or group of objects or elements or members (Cantor 1895). the collection of the four

### Cartesian Products and Relations

Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special

### Section 1.1. Introduction to R n

The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to

### Linear Algebra Notes for Marsden and Tromba Vector Calculus

Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of

### REAL ANALYSIS I HOMEWORK 2

REAL ANALYSIS I HOMEWORK 2 CİHAN BAHRAN The questions are from Stein and Shakarchi s text, Chapter 1. 1. Prove that the Cantor set C constructed in the text is totally disconnected and perfect. In other

### Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely

### Riesz-Fredhölm Theory

Riesz-Fredhölm Theory T. Muthukumar tmk@iitk.ac.in Contents 1 Introduction 1 2 Integral Operators 1 3 Compact Operators 7 4 Fredhölm Alternative 14 Appendices 18 A Ascoli-Arzelá Result 18 B Normed Spaces

### Vector and Matrix Norms

Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty

### Math 317 HW #5 Solutions

Math 317 HW #5 Solutions 1. Exercise 2.4.2. (a) Prove that the sequence defined by x 1 = 3 and converges. x n+1 = 1 4 x n Proof. I intend to use the Monotone Convergence Theorem, so my goal is to show

### Inner Product Spaces

Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

### 1. Periodic Fourier series. The Fourier expansion of a 2π-periodic function f is:

CONVERGENCE OF FOURIER SERIES 1. Periodic Fourier series. The Fourier expansion of a 2π-periodic function f is: with coefficients given by: a n = 1 π f(x) a 0 2 + a n cos(nx) + b n sin(nx), n 1 f(x) cos(nx)dx

### REAL ANALYSIS LECTURE NOTES: 1.4 OUTER MEASURE

REAL ANALYSIS LECTURE NOTES: 1.4 OUTER MEASURE CHRISTOPHER HEIL 1.4.1 Introduction We will expand on Section 1.4 of Folland s text, which covers abstract outer measures also called exterior measures).

### We call this set an n-dimensional parallelogram (with one vertex 0). We also refer to the vectors x 1,..., x n as the edges of P.

Volumes of parallelograms 1 Chapter 8 Volumes of parallelograms In the present short chapter we are going to discuss the elementary geometrical objects which we call parallelograms. These are going to

### FUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 3. BANACH SPACES

FUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 3. BANACH SPACES CHRISTOPHER HEIL 1. Elementary Properties and Examples Notation 1.1. Throughout, F will denote either the real line R or the complex plane C.

### PART I. THE REAL NUMBERS

PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS

### Mathematics Review for MS Finance Students

Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,

### Analysis I. 1 Measure theory. Piotr Haj lasz. 1.1 σ-algebra.

Analysis I Piotr Haj lasz 1 Measure theory 1.1 σ-algebra. Definition. Let be a set. A collection M of subsets of is σ-algebra if M has the following properties 1. M; 2. A M = \ A M; 3. A 1, A 2, A 3,...

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### Sequences of Functions

Sequences of Functions Uniform convergence 9. Assume that f n f uniformly on S and that each f n is bounded on S. Prove that {f n } is uniformly bounded on S. Proof: Since f n f uniformly on S, then given

### Sets, Relations and Functions

Sets, Relations and Functions Eric Pacuit Department of Philosophy University of Maryland, College Park pacuit.org epacuit@umd.edu ugust 26, 2014 These notes provide a very brief background in discrete

### (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties

Lecture 1 Convex Sets (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties 1.1.1 A convex set In the school geometry

### Geometric Transformations

Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted

### Math 563 Measure Theory Project 1 (Funky Functions Group) Luis Zerón, Sergey Dyachenko

Math 563 Measure Theory Project (Funky Functions Group) Luis Zerón, Sergey Dyachenko 34 Let C and C be any two Cantor sets (constructed in Exercise 3) Show that there exists a function F: [,] [,] with

### Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions

Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions D. R. Wilkins Copyright c David R. Wilkins 2016 Contents 3 Functions 43 3.1 Functions between Sets...................... 43 3.2 Injective

### Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

### So let us begin our quest to find the holy grail of real analysis.

1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers

### Taylor Polynomials and Taylor Series Math 126

Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will

### E3: PROBABILITY AND STATISTICS lecture notes

E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................

### 2 Complex Functions and the Cauchy-Riemann Equations

2 Complex Functions and the Cauchy-Riemann Equations 2.1 Complex functions In one-variable calculus, we study functions f(x) of a real variable x. Likewise, in complex analysis, we study functions f(z)

### INTRODUCTION TO TOPOLOGY

INTRODUCTION TO TOPOLOGY ALEX KÜRONYA In preparation January 24, 2010 Contents 1. Basic concepts 1 2. Constructing topologies 13 2.1. Subspace topology 13 2.2. Local properties 18 2.3. Product topology

### Weak topologies. David Lecomte. May 23, 2006

Weak topologies David Lecomte May 3, 006 1 Preliminaries from general topology In this section, we are given a set X, a collection of topological spaces (Y i ) i I and a collection of maps (f i ) i I such

### Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number

### Lecture 4: Random Variables

Lecture 4: Random Variables 1. Definition of Random variables 1.1 Measurable functions and random variables 1.2 Reduction of the measurability condition 1.3 Transformation of random variables 1.4 σ-algebra