# Analysis via Uniform Error Bounds Hermann Karcher, Bonn. Version May 2001

Save this PDF as:

Size: px
Start display at page:

Download "Analysis via Uniform Error Bounds Hermann Karcher, Bonn. Version May 2001"

## Transcription

1 Analysis via Uniform Error Bounds Hermann Karcher, Bonn. Version May 2001 The standard analysis route proceeds as follows: 1.) Convergent sequences and series, completeness of the reals, 2.) Continuity, main theorems, trivial examples, 3.) Differentiability via limits, 4. or 5.) Integrals, 5. or 4.) Properties of limit functions via uniform convergence. I propose the following reorganization of the material: 1.) Differentiation of polynomials, emphasis on tangent approximation, 2.) Differentiation rules, differentiation of rational functions, 3.) The monotonicity theorem via uniform estimates, before completeness, 4.) Completeness and limit functions, proofs via uniform estimates, 5.) Integrals, defined as generalized sums, computed with antiderivatives, 6.) Continuity, with less trivial examples. Arguments why one would want such a reorganization are: The start is closer to the background of the student, one spends more time on differentiation where technical skills have to be trained, and discusses continuity when logical skills are more developed. The main reasons why such a reorganization is possible are: The properties of limit functions follow more easily from uniform error bounds than from uniform convergence (e.g. if one has a pointwise convergent sequence of functions {f n } with a uniform Lipschitz bound L, then the limit function also has L as Lipschitz bound). The first such uniform error bounds follow for polynomials in a pre-analysis fashion. These bounds suffice to prove the Monotonicity Theorem before completeness. Finally, the Monotonicity Theorem shows that many interesting converging sequences indeed have uniform error estimates. The elementary formula 1. Derivatives of Polynomials x k a k =(x a) (x k 1 + x k 2 a a k 1 ) is good enough to replace all calls on continuity. The first consequence is x, a [ R, R] x k a k kr k 1 x a. 1

2 One only needs the triangle inequality to get for polynomials P (X) := n k=0 a kx k : x, a [ R, R] P (x) P (a) ( ak kr k 1) x a =: L x a. In other words: From the data which give the polynomial and from the interval on which we want to study it we can explicitly compute a Lipschitz bound. This conforms with the common expectation (which is disappointed by continuous functions): Differences between function values, P (x) P (a), increase no worse than proportionally to the difference of the arguments, x a. The derivative controls this rough proportionality more precisely. The term (x k 1 +x k 2 a+...+ a k 1 ), which multiplies (x a) in the above elementary formula, differs little from ka k 1 on small intervals around a. The first inequality above makes this precise: hence x [a r, a + r],r:= a + r (x k 1 + x k 2 a a k 1 ) ka k 1 k(k 1)/2R k 2 x a x k a k ka k 1 (x a) k(k 1)/2R k 2 x a 2. Observe that x a 2 is less than 1% of the argument difference x a if r<0.01. Again, the triangle inequality extends this to polynomials P (X) := n k=0 a kx k and again the error bound is explicitly computable from the data of the function and the interval in question: x [a r, a + r],r:= a + r, P (a) := n a k ka k 1 k=1 P (x) P (a) P (a)(x a) ( ak k(k 1)/2R k 2) x a 2 =: K x a 2. Application: At interior extremal points the derivative has to vanish. (If P (a) > 0 and 0 <x a<p (a)/k then P (x) >P(a), etc.) Note on Completeness. Consider the step function, which jumps from 0 to 1 at 2, but consider as its domain only the rational numbers. This function is differentiable, but not uniformly. On the other hand, if a function is uniformly continuous (or uniformly differentiable) on a dense subset of an interval, then, using completeness, one can extend the function to the whole interval without loosing continuity (or differentiability) and without changing the visible behaviour of the function. This is clearly the case for polynomials. Moreover, the above estimates make sense in any field between Q and R which the student 2

3 happens to know. Even in C they are useful. Therefore one can indeed discuss differentiability before completeness. Of course completeness remains essential if one wants to define inverse functions or limit functions. I chose to discuss completeness immediately before constructing limit functions, because I view this as the more spectacular application, but I am not advertising that choice here, I am merely saying: If one decides to work with uniform error bounds then this imposes fewer restrictions on where in the course one chooses to discuss completeness, while uniform convergence does need prior knowledge of completeness. 2. Differentiation Rules, Derivatives of Rational Functions Differentiation rules are ment to compute derivatives of complicated functions, built out of simpler ones, from the derivatives of the simpler functions. Since linear combinations, products and compositions of polynomials give again (easy to differentiate) polynomials the promise looks limited. However, there are some other functions which can be differentiated directly from their definitions, and this will broaden our possibilities considerably. We start with x 1/x and observe (1/x 1/a) =(a x)/(x a). While in the case of polynomials we could compute suitable error constants for any interval [a r, a + r] we now have to avoid division by zero. With this extra care we have: 0 <a/2 x 1/x 1/a = x a x a 2 a 0 <a/2 x (1/x 1/a + x a a 2 )= 2 x a (x a)2 x a 2 { 0 2a 3 (x a) 2. Composition of polynomials with this one extra function gets us to all rational functions. Of course, the proof of the chain rule must pay attention to the distances from zeros which occur in the denominators. In a similar way we handle the square root function. Here extra attention is needed for the domain of the function: As long as we only know rational numbers, the domain is rather thin, it contains only the squares of rational numbers (which, however, are still a dense subset). The following computation remains valid as more numbers become known. 0 <a/2 x x a = x a 1 x + a 1.7 a 1/2 x a 0 <a/2 x ( x a x a 2 a )= (x a) 2 2 a( x + a) 2 { 0 0.2a 3/2 (x a) 2. If we compose this function with polynomials then the discussion of the domain quickly becomes unmanagable; the computation shows that we know, even with error bounds, 3

4 what the derivative of the square root function has to be, well before we know enough about numbers to be able to use this function freely. All known proofs of the differentiation rules have the following property: Given two differentiable functions f,g we abbreviate their tangent functions as l f (x) :=f(a)+f (a)(x a), l g (x) :=g(a)+g (a)(x a). Then, if we assume that the differences f l f,g l g are small, then also the differences (α f + β g) (α l f + β l g ), f g l f l g, f g l f l g are in the same sense small. To prove something we have to specify small. Because of the functions known so far we may say: f l f is small means, there exists an interval [a r, a + r] and a constant K such that x [a r, a + r] f(x) l f (x) K x a 2. Later f l f is small may have a more subtle interpretation: For every ɛ>0 there exists δ>0 such that x [a δ, a + δ] f(x) l f (x) ɛ x a. I find it important to emphasize that the form of the tangent approximation and the form of the differentiation rules do not depend on the specification of small. Moreover, even the strategy of the proofs does not depend on what exactly we mean by small : if we change the definition of small in the assumptions, we can follow these changes through the proofs and end up with the changed conclusion. This possibility, to repeat the proofs under slightly changed assumptions, allows one to emphasize what is essential in these proofs. 3. Monotonicity Theorem and Related Results A fundamental fact of analysis is that rough information about the derivative f of a function f allows to deduce sharper information about f. As an example, take Lipschitz bounds: If x [α, ω] f (x) L then a, b [α, ω] f(b) f(a) L b a. For functions with uniform tangent approximations, i.e. for all the functions discussed so far, this fundamental theorem can be proved without invoking (even before discussing) the completeness of the reals. The only tool needed is Archimedes Principle, which is obvious for the rationals and an axiom for the reals: 4

5 Archimedes Principle If 0 r and r 1 n for all n N then r =0. The most intuitive result from the family of theorems that exploit derivative information probably is the Monotonicity Theorem Main assumption: x [α, ω] f (x) 0. Technical assumption replacing completeness: The function f can be uniformly approximated by its derivatives, i.e. there exist positive constants r, K such that x, a [α, ω], x a r f(x) f(a) f (a)(x a) K x a 2. Then f is nondecreasing: a, b [α, ω],a<b f(a) f(b). Note: The uniformity in the technical assumption is the crucial part, not the quadratic error bound; if one assumes For each ɛ>0 exists a δ>0, which can be chosen independent of a, such that x, a [α, ω], x a δ f(x) f(a) f (a)(x a) ɛ x a, then the strategy of the following proof also works. Proof. For any x, y [α, ω], x<ywith x y r we have (because of the two assumptions of the theorem): K x y 2 f(y) f(x) f (x)(y x) f(y) f(x). Apply this to sufficiently short subintervals [t j 1,t j ] of the interval [a, b], i.e. put t j := a + j/n (b a), 0 j n, with (b a)/n r (Archimedes!) and have: K(b a) 2 /n 2 f(t j ) f(t j 1 ),j=1...n, then sum for j =1...n: K(b a) 2 /n f(b) f(a). Archimedes Principle improves this to the desired claim 0 f(b) f(a). (The previous inequality changes under the ɛ-δ-assumption to K(b a) ɛ f(b) f(a), which also implies the theorem.) 5

6 Immediate consequences are: Generalized monotonicity: Explicit bounds: f g, a<b f(b) f(a) g(b) g(a) m f M, a<b m (b a) f(b) f(a) M (b a) Multiplicative version: f 0 <f,g, f g g, a<b ( g f ) = g f (g g f f ) 0 f(b) f(a) g(b) g(a) Iterated application to second derivatives: f B, a<x B(x a) f (x) f (a) B(x a) B 2 (x a)2 f(x) f(a) f (a)(x a) B 2 (x a)2. These are strong improvements over the error bounds which were initially computed from the coefficients of polynomials. As illustration consider the Taylor polynomials T n (X) for a (not yet constructed) function with f = f, f(0)=1: T n (x) := n ( 1) k xk k!, 0 x 1, T n(x) = T n 1 (x). k=0 Since this is a Leibniz series we have the nested intervals: [1 x, 1] [T 1 (x),t 2 (x)] [T 3 (x),t 4 (x)]... [T 2n 1 (x),t 2n (x)] hence in particular: T n (x) 1. The second derivative consequence of the monotonicity theorem now implies uniform bounds for polynomials of arbitrarily large degree: x, a [0, 1] T n (x) T n (a)+t n 1 (a)(x a) 1 2 (x a)2. Clearly, if we only had the existence of a limit function T then Archimedes Principle would imply without further words differentiability and derivative of the limit function: x, a [0, 1] T (x) T (a)+t (a)(x a) 1 2 (x a)2. 4. Completeness and Limits of Sequences of Functions At most occasions I have prefered to begin the discussion of completeness with nested intervals; immediate applications are Leibniz series like the just mentioned Taylor polynomials. Thus we have interesting limit functions together with their derivatives right from the start. 6

7 Cauchy sequences are the second step; the most important applications are sequences or series which are dominated by the geometric series (i.e. power series and the contraction lemma). Existence of sup and inf for bounded nonempty sets gives the most compact formulation for dealing with completeness. I have used the standard text book arguments, only the applications change since the results of the earlier sections are of significant technical help. Note. Since so much emphasis was placed on computable error bounds I mention that the theorem Monotone increasing, bounded sequences converge is a very significant exception. In my opinion this intuitively desirable theorem is a major justification of the standard limit definition: Because the convergence speed of monotone increasing, bounded sequences can be slowed down arbitrarily (namely by repeating the elements of the sequence more and more often) one cannot prove the monotone sequence theorem with any version of a limit definition which requires more explicit error control than the standard definition. By contrast, in numerical analysis one tries to use sequences which converge at least as fast as some geometric sequence, i.e. one has more explicit control like a n+p a n C q n. I illustrate how the monotonicity theorem often allows short replacements of standard induction proofs. Bernoulli s inequality is a version of the monotonicity theorem: f(x) :=(1+x) n 1+n x = f(0) + f (0) x, since f (x) 0 for x 1. The monotonicity of n f n (x) :=(1+x/n) n, 0 x and the decreasing of n g n (x) :=(1 x/n) n, 0 x<nrequires no technical skill since (f n/f n )(x) = 1/(1 + x/n) (f n+1/f n+1 (x) 1 1/(1 x/n) =(g n/g n )(x) (g n 1/g n 1 )(x). The following are convenient estimates of the geometric series and its derivatives which give the desired uniform constants when dealing with power series: 0 x<1, n k=0 ( n ) x k = k=0 ( n ) x k = k=0 x k = 1 xn+1 1 x n kx k = k=1 1 1 x (n +1)nxn 1 1 x (n +1)xn 1 x + 1 xn+1 (1 x) 2 1 (1 x) 2 2(n +1)xn (1 x) xn+1 (1 x) 3 2 (1 x) 3. As mentioned, the Contraction Lemma is also proved with explicit error bounds: Functions f : M M with f q<1are contracting, f(x) f(y) q x y. And for contracting 7

8 maps sequences generated by iteration, a n+1 := f(a n ), are geometrically dominated and hence Cauchy: a n+p a n a 1 a 0 q n. 1 q An example of a contracting rational map with the irrational golden ratio as fixed point is f(x) :=1/(1 + x), f:[1/2, 1] [1/2, 1], f (x) (1 + x) 2 4/9. The approximating sequence a 0 =1,a 1 =1/(1+1),...,a n =1/(1+1/(1+1/...)) consists of the optimal approximations from continued fractions. This is to show that sequences do appear in my approach, but they are handled with the monotonicity theorem and not presented as the road to differentiation. The main question about limit functions is, of course, What is their derivative? Usually one employs uniform convergence of the differentiated sequence and the main theorem connecting differentiation and integration. I illustrate the use of uniform error bounds in the case of power series P n (X) := n k=0 a kx k. The basic tool in both approaches is the comparison with a geometric series and it will better bring out the differences if I add an assumption which simplifies either approach: a bound for the coefficients, a k C. Then we have for all x with x q<1 P n+m (x) P n (x) n<k a k q k C 1 q qn+1, which shows that {P n (x)} is a Cauchy sequence (in fact uniformly for x q). For the first derivatives we obtain uniform bounds by comparing with the geometric series P n(x) k 1 a k kq k 1 C =: L. (1 q) 2 The Monotonicity Theorem implies for all n the Lipschitz bound x, y q P n (y) P n (x) L y x and Archimedes Principle extends this uniform estimate to the limit function x, y q P (y) P (x) L y x. Similarly we employ our estimate of the geometric series to get uniform bounds for the second derivatives P n (x) a k k(k 1)q k 2 k 2 C =: K, (1 q) 3 8

9 we use the Monotonicity Theorem to get uniform tangent approximations x, y q P n (y) P n (x) P n(x)(y x) K y x 2, and Archimedes Principle again extends these uniform bounds to the limit x, y q P (y) P (x) lim P n(x)(y x) K y x 2. n This proof of the differentiability and the determination of the derivative of the limit function clearly extends to complex power series, a first step to higher dimensional analysis. Another immediate extension is to the differentiation of curves c := (c 1,c 2,c 3 ):[a, b] R 3, which is important in itsself but also a prerequisite for analysis in R n. 5. Integrals, Riemann Sums, Antiderivatives Some notion of tangent (and hence some version of derivative) was known centuries before Newton. Similarly, summation of infinitesimals had already troubled the Greeks, and Archimedes determination of the area bounded by a parabola and a secant was definite progress. Against the background of this early knowledge I find the conceptual progress achieved with the definition of the integral even more stunning than that achieved with differentiation. I try to teach integrals as a fantastic generalization of sums, they allow for example to continuously sum the velocity of an object in order to obtain the distance which it travelled. With this goal in mind I think it is fundamental that Riemann sums of a function f can be computed up to controlled errors if one knows an antiderivative F of the given f, i.e. F = f. I use the standard definition of the integral in terms of Riemann sums. I add a construction of an antiderivative F for a continuous f which is in the spirit of uniform error control, but from now on the differences to the standard approach are not very pronounced. Let f :[a, b] R 3 be given. Consider a subdivision of [a, b], i.e. a = t 0 <t 1 <...<t n = b and choose intermediate points τ j [t j 1,t j ],j=1...n. For these data we define the Riemann Sum RS(f) := n f(τ j )(t j t j 1 ). j=1 Now, if f is at least continuous and F = f then the difference F (b) F (a) RS(f) is small ; how small depends on the precise assumption for f, for example a Lipschitz bound, x, y [a, b] f(y) f(x) L y x, implies the Error Bound F (b) F (a) RS(f) L (b a) max 1 j n t j t j 1. 9

10 This estimate (or other versions) follows from the Monotonicity Theorem and the triangle inequality; first note the derivative bound: hence x [t j 1,t j ] (F (x) f(τ j ) x) = f(x) f(τ j ) L x τ j L t j t j 1, F (t j ) F (t j 1 ) f(τ j )(t j t j 1 ) L t j t j 1 2, so that summation over j = 1...n gives the claimed error bound. Continuity (see below) of f implies with the same arguments an ɛ-δ-error bound: max 1 j n t j t j 1 δ F (b) F (a) RS(f) ɛ (b a). I prefer to define the integral for vector valued functions (for direct application to integrals of velocities). The notion of limit has to be generalized to cover convergence of Riemann sums: For every ɛ>0 there is a subdivison of [a, b] such that for all finer subdivisions and all choices of intermediate points τ j the corresponding Riemann sums differ by less than ɛ. Almost the same argument as used to prove the error bound gives: For continuous (or better) f the Riemann sums converge; the limit is called the integral of f over [a, b], notation b a f(x)dx. Moreover, if F = f then the error bound proves F (b) F (a) = b a f(x)dx. The triangle inequality for Riemann sums gives the Triangle Inequality for Integrals b b a<b f(x)dx f(x) dx. a Also other analogies between sums and integrals need to be discussed. I describe a construction of an antiderivative which is independent of the definition of the integral (its proof, based on uniformity, works in Banach spaces). Theorem. Let f be Lipschitz continuous on [a, b] (soon: uniformly continuous). Then one can approximate f uniformly by piecewise linear secant functions s n. These have piecewise quadratic antiderivatives and a limit of these is an antiderivative of f. In more detail: s n (t j ):=f(t j ),j=0,...,n, (a = t 0 <t 1 <...<t n = b) s n (x) := f(t j 1) (t j x)+f(t j ) (x t j 1 ) for x [t j 1,t j ] t j t j 1 f(x) s n (x) L max t j t j 1 =: r n 10 a

11 Obviously, s n has a piecewise quadratic antiderivative S n,s n(x) =s n (x),s n (0) = 0. From the Monotonicity Theorem and S n+m(x) S n(x) 2r n we have the (uniform) Cauchy property: S n+m (x) S n (x) 2(b a)r n, which, by completeness, gives a limit function S. But we again have uniform error bounds: (S n (x) S n (c) s n (c)(x c)) = s n (x) s n (c) L x c, hence S n (x) S n (c) s n (c)(x c) L x c 2. Archimedes Principle gives the final result: S (x) S (c) f(c)(x c) L x c 2, which says that S is differentiable with derivative f, as claimed. Note in this proof: The approximation S n (b) S n (a) for S (b) S (a) = b f(x)dx is a a frequently used numerical approximation for the integral of f. 6. Continuity, Theorems and Examples The arguments in this last section are the standard arguments. My point is that with the experience of the previous sections one can achieve a better understanding of continuity and, moreover, this takes less time than a treatment of continuity in the early parts of a course. Since convergent sequences were such an essential tool (for getting limit functions) we ask: What kind of functions are compatible with convergence? We define: f : A R d R e is called sequence continuous at a A if every sequence a n A which converges to the limit a A has its image sequence f(a n ) converging to f(a). We see that linear combinations, products, compositions of sequence continuous functions are (directly from the definition) sequence continuous. But 1/f causes a problem: If f(a) 0 then we would like to find an interval [a δ, a + δ] on which f is not zero. If such an interval could be found then on it 1/f would clearly be sequence continuous. It is well known that such a δ>0can only be found with an indirect proof. But this proof is essential for understanding continuity. It is also very similar to the equivalence of sequence continuous and ɛ-δ-continuous. 11

12 Definition: f is ɛ-δ-continuous at a if for every ɛ>0 there exists a δ>0 such that x [a δ, a + δ ] f(x) f(a) ɛ. It remains to prove the main theorems and to show examples. First I give short summaries of the proofs to recall what kind of arguments are involved. 1.) The intermediate value theorem: By interval halfing construct a Cauchy sequence which converges to a preimage of the given intermediate value. 2.) Boundedness on complete, bounded sets: In an indirect proof construct by interval halfing a Cauchy sequence on which the function f is unbounded, a contradiction to the continuity at the limit point of the Cauchy sequence. 3.) Extremal values are assumed on complete, bounded sets: Since the function is bounded by the previous result we have sup f and inf f; with interval halfing we find Cauchy sequences {a n } such that the sequences of values, {f(a n )}, converge to sup f resp. inf f. 4.) Uniform continuity on complete, bounded sets: Necessarily indirect, if for some ɛ > 0noδ>0 is good enough then we find a pair of Cauchy sequences {a n }, {b n } which have the same limit but f(a n ) f(b n ) ɛ, a contradiction to the continuity at the common limit point. 5.) Uniformly convergent sequences of continuous functions have a continuous limit function: To given ɛ>0 choose an ɛ/3-approximation from the sequence and for this (continuous!) approximation find δ > 0 for ɛ/3-deviations; this δ guarantees with the triangle inequality at most ɛ-deviations for the limit function. From the construction of examples I recall that comparison with a geometric sequence is the main tool. I find it misleading to call the following examples weird, as if continuity really were much more harmless. 1.) The polygonal approximations of Hilbert s cube filling curve are explicitly continuous: To guarantee value differences 2 n the arguments have to be closer than 8 n ; Archimedes Principle concludes the same for the limit function. 2. Similarly for Cantor s staircase, a monotone increasing continuous function which is differentiable with derivative 0 except on a set of measure zero: The piecewise linear approximations satisfy: To guarantee value differences 2 n the arguments have to be closer than 3 n and Archimedes Principle does the rest. 3.) And continuous but nowhere differentiable functions can be obtained as obviously uniform limits of sums of faster and faster oscillating continuous functions like k 2 k sin(8 k x). In view of the much better-than-continuos properties of all the functions we have so far been concerned with, I find it not so obvious how to demonstrate the usefulness of the notion of continuity. The proof of the existence of solutions of ordinary differential equations based on the Contraction Lemma in the complete metric space of continuous functions (sup-norm) is my lowest level convincing example. 12

13 Since the Monotonicity Theorem and its consequences are usually derived from the (essentially one-dimensional) Mean Value Theorem of Differentiation, I finally show that the theorems which conclude from assuming derivative bounds can be obtained with shorter proofs (again valid in Banach spaces). Theorem: Derivative bounds are Lipschitz bounds. More precisely, let A R d be a convex subset and let F : A R e be ɛ-δ-differentiable, and for emphasis: without any uniformity assumption. Assume further a bound on the derivative: x A TF(x) L. Then a, b A F (a) F (b) L a b. Indirect proof via halfing. If the inequality were not true then we had some a, b A with F (a) F (b) >L a b, i.e. with some fixed η>0wehad F (a) F (b) (L + η) a b. Let m := (a + b)/2 be the midpoint. Then for either a, m or m, b the same inequality has to hold (since otherwise, by the triangle inequality, F (a) F (b) < (L + η) a b ). In other words, we have a 1,b 1 with half the distance a 1 b 1 = a b /2, but still F (a 1 ) F (b 1 ) (L + η) a 1 b 1. This procedure can be repeated, we get a pair of Cauchy sequences {a n }, {b n } with the same limit c between a n and b n on the closed segment from a to b, but with the inequalities: F (a n ) F (b n ) (L + η) a n b n. By differentiability of F at c A we have for ɛ = η/2 aδ>0 such that x A, x c δ F (x) F (c) TF c (x c) ɛ x c F (x) F (c) (L + ɛ) x c. Choose n so large that a n c, b n c δ so that the last inequality holds for x = a n and x = b n. Add the inequalities and observe a n c + b n c = a n b n to obtain the contradiction (L + η) a n b n F (a n ) F (b n ) (L + η/2) a n b n < (L + η) a n b n. 13

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

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

### x a x 2 (1 + x 2 ) n.

Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number

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

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

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

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

### Some Notes on Taylor Polynomials and Taylor Series

Some Notes on Taylor Polynomials and Taylor Series Mark MacLean October 3, 27 UBC s courses MATH /8 and MATH introduce students to the ideas of Taylor polynomials and Taylor series in a fairly limited

### FIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.

FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is

### Taylor and Maclaurin Series

Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions

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

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

### 1 Fixed Point Iteration and Contraction Mapping Theorem

1 Fixed Point Iteration and Contraction Mapping Theorem Notation: For two sets A,B we write A B iff x A = x B. So A A is true. Some people use the notation instead. 1.1 Introduction Consider a function

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

### 1 Lecture: Integration of rational functions by decomposition

Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.

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

### Fixed Point Theorems

Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation

### Mathematical Methods of Engineering Analysis

Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................

### MATH 132: CALCULUS II SYLLABUS

MATH 32: CALCULUS II SYLLABUS Prerequisites: Successful completion of Math 3 (or its equivalent elsewhere). Math 27 is normally not a sufficient prerequisite for Math 32. Required Text: Calculus: Early

### HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

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

### 0 <β 1 let u(x) u(y) kuk u := sup u(x) and [u] β := sup

456 BRUCE K. DRIVER 24. Hölder Spaces Notation 24.1. Let Ω be an open subset of R d,bc(ω) and BC( Ω) be the bounded continuous functions on Ω and Ω respectively. By identifying f BC( Ω) with f Ω BC(Ω),

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

### THE BANACH CONTRACTION PRINCIPLE. Contents

THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,

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

### Student Performance Q&A:

Student Performance Q&A: AP Calculus AB and Calculus BC Free-Response Questions The following comments on the free-response questions for AP Calculus AB and Calculus BC were written by the Chief Reader,

### Section 3.7. Rolle s Theorem and the Mean Value Theorem. Difference Equations to Differential Equations

Difference Equations to Differential Equations Section.7 Rolle s Theorem and the Mean Value Theorem The two theorems which are at the heart of this section draw connections between the instantaneous rate

### Critical points of once continuously differentiable functions are important because they are the only points that can be local maxima or minima.

Lecture 0: Convexity and Optimization We say that if f is a once continuously differentiable function on an interval I, and x is a point in the interior of I that x is a critical point of f if f (x) =

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

### PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

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

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

### Open and Closed Sets

Open and Closed Sets Definition: A subset S of a metric space (X, d) is open if it contains an open ball about each of its points i.e., if x S : ɛ > 0 : B(x, ɛ) S. (1) Theorem: (O1) and X are open sets.

### TOPIC 4: DERIVATIVES

TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the

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

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

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

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

### Mathematics Georgia Performance Standards

Mathematics Georgia Performance Standards K-12 Mathematics Introduction The Georgia Mathematics Curriculum focuses on actively engaging the students in the development of mathematical understanding by

### Mathematics for Econometrics, Fourth Edition

Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents

### 3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

### AP Calculus BC. All students enrolling in AP Calculus BC should have successfully completed AP Calculus AB.

AP Calculus BC Course Description: Advanced Placement Calculus BC is primarily concerned with developing the students understanding of the concepts of calculus and providing experiences with its methods

Introduction to Calculus for Business and Economics by Stephen J. Silver Department of Business Administration The Citadel I. Functions Introduction to Calculus for Business and Economics y = f(x) is a

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

### Rolle s Theorem. q( x) = 1

Lecture 1 :The Mean Value Theorem We know that constant functions have derivative zero. Is it possible for a more complicated function to have derivative zero? In this section we will answer this question

### Functions and Equations

Centre for Education in Mathematics and Computing Euclid eworkshop # Functions and Equations c 014 UNIVERSITY OF WATERLOO Euclid eworkshop # TOOLKIT Parabolas The quadratic f(x) = ax + bx + c (with a,b,c

### Items related to expected use of graphing technology appear in bold italics.

- 1 - Items related to expected use of graphing technology appear in bold italics. Investigating the Graphs of Polynomial Functions determine, through investigation, using graphing calculators or graphing

### The Dirichlet Unit Theorem

Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

### correct-choice plot f(x) and draw an approximate tangent line at x = a and use geometry to estimate its slope comment The choices were:

Topic 1 2.1 mode MultipleSelection text How can we approximate the slope of the tangent line to f(x) at a point x = a? This is a Multiple selection question, so you need to check all of the answers that

### AREA AND CIRCUMFERENCE OF CIRCLES

AREA AND CIRCUMFERENCE OF CIRCLES Having seen how to compute the area of triangles, parallelograms, and polygons, we are now going to consider curved regions. Areas of polygons can be found by first dissecting

### 1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm

Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 005-06-15 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok

### 9 More on differentiation

Tel Aviv University, 2013 Measure and category 75 9 More on differentiation 9a Finite Taylor expansion............... 75 9b Continuous and nowhere differentiable..... 78 9c Differentiable and nowhere monotone......

### Figure 2.1: Center of mass of four points.

Chapter 2 Bézier curves are named after their inventor, Dr. Pierre Bézier. Bézier was an engineer with the Renault car company and set out in the early 196 s to develop a curve formulation which would

### FIXED POINT ITERATION

FIXED POINT ITERATION We begin with a computational example. solving the two equations Consider E1: x =1+.5sinx E2: x =3+2sinx Graphs of these two equations are shown on accompanying graphs, with the solutions

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

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

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

### Representation of functions as power series

Representation of functions as power series Dr. Philippe B. Laval Kennesaw State University November 9, 008 Abstract This document is a summary of the theory and techniques used to represent functions

### Sequences and Series

Sequences and Series Consider the following sum: 2 + 4 + 8 + 6 + + 2 i + The dots at the end indicate that the sum goes on forever. Does this make sense? Can we assign a numerical value to an infinite

### THE PRIME NUMBER THEOREM

THE PRIME NUMBER THEOREM NIKOLAOS PATTAKOS. introduction In number theory, this Theorem describes the asymptotic distribution of the prime numbers. The Prime Number Theorem gives a general description

### THE DIMENSION OF A VECTOR SPACE

THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field

### Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

### 1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is

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

### CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

### 1 The Brownian bridge construction

The Brownian bridge construction The Brownian bridge construction is a way to build a Brownian motion path by successively adding finer scale detail. This construction leads to a relatively easy proof

### 1 Review of Least Squares Solutions to Overdetermined Systems

cs4: introduction to numerical analysis /9/0 Lecture 7: Rectangular Systems and Numerical Integration Instructor: Professor Amos Ron Scribes: Mark Cowlishaw, Nathanael Fillmore Review of Least Squares

### Change of Continuous Random Variable

Change of Continuous Random Variable All you are responsible for from this lecture is how to implement the Engineer s Way (see page 4) to compute how the probability density function changes when we make

### Infinite Algebra 1 supports the teaching of the Common Core State Standards listed below.

Infinite Algebra 1 Kuta Software LLC Common Core Alignment Software version 2.05 Last revised July 2015 Infinite Algebra 1 supports the teaching of the Common Core State Standards listed below. High School

### MATHEMATICS (CLASSES XI XII)

MATHEMATICS (CLASSES XI XII) General Guidelines (i) All concepts/identities must be illustrated by situational examples. (ii) The language of word problems must be clear, simple and unambiguous. (iii)

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

### Quotient Rings and Field Extensions

Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

### Numerical Solution of Differential

Chapter 13 Numerical Solution of Differential Equations We have considered numerical solution procedures for two kinds of equations: In chapter 10 the unknown was a real number; in chapter 6 the unknown

### MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

### Lectures 5-6: Taylor Series

Math 1d Instructor: Padraic Bartlett Lectures 5-: Taylor Series Weeks 5- Caltech 213 1 Taylor Polynomials and Series As we saw in week 4, power series are remarkably nice objects to work with. In particular,

### Limit processes are the basis of calculus. For example, the derivative. f f (x + h) f (x)

SEC. 4.1 TAYLOR SERIES AND CALCULATION OF FUNCTIONS 187 Taylor Series 4.1 Taylor Series and Calculation of Functions Limit processes are the basis of calculus. For example, the derivative f f (x + h) f

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

### Series Convergence Tests Math 122 Calculus III D Joyce, Fall 2012

Some series converge, some diverge. Series Convergence Tests Math 22 Calculus III D Joyce, Fall 202 Geometric series. We ve already looked at these. We know when a geometric series converges and what it

### Properties of BMO functions whose reciprocals are also BMO

Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and

### t := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).

1. Line Search Methods Let f : R n R be given and suppose that x c is our current best estimate of a solution to P min x R nf(x). A standard method for improving the estimate x c is to choose a direction

### Monotone maps of R n are quasiconformal

Monotone maps of R n are quasiconformal K. Astala, T. Iwaniec and G. Martin For Neil Trudinger Abstract We give a new and completely elementary proof showing that a δ monotone mapping of R n, n is K quasiconformal

### Polynomial Invariants

Polynomial Invariants Dylan Wilson October 9, 2014 (1) Today we will be interested in the following Question 1.1. What are all the possible polynomials in two variables f(x, y) such that f(x, y) = f(y,

Section 5.4 The Quadratic Formula 481 5.4 The Quadratic Formula Consider the general quadratic function f(x) = ax + bx + c. In the previous section, we learned that we can find the zeros of this function

### Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 2012-13 school year.

This document is designed to help North Carolina educators teach the Common Core (Standard Course of Study). NCDPI staff are continually updating and improving these tools to better serve teachers. Algebra

### 3. INNER PRODUCT SPACES

. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.

### Learning Objectives for Math 165

Learning Objectives for Math 165 Chapter 2 Limits Section 2.1: Average Rate of Change. State the definition of average rate of change Describe what the rate of change does and does not tell us in a given

Advanced Microeconomics Ordinal preference theory Harald Wiese University of Leipzig Harald Wiese (University of Leipzig) Advanced Microeconomics 1 / 68 Part A. Basic decision and preference theory 1 Decisions

### Algebra and Geometry Review (61 topics, no due date)

Course Name: Math 112 Credit Exam LA Tech University Course Code: ALEKS Course: Trigonometry Instructor: Course Dates: Course Content: 159 topics Algebra and Geometry Review (61 topics, no due date) Properties

### INTERPOLATION. Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y).

INTERPOLATION Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y). As an example, consider defining and x 0 =0, x 1 = π 4, x

### 4 Lyapunov Stability Theory

4 Lyapunov Stability Theory In this section we review the tools of Lyapunov stability theory. These tools will be used in the next section to analyze the stability properties of a robot controller. We

### Calculus. Contents. Paul Sutcliffe. Office: CM212a.

Calculus Paul Sutcliffe Office: CM212a. www.maths.dur.ac.uk/~dma0pms/calc/calc.html Books One and several variables calculus, Salas, Hille & Etgen. Calculus, Spivak. Mathematical methods in the physical

### Definition 8.1 Two inequalities are equivalent if they have the same solution set. Add or Subtract the same value on both sides of the inequality.

8 Inequalities Concepts: Equivalent Inequalities Linear and Nonlinear Inequalities Absolute Value Inequalities (Sections 4.6 and 1.1) 8.1 Equivalent Inequalities Definition 8.1 Two inequalities are equivalent

PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

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

9.3 Solving Quadratic Equations by Using the Quadratic Formula 9.3 OBJECTIVES 1. Solve a quadratic equation by using the quadratic formula 2. Determine the nature of the solutions of a quadratic equation

### Chapter 7. Continuity

Chapter 7 Continuity There are many processes and eects that depends on certain set of variables in such a way that a small change in these variables acts as small change in the process. Changes of this

### Increasing for all. Convex for all. ( ) Increasing for all (remember that the log function is only defined for ). ( ) Concave for all.

1. Differentiation The first derivative of a function measures by how much changes in reaction to an infinitesimal shift in its argument. The largest the derivative (in absolute value), the faster is evolving.