Definition: A Sigma Field of a set is a collection of sets where (i), (ii) if, and (iii) for.
|
|
- Hugo Osborne
- 7 years ago
- Views:
Transcription
1 Fundamentals of Probability, Hyunseung Kang Definitions Let set be a set that contains all possible outcomes of an experiment. A subset of is an event while a single point of is considered a sample point. Next, we define a field, which is a collection of events such that it is closed under complements, and it is closed under countable addition. Definition: A Sigma Field of a set is a collection of sets where (i), (ii) if, and (iii) for. does not have to be unique. For example, for any set, and are both sigma fields. Also, a sigma field generated by a collection,, denoted as, is the smallest sigma field which contains A. To be the smallest sigma field implies that is the intersection of all sigma fields that contain A. For example, let be a collection of open sets in ( ]. Each element of ( ( ] ) ( ]) is a Borel set and the field is aptly named the Borel sigma field; it is also known as the field that contains all the open sets in ( ]. Another example, consider where is a random variable (to be defined later). is the smallest F s.t. F; or intuitively speaking, we call it the information of Finally, we define a measure which assigns probability to each element in the field we constructed. Definition: A function ] is a probability measure iff (i) and (ii) and are disjoint There are numerous properties we can derive using these definitions. We highlight the important ones. Property: If and, then Property: If and, then Next, we define random variables (and naturally their expectations) by first introducing simple random variables. Definition: A function is a simple random variable if where are disjoint partitions of. A random variable is on where Definition: The expected value of a simple random variable,. The expected value of a random variable is. We approximate this integral as a limit of the expectation of bounded r.v.s, which is a limit of simple random variables. There are couple properties of random variables that come up. The most important one is uniform boundedness of random variables and independence. Definition: A sequence of random variables is uniformly bounded when, for some Definition: A sequence of random variables is uniformly integrable if ( ( )) Definition: and are independent iff Properties
2 An important concept to remember is whether a sequence of events occurs infinitely often. There are also famous theorems associated with these called the Borel Cantelli Lemmas. Definition: A sequence of events,, occurs infinitely often, Theorem (First Borel Cantelli Lemma): Proof: Define. Then,. Therefore, ( ) ( ) Theorem (Second Borel Cantelli Lemma): Proof: }. Thus, we only have to show. Using, ( ) ( ). In addition to i.o., we can establish inequalities of random variables. Theorem (Markov Inequality): If, then. When is not non.neg, we can use Proof: Note that. Take expectation on both sides to complete the proof. Theorem (Chebyshev s Inequality): For any random variable and, ( ) Proof: Note that. Square both sides and take expectation to complete the proof. Theorem (Cauchy-Schwartz Inequality): () ( ) ( ) Proof: We know. Let and. Then, ( ). Take expectation on both sides, multiply the square root factor to get the desired inequality. Theorem (Holder s Inequality): If, then ( ( )) ( ( )) Proof: From Young s Inequality,. Let ( ) and ( ( )),do the same trick as above. Theorem (Kolmogorov Maximal Inequality): If are indep. and, then ( ) ( ) Proof: Let. Define.Then, ( ). Taking expectation on both sides, ( ) ( ( )). Note that because the stopping time T is independent from future observations. Rearranging the terms, we get ( ( )) ( ( )) ( ) *Theorem (Kolmogorov Zero-One Law): If indep, and, then, or 1
3 Note: stands for tail events. Intuitively speaking, these are events such that it is determined by all the values of, but is not determined by any finite subset of OR (probabilistically independent of any finite subset). An example of a tail event is,, or. Generally, it is hard to determine whether it s 0 or 1. Proof: Since or 1, we prove. First, let. Then, if ( ) by the approximation of sets, s.t. ( ). Now, restrict. Since the sigma fields do not overlap, and are independent. Now, ( ) ( ). Taking expectation on both sides and using independence, we get ( ) ( ) ( ). As ( ), which imply. Theorem(Berry-Essen Theorem): If i.i.d.,, then (, where. ) Theorem(Berry-Essen Inequality):For any two random variables,, with cdfs, and chfs,, which are constants s.t. We state other properties, mostly having to do with inequalities and expectation. Theorem: If is a bounded r.v., then Theorem: If, then (monotonicity of the integral) Theorem: ( ) Theorem (Jensen s Inequality): If is a proper, convex function and is r.v., then ( ) ( ) Theorem (Hoeffding s Inequality, Limited): If and, then ( ) Theorem (Tail Bound for Normal(0,1)): If Theorem: For any sequence of events a.s. Theorem (Approximation of Sets/Approximation Lemma): If is a sequence of -fields and, then s.t. ( ) where ( ) ( ) (aka the stuff not shared by two sets and ). Theorem (Kronecker s Lemma): For, converges imply Proof: ( ). Note that as by our hypothesis. Taking limits on both sides, you get the result. Theorem (Sterling s Formula):
4 Theorem (Le Cam s Theorem): If, Bernoulli with, indep.,, and, then ( ). Note: This is saying that the sum of Bernoullis roughly has a Poisson distribution. Convergence of Random Variables First, we define the three different types of convergence encountered in Definition (convergence in dist): A sequence of probability spaces with an associated random variable, converges in distribution of if for all continuous points, in, Definition (convergence in prob): A sequence of functions ( ) converges in probability if Definition (convergence a.s.): A sequence of functions converges in probability if ( ). Next, there are properties along with theorems related to these convergence. Proposition: Proof: Let ( ) ( ). Note that and. Thus, ( ) Proposition: If Proposition: If These are identical statements: (i) is uniformly integrable, (ii) in, and (iii) Proposition: If, then there is a subsequence,, s.t. Proof: Since ( ). Then, by defn. of limits, for each, we can find s.t. where. Since, by first B.C., as desired. Proposition: If, there is a further subsequence s.t. Proposition: If and, then Theorem (Bounded Convergence Theorem): If the same probability space and if, then is a sequence of uniformly bounded random variables defined on Proof: ( ), where is some constant. This is the defn. of limit. Theorem (Fatou s Lemma): If and, then
5 Proof: Define where and is a bounded r.v. Note that and. Then, Then, by BCT, we get. Finally, take the sup over all Z and we end up with Note that Fatou s Lemma is often used to show that the expectation of a random variable is bounded. Theorem (Dominated Convergence Theorem): If, and, then Proof: Let and, where both and. By Fatou s Lemma, we get and. Combining them together, we get our result. Theorem (Monotone Convergence Theorem): If and (a.s. or in prob), then. Proof: Using Fatou, we get. Also, taking the integral and taking limsup on both sides, we get. Thus, we get our desired result. There are several results on convergence. Here, we state what s relevant for this section. *Theorem (Kolmogorov One-Series Theorem): If independent,,then converges a.s. Proof: Use Kolmogorov Maximal Inequality Theorem(Kolmogorov Condensation Test): Suppose indep and ( ). If converges (a.s. or in prob), converges. Now, there are two very important types of law of large numbers, the strong law and the weak law. The weak law is basically convergence in probability while strong law is convergence a.s. For here on out, Theorem (Weak Law of Large Numbers): If are independent with, then Proof: Using Chebyshev, ( ). Take the limit on both sides to obtain the result. There are several flavors of the strong law of large numbers, each relaxing assumptions from the previous ones Theorem (Strong Law of Large Numbers, v1): If i.i.d. and bounded,, then Proof: Pick quadratic subsequence terms,. Then, we know from Chebyshev and first BC, ( ) ( ). Now, let. We can write ( ). As, we get. Since the event that w.p. 1, w.p. 1 Theorem (Strong Law of Large numbers, v2): If i.i.d.,, then
6 Proof: By Kolmogorov One-Series Theorem, converges a.s. By Kronecker, this implies converges a.s. Theorem (Strong Law of Large numbers, v3): If i.i.d., and (), Proof: first BC ( Theorem, where ( ). For the first sum, ( ) (),by )=0 and thus, it goes to zero a.s.. For the second sum, using Kolmogorov s One-Series ( ) ( ) () converges a.s. By Kronecker s Lemma, this implies that *Theorem (Strong Law of Large numbers, v4): If are pairwise independent,, and (), Proof: Requires Edimonti s Theorem and a whole lot of crap. Distribution Theory We first define a characteristic function and state some properties associated with it. Note that for any r.v., the characteristic function always exists. Definition: For any random variable, the characteristic function,, of is defined as Properties: If is a characteristic function, then the following statements are true (i) (ii) is uniformly continuous (and hence, continuous) (iii) there is an atom in some place (iv) is real in distribution (aka symmetric) (v) We have a pdf (vi) If ( ) is n times continuous differentiable with (vii) If is n derivatives at zero, then ( ) if n is even and up to if n is odd. (viii) (Levy s Uniqueness Theorem) If and have the same chfs, then X and Y have the same distribution (ix) (Levy s Inversion Formula): and thus, the chf determines the cumulative distribution of X. Theorem (Polya s Theorem): If is (i) symmetric, (ii) convex for, (iii) uniformly continuous, and(iv), then is a characteristic function of Polya type In addition to characteristic functions, we define the concept of tightness and how it can be used to prove various properties of convergence for characteristic functions and its cdfs. Definition: A sequence of cdfs,, is tight if Definition: A sequence of r.vs,, is tight if ( )
7 Theorem (Helly Selection Theorem): For a sequence of cdfs,, there is a subsequence and a right-continuous non-decreasing function s.t. at all continuity points in F. (Note: Steele states is a distribution function only if is tight) Proof: By compactness of ] and ] that converges in [0,1]. Let be a sequence of rationals. Then, has a subsequence,, that converges to. Move on to. has a further subsequence that converges to. Repeating this diagonal argument through, we end up with a super-small subsequence s.t.. Next, since is non-decreasing function, G must also be a non-increasing function. Furthermore,. Finally, if is a continuous point in F, we can pick so that. Since and, then, as desired. Theorem (Tail Bound): For any random variable, () ) ( ) Proof: ( ) ( ) ( [ ]) ( ) ( ) ( ) ( ). Rearrange the equations to obtain( ) ( ). Pick and we re done. Theorem (Tightness Lemma): If a sequence of chfs, for and some and is continuous at zero, then the cdfs associated with is tight. (Note: does not have to be a chf) Proof: ( denotes the cdfs for each chf). By Tail Bound, we get ([ ] ) ( ). Taking on both sides, we get ([ ] ) ([ ] ) ( ). We can control the right hand to be a very small number because ( ) where we use that is continuous at zero. Thus, are tight. Theorem (Levy Continuity Theorem): Given a sequence of chfs, and its corresponding cdfs, where and is continuous at zero, then (i) is a chf and (ii) Proof: By Tightness Lemma, must be tight. By Helly, and thus, has to be a chf. Now, by contradiction, suppose does not converge to. This implies that there is a subsequence does not converge to F. But, by Helly, we can choose a further subsequence of s.t., where where is a continuity point of. But, since the chfs converge, and. Hence,, which is a contradiction. With these criterions, we can now prove the central limit theorem. There are many flavors of this as well, each relaxing the assumptions of the other. Theorem (Central Limit Theorem, v1): If i.i.d.,, Proof: We need three key ingredients: 1. From Taylor Series, ( ( )). Take and we get ( ( ))
8 2. By induction, we get where and (lemma 1, pg 358) 3. From the definition of natural e, Since is represented by a characteristic function ( ) and using (1) and (2), we get ( ) ( ) ( ( )). By DCT, ( ) and ( ( get. Since this is the chf of a normal, by Levy Continuity Theorem, we re done. )). By (3), we Theorem (Central Limit Theorem, v2): For each n, we have where each are independent and each set of sequence may live on different probability spaces. If, and ( ), then. Note: The tail bound condition is called the Lindenberg Condition (LC) Proof: WLOG, let to get, and ( ). Then, using (1) and (2) from v1, we get. The first and the second absolute values can be bounded by the following Using (1) and (2) from v1 ( ( ) ( ) ) ( ), where the second sum is taken care of by the LC cond. Again, using the same trick again where we Taylor expand around, ( ) ( ( ) ( ) ) ( ). To bound the last summand, first note that ( ) ( ) ( Second, using Cauchy-Schwartz and Chebyshev, ). Using LC, we get. ( ) ( ). Summing this expectation, we get ( ). Since the first and second summands are bounded by, we arrive at our result. Finally, we have a pretty cool theorem showing that two random variables have identical distribution. Theorem: If and, then in distribution. Martingales First, note that we work in (aka Hilbert spaces) where all Cauchy sequence converges. A related work to Hilbert spaces is the theory behind conditional expectation. Definition: If, is a field, and, then is a conditional expectation of given G if (a) and (b). Written another way, ( )
9 Properties: Take the notation above. Then, the following are true (i) (Existence) exists (ii) (Uniqueness) If Y above exists, then Y is a.s. unique. (iii) (Linearity of Conditional Expectation). If is the conditional expectation of given, then is the conditional expectation of given (iv) (Non-negativity): If, then is non-negative. (v) (Contraction): (or () ()) (vi) (Tower Property): Given ( ( ) ) ( ( ) ) ( ) We highlight a convergence of monotone martingales. Theorem (Monotone Convergence of Conditional Expectation): If and, w.p.1, and, then ( ) ( ) w.p.1. Proof: Since ( ) ( ), and ( ) is some positive operator on the monotone sequence, s.t. ( ) w.p.1. (note can be infinity). Next, using MCT, and since, we get. Finally, to show that ( ) again, using MCT, we see that and and. Since limits are unique, and we re done. Now, onto the definition of a martingale Definition: Suppose we have s.t., and. Then is a martingale iff ( ) Definition: Suppose we have, and a random variable Z where (). Then,, where ( ), is a martingale (called Levy s Martingale) Definition: Suppose we have s.t., and. Then is a submartingale iff ( ). Note that any convex function of a MG,, is submg. If is a submg and monotonic, any convex function on it will be a submg. Now, there are a lot of ways in which martingales can converge. We highlight a couple along with the proofs Theorem: If is a martingale and, then for any. Proof: WLOG,. Then, ( ( )) ( ( )) ( ( ( ) )) Theorem (Doob Maximal Inequality): For any martingale in and, ( ) Proof: Let and. Then,. Take expectation on both sides, we get ( ) ( ) where the second inequality works because ( ) ( ( )) ( ( )). Therefore, ( ) ( ), as desired. Note: This also works if MG is in. Theorem ( Convergence): If is a martingale in, then converges in a.s. Proof: First, some facts about expectation and martingales. For any, ( ) ( ), thanks to the theorem above. Now, ( ) for any
10 . Therefore,. Notice that the right hand sum shrinks as grows (thanks to the bound on the sum). Second, to prove that converges a.s., we just have to show that the sequence is Cauchy OR ( ). Note that ( ) ( ) ( ). Applying Doob on each of the terms, we get ( ) ( ) ( ). Take, we end up with ( ). Using the first fact, we get the RHS to 0. Theorem (Doob Maximal Inequality): For any submg that is non-negative and for any, Proof: Define. Then,. Take expectation on both sides, ( ) where the second inequality uses. Moving out the expectation and using the same reasoning as, we get the above inequality. Theorem ( Convergence): If are submg in, then converges a.s. Proof:. By MCT and the fact that,. Furthermore, ( ) a.s. and thus, exists. By Fatou s lemma, and thus a.s. Similarly, for the case. Using Fatou again,. Hence, a.s. Therefore, a.s. *Theorem ( Maximal Inequality): If is a non-negative martingale, ( ) ( ) for. Proof: First, looking at Doob proof, we know. Replacing that sum with the equality,. Manipulating this and using the fact that ( ) for any non-negative, ( ( ) ) ( ) ( ) ( ( ) ) ( ). Then, applying the Holder s Inequality on the RHS, done. ( ) ( ) ( ) ( ). Take the power off and we re Theorem (Up-Crossing Inequality): If is a submg, ( ) ( ) where is the number of times the process up-crosses b and a. Note: The idea is to show that the MG goes between ] finitely many times for convergence Proof: In Durret. Very nasty Theorem(Doob Stopping Time): If is a MG, and is a stopping time, then is a martingale.
11 Theorem (Wald Identity): If iid (), and is a stopping time, Theorem(Optional Sampling Theorem): If is MG,, is a bounded stopping time,
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 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 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 informationn k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
More informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering
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 informationLemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.
Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a
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 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 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 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 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 informationLecture 13: Martingales
Lecture 13: Martingales 1. Definition of a Martingale 1.1 Filtrations 1.2 Definition of a martingale and its basic properties 1.3 Sums of independent random variables and related models 1.4 Products of
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 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 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 informationFor a partition B 1,..., B n, where B i B j = for i. A = (A B 1 ) (A B 2 ),..., (A B n ) and thus. P (A) = P (A B i ) = P (A B i )P (B i )
Probability Review 15.075 Cynthia Rudin A probability space, defined by Kolmogorov (1903-1987) consists of: A set of outcomes S, e.g., for the roll of a die, S = {1, 2, 3, 4, 5, 6}, 1 1 2 1 6 for the roll
More informationGambling Systems and Multiplication-Invariant Measures
Gambling Systems and Multiplication-Invariant Measures by Jeffrey S. Rosenthal* and Peter O. Schwartz** (May 28, 997.. Introduction. This short paper describes a surprising connection between two previously
More informationProbability Generating Functions
page 39 Chapter 3 Probability Generating Functions 3 Preamble: Generating Functions Generating functions are widely used in mathematics, and play an important role in probability theory Consider a sequence
More informationWald s Identity. by Jeffery Hein. Dartmouth College, Math 100
Wald s Identity by Jeffery Hein Dartmouth College, Math 100 1. Introduction Given random variables X 1, X 2, X 3,... with common finite mean and a stopping rule τ which may depend upon the given sequence,
More informationTiers, Preference Similarity, and the Limits on Stable Partners
Tiers, Preference Similarity, and the Limits on Stable Partners KANDORI, Michihiro, KOJIMA, Fuhito, and YASUDA, Yosuke February 7, 2010 Preliminary and incomplete. Do not circulate. Abstract We consider
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 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 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 informationFEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL
FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL STATIsTICs 4 IV. RANDOm VECTORs 1. JOINTLY DIsTRIBUTED RANDOm VARIABLEs If are two rom variables defined on the same sample space we define the joint
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 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 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 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 informationCONTINUED FRACTIONS AND FACTORING. Niels Lauritzen
CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents
More informationWalrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.
Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian
More information88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a
88 CHAPTER. VECTOR FUNCTIONS.4 Curvature.4.1 Definitions and Examples The notion of curvature measures how sharply a curve bends. We would expect the curvature to be 0 for a straight line, to be very small
More informationMathematical Induction. Mary Barnes Sue Gordon
Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by
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 informationStationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative
More informationSOME APPLICATIONS OF MARTINGALES TO PROBABILITY THEORY
SOME APPLICATIONS OF MARTINGALES TO PROBABILITY THEORY WATSON LADD Abstract. Martingales are a very simple concept with wide application in probability. We introduce the concept of a martingale, develop
More informationOverview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model
Overview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model 1 September 004 A. Introduction and assumptions The classical normal linear regression model can be written
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 informationIEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem
IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem Time on my hands: Coin tosses. Problem Formulation: Suppose that I have
More information6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
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 informationProbability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur
Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce
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 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 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 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 informationA Sublinear Bipartiteness Tester for Bounded Degree Graphs
A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite
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 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 informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More informationCHAPTER IV - BROWNIAN MOTION
CHAPTER IV - BROWNIAN MOTION JOSEPH G. CONLON 1. Construction of Brownian Motion There are two ways in which the idea of a Markov chain on a discrete state space can be generalized: (1) The discrete time
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 informationTransfer Learning! and Prior Estimation! for VC Classes!
15-859(B) Machine Learning Theory! Transfer Learning! and Prior Estimation! for VC Classes! Liu Yang! 04/25/2012! Liu Yang 2012 1 Notation! Instance space X = R n! Concept space C of classifiers h: X ->
More informationWinter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com
Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).
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 informationPartial Fractions. Combining fractions over a common denominator is a familiar operation from algebra:
Partial Fractions Combining fractions over a common denominator is a familiar operation from algebra: From the standpoint of integration, the left side of Equation 1 would be much easier to work with than
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
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 informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationIncreasing for all. Convex for all. ( ) Increasing for all (remember that the log function is only defined for ). ( ) Concave for all.
1. Differentiation The first derivative of a function measures by how much changes in reaction to an infinitesimal shift in its argument. The largest the derivative (in absolute value), the faster is evolving.
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 informationECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2015
ECON 459 Game Theory Lecture Notes Auctions Luca Anderlini Spring 2015 These notes have been used before. If you can still spot any errors or have any suggestions for improvement, please let me know. 1
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 informationProbability and Random Variables. Generation of random variables (r.v.)
Probability and Random Variables Method for generating random variables with a specified probability distribution function. Gaussian And Markov Processes Characterization of Stationary Random Process Linearly
More informationCONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
More informationLecture 2: Universality
CS 710: Complexity Theory 1/21/2010 Lecture 2: Universality Instructor: Dieter van Melkebeek Scribe: Tyson Williams In this lecture, we introduce the notion of a universal machine, develop efficient universal
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 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 information. (3.3) n Note that supremum (3.2) must occur at one of the observed values x i or to the left of x i.
Chapter 3 Kolmogorov-Smirnov Tests There are many situations where experimenters need to know what is the distribution of the population of their interest. For example, if they want to use a parametric
More informationSolutions for Practice problems on proofs
Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some
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 informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationNotes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand
Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such
More informationThe Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.
The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,
More informationNon Parametric Inference
Maura Department of Economics and Finance Università Tor Vergata Outline 1 2 3 Inverse distribution function Theorem: Let U be a uniform random variable on (0, 1). Let X be a continuous random variable
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 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 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 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 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 information6.3 Conditional Probability and Independence
222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
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 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 informationLecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs
CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like
More informationx < y iff x < y, or x and y are incomparable and x χ(x,y) < y χ(x,y).
12. Large cardinals The study, or use, of large cardinals is one of the most active areas of research in set theory currently. There are many provably different kinds of large cardinals whose descriptions
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 informationMATHEMATICAL METHODS OF STATISTICS
MATHEMATICAL METHODS OF STATISTICS By HARALD CRAMER TROFESSOK IN THE UNIVERSITY OF STOCKHOLM Princeton PRINCETON UNIVERSITY PRESS 1946 TABLE OF CONTENTS. First Part. MATHEMATICAL INTRODUCTION. CHAPTERS
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 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 informationHow To Understand The Theory Of Hyperreals
Ultraproducts and Applications I Brent Cody Virginia Commonwealth University September 2, 2013 Outline Background of the Hyperreals Filters and Ultrafilters Construction of the Hyperreals The Transfer
More informationMARTINGALES AND GAMBLING Louis H. Y. Chen Department of Mathematics National University of Singapore
MARTINGALES AND GAMBLING Louis H. Y. Chen Department of Mathematics National University of Singapore 1. Introduction The word martingale refers to a strap fastened belween the girth and the noseband of
More informationThis is a square root. The number under the radical is 9. (An asterisk * means multiply.)
Page of Review of Radical Expressions and Equations Skills involving radicals can be divided into the following groups: Evaluate square roots or higher order roots. Simplify radical expressions. Rationalize
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 informationKevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm
MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following
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 informationMaximum Likelihood Estimation
Math 541: Statistical Theory II Lecturer: Songfeng Zheng Maximum Likelihood Estimation 1 Maximum Likelihood Estimation Maximum likelihood is a relatively simple method of constructing an estimator for
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 informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More information