Probability basics. Probability and Measure Theory. Probability = mathematical analysis

Similar documents
Notes on the Unique Extension Theorem. Recall that we were interested in defining a general measure of a size of a set on Ò!ß "Ó.

Gene expression experiments. Infinite Dimensional Vector Spaces. 1. Motivation: Statistical machine learning and reproducing kernel Hilbert Spaces

The Hahn-Banach and Radon-Nikodym Theorems

Math 131 Exam 4 (Final Exam) F04M

Infinite Dimensional Vector Spaces. 1. Motivation: Statistical machine learning and reproducing kernel Hilbert Spaces

STAT 2122 Homework # 3 Solutions Fall 2018 Instr. Sonin

ECE353: Probability and Random Processes. Lecture 2 - Set Theory

Ð"Ñ + Ð"Ñ, Ð"Ñ +, +, + +, +,,

SVM example: cancer classification Support Vector Machines

Product Measures and Fubini's Theorem

Example Let VœÖÐBßCÑ À b-, CœB - ( see the example above). Explain why

PART I. Multiple choice. 1. Find the slope of the line shown here. 2. Find the slope of the line with equation $ÐB CÑœ(B &.

1. Classify each number. Choose all correct answers. b. È # : (i) natural number (ii) integer (iii) rational number (iv) real number

Basic Measure and Integration Theory. Michael L. Carroll

Dr. H. Joseph Straight SUNY Fredonia Smokin' Joe's Catalog of Groups: Direct Products and Semi-direct Products

MATH 1301 (College Algebra) - Final Exam Review

Relations. Relations occur all the time in mathematics. For example, there are many relations between # and % À

Review of Elementary Probability Theory Math 495, Spring 2011

18.175: Lecture 2 Extension theorems, random variables, distributions

SIMULATION - PROBLEM SET 1

Statistical machine learning and kernel methods. Primary references: John Shawe-Taylor and Nello Cristianini, Kernel Methods for Pattern Analysis

Lecture 1. Chapter 1. (Part I) Material Covered in This Lecture: Chapter 1, Chapter 2 ( ). 1. What is Statistics?

B-9= B.Bà B 68 B.Bß B/.Bß B=38 B.B >+8 ab b.bß ' 68aB b.bà

Systems of Equations 1. Systems of Linear Equations

8œ! This theorem is justified by repeating the process developed for a Taylor polynomial an infinite number of times.

ACT455H1S - TEST 2 - MARCH 25, 2008

Notes 1 : Measure-theoretic foundations I

Proofs Involving Quantifiers. Proof Let B be an arbitrary member Proof Somehow show that there is a value

Recitation 2: Probability

ECE 340 Probabilistic Methods in Engineering M/W 3-4:15. Lecture 2: Random Experiments. Prof. Vince Calhoun

Week 2. Section Texas A& M University. Department of Mathematics Texas A& M University, College Station 22 January-24 January 2019

Properties of Probability

ADVANCE TOPICS IN ANALYSIS - REAL. 8 September September 2011

Appendix 4.1 Alternate Solution to the Infinite Square Well with Symmetric Boundary Conditions. V(x) I II III +L/2

LECTURE 1. 1 Introduction. 1.1 Sample spaces and events

MA : Introductory Probability

Chap 1: Experiments, Models, and Probabilities. Random Processes. Chap 1 : Experiments, Models, and Probabilities

Digital Communications: An Overview of Fundamentals

Sample Space: Specify all possible outcomes from an experiment. Event: Specify a particular outcome or combination of outcomes.

Lecture notes for probability. Math 124

CONVERGENCE OF RANDOM SERIES AND MARTINGALES

7. Random variables as observables. Definition 7. A random variable (function) X on a probability measure space is called an observable

Module 1. Probability

the time it takes until a radioactive substance undergoes a decay

Randomized Algorithms. Andreas Klappenecker

e) D œ < f) D œ < b) A parametric equation for the line passing through Ð %, &,) ) and (#,(, %Ñ.

The Experts In Actuarial Career Advancement. Product Preview. For More Information: or call 1(800)

Solving SVM: Quadratic Programming

Definition Suppose M is a collection (set) of sets. M is called inductive if

MAP METHODS FOR MACHINE LEARNING. Mark A. Kon, Boston University Leszek Plaskota, Warsaw University, Warsaw Andrzej Przybyszewski, McGill University

MAY 2005 SOA EXAM C/CAS 4 SOLUTIONS

Econ 325: Introduction to Empirical Economics

CMPSCI 240: Reasoning about Uncertainty

OC330C. Wiring Diagram. Recommended PKH- P35 / P50 GALH PKA- RP35 / RP50. Remarks (Drawing No.) No. Parts No. Parts Name Specifications

Almost Sure Convergence of a Sequence of Random Variables

Outline of Elementary Probability Theory Math 495, Spring 2013

Dept. of Linguistics, Indiana University Fall 2015

Probability Theory. Introduction to Probability Theory. Principles of Counting Examples. Principles of Counting. Probability spaces.

RANDOM WALKS AND THE PROBABILITY OF RETURNING HOME

Mathematics for Informatics 4a

Machine Learning. Probability Theory. WS2013/2014 Dmitrij Schlesinger, Carsten Rother

Inner Product Spaces

It's Only Fitting. Fitting model to data parameterizing model estimating unknown parameters in the model

Chapter 2: Probability Part 1

SIMULTANEOUS CONFIDENCE BANDS FOR THE PTH PERCENTILE AND THE MEAN LIFETIME IN EXPONENTIAL AND WEIBULL REGRESSION MODELS. Ping Sa and S.J.

Cellular Automaton Growth on # : Theorems, Examples, and Problems

Here are proofs for some of the results about diagonalization that were presented without proof in class.

Chapter 4. Measure Theory. 1. Measure Spaces

Lebesgue Measure. Dung Le 1

: œ Ö: =? À =ß> real numbers. œ the previous plane with each point translated by : Ðfor example,! is translated to :)

Axioms of Probability


V7 Foundations of Probability Theory

Probability Basics Review

The Practice of Statistics Third Edition

Chapter 5: Probability in Our Daily Lives

Lecture 6 Feb 5, The Lebesgue integral continued

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 3 9/10/2008 CONDITIONING AND INDEPENDENCE

Implicit in the definition of orthogonal arrays is a projection propertyþ

Random Variables. Andreas Klappenecker. Texas A&M University

1.1. MEASURES AND INTEGRALS

STAT 430/510 Probability

Recap. The study of randomness and uncertainty Chances, odds, likelihood, expected, probably, on average,... PROBABILITY INFERENTIAL STATISTICS

Monic Adjuncts of Quadratics (Developed, Composed & Typeset by: J B Barksdale Jr / )


TOTAL DIFFERENTIALS. In Section B-4, we observed that.c is a pretty good approximation for? C, which is the increment of

Framework for functional tree simulation applied to 'golden delicious' apple trees

Chapter 1: Introduction to Probability Theory

Outline. 1. The Screening Philosophy 2. Robust Products/Processes 3. A Statistical Screening Procedure 4. Some Caveats 5.

LA PRISE DE CALAIS. çoys, çoys, har - dis. çoys, dis. tons, mantz, tons, Gas. c est. à ce. C est à ce. coup, c est à ce

Brief Review of Probability

Introduction to probability theory

Lecture Notes 1 Basic Probability. Elements of Probability. Conditional probability. Sequential Calculation of Probability

The Lebesgue Integral

Mathematical Probability

1 Chapter 1: SETS. 1.1 Describing a set

Probability. Lecture Notes. Adolfo J. Rumbos

Lecture 9: Conditional Probability and Independence

Review of probability. Nuno Vasconcelos UCSD

Problem Set 2: Solutions Math 201A: Fall 2016

Transcription:

MA 751 Probability basics Probability and Measure Theory 1. Basics of probability 2 aspects of probability: Probability = mathematical analysis Probability = common sense

Probability basics A set-up of the common sense view: Define as experiment any event with an outcome. Example 1: Toss of a die Example 2: Record information on deaths of cancer patients. Example 3: Measure daily high body temperature of a person on chemotherapy Example 4: Observe the next letter in a chain of DNA:

Probability basics ATCTTCA Ä? Given a well-defined experiment we must know the set of all possible outcomes (this must be defined by the experimenter) Collection of possible outcomes is denoted as W œ sample space. (sometimes also called a probability space and written HÑ

Probability basics This is the collection of all possible outcomes of the experiment Example 5: Die toss: W œ Ö"ß #ß $ß %ß &ß ' Example 6: Cancer outcome records:

Probability basics 4 outcomes: RPßVPßRHßVH Vœreceived treatment; Pœlived; Hœdied Rœno treatment;

Probability basics Example 7: High temperature measurement WœÖ>À> a real number Many other outcome (sample) spaces W are possible, for example, profiles of functions of DNA regions So: Have practical situations and for each one we define the sample space W of possible outcomes Def. 1: For sets Eß F: Define E Fif Eis a subcollection of F. If I Wß I is an event

Probability basics Example 8: Die tossing experiment: if I œ even roll œ Ö 2, 4, 6 Ö 1, 2, 3, 4, 5, 6 then I is an event. Why an event? Intuitively, an event means something that has occurred, and above the event E œ Ö#ß %ß ' represents the occurrence of an even number

Probability basics Again can translate between mathematical definition (subset) and intuitive notions of meanings of words (event). Probabilist wants to assign a probability TÐIÑ between! and ") to every event I. (a number Thus, e.g., if I œ Ö event of an even roll œ Ö#ß %ß ' want TÐEÑ œ " # [Rationales can vary] So: Ideally, want to assign numbers (probabilities) to subsets I W.

Example 9: Probability basics Die toss revisited: TÐ"Ñ œ " ' TÐ#Ñ œ " ' TÐ$Ñ œ " ' TÐ'Ñ œ " '

Probability basics " ' Each component in W has probability.

Probability basics Any subset E W has probability determined by adding measures of component subsets. Want TÐWÑ œ " ( why?) E 3

Probability basics Example 10: If we want to predict next base in genomic sequence, we have the sample space W œöeßxßgßk Define Iœevent that next base is a purine, i.e., IœÖEßK W. If we expect all bases have equal probabilities, then T ÐIÑ œ "Î#Þ

Analytic probability 2. Sample space and probability measure: what properties do we want? Def. 2: Recall for sets Eß Fß define E F and E F as the union and intersection of the sets.

Analytic probability Desired properties of T : (1) If E 3 are disjoint (i.e., no pair of them intersects) then the probability of the union of the E 3 is the sum of their probabilities: If 9 œ empty set: TŠ. E œ TÐE Ñ 3œ" 3 3 3œ" (2) TÐ9Ñ œ!ß TÐWÑ œ "Þ (Linearity)

Analytic probability An assignment of numbers TÐIÑ to subsets (events) I W satisfying properties (1) and (2) is called a measure on the set W. However, we will sometimes need to restrict the collection of sets I to which we can assign a probability (measure) TÐIÑ. Ê need a collection Y of subsets of W whose probabilities we are allowed to measure.

Analytic probability This collection of subsets Y must have some specific properties: Def. 3: The notation I Y means that the object Iis in the collection Y

Analytic probability Def: 4 a collection Y of subsets of W is a 5-field if (i) W, 9 Y ( W and 9 are in collection Y) - - (ii) E Ê E Y ( E œ complement of E) (iii) E Y a3 Ê E 3 3 3 [ aœfor all ] Y where EßEßEßá " # $ form a sequence of sets.

Analytic probability Once we have an W, Y, and a T as above, we call the triple ÐWß Yß T Ñ œ probability space We denote the class Y to be the measureable sets in W.

Analytic probability Example 11: W œ Ö"ß #ß $ß %ß &ß '. In this case the collection Y of measureable sets is usually all subsets of Wß i.e., Y œ Öall subsets of W} Example 12: WœÒ!ß"Ó, i.e., we are choosing a random number B in the interval Ò!ß "Ó; W is the set of all possible outcomes. Here Y œ collection of measureable sets is defined to be the smallest 5-field of sets including all possible intervals Ð+ß,Ñ.

Analytic probability Sometimes this collection Y is denoted as the Borel sets. We can define probabilities of sets to be, e.g. TÐ+ß,Ñ œ, + This defines the probability that our random number B is in the interval Ð+ß,Ñ. It can be shown that we can uniquely extend this definition of probability from the collection of intervals Ð+ß,Ñ to the larger collection of sets Y.

Analytic probability This full measure on the interval Ò!ß "Ó is called Lebesgue measure.

Measurable functions 3. Some basic notions: measurable functions If we have a sample space W on it. we want to define functions Definition 5: We define to be the collection of all real numbers. Definition 6: A function 0 on any set I is rule which assigns to each element B Ia real number denoted as 0ÐBÑ. In this case we write 0ÀIÄ

Measurable functions Assume now we have a collection of measurable sets Y on H Definition 7: A function 0ÀWÄ is measurable if for all B, the set Ö+ À 0Ð+Ñ Ÿ B œ the set of all + such that 0Ð+Ñ Ÿ B is measurable (i.e. is in Y) Þ Example 13: Consider the function 0À Ä $ 0BÑœB ( such that

Measurable functions Example 14: Consider 0ÐBÑ œ MUÐBÑ œ indicator function of rationals, defined by 0ÐBÑ œ " if B is rational œ! if B is irrational.

Random variables 4. Random Variables Definition 8: A random variable \ is any measurable function from the sample space W to the real numbers. Example 15: throw 2 dice

Random variables Suppose random variable \ maps outcomes to numbers.

Random variables Thus if the outcome is Ð$ß &Ñ (i.e. first die is a 3 and second die is a &) then \Ð$ß &Ñ œ ), i.e., \ maps each outcome to the total. Example 16: For a given amino acid + in a protein sequence, let \Ð+Ñ denote the number of other amino acids which + is bound to. Again \ maps the amino acid (in W) into a number. For a random variable (RV) \:

Random variables Def. 9: If \ is a random variable, we define its distribution function J to be distribution function ß J ÐBÑ À T Ð= À \Ð= Ñ Ÿ BÑ œ T Ð\ Ÿ BÑ

Properties of Random variables J Ðeasily derived) (i) JÐBÑ Ä " as B Ä JÐBÑ Ä! as B Ä (ii) J has at most countably many discontinuities i.e., discontinuity points BßBßá " # can be listed Example 17: Suppose we record high, low body temperatures for a patient on a given day; form a sample space of all possible pairs of measurements:

Random variables W œ ÖÐLßPÑ À L P Define a random variable \ÀWÄ as follows: for each element of W, let \ÐLßPÑ œ L P œ temperature range

Random variables Suppose we find that. J ÐBÑ œ T Ð ÐLß PÑ À ÐL PÑ Ÿ BÑ œ TÐ\ Ÿ BÑ œ " / B if œ B!! if B!

Random variables If J has a derivative, w JÐBÑœ0ÐBÑœ can check this is a d.f. density function of \. Example 18: here density œ0ðbñ œ / B œ!

Example 19: Random variables check: J ÐBÑ œ ( 0ÐB Ñ.B Þ Normal: density is B " # B Î# È / # 1 w w

1. Conditional probability More probability: Example 1: Die roll:

E œ event of even roll œ Ö#ß %ß ' F œ event of roll divisible by 3 œ Ö$ß ' TÐEÑ œ Define conditional probability " " à TÐFÑ œ # $ P(B A) œ Prob. of B given A occurs How to compute TÐFlEÑ? Create reduced sample space consisting only of E

and compute what portion of E is in F. Here reduced sample space E œ Ö#ß %ß '. Assuming equal probabilities: T Ð#lEÑ œ T Ð%lEÑ œ T Ð'lEÑ œ "Î$Þ Note T ÐFlEÑ œ T Ð'lEÑ œ "Î$Þ

Now note TÐE FÑ œ " ' ; thus " " ' TÐE FÑ TÐFlEÑ œ œ œ Þ $ " TÐEÑ Illustrates general mathematical definition TÐFlEÑ œ TÐE FÑ TÐEÑ #

2. Independence: We say events F and E are independent if TÐF EÑ T ÐFlEÑ œ T ÐFÑ Í œ T ÐFÑ TÐEÑ Í TÐE FÑ œ TÐEÑTÐFÑ In general a collection of events EßáßE " 8 is independent if for any subcollection E ßáßE TÐE 3 3 " 8 E á E Ñ œ TÐE ÑTÐE ÑâTÐE Ñ 3 3 3 3 3 3 " # 8 " # 8 À

Example 2: Consider sequence BßBßáßB " # 5 forming gene 1. of bases Q: Are the successive bases BßB 3 3 " independent? For example, given we know the base B3 œ Aß does that change the probability TÐB œ C). More specifically, do we have 3 " TÐB3 " œ ClB3 œ AÑ œ TÐB3 " œ C Ñ? (3) If (3) also holds for all possible choices ÐC,G,T) replacing A and all choices replacing C, then B3 " and B3 are independent.

Expect: in actual DNA exon region has more dependence from base to base than an intron does. Why? Evolutionary structural pressures - exons are more important to survival

Independence of RV's 3. Independence of RV's Henceforth given a subset E of sample space W, we assume E is measurable unless stated otherwise. Definition 10: Let W be a sample (probability) space. Let \ÀWÄ be a random variable (i.e., a rule assigning a real number to each outcome in W) If EœÒ+ß,Ó ß define TÐ\ EÑœTÐ+Ÿ\Ÿ,Ñ

Independence of RV's œtð all outcomes = whose value \Ð=Ñ is between + and,ñ œtð=l+ÿ\ð=ñÿ,ñþ Recall: Definition 11: Let W be a sample space, and \" ß\ # be random variables. Then \ß\ " # are independent if for any sets E, E, " # T Ð\ E ß \ E Ñ œ T Ð\ E ÑT Ð\ E Ñ " " # # " " # #

Independence of RV's Generally \ßáß\ " 8 TÐ\ E ßáß\ are independent if E Ñ " " 8 8 œ T Ð\ E ÑT Ð\ E Ñá T Ð\ E Ñ " " # # 8 8

Independence of RV's More to come on these topics-