AN ELEMENTARY PROOF OF LEBESGUE S DIFFERENTIATION THEOREM
|
|
- Benjamin Myles Lester
- 7 years ago
- Views:
Transcription
1 AN ELEMENTARY PROOF OF LEBESGUE S DIFFERENTIATION THEOREM Elif Az Spring Abstract The fact that a continuous monotone function is differentiable almost everywhere was established by Lebesgue in Riesz gave a completely elementary proof of this theorem in 1932 by using his Rising Sun Lemma. Other than Riesz s, all the proofs of this theorem utilize measure theory. Also a geometric proof which involves measure theory and sets of measure zero was given by D. Austin. The purpose of this work is to give an easier alternative proof of this theorem that can be presented in an elementary analysis course. This proof uses the sets of measure zero and upper and lower derivatives. We will use Heine-Borel Theorem and an elementary covering lemma to show that a nondecreasing function f defined on [a, b] has derivative almost everywhere in this interval. Özet Sürekli ve monoton bir fonksiyonun hemen her yerde türevlenebilir olması durumu 1904 te Lebesgue tarafından tasdik edilmiştir. Reisz 1932 de Rising Sun önsavını kullanarak bu teoremin basit bir ispatını yapmıştır. Reisz ınki hariç ispatlarn hepsinde ölçü teorisi kullanılmıştır. Ayrıca D. Austin tarafından da ölçü teorisini ve ölçümü sıfır olan kümeleri içeren geometrik bir ispat verilmiştir. Bu çalışmanın amacı teoremin elementer analiz derslerinde sunulabilecek şekilde daha kolay alternatif bir ispatını vermektir. Bu ispatta ölçümü sıfır olan kümeleri ve alt ve üst türevler kullanılmaktadır. [a, b] de tanımlı azalmayan bir fonksiyon olan f nin bu aralıkta hemen her yerde türevlenebilir olduğunu göstermek için Heine-Borel Teoremin i ve aynı zamanda basit bir örtü kümesi önsavını kullanacağız. 1
2 1 INTRODUCTION The fact that a continuous monotone function is differentiable almost everywhere was established by Lebesgue in Many proofs of this theorem were given in many ways. In this work we will give an easier alternative proof of this theorem by using sets of measure zero. To achieve the result we have worked on the paper by Michael W. Botsko (Nov Sets of measure zero are just the sets that are negligible in theory of Lebesgue integration. If something happens except on a set of measure zero, it is said to happen almost everywhere [2, p. 63]. To show that a nondecreasing function f defined on [a, b] has derivative almost everywhere in this interval, first we prove a lemma by using Heine- Borel Theorem. In the proof of this lemma we will make some calculations on coverings and in the main part we will use this lemma in a technical part of our proof. 2 PRELIMINARIES In our proof we will use an elementary covering lemma which is stated below as Lemma 1. To prove Lemma 1 we need nothing more than the fact that an open set on the real line can be expressed as the countable disjoint union of open intervals and also the Heine-Borel Theorem which states that the compact sets of real numbers are exactly the sets that are both closed and bounded. Lemma 1: Let E be a subset of (a, b that is not of measure zero. (Thus there exist ε > 0 such that J n ε for any sequence {J n } of open intervals that covers E, where J n denotes the lenght of J n. If I is any collection of open subintervals of [a, b] that covers E, then there exits a finite disjoint subcollection {I 1, I 2,..., I N } of I such that I k > ε/3. Proof: Since I I I is an open set, we can state that I I I = where {(a n, b n } is a disjoint sequence of open intervals. (a n, b n 2
3 Since E (a n, b n (b n a n ε. Now for all (a n, b n choose a closed subinterval [a n, b n] such that c > 1, c R, b n a n = (b n a n /c. Thus (b n a n ε/c. Let n be a fixed positive integer. For each x in [a n, b n] there exists J x in I such that x J x (a n, b n. So {J x : x [a n, b n]} is an open cover of [a n, b n]. Since [a n, b n] closed and bounded by Heine-Borel theorem it is compact. So an open cover {J x : x [a n, b n]} of [a n, b n] can be reduced to a finite subcovering {J 1, J 2,... J p } such that [a n, b n] p J k. Furthermore by discarding some of the intervals, we may assume that no interval in {J k } p is a subset of the union of the remaining intervals in {J k } p. Thus each J i contains a point x i which does not belong to k i J k, and renumbering J k s, if necessary, we can assume that x 1 < x 2 <... < x p. Therefore both {J 1, J 3, J 5,...} and {J 2, J 4, J 6,...} are finite disjoint subcollections of I. It is obvious that either ( p J 2k 1 J k /2 or k ( p J 2k J k /2. k Depending on which one of the inequalities holds, we have found a finite disjoint subcollection I n of I such that ( p I J k /2 (b n a n/2. I I n Hence for each positive integer n there exist a finite disjoint subcollection I n of I each of whose open intervals is a subset of (a n, b n such that I I n I (b n a n/2. Summing both sides of the inequality, we have ( I (b n a n /2 ε/2c. I I n 3
4 Therefore I n = {I 1, I 2, I 3,...} is a countable disjoint subcollection of I for which I n ε/2c. Finally choose N so large that I k > ε/dc, where d R, d > 2 and dc R, dc > 2. Without loss of generality we can choose dc = 3 and I k > ε/3 to complete the proof. In this lemma we have shown that for a subset E of (a, b that is not of measure zero and I be an open covering for E, there exists a finite disjoint subcollection of open intervals of I whose total lenght is greater than ε/3. Here ε/3 is the maximum value that we can find such a collection. Remark 1: Suppose E and ε are exactly as in Lemma 1. Let P be a given finite subset of [a, b] and let I be a collection of open subintervals of [a, b] that covers E P. Then by adding to I sufficiently small open intervals centered at each point of P we can find a collection J such that J = I {K 1, K 2,... K i } that covers E. Now E J k and by Lemma 1 d R. Since I J, we have N 1 J k > ε/cd,where cd > 2, c and I k > ε/r, where r > cd > 2, r R. Hence there exists a finite disjoint subcollection {I 1, I 2,... I N } of I such that I k > ε/4. Clearly Remark 1 is an easy variation of Lemma 1. Lemma 2: Let f : [a, b] R, let P = {x 0, x 1, x 2,..., x n } be a partition of [a, b], let S be a nonempty subset of {1, 2, 3,..., n}, and let A > 0. If f(a f(b and < A x k x k 1 for each k in S, then > f(b f(a + AL, 4
5 where L = k S (x k x k 1. Proof : Since f(a f(b, it follows that, Therefore f(b f(a = f(b f(a = ( ( ( = + k S k / S < A (x k x k 1 + ( k S k / S AL + > f(b f(a + AL, which completes the proof. Remark 2: By putting g = f we can easily show that the conclusion of Lemma 2 holds if f(a f(b and for each k in S. x k x k 1 > A In Lemma 2 we have found a result by using the fact that the derivative of f defined on [a, b] with the properties as above, in a partition of [a, b] has a bound. We have shown these lemmas and their variations because we will use both Remark 1 and Lemma 2 in technical parts of our main proof. To prove our main result we will work on sets of measure zero and their open coverings.we will make some calculations on this coverings. Also we will use partitions on [a, b] with function defined on this intervals. 5
6 3 MAIN RESULT Now we are going to establish the main result. We will achieve the result by using the lemmas in preliminary part. We need them in some technical part of our proof. Our proof will depend on no measure theory beyond sets of measure zero. Also upper and lower derivatives are used. Theorem: If f is nondecreasing on [a, b], then f (x exists almost everywhere on [a, b]. Proof: We know that the only discontinuities of monotonic functions are jumps [2, p. 129]. Since f is continuous except at a countable number of points, it is sufficient to show that F = {x : x (a, b, f is continuous at x and Df(x > Df(x} has measure zero. Here Df(x = lim sup y x f(y f(x f(y f(x, Df(x = lim inf y x y x y x are the upper and lower derivatives of f at x, respectively. Clearly F is the countable union of the sets E r,s = {x : x (a, b, f is continuous at x and Df(x > r > s > Df(x} for rational numbers r and s with r > s. Thus we need to show that each E r,s has measure zero. Assume for a contradiction that for some choice of r and s the set E = E r,s does not have measure zero, and let ε be the positive number in Lemma 1. Let A = (r s/2, B = (r + s/2, and g = f Bx. and B are positive and Clearly both A E = {x : x (a, b, g is continuous at x, Dg(x > A and Dg(x < A}. Now { P g(x k g(x k 1 : P is partition of [a, b]} is bounded above. Namely, g(x k g(x k 1 = B(x k x k 1 P P + B (x k x k 1 P P = f(b f(a + B(b a. 6
7 Let T be the least upper bound for this set. Since both A and ε are positive, there exists a partition P = {x 0, x 1, x 2,... x n } of [a, b] for which g(x k g(x k 1 > T Aε 4. (1 Now let x belongs to E P, which means that x is in E (x k 1, x k for some k. Since Dg(x > A and Dg(x < A and g is continuous at x, we can choose a x and b x such that a x < x < b x, (a x, b x (x k 1, x k, and either g(x k 1 g(x k and g(x k g(x k 1 > A or g(x k 1 g(x k and x k x k 1 g(x k g(x k 1 < A holds. Thus I = {(a x, b x : x E P } is a collection x k x k 1 of open subintervals of [a, b] that covers E P. By Remark 1, there exists a finite disjoint subcollection {I 1, I 2,..., I N } of I such that I k > ε 4. (2 Now let Q = {y 0, y 1, y 2,..., y q } be the partition of [a, b] determined by the points of P and the endpoints of the intervals I 1, I 2,..., I N. For each [x k 1, x k ] containing at least one of the intervals {I 1, I 2,..., I N }, we get by Lemma 2 that g(y i g(y i 1 > g(x k g(x k 1 + AL k, (3 [y i 1,y i ] [x k 1,x k ] where the summation is taken over the closed intervals determined by Q that are contained in [x k 1, x k ] and L k is the sum of the lengths of those intervals I 1, I 2,..., I N that contained in [x k 1, x k ]. Summing inequality (3 over k and using (1 and (2, we get q g(y k g(y k 1 > g(x k g(x k 1 + A which contradicts the definition of T. We have shown that the set > T Aε ( ε 4 + A 4 = T, I k F = {x : x (a, b, f is continuous at x and Df(x > Df(x} 7
8 has measure zero. Hence upper and lower derivatives are equal but they can be both equal to infinity. For existence of the derivative this value must be finite. Now in this part of our proof we will show that f has a finite derivative almost everywhere on [a, b]. Since Df(x 0 for all x in (a, b, it is sufficient to prove that Df(x < almost everywhere on (a, b. To accomplish this we will show that has measure zero. E = {x : x (a, b and Df(x = } Suppose that E does not have measure zero. Let M be an arbitrarily large positive number, and let ε be as in Lemma 1. If x lies in E, then Df(x > M and there exist a x and b x such that a x < x < b x, (a x, b x (a, b, and f(b x f(a x b x a x > M. Thus I = {(a x, b x : x E} covers E and by Lemma 1 contains a finite disjoint subcollection {I 1, I 2,... I N } such that N I k > ε/3. For each k let I k = (a k, b k. Since f is increasing, clearly f(b f(a ( f(b k f(a k > M(b k a k > M ε 3. Therefore f(b f(a > Mε/3. Because ε > 0 and M is arbitrarily large, this contradicts the finiteness of f(b f(a. Hence we have shown that a continuous nondecreasing real-valued function f defined on [a, b] has a finite derivative almost everywhere in this interval. Similarly we can show that it is true for a nonincreasing function f. 4 CONCLUSION It is clear that if a fuction f is differentiable at a point x then it is continuous at x. But the inverse is not always true. In Lebesgue Differentiation Theorem it is stated that a continuous monotone function is differentiable almost everywhere. Actually this result is excellent in its own and made an extensive contribution to mathematics. It means nearly that a continuous function is differentiable. 8
9 In our work we proved this result with using elementary consepts. We used sets of measure zero, Heine-Borel Theorem, upper and lower derivatives which can be presented in an elementary analysis course. Mathematicians worked to prove this result many times in many ways. For instance a geometric proof was given by D. Austin. But the arguments in this work are more complicated to understand. It can be another work to study solely. References [1] M. W. Botsko. An Elementary Proof of Lebesgue s Differentiation Theorem, The American Mathematical Monthly, 110 (9, (Nov 2003: [2] R. P. Boas., A Primer of Real Funtions,(Rahway, New Jersey: Mathematical Association of America,
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
More informationMathematics 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
More information1. 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
More informationMetric 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
More informationMASSACHUSETTS 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
More informationFIRST 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
More informationTHE 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,
More informationNotes 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.
More informationx 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
More informationNo: 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
More informationPractice 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
More informationI. 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
More informationEstimating the Average Value of a Function
Estimating the Average Value of a Function Problem: Determine the average value of the function f(x) over the interval [a, b]. Strategy: Choose sample points a = x 0 < x 1 < x 2 < < x n 1 < x n = b and
More informationHow To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra
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
More informationTOPIC 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
More informationThe 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
More informationMathematical 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.............................
More informationReal 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
More informationMetric 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
More information9 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......
More informationSOLUTIONS 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
More informationLebesgue Measure on R n
8 CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationINDISTINGUISHABILITY 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
More informationCHAPTER 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.,
More informationMetric 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
More informationand s n (x) f(x) for all x and s.t. s n is measurable if f is. REAL ANALYSIS Measures. A (positive) measure on a measurable space
RAL ANALYSIS A survey of MA 641-643, UAB 1999-2000 M. Griesemer Throughout these notes m denotes Lebesgue measure. 1. Abstract Integration σ-algebras. A σ-algebra in X is a non-empty collection of subsets
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationThe 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,
More informationMEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich
MEASURE AND INTEGRATION Dietmar A. Salamon ETH Zürich 12 May 2016 ii Preface This book is based on notes for the lecture course Measure and Integration held at ETH Zürich in the spring semester 2014. Prerequisites
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationLECTURE NOTES IN MEASURE THEORY. Christer Borell Matematik Chalmers och Göteborgs universitet 412 96 Göteborg (Version: January 12)
1 LECTURE NOTES IN MEASURE THEORY Christer Borell Matematik Chalmers och Göteborgs universitet 412 96 Göteborg (Version: January 12) 2 PREFACE These are lecture notes on integration theory for a eight-week
More informationLecture Notes on Measure Theory and Functional Analysis
Lecture Notes on Measure Theory and Functional Analysis P. Cannarsa & T. D Aprile Dipartimento di Matematica Università di Roma Tor Vergata cannarsa@mat.uniroma2.it daprile@mat.uniroma2.it aa 2006/07 Contents
More informationFixed 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
More informationDISINTEGRATION OF MEASURES
DISINTEGRTION OF MESURES BEN HES Definition 1. Let (, M, λ), (, N, µ) be sigma-finite measure spaces and let T : be a measurable map. (T, µ)-disintegration is a collection {λ y } y of measures on M such
More informationIntroduction 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.......................................
More informationBasic 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
More informationRolle 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
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More information1 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)
More informationCHAPTER 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
More informationMA651 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
More informationBANACH 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
More informationConvex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
More informationE3: 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............................
More informationSeparation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
More informationHow To Prove 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
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationExtension of measure
1 Extension of measure Sayan Mukherjee Dynkin s π λ theorem We will soon need to define probability measures on infinite and possible uncountable sets, like the power set of the naturals. This is hard.
More informationElements of probability theory
2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted
More informationSection 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
More informationVector 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
More informationChapter 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
More informationON 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
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationEvery 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
More informationMath 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
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationFUNCTIONAL 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
More informationINTRODUCTORY 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,
More informationContinuity. DEFINITION 1: A function f is continuous at a number a if. lim
Continuity DEFINITION : A function f is continuous at a number a if f(x) = f(a) REMARK: It follows from the definition that f is continuous at a if and only if. f(a) is defined. 2. f(x) and +f(x) exist.
More informationFuzzy Probability Distributions in Bayesian Analysis
Fuzzy Probability Distributions in Bayesian Analysis Reinhard Viertl and Owat Sunanta Department of Statistics and Probability Theory Vienna University of Technology, Vienna, Austria Corresponding author:
More informationALMOST 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
More informationMath 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
More informationGod 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
More informationMathematical 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,
More informationLIMITS AND CONTINUITY
LIMITS AND CONTINUITY 1 The concept of it Eample 11 Let f() = 2 4 Eamine the behavior of f() as approaches 2 2 Solution Let us compute some values of f() for close to 2, as in the tables below We see from
More information36 CHAPTER 1. LIMITS AND CONTINUITY. Figure 1.17: At which points is f not continuous?
36 CHAPTER 1. LIMITS AND CONTINUITY 1.3 Continuity Before Calculus became clearly de ned, continuity meant that one could draw the graph of a function without having to lift the pen and pencil. While this
More information10.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
More informationMarkov random fields and Gibbs measures
Chapter Markov random fields and Gibbs measures 1. Conditional independence Suppose X i is a random element of (X i, B i ), for i = 1, 2, 3, with all X i defined on the same probability space (.F, P).
More informationLecture 7: Continuous Random Variables
Lecture 7: Continuous Random Variables 21 September 2005 1 Our First Continuous Random Variable The back of the lecture hall is roughly 10 meters across. Suppose it were exactly 10 meters, and consider
More informationA 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
More informationFurther 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
More informationMA4001 Engineering Mathematics 1 Lecture 10 Limits and Continuity
MA4001 Engineering Mathematics 1 Lecture 10 Limits and Dr. Sarah Mitchell Autumn 2014 Infinite limits If f(x) grows arbitrarily large as x a we say that f(x) has an infinite limit. Example: f(x) = 1 x
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationSolutions 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
More information1. 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
More information3. 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)
More informationCartesian 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
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationContinued 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
More information1. 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
More informationON 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
More informationUniversity 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
More informationIntroduction to Finite Fields (cont.)
Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number
More informationCS 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
More informationINCIDENCE-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
More informationTHE 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
More informationCritical 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) =
More informationGENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY
GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in
More informationUniversal Algorithm for Trading in Stock Market Based on the Method of Calibration
Universal Algorithm for Trading in Stock Market Based on the Method of Calibration Vladimir V yugin Institute for Information Transmission Problems, Russian Academy of Sciences, Bol shoi Karetnyi per.
More informationFollow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu
COPYRIGHT NOTICE: Ariel Rubinstein: Lecture Notes in Microeconomic Theory is published by Princeton University Press and copyrighted, c 2006, by Princeton University Press. All rights reserved. No part
More informationTriangle 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,
More informationProperties 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
More informationLecture Notes on Analysis II MA131. Xue-Mei Li
Lecture Notes on Analysis II MA131 Xue-Mei Li March 8, 2013 The lecture notes are based on this and previous years lectures by myself and by the previous lecturers. I would like to thank David Mond, who
More informationAbout 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
More informationk, 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
More informationVieta s Formulas and the Identity Theorem
Vieta s Formulas and the Identity Theorem This worksheet will work through the material from our class on 3/21/2013 with some examples that should help you with the homework The topic of our discussion
More informationConnectivity 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
More informationSCORE SETS IN ORIENTED GRAPHS
Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in
More information