# THE BANACH CONTRACTION PRINCIPLE. Contents

Size: px
Start display at page:

Transcription

1 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, and discuss what happens when we compose contraction functions. The paper will lead up to The Banach Contraction Principle, which states every contraction in a complete metric space has a unique fixed point. Contents 1. Contractions: Definition and Examples Definition 1 (Contraction). Let (X, d) be a complete metric space. A function f : X X is called a contraction if there exists k < 1 such that for any x, y X, kd(x, y) d(f(x), f(y)). Example 1. Consider the metric space (R, d) where d is the Euclidean distance metric, i.e. d(x, y) = x y. The function f : R R where f(x) = x a + b is a contraction if a > 1. In this specific case we can find a fixed point. Since a fixed means that f(x) = x, we want x = x ab a + b. Solving for x gives us x = a 1. Example 2. We can create a similar contraction in the metric space (R 2, d) with the Euclidean distance metric. The function f : R 2 R 2 where f(x, y) = ( x a + b, y c + b) is a contraction if a, c > 1. For a fixed point, we want f(x, y) = (x, y). Solving just like we did above, we get x = ab cb a 1 and y = c Complete Metric Spaces The Contraction Theorem will specify that the metric space must be complete. We will now define a complete metric space and explain its role in the Theorem. Definition 2. A metric space X is complete if every cauchy sequence of points in X converges to a point in X. This specification simply ensures that what would be our fixed point is actually in X. If we took the function f(x) = x a + b, as in the above example, but only considered it on the space R 2 {ab/(a + 1} (which is not complete), our function would not have a fixed point. Date: July 1,

2 2 ALEX PONIECKI. Applying Contractions Multiple Times From these examples, we have reason to believe that contractions in general have fixed points. To show that any contraction has a fixed point we will find a point that should be fixed and prove that that point is indeed a fixed point. Let f : X X be any contraction. If, for a moment, we believe that all contractions have fixed points, then f 2 (x) should have a fixed point since it s a contraction: Claim 1. Suppose f is contraction. Then f n is also a contraction. Furthermore, if k is the constant for f, k n is the constant for f n. Proof. First we will show that the theorem is true for n = 2. Since f is a contraction, we know that for some k < 1, kd(x, y) d(f(x), f(y)). We can apply f again to f(x) and f(y) to get kd(f(x), (y)) d(f 2 (x), f 2 (y)). Since kd(x, y) d(f(x), f(y)), we know that k 2 d(x, y) kd(f(x), f(y)). Thus we have k 2 d(x, y) kd(f(x), f(y)) d(f 2 (x), f 2 (y)) Thus k 2 d(x, y) d(f 2 (x), f 2 (y)). Note that since k < 1, k 2 < 1. Now assume f n is a contraction. We can similarly show that f n+1 is a contraction. Our induction step is also proving that the constant for f n is k n, so we can assume that k n d(x, y) d(f n (x), f n (y)). Like in the above proof, we can apply f again to get k n+1 d(x, y) k n+1 d(f(x), f(y)) d(f n+1 (x), f n+1 (y)) Thus k n+1 d(x, y) d(f n+1 (x), f n+1 (y)). By induction, the theorem is true for all n. Since each f n is a contraction, each f n has a fixed point. Moreover, we can show that each f n has the same fixed point. If f(x) = x, then f 2 (x) = f(f(x)) = f(x) = x. By induction, f n (x) = x for all n. Also, this proof shows that the distances between points get very small as we apply the contraction many times. This means that if the original space X was not infinitely large, the area covered by the image of f n will get very small. That is, if the distance between any two points in X had a maximum, let s say m, then the distance between any two points in the image of f m would have to be less than k n m. In the next section, we will look at contractions on metric spaces where the all distances are bounded. 4. Contractions on Balls Definition. For c X and 0 < r R let B r (c) = {x X d(c, x) < r} be the ball of radius r centered at c. Also, we define the closure of B r (c), denotated by B r (c), to be the set containing B r (c) and all of its limit points. Remark. If a subset of a complete metric space contains all of its limit points, then all cauchy sequences contained in the set converge to a point in the set. Thus by using closed balls, we ensure that they are complete. Also note that B r (c) = {x X d(c, x) r}.

3 THE BANACH CONTRACTION PRINCIPLE The above definition implies the distance between any two points in a ball B r (x) has to be less than or equal to 2r. Thus, if we restrict f to some B r (x) we will be able to specify which points are contained in the image. But we have to make sure we pick our ball so that the hypothetical fixed point of X is in it. If we pick our ball so that the image of the ball is a subset of the original ball, then f : B r (x) B r (x) would itself be a contraction, so it would have a fixed point. This would also be the same point that is fixed in X! So we just have to make sure that such a ball exists: Claim 2. Suppose that f is a contraction. Let x X. For large enough values of r, f(b r (x)) B r (x). Proof. We want to find r such that for any y B r (x), f(y) B r (x). Thus we want to find r such that d(x, f(y)) < r. By the triangle inequality, we know that d(x, f(y)) d(x, f(x)) + d(f(x), f(y)) Since f is a contraction, we know that d(f(x), f(y)) kd(x, y). If B r (x) is any ball and y B r (x), we know that d(x, y) r. Thus d(f(x), f(y)) kr. Thus d(x, f(y)) d(x, f(x)) + kr. So if we choose r so that d(x, f(x)) + kr < r, we would know that d(x, f(y)) < r for any y B r (x). Thus f(y) B r (x). Thus we can solve for r to find which r s will work for a specific k and x: Thus we know that if d(x,f(x)) (1 k) d(x, f(x)) + kr < r d(x, f(x)) < r kr d(x, f(x)) < r(1 k) d(x, f(x)) < r (1 k) < r, then f(y) B r (x) for any y B r (x). Remark. In general, we know that if A B and p is a limit point of A, then p is also limit point of B. Thus A B. Since f(b r (x)) B r (x), we know that f(b r (x)) B r (x). Now, since we know how large the ball is to begin with, we can specify how small it gets when we apply f many times: Claim. For any n, f n (B r (x)) B r (f n (x)), where r = k n r. Proof. The proof of this Claim is very similar to the proof of Claim 1. First we will show that it is true for n = 1. We know that r > d(x, y) for any y B r (x). This implies that r = kr > kd(x, y). Since f is a contraction, we also know that kd(x, y) d(f(x), f(y)), which means kr d(f(x), f(y)). Since every point in f(b r (x)) equals f(y) for some y B r (x), we know that every point in f(b r (x)) is less than kr away from f(x). Thus all points in f(b r (x)) are in a ball around f(x)

4 4 ALEX PONIECKI or radius kr. Now assume the Claim is true for n. Thus we know that f n (B r (x)) B r (f n (x)), which implies d(f n (x), f n (y)) k n r for any y B r (x). This implies that kd(f n (x), f n (y)) k n+1 r. Also, since f is a contraction, we know that d(f n+1 (x), f n+1 (y)) kd(f n (x), f n (y)). So d(f n+1 (x), f n+1 (y)) k n+1 r. This implies that f n+1 (B r (x)) B r (f n+1 (x)), as desired. By induction, the Claim is true for all n. Remark. Again, since f n (B r (x)) B r (f n (x)), we know that f n (B r (x)) B r (f n (x)). 5. The Intersection of Nested Closed Sets We know that when we apply f many times the image gets very small and we have a precise way of saying how small the image is. Also, our fixed point should be in the image of each f n. Since the fixed point should be in all f n (B r (x)), it should be in the intersection of all f n (B r (x)). We will complete the proof by studying the intersection. First, we will make sure there is at least one point in the intersection: Claim 4. The intersection of all f n (B r (x)) is nonempty. Proof. First we will find a sequence of points that is cauchy, so it must converge to a limit. We will then show that this limit must be in the intersection. Take the sequence of points a n such that a n f n (B r (x)). We will show that this sequence is cauchy. We will show that for any ɛ there exists N such that if n, m > N, d(a n, a m ) ɛ. Let N be such that ɛ > k N r. We know that f N (B r (x)) B r (f N (x)), where r = k N r, as described in Claim. Also, note that if p > N, then f p (B r (x)) f N (B r (x)). Thus if n, m > N, we know that a n, a m f N (B r (x)). Thus a n, a m B r (f N (x)). Thus d(f N (x), a n ) r and d(f N (x), a m ) r. Adding these together get d(f N (x), a n ) + d(f N (x), a m ) 2r. Since this is a metric space we know that d(a m, a n ) d(f N (x), a n )+d(f N (x), a m ). Thus d(a m, a n ) 2r < ɛ, as desired. Since the sequence is cauchy, it must converge to a limit. Now we will show that this limit is in the intersection. Say that the limit p was not in the intersection. Then p is not in some f n (B r (x)). Let B j (p) be a ball around p such that j = d(f(x), p) r, where r = k n r. Thus no point in f n (B r (x)) is in B j (p). But there are an infinite number of points from the sequence a n in f n (B r (x)) since we have a m f m (B r (x)) f n (B r (x)) if m > n. Since every ball around p must only have a finite number of points of a n outside of it, this contradicts the fact that a n converges to p. Thus p is in the intersection. Remark It is true that in a complete metric space, for any sequence of closed sets A 1 A 2 A..., the intersection of the sets A i is nonempty. Furthermore, we can show that p is the only point in the intersection. Claim 5. The intersection of all f n (B r (x)) has only one point.

5 THE BANACH CONTRACTION PRINCIPLE 5 Proof. Say the intersection had more then one point. Let a, b be any two points in the intersection. Let ɛ = d(a, b). Take n such that ɛ/2 > k n r. We know that f n (B r (x)) is contained B r (f(x)), where r = k n r. Also, no two points in this ball can have a distance of 2r or more. Since d(a, b) = ɛ = 2r, both a and b cannot be in f n (B r (x)). Thus they are not in the intersection of all f n (B r (x)). 6. Two Proofs of the Contraction Theorem Now we know that the intersection has exactly one point. Since we have guessed that our fixed point is in all f n (B r (x)), this must be our fixed point. We will now prove that this is so. Theorem 1 (The Banach Contraction Principle). Let (X, d) be a complete metric space, f : X X a contraction. Then f has a unique fixed point in X. Proof. By the previous two claims, there exists exactly one point y in the intersection of all f n (B r (x)). Say that it was not fixed. Let ɛ = d(f(y), y). We know that ɛ is not 0 since f(y) y. Take n such that ɛ/2 = k n r. Thus we know that f n (B r (x) B ɛ2 (f(x)). Thus no two points in f n (B r (x) can have a distance greater than ɛ. y is in f n (B r (x) because it s in all f n (B r (x) and f(y) is in f n (B r (x) because each contraction is a subset of the last. But the distance between y and f(y) is ɛ. Thus we must have f(y) = y. Thus y is a fixed point. Note that we cannot have more than one fixed point. If had two, say x, y, we would have d(f(x), f(y)) = d(x, y). But we know that d(f(x), f(y)) kd(x, y) where k < 1 since f is a contraction. Alternate Proof. We can prove the Theorem an alternate way using similar concepts and methods developed in this paper. However, this proof is framed around the idea of creating a cauchy sequence that will lead us to our fixed point. Proof. Take any x X. Let a n be the sequence such that a k = f k (x). Choose r so that f(b r (x)) B r (x), as described in Claim 2. First we will show that this sequence is cauchy. For any ɛ, we will find j such that if m, n > j then d(a m, a n ) < ɛ. Take any ɛ. Take j such that ɛ/2 > k j r. So we know that the distance between any two points in f j (B r (x)) is less than ɛ (see Claim ). We also know that a k f k (B r (x)) and that if m, n > j, then f m (B r (x)), f n (B r (x)) f j (B r (x)). Thus a m, a n f j (B r (x)) and so d(a m, a n ) < ɛ, as desired. Since the sequence is cauchy, it converges to a limit y. Say that y was not fixed by f. Take ɛ = d(f(y), y)/. Since a n converges to y, we can find N such that for all k > N, a k B ɛ (y). Find that N and take any such k. By the triangle inequality, we know that d(f(y), y) d(f(y), a k ) + d(a k, y). This implies that d(f(y), y) d(a k, y) d(f(y), a k ). Since d(a k, y) < d(f(y), y)/, d(f(y), y) d(f(y), y)/ < d(f(y), y) d(a k, y) d(f(y), a k ) Thus 2d(f(y),y) < d(f(y), a k ). Since a k+1 = f(a k ), a k+1 is in the same ball as a k. Thus the exact same statement can be made for a k+1, i.e. 2d(f(y),y) < d(f(y), a k+1 ). Thus we have

6 6 ALEX PONIECKI d(f(y), y) 2d(f(y), y) d(y, a k ) < < < d(f(y), a k+1 ) This contradicts the fact that f is a contraction, since a contraction requires that d(f(y), f(a k )) < d(y, a k ). Thus y must be fixed. Acknowledgments. I would like to thank my mentors Tom Church and Katie Mann. Tom was very helpful in getting me started on Topology topics and answering some preliminary questions. Katie provided much guidance during our meetings, and was particularly good at helping me understand the concepts and ideas behind the math we were working with. References [1] Charles C. Pugh. Real Mathematical Analysis. Springer. 200.

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

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

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

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

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

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

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

### Practice with Proofs

Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using

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

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

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

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

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

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

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

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

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

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

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

### THE CONTRACTION MAPPING THEOREM

THE CONTRACTION MAPPING THEOREM KEITH CONRAD 1. Introduction Let f : X X be a mapping from a set X to itself. We call a point x X a fixed point of f if f(x) = x. For example, if [a, b] is a closed interval

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

### Math 104: Introduction to Analysis

Math 104: Introduction to Analysis Evan Chen UC Berkeley Notes for the course MATH 104, instructed by Charles Pugh. 1 1 August 29, 2013 Hard: #22 in Chapter 1. Consider a pile of sand principle. You wish

### 10.2 Series and Convergence

10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and

### Triangle deletion. Ernie Croot. February 3, 2010

Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

### 4. Expanding dynamical systems

4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

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

### Duality of linear conic problems

Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least

### Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

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

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

### I. Pointwise convergence

MATH 40 - NOTES Sequences of functions Pointwise and Uniform Convergence Fall 2005 Previously, we have studied sequences of real numbers. Now we discuss the topic of sequences of real valued functions.

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

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

### Real Roots of Univariate Polynomials with Real Coefficients

Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials

### www.pioneermathematics.com

Problems and Solutions: INMO-2012 1. Let ABCD be a quadrilateral inscribed in a circle. Suppose AB = 2+ 2 and AB subtends 135 at the centre of the circle. Find the maximum possible area of ABCD. Solution:

### Metric Spaces. Lecture Notes and Exercises, Fall 2015. M.van den Berg

Metric Spaces Lecture Notes and Exercises, Fall 2015 M.van den Berg School of Mathematics University of Bristol BS8 1TW Bristol, UK mamvdb@bristol.ac.uk 1 Definition of a metric space. Let X be a set,

### Fundamentele Informatica II

Fundamentele Informatica II Answer to selected exercises 1 John C Martin: Introduction to Languages and the Theory of Computation M.M. Bonsangue (and J. Kleijn) Fall 2011 Let L be a language. It is clear

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

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

### The Mean Value Theorem

The Mean Value Theorem THEOREM (The Extreme Value Theorem): If f is continuous on a closed interval [a, b], then f attains an absolute maximum value f(c) and an absolute minimum value f(d) at some numbers

### Quasi Contraction and Fixed Points

Available online at www.ispacs.com/jnaa Volume 2012, Year 2012 Article ID jnaa-00168, 6 Pages doi:10.5899/2012/jnaa-00168 Research Article Quasi Contraction and Fixed Points Mehdi Roohi 1, Mohsen Alimohammady

### Tiers, Preference Similarity, and the Limits on Stable Partners

Tiers, Preference Similarity, and the Limits on Stable Partners KANDORI, Michihiro, KOJIMA, Fuhito, and YASUDA, Yosuke February 7, 2010 Preliminary and incomplete. Do not circulate. Abstract We consider

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

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

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

### MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.

MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α

### ON FIBER DIAMETERS OF CONTINUOUS MAPS

ON FIBER DIAMETERS OF CONTINUOUS MAPS PETER S. LANDWEBER, EMANUEL A. LAZAR, AND NEEL PATEL Abstract. We present a surprisingly short proof that for any continuous map f : R n R m, if n > m, then there

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

### Connectivity and cuts

Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every

### About the inverse football pool problem for 9 games 1

Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute

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

### Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

### Section 1.3 P 1 = 1 2. = 1 4 2 8. P n = 1 P 3 = Continuing in this fashion, it should seem reasonable that, for any n = 1, 2, 3,..., = 1 2 4.

Difference Equations to Differential Equations Section. The Sum of a Sequence This section considers the problem of adding together the terms of a sequence. Of course, this is a problem only if more than

### Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

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

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

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

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

### 8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

### UNIFORMLY DISCONTINUOUS GROUPS OF ISOMETRIES OF THE PLANE

UNIFORMLY DISCONTINUOUS GROUPS OF ISOMETRIES OF THE PLANE NINA LEUNG Abstract. This paper discusses 2-dimensional locally Euclidean geometries and how these geometries can describe musical chords. Contents

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

### ALMOST COMMON PRIORS 1. INTRODUCTION

ALMOST COMMON PRIORS ZIV HELLMAN ABSTRACT. What happens when priors are not common? We introduce a measure for how far a type space is from having a common prior, which we term prior distance. If a type

### Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers

### 1. Let X and Y be normed spaces and let T B(X, Y ).

Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: NVP, Frist. 2005-03-14 Skrivtid: 9 11.30 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok

### Intermediate Value Theorem, Rolle s Theorem and Mean Value Theorem

Intermediate Value Theorem, Rolle s Theorem and Mean Value Theorem February 21, 214 In many problems, you are asked to show that something exists, but are not required to give a specific example or formula

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

### INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem

### The Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line

The Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line D. Bongiorno, G. Corrao Dipartimento di Ingegneria lettrica, lettronica e delle Telecomunicazioni,

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

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

### ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction

ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity

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

### Finite dimensional topological vector spaces

Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the

### SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM

SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM ALEX WRIGHT 1. Intoduction A fixed point of a function f from a set X into itself is a point x 0 satisfying f(x 0 ) = x 0. Theorems which establish the

### 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 ASSIGNMENT 1 MATH 576

SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts

### Kevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm

MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following

### The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

### WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

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

### MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P

### Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:

Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),

### 5. Linear algebra I: dimension

5. Linear algebra I: dimension 5.1 Some simple results 5.2 Bases and dimension 5.3 Homomorphisms and dimension 1. Some simple results Several observations should be made. Once stated explicitly, the proofs

### 16.3 Fredholm Operators

Lectures 16 and 17 16.3 Fredholm Operators A nice way to think about compact operators is to show that set of compact operators is the closure of the set of finite rank operator in operator norm. In this

### POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).

### 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(Ω),

### MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish

### F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p

### MATH 425, PRACTICE FINAL EXAM SOLUTIONS.

MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator

### CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

### ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction

ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE J.M. CALABUIG, J. RODRÍGUEZ, AND E.A. SÁNCHEZ-PÉREZ Abstract. Let m be a vector measure taking values in a Banach space X. We prove that

### CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

### Collinear Points in Permutations

Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,

### Two Fundamental Theorems about the Definite Integral

Two Fundamental Theorems about the Definite Integral These lecture notes develop the theorem Stewart calls The Fundamental Theorem of Calculus in section 5.3. The approach I use is slightly different than

### Math 312 Homework 1 Solutions

Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please