Estimates for probabilities of independent events and infinite series
|
|
- Allyson Fox
- 5 years ago
- Views:
Transcription
1 Estimates for probabilities of independent events and infinite series Jürgen Grahl and Shahar evo September 9, 06 arxiv: v [math.pr] 8 Sep 06 Abstract This paper deals with finite or infinite sequences of arbitrary independent events in some probability space. We find sharp lower bounds for the probability of a union of such events when the sum of their probabilities is given. The results have parallel meanings in terms of infinite series. Keywords: Probability space, independent events, Bonferroni inequalities, Borel- Cantelli lemma, infinite series Mathematics Subject Classification: 60-0, 60A05, 97K50, 40A05 Introduction This paper deals with finite or infinite sequences of arbitrary independent events in some probability space Ω, A, P. In particular, we discuss the connection between the sum of the probabilities of these events and the probability of their union. aturally, the results can be formulated both in the language of probability and the language of calculus of non-negative series. This paper is written in an expository and to some extent educational style. Part of the results in particular in sections and 3 are basically known, one of them being more or less equivalent to the Borel-Cantelli lemma. We hope that our approach, emphasizing the connections to calculus, will be of interest in itself. In Section we start with a lemma/construction that shows that for each sequence {x n } of real numbers x n [0; there is a sequence of independent events {A n } in a suitable quite simple probability space Ω, A, P such that P A n = x n for all n. In Section 3 we discuss the connections between the convergence of series of independent events and the probability of the union of these events. In particular, we give an extension of the inclusion-exclusion principle to the case of infinitely many events. In Section 4 we determine a sharp lower bound for the probability of a union of independent events when the sum of the probabilities is given and, vice versa, a sharp upper bound for the sum of the probabilities when the probability of the union is given.
2 The correspondence between sequences of independent events and non-negative series Throughout this paper, let Ω, A, P be a probability space, i.e. Ω is an arbitrary nonempty set, A a σ-algebra of subsets of Ω the sets considered to be measurable w.r.t. P and P : A [0; ] a probability measure. Let us first recall that infinitely many events A, A,... A are mutually independent if and only if k k P A il = P A il whenever i < i <... < i k. l= l= In the following we frequently make use of the fact that independence isn t affected if one or several events are replaced by their complements with respect to Ω. We denote the complement of an event A by A c, i.e. A c := Ω \ A. We begin with a lemma that gives a full correspondence between series with non-negative terms and less than and sequences of independent events. Lemma. If {x n } is a sequence of real numbers x n [0; ], then there exist a probability space Ω, A, P and a sequence {A n } of independent events A n A such that P A n = x n for all n. Proof. We can choose Ω := [0, ] [0, ] R, equipped with the Lebesgue measure P on the σ-algebra A of Lebesgue measurable subsets of Ω. We construct the desired sequence of sets/events A n by recursion. First, we take A to be the empty set if x = 0, and if x > 0 then we take A to be a rectangle contained in Ω, with its sides parallel to the axes and with area x. Here and in the following it doesn t matter whether we take open or closed rectangles since their boundaries form a null set anyway. Suppose we have already defined events A, A,..., A n such that P A k = x k for k =,..., n, the events A,..., A n are independent and 3 each A k k =,..., n is a finite union of rectangles with sides parallel to the axes. Then if if x n+ = 0 we define A n+ :=. If x n+ > 0, then for every k {,..., n } and for i < i <... < i k n we define k B i,i,...,i k := A il \ A j, l= j n j i,i,...,i k i.e. B i,i,...,i k consists of those points in Ω that are contained in all A il, but not in any other A j. Furthermore, for k = 0 we define B := Ω \ A A... A n.
3 In this way, we get a decomposition of Ω to n pairwise disjoint sets, Ω = k n i <i <...<i k n B i,i,...,i k B. For simplicity, let us re-write this as Ω = C C... C n where each C l is one of the sets B i,i,...,i k or B. The exact order is not important. Each C j is a finite union of rectangles with sides parallel to the axes. For each j we can construct a set C j C j which is a union of rectangles with sides parallel to the axes and with area P Cj = x n+ P C j. ow we define A n+ := C C... C n. From the construction it is obvious that P A n+ = x n+ and that A n+ is a finite union of rectangles with its sides parallel to the axes. It remains to show that A,..., A n+ are independent, more precisely that k k P A n+ A il = P A n+ P A il whenever i < i <... < i k n. l= ν= For this purpose we fix i,..., i n with i < i <... < i k n. Then by our construction there are j,..., j r {,..., n } such that k A il = l= r C jν. ν= Here P C jν A n+ = P Cjν = x n+ P C jν = P A n+ P C jν, and we obtain k P A n+ A il l= r = P C jν A n+ = ν= r P C jν A n+ ν= = P A n+ r P C jν ν= r = P A n+ P C jν ν= k = P A n+ P A il = P A n+ l= ν= k P A il, as desired. In such a way, we can construct the required infinite sequence {A n }. Obviously this lemma is true also for a finite number of sets. 3
4 3 The connection between the convergence of the series of probabilities and the probability of the union We now turn to the situation that we will deal with for the rest of this paper. We first introduce the following notation. otation. Let {x n } be a sequence of real numbers x n [0;. Then we set and generally T := x, T := x x, T 3 := x 3 x x, n T n := x n x x... x n = x n x k for all n. The quantities T n have a probabilistic meaning: In view of Lemma, we can consider the x n as probabilities of certain independent events A n in some probability space: x n = P A n. Then we have T n = P A n \ n k= A k k=, 3. i.e. T n is the probability that A n, but none of the events A,..., A n happens. In the following this correspondence will be very useful. We first collect some easy observations on the T n. Remark. For all I T n = x x... x. 3. Proof. This obviously holds for =, and if it is valid for some, then we conclude that + + T n = T n + T + = x n + x + x n = x n, so by induction our claim holds for all. Proof. 3. also follows from the probabilistic meaning of the T : For every I we have in view of 3. T n = P A n = P = x x... x, A c n where the last equality holds since A c, A c,..., A c n are also independent events. In other words, both sides of 3. denote the probability that at least one of the events A,..., A happens. 4
5 From 3. we immediately obtain T = x T n for all For every I the map F : R R, F x, x,..., x := T, T,..., T is injective though of course not surjective and the inverse is given by F T, T,..., T = x, x,..., x where x = T, x = T T, x 3 = T 3 T T,..., x = T T T... T. Thus, we will often say {x n } and the corresponding {T n } and vice versa. The above is also true for = in an obvious manner. 4 If σ is some permutation of {,..., } and T = T,..., T := F x σ,..., x σ, then T n = T n. This is an immediate consequence from 3.. Theorem. If the T n are defined as above, then T n < for all and Furthermore T n = if and only if x n =. T n. Proof. T n < follows immediately from 3., keeping in mind that x n < for all n. Hence u := T n. If u <, then we use that from 3.3 we have n T n = x n T k x n u for all n, 3.4 which yields k= T n u x n, hence x n u u <
6 Suppose now that u =. We want to show that x n =. Indeed, if there exists an such that T n = T T + x +n, and we obtain x n <, then x +n T T... T +n T T + T T... T < since T T <. This completes the proof of our Theorem. In the proof of the second statement on the case of equality we can also argue as follows: Taking the limit in 3. we obtain T n = lim T n = x n. By the theory of infinite products [, p. 9] hence to T n <. x n < is equivalent to x n > 0, Continuing with this line of ideas, we can get the following estimate for x n. Theorem 3. If x n < and u := T n <, then and this estimate is sharp. Proof. x n < log u, As in the proof of Theorem, from 3. we get u = T n = x n. Using the well-known estimate log + x < x which holds for < x we obtain x n < log x n = log x n = log u = log u. 3.6 In order to show the asymptotic sharpness of this estimate, we fix some u [0;, and we choose the x n such that finitely many of them have the same value and all others are zero. More precisely, for given I we set { u for n =,...,, x n := 0 for n >. 6
7 Then and T n = x n = x n = u = u x n = u log u ; the latter limit is easily calculated by considering the derivative of gx := u x at x = 0. The sharpness of the estimate can also be seen by estimating the error in the inequality log + x < x used above: From 3.6 and the Taylor expansion of the logarithm we obtain 0 < log u x n = [log x n + x n ] = x n x n 3 + x n 4 x n If again x,..., x are all equal to x and x n = 0 for all n > where of course x depends on, in order to ensure T n = u, then x = x n < log u, hence x < log u, and we obtain 0 < log u x n x n = x < < log u. This upper bound obviously tends to 0 if which again shows the sharpness of the result. We will revisit the estimate in Theorem 3 from a slightly different point of view in the next section. We now want to give a probabilistic formulation of Theorems and 3. In order to do so we recall that if the x n are the probabilities of certain independent events A n, then T n is the probability of A n \ n k= A k. Since these sets are pairwise disjoint, we conclude that T n = P A n. So the estimate T n x n a direct consequence of T n x n is just a reformulation of the trivial inequality P A n P A n. In view of 3. it is also equivalent to the estimate x n 7 x n x n.
8 valid for all x n 0 which of course can also be proved by an elementary induction. The probabilistic meaning of the sum T n also carries over to the limit case. To see this, let us recall some known facts from probability theory. If {B n } n is a sequence of subsets of Ω, then we define B = lim inf n B n := k=n B k and B = lim sup B n := n k=n B k. Obviously, we always have B B. In the case of equality we write lim B n := B = B. n A sufficient condition for B = B, hence for the existence of lim n B n is that the sequence {B n } n is increasing B B B 3... or decreasing B B B When lim B n exists, then n lim P B n = P lim B n 3.7 n n see, for example [4, p. ]. We apply this to our independent events {A n }. If we set B lim B = A n, hence := A n, then P A n = P lim B = lim P B = ow we can state Theorems and 3 in terms of probability. T n. Theorem -P. Let {A n } be a sequence of independent events with P a n < for all n. Then P A n < if and only if P A n <. The direction is reminiscent of the Borel-Cantelli Lemma which can be stated as follows [, p. 96]: Let {A n } be a sequence of events. BC If P A n <, then P lim sup A n = 0. n BC If P A n = and the events A n are independent, then P lim sup A n =. n Here the zero-one law due to Borel and Kolmogorov [, p. 47] makes sure that for independent events P lim sup n A n has either the value 0 or the value. 8
9 In fact, BC is an immediate consequence of Theorem -P. Indeed, if P A n =, then also n= P A n = for all I, and if the events A n are independent, then Theorem -P yields P A n = for all I, so from 3.7 we deduce n= P lim sup A n = P n = n= A n = lim P n= A n =. For the sake of completeness we d also like to remind the reader of the short proof of BC: If P A n <, then for each given ε > 0 there is an I such that n=m P A n < ε for all m, hence P A n < ε for all m. Again in view of 3.7 this yields n=m P lim sup A n = lim P A n ε. n m n=m Since this holds for each ε > 0, we conclude that P lim sup n A n = 0. Theorem -P. If {A n } is a sequence of independent events with P A n < for all n and u := P A n <, then P A n < log u. ow let s consider for a moment only finitely many x n, say x,..., x, and the corresponding T,..., T. Expanding 3. we obtain T n = x n i<j x i x j + i<j<k x i x j x k x x... x. The probabilistic meaning of this identity is just the inclusion-exclusion principle here for the special case of independent events: If once more we identify x n = P A n where A,..., A are independent events, then our identity takes the form P A n = P A n P A i A j i<j<k i<j P A i A j A k P A... A. It is well-known that this identity also in the general case of non-independent events gives rise to the so-called Bonferroni inequalities see, for example [3], by truncating it either after positive or after negative terms: r r k S k P A n k S k for all admissible r, k= k= 9
10 where S k := P A j... A jk. j <j <...<j k Our next theorem shows that the inclusion exclusion principle holds also in the case of infinitely many independent events, i.e. that for all sums in 3.8 are convergent. Theorem 4. If {A n } is a sequence of independent events with P A n < for all n and P A n <, then P A n = k S k where S k := k= j <j <...<j k P A j... A jk. Proof. Setting x n := P A n, we can write S k as S k = x j x j... x jk. j <j <...<j k Since in any product of the form x j x j... x j, there is at least one j i with j i, and S is the sum of all possibilities of products of different x i s, we have the estimate S S n= ow, since x n converges, for every q 0; we have x n for all. 3.9 n= x n < q say for 0. Inserting this into 3.9 yields S S 0 q 0, hence lim for large enough, S = 0 for all q 0;. 3.0 q In fact, when infinitely many x n s are different from zero, then S 0 for every, and S we obtain even lim S = 0. In view of the convergence of the geometric series q n this shows that the sum k= k S k is absolutely convergent. Hence, since all terms in S have the same nonnegative sign, it follows that also the series obtained by expanding all the products in the series T n = x x... x n is absolutely convergent, and thus in any order of summation it has the same value. This proves our theorem. k= 0
11 4 Upper and lower bounds for probabilities Let and T n be as above. We consider the extremal problems to determine { } U s := inf T n : x n = s, 0 x,..., x for 0 s 4. and { } S u := sup x n : T n = u, 0 x,..., x for 0 u. The infimum in the definition of U s is in fact a minimum, since T T = x x... x 4. { is a continuous function of x,..., x which is evaluated on the compact set x,..., x [0; ] : } x n = s. A similar reasoning shows that also the supremum in the definition of S u is a maximum. Theorem 5. U s = s and S u = U u = u. Proof. One might think of the method of Lagrange multipliers to calculate S u and U s, but as sometimes in similar situations it suffices to apply the inequality between arithmetic and geometric means. It shows that for all x,..., x [0; ] with x n = s we have x n x x = s, with equality if and only if x = x =... = x = s. From this and 4. we see U s =. s On the other hand, if x,..., x [0; ] satisfy T n = u [0; ], then by 4. u = x n x x, again with equality if and only if all x n are equal, in which case we have x x = u. This shows the formula for S u. Obviously, S = U. Remark 6. U s and S u are strictly increasing functions of s resp. of u, while U s is a decreasing and S u an increasing function of.
12 Proof. That s U s and u S u are increasing is trivial. Each x,..., x [0; ] with x n = s gives rise to an x,..., x, x + [0; ] + with + x n = s by setting x + := 0, and the T,..., T corresponding to x,..., x and to x,..., x, x + are the same while T + = 0. Therefore the infimum in the definition of U + s is taken over a superset of the set appearing in the definition of U s, and we conclude that U + s U s for s. A similar resoning shows that S u is increasing. Of course, the monotonicity of U s and S u can also be verified by calculating the derivatives of the functions gx := x log x s and hy := y u /y and showing that they are non-negative. In view of, the maximum of U s over all s is attained at the first one, i.e., at = s where s denotes the smallest integer s. Hence we have Us := max U s = s s. s s So when the finite number of events is = s, the minimum of the probabilities P A n under the restriction P A n = s is the highest. Also, we have Us =. lim s In an obvious way, we can extend the definitions of S and U also to the case =. We will show that we will obtain explicit formulas for S and U by taking the limits of S and U for. First of all we note that for s > 0 the infimum in the definition of U s is not a minimum. Indeed, suppose that x n = s and x n = U s. W.l.o.g. we can assume that x > 0. Then we replace x by x, x x = x = x and x n = x n for n 3. Then x. Hence and we get a contradiction. Theorem 7., i.e. we create a new sequence {x n} where x n < x n = U s, x n = s and x x = x > U s = e s and S u = U u = log This formula for S u gives also a new proof of Theorem 3. u.
13 Proof. Since the infimum in the definition of U s is taken over a larger set than for any U s cf. the proof of Remark 6 and since U s e s, it is clear that U s e s. Suppose that U s < e s for some s 0. Then for some sequence {x n } with x n = s we have u 0 := T n < e s. Here infinitely many x n are positive since otherwise U s would be a lower bound for T n for sufficiently large, contradicting U s e s > u 0.. We can choose 0 so large that 0 > s and u 0 < e s 0 where s 0 := 0 x n < s. We then have 0 T n T n = u 0 < e s 0 < s 0 0 = U 0s 0. 0 This is a contradiction to the definition of U 0 s 0. Hence U s = e s. As we have mentioned already in the proof of Theorem 3, S u = u log u, so a similar reasoning as for U s shows that S u = log The functions S, U, S, U are plotted in Figure. u = U u Figure : The graphs of U s left and S u right for =,, 5, The results in Theorems 5 and 7 can be reformulated in terms of probabilities of independent events: Theorem 8. Let A,..., A be finitely many independent events. Then P A n P A n, 4.3 P A n P A n
14 If {A n } is a sequence of independent events such that 0 < P A n <, then P A n > exp P A n, P A n < log P A n. All these estimates are best-possible. Equality in 4.3 and 4.4 occurs if P A =... = P A. The assumption in Theorem 8 that the events A n are independent is essential as the following easy counterexample demonstrates: Choose A =... = A to be one and the same event, whose probability is x = P A 0;. Then the left hand side of 4.3 is x while the right hand side is x which will be larger than x if is sufficiently large. Similarly, the left hand side of 4.4 is x while its right hand side is x, so their quotient x will become arbitrarily small for sufficiently large. x At last we take a brief look at the extremal problems opposite to those above, i.e. with supremum replaced by infimum and vice versa. Their solutions turn out to be quite simple. Theorem 9. For all I we have { } inf x n : T n = u, 0 x,..., x = u for 0 u, { sup T n : } x n = s, 0 x,..., x = min {s, } for 0 s, and this remains valid analogously also for =. Proof. By the definition of the T n we always have x n T n, hence T n x n. Therefore the infimum is at least u, and the value u is attained by taking only one event with x = T = u and x n = 0 for n. This shows the first assertion. The very same reasoning applies to the case s in the second assertion. If s >, we can choose x = and the other x n more or less arbitrary, requiring only x n = s. Then T = and T n = 0 for all n, hence T n = which is of course the maximal value. This proves also the second assertion. Acknowledgment. advice. We would like to thank Professor Ely Merzbach for his valuable References [] L.V. Ahlfors: Complex Analysis. An introduction to the theory of analytic functions of one complex variable, 3rd edition, McGraw-Hill Book Company, Düsseldorf 979 4
15 [] H. Bauer: Wahrscheinlichkeitstheorie, 4th edition, Walter degruyter, Berlin/ew York 99 [3] J. Galambos; I. Simonelli: Bonferroni-type inequalities with applications, Springer, ew York 996 [4] A. Gut: Probability: A Graduate Course, Springer, ew York 007. Jürgen Grahl University of Würzburg Department of Mathematics Würzburg Germany grahl@mathematik.uni-wuerzburg.de Shahar evo Bar-Ilan University Department of Mathematics Ramat-Gan 5900 Israel nevosh@math.biu.ac.il 5
Chapter 4. Measure Theory. 1. Measure Spaces
Chapter 4. Measure Theory 1. Measure Spaces Let X be a nonempty set. A collection S of subsets of X is said to be an algebra on X if S has the following properties: 1. X S; 2. if A S, then A c S; 3. if
More informationHILBERT SPACES AND THE RADON-NIKODYM THEOREM. where the bar in the first equation denotes complex conjugation. In either case, for any x V define
HILBERT SPACES AND THE RADON-NIKODYM THEOREM STEVEN P. LALLEY 1. DEFINITIONS Definition 1. A real inner product space is a real vector space V together with a symmetric, bilinear, positive-definite mapping,
More informationChapter 1. Measure Spaces. 1.1 Algebras and σ algebras of sets Notation and preliminaries
Chapter 1 Measure Spaces 1.1 Algebras and σ algebras of sets 1.1.1 Notation and preliminaries We shall denote by X a nonempty set, by P(X) the set of all parts (i.e., subsets) of X, and by the empty set.
More informationSTAT 7032 Probability Spring Wlodek Bryc
STAT 7032 Probability Spring 2018 Wlodek Bryc Created: Friday, Jan 2, 2014 Revised for Spring 2018 Printed: January 9, 2018 File: Grad-Prob-2018.TEX Department of Mathematical Sciences, University of Cincinnati,
More informationProblem set 1, Real Analysis I, Spring, 2015.
Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n
More informationMeasures. Chapter Some prerequisites. 1.2 Introduction
Lecture notes Course Analysis for PhD students Uppsala University, Spring 2018 Rostyslav Kozhan Chapter 1 Measures 1.1 Some prerequisites I will follow closely the textbook Real analysis: Modern Techniques
More informationThe small ball property in Banach spaces (quantitative results)
The small ball property in Banach spaces (quantitative results) Ehrhard Behrends Abstract A metric space (M, d) is said to have the small ball property (sbp) if for every ε 0 > 0 there exists a sequence
More information5 Measure theory II. (or. lim. Prove the proposition. 5. For fixed F A and φ M define the restriction of φ on F by writing.
5 Measure theory II 1. Charges (signed measures). Let (Ω, A) be a σ -algebra. A map φ: A R is called a charge, (or signed measure or σ -additive set function) if φ = φ(a j ) (5.1) A j for any disjoint
More informationA LITTLE REAL ANALYSIS AND TOPOLOGY
A LITTLE REAL ANALYSIS AND TOPOLOGY 1. NOTATION Before we begin some notational definitions are useful. (1) Z = {, 3, 2, 1, 0, 1, 2, 3, }is the set of integers. (2) Q = { a b : aεz, bεz {0}} is the set
More informationThe Lebesgue Integral
The Lebesgue Integral Brent Nelson In these notes we give an introduction to the Lebesgue integral, assuming only a knowledge of metric spaces and the iemann integral. For more details see [1, Chapters
More informationMeasures. 1 Introduction. These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland.
Measures These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland. 1 Introduction Our motivation for studying measure theory is to lay a foundation
More information(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define
Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More informationThe main results about probability measures are the following two facts:
Chapter 2 Probability measures The main results about probability measures are the following two facts: Theorem 2.1 (extension). If P is a (continuous) probability measure on a field F 0 then it has a
More informationSection 2: Classes of Sets
Section 2: Classes of Sets Notation: If A, B are subsets of X, then A \ B denotes the set difference, A \ B = {x A : x B}. A B denotes the symmetric difference. A B = (A \ B) (B \ A) = (A B) \ (A B). Remarks
More informationThe strictly 1/2-stable example
The strictly 1/2-stable example 1 Direct approach: building a Lévy pure jump process on R Bert Fristedt provided key mathematical facts for this example. A pure jump Lévy process X is a Lévy process such
More informationMath212a1411 Lebesgue measure.
Math212a1411 Lebesgue measure. October 14, 2014 Reminder No class this Thursday Today s lecture will be devoted to Lebesgue measure, a creation of Henri Lebesgue, in his thesis, one of the most famous
More informationIntroduction to Hausdorff Measure and Dimension
Introduction to Hausdorff Measure and Dimension Dynamics Learning Seminar, Liverpool) Poj Lertchoosakul 28 September 2012 1 Definition of Hausdorff Measure and Dimension Let X, d) be a metric space, let
More informationSome Background Material
Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationSpring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures
36-752 Spring 2014 Advanced Probability Overview Lecture Notes Set 1: Course Overview, σ-fields, and Measures Instructor: Jing Lei Associated reading: Sec 1.1-1.4 of Ash and Doléans-Dade; Sec 1.1 and A.1
More information3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable
More informationTheorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension. n=1
Chapter 2 Probability measures 1. Existence Theorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension to the generated σ-field Proof of Theorem 2.1. Let F 0 be
More information(U) =, if 0 U, 1 U, (U) = X, if 0 U, and 1 U. (U) = E, if 0 U, but 1 U. (U) = X \ E if 0 U, but 1 U. n=1 A n, then A M.
1. Abstract Integration The main reference for this section is Rudin s Real and Complex Analysis. The purpose of developing an abstract theory of integration is to emphasize the difference between the
More informationCHAPTER I THE RIESZ REPRESENTATION THEOREM
CHAPTER I THE RIESZ REPRESENTATION THEOREM We begin our study by identifying certain special kinds of linear functionals on certain special vector spaces of functions. We describe these linear functionals
More informationMeasure and integration
Chapter 5 Measure and integration In calculus you have learned how to calculate the size of different kinds of sets: the length of a curve, the area of a region or a surface, the volume or mass of a solid.
More information1.1. MEASURES AND INTEGRALS
CHAPTER 1: MEASURE THEORY In this chapter we define the notion of measure µ on a space, construct integrals on this space, and establish their basic properties under limits. The measure µ(e) will be defined
More informationLebesgue Measure. Dung Le 1
Lebesgue Measure Dung Le 1 1 Introduction How do we measure the size of a set in IR? Let s start with the simplest ones: intervals. Obviously, the natural candidate for a measure of an interval is its
More informationREAL ANALYSIS LECTURE NOTES: 1.4 OUTER MEASURE
REAL ANALYSIS LECTURE NOTES: 1.4 OUTER MEASURE CHRISTOPHER HEIL 1.4.1 Introduction We will expand on Section 1.4 of Folland s text, which covers abstract outer measures also called exterior measures).
More informationConstruction of a general measure structure
Chapter 4 Construction of a general measure structure We turn to the development of general measure theory. The ingredients are a set describing the universe of points, a class of measurable subsets along
More informationAhlswede Khachatrian Theorems: Weighted, Infinite, and Hamming
Ahlswede Khachatrian Theorems: Weighted, Infinite, and Hamming Yuval Filmus April 4, 2017 Abstract The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationREAL AND COMPLEX ANALYSIS
REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any
More informationMATH5011 Real Analysis I. Exercise 1 Suggested Solution
MATH5011 Real Analysis I Exercise 1 Suggested Solution Notations in the notes are used. (1) Show that every open set in R can be written as a countable union of mutually disjoint open intervals. Hint:
More informationJUHA KINNUNEN. Harmonic Analysis
JUHA KINNUNEN Harmonic Analysis Department of Mathematics and Systems Analysis, Aalto University 27 Contents Calderón-Zygmund decomposition. Dyadic subcubes of a cube.........................2 Dyadic cubes
More informationNotes 6 : First and second moment methods
Notes 6 : First and second moment methods Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Roc, Sections 2.1-2.3]. Recall: THM 6.1 (Markov s inequality) Let X be a non-negative
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More informationSOME MEASURABILITY AND CONTINUITY PROPERTIES OF ARBITRARY REAL FUNCTIONS
LE MATEMATICHE Vol. LVII (2002) Fasc. I, pp. 6382 SOME MEASURABILITY AND CONTINUITY PROPERTIES OF ARBITRARY REAL FUNCTIONS VITTORINO PATA - ALFONSO VILLANI Given an arbitrary real function f, the set D
More informationarxiv: v1 [math.fa] 14 Jul 2018
Construction of Regular Non-Atomic arxiv:180705437v1 [mathfa] 14 Jul 2018 Strictly-Positive Measures in Second-Countable Locally Compact Non-Atomic Hausdorff Spaces Abstract Jason Bentley Department of
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationCopyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.
.1 Limits of Sequences. CHAPTER.1.0. a) True. If converges, then there is an M > 0 such that M. Choose by Archimedes an N N such that N > M/ε. Then n N implies /n M/n M/N < ε. b) False. = n does not converge,
More informationG1CMIN Measure and Integration
G1CMIN Measure and Integration 2003-4 Prof. J.K. Langley May 13, 2004 1 Introduction Books: W. Rudin, Real and Complex Analysis ; H.L. Royden, Real Analysis (QA331). Lecturer: Prof. J.K. Langley (jkl@maths,
More informationMath 421, Homework #7 Solutions. We can then us the triangle inequality to find for k N that (x k + y k ) (L + M) = (x k L) + (y k M) x k L + y k M
Math 421, Homework #7 Solutions (1) Let {x k } and {y k } be convergent sequences in R n, and assume that lim k x k = L and that lim k y k = M. Prove directly from definition 9.1 (i.e. don t use Theorem
More information2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is
More informationREAL ANALYSIS I Spring 2016 Product Measures
REAL ANALSIS I Spring 216 Product Measures We assume that (, M, µ), (, N, ν) are σ- finite measure spaces. We want to provide the Cartesian product with a measure space structure in which all sets of the
More informationM17 MAT25-21 HOMEWORK 6
M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute
More informationMATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION. Extra Reading Material for Level 4 and Level 6
MATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION Extra Reading Material for Level 4 and Level 6 Part A: Construction of Lebesgue Measure The first part the extra material consists of the construction
More informationCHAPTER 6. Differentiation
CHPTER 6 Differentiation The generalization from elementary calculus of differentiation in measure theory is less obvious than that of integration, and the methods of treating it are somewhat involved.
More informationPart V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory
Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite
More information18.175: Lecture 3 Integration
18.175: Lecture 3 Scott Sheffield MIT Outline Outline Recall definitions Probability space is triple (Ω, F, P) where Ω is sample space, F is set of events (the σ-algebra) and P : F [0, 1] is the probability
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More information1 The Real Number System
1 The Real Number System The rational numbers are beautiful, but are not big enough for various purposes, and the set R of real numbers was constructed in the late nineteenth century, as a kind of an envelope
More informationReal Variables: Solutions to Homework 3
Real Variables: Solutions to Homework 3 September 3, 011 Exercise 0.1. Chapter 3, # : Show that the cantor set C consists of all x such that x has some triadic expansion for which every is either 0 or.
More informationMath 421, Homework #6 Solutions. (1) Let E R n Show that = (E c ) o, i.e. the complement of the closure is the interior of the complement.
Math 421, Homework #6 Solutions (1) Let E R n Show that (Ē) c = (E c ) o, i.e. the complement of the closure is the interior of the complement. 1 Proof. Before giving the proof we recall characterizations
More informationMORE ON CONTINUOUS FUNCTIONS AND SETS
Chapter 6 MORE ON CONTINUOUS FUNCTIONS AND SETS This chapter can be considered enrichment material containing also several more advanced topics and may be skipped in its entirety. You can proceed directly
More informationSolution of the 7 th Homework
Solution of the 7 th Homework Sangchul Lee December 3, 2014 1 Preliminary In this section we deal with some facts that are relevant to our problems but can be coped with only previous materials. 1.1 Maximum
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationMath 564 Homework 1. Solutions.
Math 564 Homework 1. Solutions. Problem 1. Prove Proposition 0.2.2. A guide to this problem: start with the open set S = (a, b), for example. First assume that a >, and show that the number a has the properties
More informationExercises for Unit VI (Infinite constructions in set theory)
Exercises for Unit VI (Infinite constructions in set theory) VI.1 : Indexed families and set theoretic operations (Halmos, 4, 8 9; Lipschutz, 5.3 5.4) Lipschutz : 5.3 5.6, 5.29 5.32, 9.14 1. Generalize
More information18.175: Lecture 2 Extension theorems, random variables, distributions
18.175: Lecture 2 Extension theorems, random variables, distributions Scott Sheffield MIT Outline Extension theorems Characterizing measures on R d Random variables Outline Extension theorems Characterizing
More informationChapter One. The Real Number System
Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and
More informationChapter 2 Metric Spaces
Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics
More informationLebesgue Measure on R n
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 information3 Measurable Functions
3 Measurable Functions Notation A pair (X, F) where F is a σ-field of subsets of X is a measurable space. If µ is a measure on F then (X, F, µ) is a measure space. If µ(x) < then (X, F, µ) is a probability
More informationMAT 257, Handout 13: December 5-7, 2011.
MAT 257, Handout 13: December 5-7, 2011. The Change of Variables Theorem. In these notes, I try to make more explicit some parts of Spivak s proof of the Change of Variable Theorem, and to supply most
More informationTopological properties of Z p and Q p and Euclidean models
Topological properties of Z p and Q p and Euclidean models Samuel Trautwein, Esther Röder, Giorgio Barozzi November 3, 20 Topology of Q p vs Topology of R Both R and Q p are normed fields and complete
More informationHomework 11. Solutions
Homework 11. Solutions Problem 2.3.2. Let f n : R R be 1/n times the characteristic function of the interval (0, n). Show that f n 0 uniformly and f n µ L = 1. Why isn t it a counterexample to the Lebesgue
More informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
More informationModule 1. Probability
Module 1 Probability 1. Introduction In our daily life we come across many processes whose nature cannot be predicted in advance. Such processes are referred to as random processes. The only way to derive
More informationIntegral Jensen inequality
Integral Jensen inequality Let us consider a convex set R d, and a convex function f : (, + ]. For any x,..., x n and λ,..., λ n with n λ i =, we have () f( n λ ix i ) n λ if(x i ). For a R d, let δ a
More informationOn the Set of Limit Points of Normed Sums of Geometrically Weighted I.I.D. Bounded Random Variables
On the Set of Limit Points of Normed Sums of Geometrically Weighted I.I.D. Bounded Random Variables Deli Li 1, Yongcheng Qi, and Andrew Rosalsky 3 1 Department of Mathematical Sciences, Lakehead University,
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationHOMEWORK ASSIGNMENT 6
HOMEWORK ASSIGNMENT 6 DUE 15 MARCH, 2016 1) Suppose f, g : A R are uniformly continuous on A. Show that f + g is uniformly continuous on A. Solution First we note: In order to show that f + g is uniformly
More informationConnectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ).
Connectedness 1 Motivation Connectedness is the sort of topological property that students love. Its definition is intuitive and easy to understand, and it is a powerful tool in proofs of well-known results.
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationEcon Slides from Lecture 1
Econ 205 Sobel Econ 205 - Slides from Lecture 1 Joel Sobel August 23, 2010 Warning I can t start without assuming that something is common knowledge. You can find basic definitions of Sets and Set Operations
More information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More informationLebesgue-Radon-Nikodym Theorem
Lebesgue-Radon-Nikodym Theorem Matt Rosenzweig 1 Lebesgue-Radon-Nikodym Theorem In what follows, (, A) will denote a measurable space. We begin with a review of signed measures. 1.1 Signed Measures Definition
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationElementary Probability. Exam Number 38119
Elementary Probability Exam Number 38119 2 1. Introduction Consider any experiment whose result is unknown, for example throwing a coin, the daily number of customers in a supermarket or the duration of
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 informationPostulate 2 [Order Axioms] in WRW the usual rules for inequalities
Number Systems N 1,2,3,... the positive integers Z 3, 2, 1,0,1,2,3,... the integers Q p q : p,q Z with q 0 the rational numbers R {numbers expressible by finite or unending decimal expansions} makes sense
More informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
More informationMAS221 Analysis Semester Chapter 2 problems
MAS221 Analysis Semester 1 2018-19 Chapter 2 problems 20. Consider the sequence (a n ), with general term a n = 1 + 3. Can you n guess the limit l of this sequence? (a) Verify that your guess is plausible
More informationElementary Analysis Math 140D Fall 2007
Elementary Analysis Math 140D Fall 2007 Bernard Russo Contents 1 Friday September 28, 2007 1 1.1 Course information............................ 1 1.2 Outline of the course........................... 1
More informationThe Heine-Borel and Arzela-Ascoli Theorems
The Heine-Borel and Arzela-Ascoli Theorems David Jekel October 29, 2016 This paper explains two important results about compactness, the Heine- Borel theorem and the Arzela-Ascoli theorem. We prove them
More informationThus, X is connected by Problem 4. Case 3: X = (a, b]. This case is analogous to Case 2. Case 4: X = (a, b). Choose ε < b a
Solutions to Homework #6 1. Complete the proof of the backwards direction of Theorem 12.2 from class (which asserts the any interval in R is connected). Solution: Let X R be a closed interval. Case 1:
More informationIntegration on Measure Spaces
Chapter 3 Integration on Measure Spaces In this chapter we introduce the general notion of a measure on a space X, define the class of measurable functions, and define the integral, first on a class of
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationPart III. 10 Topological Space Basics. Topological Spaces
Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT4410, autumn 2017 Nadia S. Larsen. 17 November 2017.
Product measures, Tonelli s and Fubini s theorems For use in MAT4410, autumn 017 Nadia S. Larsen 17 November 017. 1. Construction of the product measure The purpose of these notes is to prove the main
More informationIntroduction and Preliminaries
Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis
More information02. Measure and integral. 1. Borel-measurable functions and pointwise limits
(October 3, 2017) 02. Measure and integral Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2017-18/02 measure and integral.pdf]
More informationProjection-valued measures and spectral integrals
Projection-valued measures and spectral integrals Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto April 16, 2014 Abstract The purpose of these notes is to precisely define
More informationMATH 131A: REAL ANALYSIS (BIG IDEAS)
MATH 131A: REAL ANALYSIS (BIG IDEAS) Theorem 1 (The Triangle Inequality). For all x, y R we have x + y x + y. Proposition 2 (The Archimedean property). For each x R there exists an n N such that n > x.
More informationIntroduction. Chapter 1. Contents. EECS 600 Function Space Methods in System Theory Lecture Notes J. Fessler 1.1
Chapter 1 Introduction Contents Motivation........................................................ 1.2 Applications (of optimization).............................................. 1.2 Main principles.....................................................
More information