MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 13 10/22/2008 PRODUCT MEASURE AND FUBINI S THEOREM
|
|
- Nathan Harold Fletcher
- 7 years ago
- Views:
Transcription
1 MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 13 10/22/2008 PRODUCT MEASURE AND FUBINI S THEOREM Contents 1. Product measure 2. Fubini s theorem In elementary math and calculus, we often interchange the order of summation and integration. The discussion here is concerned with conditions under which this is legitimate. 1 PRODUCT MEASURE Consider two probabilistic experiments described by probability spaces (Ω 1, F 1, P 1 ) and (Ω 2, F 2, P 2 ), respectively. We are interested in forming a probabilistic model of a joint experiment in which the original two experiments are carried out independently. 1.1 The sample space of the joint experiment If the first experiment has an outcome ω 1, and the second has an outcome ω 2, then the outcome of the joint experiment is the pair (ω 1, ω 2 ). This leads us to define a new sample space Ω = Ω 1 Ω The σ-field of the joint experiment Next, we need a σ-field on Ω. If A 1 F 1, we certainly want to be able to talk about the event {ω 1 A 1 } and its probability. In terms of the joint experiment, this would be the same as the event A 1 Ω 1 = {(ω 1, ω 2 ) ω 1 A 1, ω 2 Ω 2 }. 1
2 Thus, we would like our σ-field on Ω to include all sets of the form A 1 Ω 2, (with A 1 F 1 ) and by symmetry, all sets of the form Ω 1 A 2 (with (A 2 F 2 ). This leads us to the following definition. Definition 1. We define F 1 F 2 as the smallest σ-field of subsets of Ω 1 Ω 2 that contains all sets of the form A 1 Ω 2 and Ω 1 A 2, where A 1 F 1 and A 2 F 2. Note that the notation F 1 F 2 is misleading: this is not the Cartesian product of F 1 and F 2! Since σ-fields are closed under intersection, we observe that if A i F i, then A 1 A 2 = (A 1 Ω 2 ) (Ω 1 A 2 ) F 1 F 2. It turns out (and is not hard to show) that F 1 F 2 can also be defined as the smallest σ-field containing all sets of the form A 1 A 2, where A i F i. 1.3 The product measure We now define a measure, to be denoted by P 1 P 2 (or just P, for short) on the measurable space (Ω 1 Ω 2, F 1 F 2 ). To capture the notion of independence, we require that P(A 1 A 2 ) = P 1 (A 1 )P 2 (A 2 ), A 1 F 1, A 2 F 2. (1) Theorem 1. There exists a unique measure P on (Ω 1 Ω 2, F 1 F 2 ) that has property (1). Theorem 1 has the flavor of Carathéodory s extension theorem: we define a measure on certain subsets that generate the σ-field F 1 F 2, and then extend it to the entire σ-field. However, Caratheodory s extension theorem involves certain conditions, and checking them does take some nontrivial work. Various proofs can be found in most measure-theoretic probability texts. 1.4 Beyond probability measures Everything in these notes extends to the case where instead of probability measures P i, we are dealing with general measures µ i, under the assumptions that the measures µ i are σ-finite. (A measure µ is called σ-finite if the set Ω can be partitioned into a countable union of sets, each of which has finite measure.) 2
3 The most relevant example of a σ-finite measure is the Lebesgue measure on the real line. Indeed, the real line can be broken into a countable sequence of intervals (n, n + 1], each of which has finite Lebesgue measure. 1.5 The product measure on R 2 The two-dimensional plane R 2 is the Cartesian product of R with itself. We endow each copy of R with the Borel σ-field B and one-dimensional Lebesgue measure. The resulting σ-field B B is called the Borel σ-field on R 2. The resulting product measure on R 2 is called two-dimensional Lebesgue measure, to be denoted here by λ 2. The measure λ 2 corresponds to the natural notion of area. For example, λ 2 ([a, b] [c, d]) = λ([a, b]) λ([c, d]) = (b a) (d c). More generally, for any nice set of the form encountered in calculus, e.g., sets of the form A = {(x, y) f(x, y) c}, where f is a continuous function, λ 2 (A) coincides with the usual notion of the area of A. Remark for those of you who know a little bit of topology otherwise ignore it. We could define the Borel σ-field on R 2 as the σ-field generated by the collection of open subsets of R 2. (This is the standard way of defining Borel sets in topological spaces.) It turns out that this definition results in the same σ-field as the method of Section FUBINI S THEOREM Fubini s theorem is a powerful tool that provides conditions for interchanging the order of integration in a double integral. Given that sums are essentially special cases of integrals (with respect to discrete measures), it also gives conditions for interchanging the order of summations, or the order of a summation and an integration. In this respect, it subsumes results such as Corollary 1 at the end of the notes for Lecture 12. In the sequel, we will assume that g : Ω 1 Ω 2 R is a measurable function. This means that for any Borel set A R, the set {(ω 1, ω 2 ) g(ω 1, ω 2 ) A} belongs to the σ-field F 1 F 2. As a practical matter, it is enough to verify that for any scalar c, the set {(ω 1, ω 2 ) g(ω 1, ω 2 ) c} is measurable. Other than using this definition directly, how else can we verify that such a function g is measurable? The basic tools at hand are the following: (a) continuous functions from R 2 to R are measurable; 3
4 (b) indicator functions of measurable sets are measurable; (c) combining measurable functions in the usual ways (e.g., adding them, multiplying them, taking limits, etc.) results in measurable functions. Fubini s theorem holds under two different sets of conditions: (a) nonnegative functions g (compare with the MCT); (b) functions g whose absolute value has a finite integral (compare with the DCT). We state the two versions separately, because of some subtle differences. The two statements below are taken verbatim from the text by Adams & Guillemin, with minor changes to conform to our notation. Theorem 2. Let g : Ω 1 Ω 2 R be a nonnegative measurable function. Let P = P 1 P 2 be a product measure. Then, (a) For every ω 1 Ω 1, g(ω 1, ω 2 ) is a measurable function of ω 2. (b) For every ω 2 Ω 2, g(ω 1, ω 2 ) is a measurable function of ω 1. (c) Ω 2 g(ω 1, ω 2 ) dp 2 is a measurable function of ω 1. (d) Ω 1 g(ω 1, ω 2 ) dp 1 is a measurable function of ω 2. (e) We have [ ] [ ] g(ω 1, ω 2 ) dp 2 dp 1 = g(ω 1, ω 2 ) dp 1 dp 2 Ω 1 Ω 2 Ω 2 Ω 1 = g(ω 1, ω 2 ) dp. Ω 1 Ω 2 Note that some of the integrals above may be infinite, but this is not a problem; since everything is nonnegative, expressions of the form do not arise. Recall now that a function is said to be integrable if it is measurable and the integral of its absolute value is finite. 4
5 Theorem 3. Let g : Ω 1 Ω 2 R be a measurable function such that g(ω 1, ω 2 ) dp <, where P = P 1 P 2. Ω 1 Ω 2 (a) For almost all ω 1 Ω 1, g(ω 1, ω 2 ) is an integrable function of ω 2. (b) For almost all ω 2 Ω 2, g(ω 1, ω 2 ) is an integrable function of ω 1. (c) There exists an integrable function h : Ω 1 R such that Ω2 g(ω 1, ω 2 ) dp 2 = h(ω 1 ), a.s. (i.e., except for a set of ω 1 of zero P 1 -measure for which Ω 2 g(ω 1, ω 2 ) dp 2 is undefined or infinite). (d) There exists an integrable function h : Ω 2 R such that Ω1 g(ω 1, ω 2 ) dp 1 = h(ω 2 ), a.s. (i.e., except for a set of ω 2 of zero P 2 -measure for which g(ω 1, ω 2 ) dp 1 is undefined or infinite). Ω 1 (e) We have [ ] [ ] g(ω 1, ω 2 ) dp 2 dp 1 = g(ω 1, ω 2 ) dp 1 dp 2 Ω 1 Ω 2 Ω 2 Ω 1 = g(ω 1, ω 2 ) dp. Ω 1 Ω 2 We repeat that all of these results remain valid when dealing with σ-finite measures, such as the Lebesgue measure on R 2. This provides us with conditions for the familiar calculus formula g(x, y) dx dy = g(x, y) dy dx. In order to apply Theorem 3, we need a practical method for checking the integrability condition g(ω 1, ω 2 ) dp <. Ω 1 Ω 2 in Theorem 3. Here, Theorem 2 comes to the rescue. Indeed, by Theorem 2, we have g(ω 1, ω 2 ) dp = g(ω 1, ω 2 ) dp 2 dp 1, Ω 1 Ω 2 Ω 1 Ω 2 5
6 so all we need is to work with the right hand side, and integrate one variable at a time, possibly also using some bounds on the way. Finally, let us note that all the hard work goes into proving Theorem 2. Theorem 3 is relatively easy to derive once Theorem 2 is available: Given a function g, decompose it into its positive and negative parts, apply Theorem 2 to each part, and in the process make sure that you do not encounter expressions of the form. 3 Some cautionary examples We give a few examples where Fubini s theorem does not apply. 3.1 Nonnegative and Integrability Suppose both of our sample spaces are the nonnegative integers: Ω 1 = Ω 2 = {1, 2,..., }. The σ-fields F 1 and F 2 will be all subsets of Ω 1 and Ω 2, respectively. Then, σ(f 1 F 2 ) will be composed of all subsets of {1, 2,..., } 2. Both P 1 and P 2 will be the counting measure, i.e. P (A) = A. This means that gdp 1 = f(a), hdp 2 = h(b), fdp 1 P 2 = f(c). A a A B b B C c C Consider the function f defined by f(m, m) = 1, f(m, m + 1) = 1, and f = 0 elsewhere. It is easier to visualize f with a picture: So fdp 1 dp 2 = f(n, m) = 0 = 1 = f(n, m) = fdp 2 dp 1 Ω 1 Ω 2 n m m n Ω 2 Ω 1 The problem is that the function we are integrating is neither nonnegative nor integrable. 6
7 3.2 σ-finiteness Let Ω 1 = (0, 1), and let F 1 be the Borel sets, and P 1 be the Lebesgue measure. Let Ω 2 = (0, 1) and F 2 be the set of all subsets of (0, 1), and let P 2 be the counting measure. Define f(x, y) = 1 if x = y and 0 otherwise. Then, f(x, y)dp 2 (y)dp 1 (x) = 1dP 1 (y) = 1, Ω 1 Ω 2 Ω 1 but f(x, y)dp 1 (x)dp 2 (y) = 0dP 2 (y) = 0. Ω 2 Ω 1 Ω 2 The problem is that the counting measure on (0, 1) is not σ-finite. 4 An application Let s apply Fubini s theorem to prove a generalization of a familiar relation from a beginning probability course. Let X be a nonnegative integer-valued random variable. Then, E[X] = This is usually proved as follows: i=1 i = p(i) P (X i). E[X] = ip(i) i=1 i=1 k=1 = p(i) k=1 i=k = P (X k) k=1 where the sum exchange is typically justified by an appeal to nonnegativity. Let s rigourously prove a justification of this relation in the most general case. We will show that if X is a nonnegative random variable, then E[X] = 0 P (X x)dx. 7
8 Proof: Define A = {(w, x) 0 x X(w)}. Intuitively, if Ω = R, then A would be the region under the curve X(w). We argue that E[X] = X(w)dP = 1 A (w, x)dxdp, Ω Ω 0 and now let s postpone the technical issues for a moment and interchange the integrals to get E[X] = 1 A (w, x)dp dx 0 Ω = P (X x)dx. 0 Now let s consider the technical details necessary to make the above argument work. The integral interchange can be justified on account of the funciton 1 A being nonnegative, so we just need to show that all the functions we deal with are measurable. In particular we need to show that: 1. For fixed x, 1 A (w, x) is a measurable functions of w. 2. For fixed w, 1 A (w, x) is a measurable function of x. 3. X(ω) is a measurable function of ω. 4. P (X x) is a measurable function of x A (w, x) is a measurable function of w and x. and we do this as follows: 1. For fixed x, 1 A (w, x) is the indicator function of the set X x, so it must be measurable. 2. For fixed w, 1 A (w, x) is the indicator function of the interval [0, X(w)], so it is lebesgue measurable. 3. X is measurable since its a random variable. 4. Using the notation Z(x) = P (X x), observe that if a {Z z}, then so is every number below a. It follows that the set {Z z} is always an interval, so it is Lebesgue measurable. 8
9 5. To show that 1 A is measurable, we argue that A is measurable.indeed, the function g : Ω R R defined by g(w, x) = X(w) is measurable, since for any Borel set B, g 1 (B) = X 1 (B) (, + ). Similarly, h : Ω R R defined as h(w, x) = x is measurable for the same reason. Since A = {g h} {h 0}, it follows that A is measurable. 9
10 MIT OpenCourseWare J / J Fundamentals of Probability Fall 2008 For information about citing these materials or our Terms of Use, visit:
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
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 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 informationThe sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].
Probability Theory Probability Spaces and Events Consider a random experiment with several possible outcomes. For example, we might roll a pair of dice, flip a coin three times, or choose a random real
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 information1 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 informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
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 informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
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 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 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 informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
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 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 informationCOMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012
Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about
More informationProbability Theory. Florian Herzog. A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T..
Probability Theory A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T.. Florian Herzog 2013 Probability space Probability space A probability space W is a unique triple W = {Ω, F,
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
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 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 informationx 2 + y 2 = 1 y 1 = x 2 + 2x y = x 2 + 2x + 1
Implicit Functions Defining Implicit Functions Up until now in this course, we have only talked about functions, which assign to every real number x in their domain exactly one real number f(x). The graphs
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
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 informationLecture 13 - Basic Number Theory.
Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted
More informationBasic Probability Concepts
page 1 Chapter 1 Basic Probability Concepts 1.1 Sample and Event Spaces 1.1.1 Sample Space A probabilistic (or statistical) experiment has the following characteristics: (a) the set of all possible outcomes
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS Contents 1. Moment generating functions 2. Sum of a ranom number of ranom variables 3. Transforms
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 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 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 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 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 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 informationMOP 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
More informationArkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers
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 informationClass Meeting # 1: Introduction to PDEs
MATH 18.152 COURSE NOTES - CLASS MEETING # 1 18.152 Introduction to PDEs, Fall 2011 Professor: Jared Speck Class Meeting # 1: Introduction to PDEs 1. What is a PDE? We will be studying functions u = u(x
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 informationTHE TURING DEGREES AND THEIR LACK OF LINEAR ORDER
THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER JASPER DEANTONIO Abstract. This paper is a study of the Turing Degrees, which are levels of incomputability naturally arising from sets of natural numbers.
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
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 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 informationNormal distribution. ) 2 /2σ. 2π σ
Normal distribution The normal distribution is the most widely known and used of all distributions. Because the normal distribution approximates many natural phenomena so well, it has developed into a
More informationTwo Fundamental Theorems about the Definite Integral
Two Fundamental Theorems about the Definite Integral These lecture notes develop the theorem Stewart calls The Fundamental Theorem of Calculus in section 5.3. The approach I use is slightly different than
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 informationMath 2443, Section 16.3
Math 44, Section 6. Review These notes will supplement not replace) the lectures based on Section 6. Section 6. i) ouble integrals over general regions: We defined double integrals over rectangles in the
More informationMath 115 Spring 2011 Written Homework 5 Solutions
. Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationRandom variables, probability distributions, binomial random variable
Week 4 lecture notes. WEEK 4 page 1 Random variables, probability distributions, binomial random variable Eample 1 : Consider the eperiment of flipping a fair coin three times. The number of tails that
More informationSample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
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 information1.7 Graphs of Functions
64 Relations and Functions 1.7 Graphs of Functions In Section 1.4 we defined a function as a special type of relation; one in which each x-coordinate was matched with only one y-coordinate. We spent most
More information6.4 Normal Distribution
Contents 6.4 Normal Distribution....................... 381 6.4.1 Characteristics of the Normal Distribution....... 381 6.4.2 The Standardized Normal Distribution......... 385 6.4.3 Meaning of Areas under
More informationMath 115A - Week 1 Textbook sections: 1.1-1.6 Topics covered: What is a vector? What is a vector space? Span, linear dependence, linear independence
Math 115A - Week 1 Textbook sections: 1.1-1.6 Topics covered: What is Linear algebra? Overview of course What is a vector? What is a vector space? Examples of vector spaces Vector subspaces Span, linear
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 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 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 informationYou know from calculus that functions play a fundamental role in mathematics.
CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.
More information2.1 Increasing, Decreasing, and Piecewise Functions; Applications
2.1 Increasing, Decreasing, and Piecewise Functions; Applications Graph functions, looking for intervals on which the function is increasing, decreasing, or constant, and estimate relative maxima and minima.
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
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 informationit 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
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 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 information1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let
Copyright c 2009 by Karl Sigman 1 Stopping Times 1.1 Stopping Times: Definition Given a stochastic process X = {X n : n 0}, a random time τ is a discrete random variable on the same probability space as
More informationWHAT 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
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 informationLecture 6: Discrete & Continuous Probability and Random Variables
Lecture 6: Discrete & Continuous Probability and Random Variables D. Alex Hughes Math Camp September 17, 2015 D. Alex Hughes (Math Camp) Lecture 6: Discrete & Continuous Probability and Random September
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More information3. 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.
More informationChapter 4 Lecture Notes
Chapter 4 Lecture Notes Random Variables October 27, 2015 1 Section 4.1 Random Variables A random variable is typically a real-valued function defined on the sample space of some experiment. For instance,
More informationThe 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
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 information6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008
MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
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 informationMicroeconomic Theory: Basic Math Concepts
Microeconomic Theory: Basic Math Concepts Matt Van Essen University of Alabama Van Essen (U of A) Basic Math Concepts 1 / 66 Basic Math Concepts In this lecture we will review some basic mathematical concepts
More informationST 371 (IV): Discrete Random Variables
ST 371 (IV): Discrete Random Variables 1 Random Variables A random variable (rv) is a function that is defined on the sample space of the experiment and that assigns a numerical variable to each possible
More informationLecture Note 1 Set and Probability Theory. MIT 14.30 Spring 2006 Herman Bennett
Lecture Note 1 Set and Probability Theory MIT 14.30 Spring 2006 Herman Bennett 1 Set Theory 1.1 Definitions and Theorems 1. Experiment: any action or process whose outcome is subject to uncertainty. 2.
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 informationGROUPS 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
More informationProbability: Terminology and Examples Class 2, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom
Probability: Terminology and Examples Class 2, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom 1 Learning Goals 1. Know the definitions of sample space, event and probability function. 2. Be able to
More informationTaylor 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
More information1 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.
More information(b)using the left hand end points of the subintervals ( lower sums ) we get the aprroximation
(1) Consider the function y = f(x) =e x on the interval [, 1]. (a) Find the area under the graph of this function over this interval using the Fundamental Theorem of Calculus. (b) Subdivide the interval
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 informationFormal Languages and Automata Theory - Regular Expressions and Finite Automata -
Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March
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 informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationMathematics Review for MS Finance Students
Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
More informationBreaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and
Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study
More informationMechanics 1: Vectors
Mechanics 1: Vectors roadly speaking, mechanical systems will be described by a combination of scalar and vector quantities. scalar is just a (real) number. For example, mass or weight is characterized
More informationLecture L3 - Vectors, Matrices and Coordinate Transformations
S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3 - Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between
More informationMath 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
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 information5.3 The Cross Product in R 3
53 The Cross Product in R 3 Definition 531 Let u = [u 1, u 2, u 3 ] and v = [v 1, v 2, v 3 ] Then the vector given by [u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ] is called the cross product (or
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 informationLecture 16 : Relations and Functions DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence
More information