The Derivation of Modern Probability Theory from Measure Theory

Slides:



Advertisements
Similar presentations
Probability Theory Part 1: Basic Concepts. Sample Space - Events  Sample Point The outcome of a random experiment  Sample Space S The set of all possible.
Advertisements

Week 21 Basic Set Theory A set is a collection of elements. Use capital letters, A, B, C to denotes sets and small letters a 1, a 2, … to denote the elements.
Chapter Two Probability
Introduction to Bayesian Statistics Harry R. Erwin, PhD School of Computing and Technology University of Sunderland.
Introduction to stochastic process
Chris Morgan, MATH G160 January 9, 2012 Lecture 1 Chapter 4.1, 4.2, & 4.3: Set Theory, Introduction to Probability.
1. Probability 2. Random variables 3. Inequalities 4. Convergence of random variables 5. Point and interval estimation 6. Hypotheses testing 7. Nonparametric.
Probability Theory Part 2: Random Variables. Random Variables  The Notion of a Random Variable The outcome is not always a number Assign a numerical.
Stats Probability Theory.
Basic probability Sample Space (S): set of all outcomes of an experiment Event (E): any collection of outcomes Probability of an event E, written as P(E)
Chapter 2 Chapter The sample space of an experiment, denoted S , is the set of all possible outcomes of that experiment. An event is any collection.
Week 51 Relation between Binomial and Poisson Distributions Binomial distribution Model for number of success in n trails where P(success in any one trail)
Basic Concepts and Approaches
MATH 3033 based on Dekking et al. A Modern Introduction to Probability and Statistics Slides by Tim Birbeck Instructor Longin Jan Latecki C2: Outcomes,
Chapter 1 Probability and Distributions Math 6203 Fall 2009 Instructor: Ayona Chatterjee.
Welcome to Probability and the Theory of Statistics This class uses nearly every type of mathematics that you have studied so far as well as some possibly.
Week 41 Continuous Probability Spaces Ω is not countable. Outcomes can be any real number or part of an interval of R, e.g. heights, weights and lifetimes.
Tch-prob1 Chap 3. Random Variables The outcome of a random experiment need not be a number. However, we are usually interested in some measurement or numeric.
Chapter 8 Probability Section R Review. 2 Barnett/Ziegler/Byleen Finite Mathematics 12e Review for Chapter 8 Important Terms, Symbols, Concepts  8.1.
Lecture 1: Data Science & Data Engineering CS 6071 Big Data Engineering, Architecture, and Security Fall 2015, Dr. Rozier.
Lecture 2: Measures and Data Collection/Cleaning CS 6071 Big Data Engineering, Architecture, and Security Fall 2015, Dr. Rozier.
Basic Concepts of Discrete Probability (Theory of Sets: Continuation) 1.
Chapter 3 – Set Theory  .
CIS 2033 based on Dekking et al. A Modern Introduction to Probability and Statistics Instructor Longin Jan Latecki C2: Outcomes, events, and probability.
CPSC 531: Probability Review1 CPSC 531:Probability & Statistics: Review Instructor: Anirban Mahanti Office: ICT Class.
3. Counting Permutations Combinations Pigeonhole principle Elements of Probability Recurrence Relations.
Computing Fundamentals 2 Lecture 6 Probability Lecturer: Patrick Browne
Week 11 What is Probability? Quantification of uncertainty. Mathematical model for things that occur randomly. Random – not haphazard, don’t know what.
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 4 Counting methods and the pigeonhole principle.
STA347 - week 31 Random Variables Example: We roll a fair die 6 times. Suppose we are interested in the number of 5’s in the 6 rolls. Let X = number of.
Dr. Ahmed Abdelwahab Introduction for EE420. Probability Theory Probability theory is rooted in phenomena that can be modeled by an experiment with an.
Lecture V Probability theory. Lecture questions Classical definition of probability Frequency probability Discrete variable and probability distribution.
확률및공학통계 (Probability and Engineering Statistics) 이시웅.
Probability: Terminology  Sample Space  Set of all possible outcomes of a random experiment.  Random Experiment  Any activity resulting in uncertain.
Probability Definition : The probability of a given event is an expression of likelihood of occurrence of an event.A probability isa number which ranges.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/19/2008.
Probability (outcome k) = Relative Frequency of k
Discrete Random Variables. Introduction In previous lectures we established a foundation of the probability theory; we applied the probability theory.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Introduction to Probability (CSCE 317) January 21, 2016 Marco Valtorta SWRG.
Random Variables and Stochastic Processes – Dr. Ghazi Al Sukkar Office Hours: will be.
Basic probability Sep. 16, Introduction Our formal study of probability will base on Set theory Axiomatic approach (base for all our further studies.
PROBABILITY AND BAYES THEOREM 1. 2 POPULATION SAMPLE PROBABILITY STATISTICAL INFERENCE.
Basic Concepts of Information Theory A measure of uncertainty. Entropy. 1.
Chapter 7 Sets & Probability Section 7.3 Introduction to Probability.
Basic Probability. Introduction Our formal study of probability will base on Set theory Axiomatic approach (base for all our further studies of probability)
Primbs, MS&E345 1 Measure Theory in a Lecture. Primbs, MS&E345 2 Perspective  -Algebras Measurable Functions Measure and Integration Radon-Nikodym Theorem.
Existence of Non-measurable Set
ICS 253: Discrete Structures I
Natural Language Processing
What is Probability? Quantification of uncertainty.
CONTINUOUS RANDOM VARIABLES
Lebesgue measure: Lebesgue measure m0 is a measure on i.e., 1. 2.
Existence of Non-measurable Set
Natural Language Processing
Introduction to Probability
Probability Models Section 6.2.
Tutorial 2: Sample Space and Probability 2
Introduction to Probability (CSCE 317)
Sets A set is simply any collection of objects
Introduction to Probability
Set – collection of objects
Sets and Probabilistic Models
Sets and Probabilistic Models
Experiments, Outcomes, Events and Random Variables: A Revisit
6.2 Probability Models.
Sets and Probabilistic Models
Introduction to Probability (CSCE 317)
Sets and Probabilistic Models
Continuous Random Variables: Basics
Chapter 1 Probability Spaces
Presentation transcript:

The Derivation of Modern Probability Theory from Measure Theory By Jeffrey Carrington

Introduction The question of “Will a specific event occur?” has always been a concern of man. Probability theory is concerned with the analysis of this random phenomena and allows us to quantify the likelihood of an event occuring. We owe modern probability theory to the work of Andrey Nikolaevich Kolmogorov

Introduction (cont.) Andrey Kolmogorov was a soviet mathematician born in 1903. He combined the idea of sample space with measure theory and created the axiom system for modern probability theory in 1933. These axioms can be summarized by the statement: Let (Ω,Ϝ,P) be a measure space with P(Ω)=1. Then (Ω,Ϝ,P) is a probability space with sample space Ω, event space F and probability measure P.

Modern Probability Theory Foundations Measure Theory

Measure Theory What is measure? Encountered as the “length” of a ruler, the “area” of a room and the “volume” of a cup. Involves the assigning of a number to a set. Certain properties are intrinsic to measure: “Measure” is nonnegative. “Measure” can be +∞ If A is a subset of R, it can be written as A=U_{n}A_{n} where the A_{n}'s are disjoint non-empty subintervals of A

Measure Theory (cont.) Metric Space A set such that the concept of distance between elements is defined. It is represented as (S,d) where S is a set and d is a metric such that d:SxS-->R. It also has the properties of positivity, symmetry, identity and triangle inequality.

Probability Axioms

First Probability Axiom The probability of an event is a non-negative real number. P is always finite.

Second Probability Axiom The probability that some elementary event (the event that contains only a single outcome) in the entire sample space will occur is 1.

Third Probability Axiom Any countable sequence of pairwise disjoint events, E₁,E₂, ... satisfies P(E₁∪E₂∪...)=∑_{i=1}^{∞}P(E_{i})

Consequences of Kolmogorov Axioms Monotonicity P(A)≤P(B) if A⊆B The probability of the empty set P(∅)=0 The numeric bound It follows that 0≤P(E)≤1 for all E∈F

Consequences (cont.) Let E₁=A and E₂=B/A, where A⊆B and E_{i}=∅ for i≥3. By the third axiom E₁∪E₂∪...=B and P(A)+P(B\A)+∑_{i=3}^{∞}P(∅)=P(B). Now if P(∅)>0 then by set theory definitions we would obtain a contradiction. Additionally P(A)≤P(B). Therefore monotonicity and P(∅)=0 are proven.

Example We attempt to register for class. We successfully register if and only if the internet works and we have paid for classes. Probability (internet works)=.9, Probability(paid for classes)=.6 and P(internet works and paid for classes)=.55 Probability that internet works or we've paid for classes =.95

Works Cited Measure Theory Tutorial. https://www.ee.washington.edu/techsite/papers/ documents/UWEETR-2006-0008.pdf An Introduction to Measure Theory http://terrytao.files.wordpress.com/2011/01/meas ure-book1.pdf The Theory of Measures and Integration, Eric M. Vestrup http://en.wikipedia.org/wiki/Probability_theory http://en.wikipedia.org/wiki/Probability_axioms