# THE BANACH CONTRACTION PRINCIPLE. Contents

Save this PDF as:

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.

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

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

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

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

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

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

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

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

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

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

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

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

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

### Baltic Way 1995. Västerås (Sweden), November 12, 1995. Problems and solutions

Baltic Way 995 Västerås (Sweden), November, 995 Problems and solutions. Find all triples (x, y, z) of positive integers satisfying the system of equations { x = (y + z) x 6 = y 6 + z 6 + 3(y + z ). Solution.

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

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

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

### Fixed Point Theorems For Set-Valued Maps

Fixed Point Theorems For Set-Valued Maps Bachelor s thesis in functional analysis Institute for Analysis and Scientific Computing Vienna University of Technology Andreas Widder, July 2009. Preface In this

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

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

### IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible

### Fixed Point Theorems in Topology and Geometry

Fixed Point Theorems in Topology and Geometry A Senior Thesis Submitted to the Department of Mathematics In Partial Fulfillment of the Requirements for the Departmental Honors Baccalaureate By Morgan Schreffler

### THE CENTRAL LIMIT THEOREM TORONTO

THE CENTRAL LIMIT THEOREM DANIEL RÜDT UNIVERSITY OF TORONTO MARCH, 2010 Contents 1 Introduction 1 2 Mathematical Background 3 3 The Central Limit Theorem 4 4 Examples 4 4.1 Roulette......................................

### CHAPTER 5. Product Measures

54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue

### GROUPS ACTING ON A SET

GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

### Putnam Notes Polynomials and palindromes

Putnam Notes Polynomials and palindromes Polynomials show up one way or another in just about every area of math. You will hardly ever see any math competition without at least one problem explicitly concerning

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

### Reading material on the limit set of a Fuchsian group

Reading material on the limit set of a Fuchsian group Recommended texts Many books on hyperbolic geometry and Kleinian and Fuchsian groups contain material about limit sets. The presentation given here

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

### The Banach-Tarski Paradox

University of Oslo MAT2 Project The Banach-Tarski Paradox Author: Fredrik Meyer Supervisor: Nadia S. Larsen Abstract In its weak form, the Banach-Tarski paradox states that for any ball in R, it is possible

### MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu

Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing

### A new continuous dependence result for impulsive retarded functional differential equations

CADERNOS DE MATEMÁTICA 11, 37 47 May (2010) ARTIGO NÚMERO SMA#324 A new continuous dependence result for impulsive retarded functional differential equations M. Federson * Instituto de Ciências Matemáticas

### All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

### Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1

Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing

### CHAPTER 1. Internal Set Theory

CHAPTER 1 Internal Set Theory Ordinarily in mathematics, when one introduces a new concept one defines it. For example, if this were a book on blobs I would begin with a definition of this new predicate:

### THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear

### RIGIDITY OF HOLOMORPHIC MAPS BETWEEN FIBER SPACES

RIGIDITY OF HOLOMORPHIC MAPS BETWEEN FIBER SPACES GAUTAM BHARALI AND INDRANIL BISWAS Abstract. In the study of holomorphic maps, the term rigidity refers to certain types of results that give us very specific

### it is easy to see that α = a

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

### ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska

Pliska Stud. Math. Bulgar. 22 (2015), STUDIA MATHEMATICA BULGARICA ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION E. I. Pancheva, A. Gacovska-Barandovska Smirnov (1949) derived four

### BX in ( u, v) basis in two ways. On the one hand, AN = u+

1. Let f(x) = 1 x +1. Find f (6) () (the value of the sixth derivative of the function f(x) at zero). Answer: 7. We expand the given function into a Taylor series at the point x = : f(x) = 1 x + x 4 x

### CONTRIBUTIONS TO ZERO SUM PROBLEMS

CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg

### 1 Local Brouwer degree

1 Local Brouwer degree Let D R n be an open set and f : S R n be continuous, D S and c R n. Suppose that the set f 1 (c) D is compact. (1) Then the local Brouwer degree of f at c in the set D is defined.

### Point Set Topology. A. Topological Spaces and Continuous Maps

Point Set Topology A. Topological Spaces and Continuous Maps Definition 1.1 A topology on a set X is a collection T of subsets of X satisfying the following axioms: T 1.,X T. T2. {O α α I} T = α IO α T.

### Prime Numbers and Irreducible Polynomials

Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.

### Elements of Abstract Group Theory

Chapter 2 Elements of Abstract Group Theory Mathematics is a game played according to certain simple rules with meaningless marks on paper. David Hilbert The importance of symmetry in physics, and for

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

### Notes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand

Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such

### The degree, size and chromatic index of a uniform hypergraph

The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the

### Chapter 5. Banach Spaces

9 Chapter 5 Banach Spaces Many linear equations may be formulated in terms of a suitable linear operator acting on a Banach space. In this chapter, we study Banach spaces and linear operators acting on

### PSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2

PSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2 Abstract. We prove a Bruckner-Garg type theorem for the fiber structure of a generic map from a continuum X into the unit interval I. We

### Random graphs with a given degree sequence

Sourav Chatterjee (NYU) Persi Diaconis (Stanford) Allan Sly (Microsoft) Let G be an undirected simple graph on n vertices. Let d 1,..., d n be the degrees of the vertices of G arranged in descending order.

### PETER HÄSTÖ, RIKU KLÉN, SWADESH KUMAR SAHOO, AND MATTI VUORINEN

GEOMETRIC PROPERTIES OF ϕ-uniform DOMAINS PETER HÄSTÖ, RIKU KLÉN, SWADESH KUMAR SAHOO, AND MATTI VUORINEN Abstract. We consider proper subdomains G of R n and their images G = f(g) under quasiconformal

### Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

### Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

### 15 Limit sets. Lyapunov functions

15 Limit sets. Lyapunov functions At this point, considering the solutions to ẋ = f(x), x U R 2, (1) we were most interested in the behavior of solutions when t (sometimes, this is called asymptotic behavior

### Logic, Algebra and Truth Degrees 2008. Siena. A characterization of rst order rational Pavelka's logic

Logic, Algebra and Truth Degrees 2008 September 8-11, 2008 Siena A characterization of rst order rational Pavelka's logic Xavier Caicedo Universidad de los Andes, Bogota Under appropriate formulations,

### Alex, I will take congruent numbers for one million dollars please

Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 jimlb@math.ohio-state.edu One of the most alluring aspectives of number theory

### University of Miskolc

University of Miskolc The Faculty of Mechanical Engineering and Information Science The role of the maximum operator in the theory of measurability and some applications PhD Thesis by Nutefe Kwami Agbeko

### Subsets of Euclidean domains possessing a unique division algorithm

Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness

### SMALL SKEW FIELDS CÉDRIC MILLIET

SMALL SKEW FIELDS CÉDRIC MILLIET Abstract A division ring of positive characteristic with countably many pure types is a field Wedderburn showed in 1905 that finite fields are commutative As for infinite

### Reference: Introduction to Partial Differential Equations by G. Folland, 1995, Chap. 3.

5 Potential Theory Reference: Introduction to Partial Differential Equations by G. Folland, 995, Chap. 3. 5. Problems of Interest. In what follows, we consider Ω an open, bounded subset of R n with C 2

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

### TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS

TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS VIPUL NAIK Abstract. In this journey, we are going to explore the so called separation axioms in greater detail. We shall try to understand how these axioms

### SOLUTIONS FOR PROBLEM SET 2

SOLUTIONS FOR PROBLEM SET 2 A: There exist primes p such that p+6k is also prime for k = 1,2 and 3. One such prime is p = 11. Another such prime is p = 41. Prove that there exists exactly one prime p such

### NON-CANONICAL EXTENSIONS OF ERDŐS-GINZBURG-ZIV THEOREM 1

NON-CANONICAL EXTENSIONS OF ERDŐS-GINZBURG-ZIV THEOREM 1 R. Thangadurai Stat-Math Division, Indian Statistical Institute, 203, B. T. Road, Kolkata 700035, INDIA thanga v@isical.ac.in Received: 11/28/01,

### Quasi-static evolution and congested transport

Quasi-static evolution and congested transport Inwon Kim Joint with Damon Alexander, Katy Craig and Yao Yao UCLA, UW Madison Hard congestion in crowd motion The following crowd motion model is proposed

### A MEAN VALUE THEOREM FOR METRIC SPACES

A MEAN VALUE THEOREM FOR METRIC SPACES PAULO M. CARVALHO NETO 1 AND PAULO A. LIBONI FILHO 2 Abstract. We present a form of the Mean Value Theorem (MVT) for a continuous function f between metric spaces,

### A domain of spacetime intervals in general relativity

A domain of spacetime intervals in general relativity Keye Martin Department of Mathematics Tulane University New Orleans, LA 70118 United States of America martin@math.tulane.edu Prakash Panangaden School

### ABSTRACT. For example, circle orders are the containment orders of circles (actually disks) in the plane (see [8,9]).

Degrees of Freedom Versus Dimension for Containment Orders Noga Alon 1 Department of Mathematics Tel Aviv University Ramat Aviv 69978, Israel Edward R. Scheinerman 2 Department of Mathematical Sciences

### A class of infinite dimensional stochastic processes

A class of infinite dimensional stochastic processes John Karlsson Linköping University CRM Barcelona, July 7, 214 Joint work with Jörg-Uwe Löbus John Karlsson (Linköping University) Infinite dimensional

### Lecture 6 Online and streaming algorithms for clustering

CSE 291: Unsupervised learning Spring 2008 Lecture 6 Online and streaming algorithms for clustering 6.1 On-line k-clustering To the extent that clustering takes place in the brain, it happens in an on-line

### Unique Factorization

Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon

Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650

### Pacific Journal of Mathematics

Pacific Journal of Mathematics MINIMIZATION OF FUNCTIONS HAVING LIPSCHITZ CONTINUOUS FIRST PARTIAL DERIVATIVES LARRY ARMIJO Vol. 16, No. 1 November 1966 PACIFIC JOURNAL OF MATHEMATICS Vol. 16, No. 1, 1966

### Course Notes for Math 162: Mathematical Statistics Approximation Methods in Statistics

Course Notes for Math 16: Mathematical Statistics Approximation Methods in Statistics Adam Merberg and Steven J. Miller August 18, 6 Abstract We introduce some of the approximation methods commonly used

### Relatively dense sets, corrected uniformly almost periodic functions on time scales, and generalizations

Wang and Agarwal Advances in Difference Equations (2015) 2015:312 DOI 10.1186/s13662-015-0650-0 R E S E A R C H Open Access Relatively dense sets, corrected uniformly almost periodic functions on time

### First-Order Logics and Truth Degrees

First-Order Logics and Truth Degrees George Metcalfe Mathematics Institute University of Bern LATD 2014, Vienna Summer of Logic, 15-19 July 2014 George Metcalfe (University of Bern) First-Order Logics

### Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes)

Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes) by Jim Propp (UMass Lowell) March 14, 2010 1 / 29 Completeness Three common

### Descriptive Set Theory

Descriptive Set Theory David Marker Fall 2002 Contents I Classical Descriptive Set Theory 2 1 Polish Spaces 2 2 Borel Sets 14 3 Effective Descriptive Set Theory: The Arithmetic Hierarchy 27 4 Analytic

### Mechanisms for Fair Attribution

Mechanisms for Fair Attribution Eric Balkanski Yaron Singer Abstract We propose a new framework for optimization under fairness constraints. The problems we consider model procurement where the goal is

### The number of generalized balanced lines

The number of generalized balanced lines David Orden Pedro Ramos Gelasio Salazar Abstract Let S be a set of r red points and b = r + 2δ blue points in general position in the plane, with δ 0. A line l

### Surface bundles over S 1, the Thurston norm, and the Whitehead link

Surface bundles over S 1, the Thurston norm, and the Whitehead link Michael Landry August 16, 2014 The Thurston norm is a powerful tool for studying the ways a 3-manifold can fiber over the circle. In

### INTEGRAL OPERATORS ON THE PRODUCT OF C(K) SPACES

INTEGRAL OPERATORS ON THE PRODUCT OF C(K) SPACES FERNANDO BOMBAL AND IGNACIO VILLANUEVA Abstract. We study and characterize the integral multilinear operators on a product of C(K) spaces in terms of the

### ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM

ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM DANIEL PARKER Abstract. This paper provides a foundation for understanding Lenstra s Elliptic Curve Algorithm for factoring large numbers. We give

### U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

### On The Existence Of Flips

On The Existence Of Flips Hacon and McKernan s paper, arxiv alg-geom/0507597 Brian Lehmann, February 2007 1 Introduction References: Hacon and McKernan s paper, as above. Kollár and Mori, Birational Geometry

### CHAPTER 1 BASIC TOPOLOGY

CHAPTER 1 BASIC TOPOLOGY Topology, sometimes referred to as the mathematics of continuity, or rubber sheet geometry, or the theory of abstract topological spaces, is all of these, but, above all, it is

### Math 231b Lecture 35. G. Quick

Math 231b Lecture 35 G. Quick 35. Lecture 35: Sphere bundles and the Adams conjecture 35.1. Sphere bundles. Let X be a connected finite cell complex. We saw that the J-homomorphism could be defined by

### Notes on Richard Dedekind s Was sind und was sollen die Zahlen?

Notes on Richard Dedekind s Was sind und was sollen die Zahlen? David E. Joyce, Clark University December 2005 Contents Introduction 2 I. Sets and their elements. 2 II. Functions on a set. 5 III. One-to-one

### Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of

### PROBLEM SET 6: POLYNOMIALS

PROBLEM SET 6: POLYNOMIALS 1. introduction In this problem set we will consider polynomials with coefficients in K, where K is the real numbers R, the complex numbers C, the rational numbers Q or any other

### A Hajós type result on factoring finite abelian groups by subsets II

Comment.Math.Univ.Carolin. 51,1(2010) 1 8 1 A Hajós type result on factoring finite abelian groups by subsets II Keresztély Corrádi, Sándor Szabó Abstract. It is proved that if a finite abelian group is

### Degrees that are not degrees of categoricity

Degrees that are not degrees of categoricity Bernard A. Anderson Department of Mathematics and Physical Sciences Gordon State College banderson@gordonstate.edu www.gordonstate.edu/faculty/banderson Barbara

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### The Ideal Class Group

Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned

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

### Definition: Suppose that two random variables, either continuous or discrete, X and Y have joint density

HW MATH 461/561 Lecture Notes 15 1 Definition: Suppose that two random variables, either continuous or discrete, X and Y have joint density and marginal densities f(x, y), (x, y) Λ X,Y f X (x), x Λ X,

### On the number-theoretic functions ν(n) and Ω(n)

ACTA ARITHMETICA LXXVIII.1 (1996) On the number-theoretic functions ν(n) and Ω(n) by Jiahai Kan (Nanjing) 1. Introduction. Let d(n) denote the divisor function, ν(n) the number of distinct prime factors,