Chapter 2. Some Basic Probability Concepts. 2.1 Experiments, Outcomes and Random Variables

Similar documents
Random Variables. Random variables. A numerically valued map X of an outcome ω from a sample space Ω to the real line R

Random Variables. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay

Bivariate distributions

Some Basic Probability Concepts. 2.1 Experiments, Outcomes and Random Variables

Continuous Random Variables

Joint Distribution of Two or More Random Variables

EC212: Introduction to Econometrics Review Materials (Wooldridge, Appendix)

ACE 562 Fall Lecture 2: Probability, Random Variables and Distributions. by Professor Scott H. Irwin

Preliminary Statistics. Lecture 3: Probability Models and Distributions

Preliminary Statistics Lecture 3: Probability Models and Distributions (Outline) prelimsoas.webs.com

ECON Fundamentals of Probability

2 (Statistics) Random variables

Random Variables. Cumulative Distribution Function (CDF) Amappingthattransformstheeventstotherealline.

6.041/6.431 Fall 2010 Quiz 2 Solutions

IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS LECTURE 3-RANDOM VARIABLES

MA/ST 810 Mathematical-Statistical Modeling and Analysis of Complex Systems

More on Distribution Function

Probability. Table of contents

MAS113 Introduction to Probability and Statistics. Proofs of theorems

Probability. Paul Schrimpf. January 23, UBC Economics 326. Probability. Paul Schrimpf. Definitions. Properties. Random variables.

Chapter 4. Chapter 4 sections

CHAPTER 4 MATHEMATICAL EXPECTATION. 4.1 Mean of a Random Variable

Probability Review. Chao Lan

Probability. Paul Schrimpf. January 23, Definitions 2. 2 Properties 3

Perhaps the simplest way of modeling two (discrete) random variables is by means of a joint PMF, defined as follows.

STA 256: Statistics and Probability I

Expectation of Random Variables

Lecture 2: Review of Probability

Random Variables and Expectations

Lecture 2: Repetition of probability theory and statistics

Review: mostly probability and some statistics

Let X and Y denote two random variables. The joint distribution of these random

1 Basic continuous random variable problems

ECE 650 Lecture 4. Intro to Estimation Theory Random Vectors. ECE 650 D. Van Alphen 1

Mathematics 426 Robert Gross Homework 9 Answers

UNIT-2: MULTIPLE RANDOM VARIABLES & OPERATIONS

Probability and Distributions

BASICS OF PROBABILITY

MULTIVARIATE PROBABILITY DISTRIBUTIONS

Summary of basic probability theory Math 218, Mathematical Statistics D Joyce, Spring 2016

Random Signals and Systems. Chapter 3. Jitendra K Tugnait. Department of Electrical & Computer Engineering. Auburn University.

Review of Probability Theory

1 Probability theory. 2 Random variables and probability theory.

18.440: Lecture 28 Lectures Review

STAT 430/510 Probability Lecture 7: Random Variable and Expectation

MAS113 Introduction to Probability and Statistics. Proofs of theorems

Discrete Probability Refresher

STAT2201. Analysis of Engineering & Scientific Data. Unit 3

Formulas for probability theory and linear models SF2941

3. Probability and Statistics

SUMMARY OF PROBABILITY CONCEPTS SO FAR (SUPPLEMENT FOR MA416)

18.440: Lecture 28 Lectures Review

Jointly Distributed Random Variables

f X, Y (x, y)dx (x), where f(x,y) is the joint pdf of X and Y. (x) dx

CME 106: Review Probability theory

Chapter 2. Continuous random variables

EXPECTED VALUE of a RV. corresponds to the average value one would get for the RV when repeating the experiment, =0.

Chapter 2. Random Variable. Define single random variables in terms of their PDF and CDF, and calculate moments such as the mean and variance.

Expectation and Variance

Random Variables and Their Distributions

1 Random Variable: Topics

Gaussian random variables inr n

Appendix A : Introduction to Probability and stochastic processes

E X A M. Probability Theory and Stochastic Processes Date: December 13, 2016 Duration: 4 hours. Number of pages incl.

Review of Probability. CS1538: Introduction to Simulations

Stat 704 Data Analysis I Probability Review

2 Functions of random variables

1 Random variables and distributions

SDS 321: Introduction to Probability and Statistics

conditional cdf, conditional pdf, total probability theorem?

Random variables (discrete)

Statistical Methods in Particle Physics

Algorithms for Uncertainty Quantification

Lecture 4: Proofs for Expectation, Variance, and Covariance Formula

MATHEMATICS 154, SPRING 2009 PROBABILITY THEORY Outline #11 (Tail-Sum Theorem, Conditional distribution and expectation)

1: PROBABILITY REVIEW

Basics on Probability. Jingrui He 09/11/2007

Lecture 10: Probability distributions TUESDAY, FEBRUARY 19, 2019

3 Multiple Discrete Random Variables

Stochastic Models of Manufacturing Systems

Introduction to Computational Finance and Financial Econometrics Probability Review - Part 2

Joint Probability Distributions, Correlations

Arkansas Tech University MATH 3513: Applied Statistics I Dr. Marcel B. Finan

SDS 321: Introduction to Probability and Statistics

PCMI Introduction to Random Matrix Theory Handout # REVIEW OF PROBABILITY THEORY. Chapter 1 - Events and Their Probabilities

1 Presessional Probability

Fourier and Stats / Astro Stats and Measurement : Stats Notes

Random Variables. P(x) = P[X(e)] = P(e). (1)

STAT Chapter 5 Continuous Distributions

We introduce methods that are useful in:

Joint Probability Distributions, Correlations

Topic 3: The Expectation of a Random Variable

S n = x + X 1 + X X n.

4. Distributions of Functions of Random Variables

Probability Review. Yutian Li. January 18, Stanford University. Yutian Li (Stanford University) Probability Review January 18, / 27

Chp 4. Expectation and Variance

ECE Lecture #9 Part 2 Overview

Statistics 100A Homework 5 Solutions

PROBABILITY DISTRIBUTION

Brief Review of Probability

Transcription:

Chapter 2 Some Basic Probability Concepts 2.1 Experiments, Outcomes and Random Variables A random variable is a variable whose value is unknown until it is observed. The value of a random variable results from an experiment; it is not perfectly predictable. A discrete random variable can take only a finite number of values, which can be counted by using the positive integers. Discrete variables are also commonly used in economics to record qualitative, or nonnumerical, characteristics. In this role they are sometimes called dummy variables. A continuous random variable can take any real value (not just whole numbers) in an interval on the real number line. Slide 2.1

2.2 The Probability Distribution of a Random Variable The values of random variables are not known until an experiment is carried out, and all possible values are not equally likely. We can make probability statements about certain values occurring by specifying a probability distribution for the random variable. If event A is an outcome of an experiment, then the probability of A, which we write as P(A), is the relative frequency with which event A occurs in many repeated trials of the experiment. For any event, 0 P(A) 1, and the total probability of all possible event is one. 2.2.1 Probability Distributions of Discrete Random Variables When the values of a discrete random variable are listed with their chances of occurring, the resulting table of outcomes is called a probability function or a probability density function. Slide 2.2

The probability density function spreads the total of 1 unit of probability over the set of possible values that a random variable can take. Consider a discrete random variable, X = the number of heads obtained in a single flip of a coin. The values that X can take are x = 0,1. If the coin is fair then the probability of a head occurring is 0.5. The probability density function, say f(x), for the random variable X is Coin Side x f(x) tail 0 0.5 head 1 0.5 The probability that X takes the value 1 is 0.5 means that the two values 0 and 1 have an equal chance of occurring and, if we flipped a fair coin a very large number of times, the value x = 1 would occur 50 percent of the time. We can denote this as P[X Slide 2.3

= 1] = f(1) = 0.5, where P[X = 1] is the probability of the event that the random variable X = 1. For a discrete random variable X the value of the probability density function f(x) is the probability that the random variable X takes the value x, f(x) = P(X=x). Therefore, 0 f(x) 1 and, if X takes n values x 1,.., x n, then f x1 f x2 f x n ( ) + ( ) + L + ( ) = 1. 2.2.2 The Probability Density Function of A Continuous Random Variable For the continuous random variable Y the probability density function f(y) can be represented by an equation, which can be described graphically by a curve. For continuous random variables the area under the probability density function corresponds to probability. For example, the probability density function of a continuous random variable Y might be represented as in Figure 2.1. The total area under a probability density function is 1, Slide 2.4

and the probability that Y takes a value in the interval [a, b], or P[a Y b], is the area under the probability density function between the values y = a and y = b. This is shown in Figure 2.1 by the shaded area. Since a continuous random variable takes an uncountable infinite number of values, the probability of any one occurring is zero. That is, P[Y = a] = P[a Y a] = 0. In calculus, the integral of a function defines the area under it, and therefore Pa [ Y b] = f( ydy ). b y= a For any random variable x, the probability that x is less than or equal to a is denoted F(a). F(x) is the cumulative distribution function (cdf). For a discrete random variable, F() x = f() x = Prob( X x) X x Slide 2.5

In view of the definition of f(x), f( x) = Fx ( ) Fx ( ) 1 i i i For a continuous random variable, x F() x = f() t dt and f() x = df() x dx In both the continuous and discrete cases, F(x) must satisfy the following properties: Slide 2.6

1. 0 F( x) 1. 2. If x y, then F() x F() y. 3. F ( + ) =. 1 4. F( ) = 0. 5. Prob( a< x b) = F( b) F( a). Slide 2.7

2.3 Expected Values Involving a Single Random Variable When working with random variables, it is convenient to summarize their probability characteristics using the concept of mathematical expectation. These expectations will make use of summation notation. 2.3.1 The Rules of Summation 1. If X takes n values x 1,..., x n then their sum is n i 1 2 L i= 1 x = x + x + + x 2. If a is a constant, then n n i= 1 a = na Slide 2.8

3. If a is a constant then it can be pulled out in front of a summation n n ax = a x i i= 1 i= 1 i 4. If X and Y are two variables, then n n n ( x + y ) = x + y i i i i i= 1 i= 1 i= 1 5. If a and b are constants, then n ( a+ bx ) = na+ b x i i= 1 i= 1 n 6. If X and Y are two variables, then n n n ( ax + by ) = a x + b y i i i i i= 1 i= 1 i= 1 i Slide 2.9

7. The arithmetic mean (average) of n values of X is n x = x + x + L+ x x = = n n Also, n i= 1 i i 1 1 2 n. ( x x) = 0 i 8. We often use an abbreviated form of the summation notation. For example, if f(x) is a function of the values of X, n i= 1 f( x ) = f( x ) + f( x ) + L+ f( x ) i 1 2 = f( x ) ("Sum over all values of the index i") = i x i f( x) ("Sum over all possible values of X") n Slide 2.10

9. Several summation signs can be used in one expression. Suppose the variable Y takes n values and X takes m values, and let f(x,y) = x+y. Then the double summation of this function is m n m n f( x, y ) = ( x + y ) i j i j i= 1 j= 1 i= 1 j= 1 To evaluate such expressions work from the innermost sum outward. First set i=1 and sum over all values of j, and so on. To illustrate, let m = 2 and n = 3. Then ( i, j) = ( i, 1) + ( i, 2) + ( i, 3) 2 3 2 f x y f x y f x y f x y i= 1 j= 1 i= 1 ( 1, 1) ( 1, 2) ( 1, 3) (, ) + (, ) + (, ) = f x y + f x y + f x y + f x y f x y f x y 2 1 2 2 2 3 The order of summation does not matter, so m n n m f( x, y ) = f( x, y ) i j i j i= 1 j= 1 j= 1 i= 1 Slide 2.11

2.3.2 The Mean of a Random Variable The expected value of a random variable X is the average value of the random variable in an infinite number of repetitions of the experiment (repeated samples); it is denoted E[X]. If X is a discrete random variable which can take the values x 1, x 2,,xn with probability density values f(x 1 ), f(x 2 ),, f(xn), the expected value of X is EX [ ] = xf( x) + xf( x) + L+ xf( x) = = 1 1 2 2 n i= 1 x xf( x) i xf ( x) i n n (2.3.1) Slide 2.12

If X is a continuous random variable, the expected value of X is EX [ ] = xf( xdx ) x The notation means integral over the entire range of values of x. x 2.3.3 Expectation of a Function of a Random Variable If X is a discrete random variable and g(x) is a function of it, then E[ g( X)] = g( x) f( x) (2.3.2a) x Slide 2.13

However, E[ g( X )] g[ E( X)] in general. If X is a discrete random variable and g(x) = g 1 (X) + g 2 (X), where g 1 (X) and g 2 (X) are functions of X, then EgX [ ( )] = [ g( x) + g( x)] f( x) x 1 2 (2.3.2b) = g ( x) f( x) + g ( x) f( x) x 1 2 x = Eg [ ( x)] + Eg [ ( x)] 1 2 The expected value of a sum of functions of random variables, or the expected value of a sum of random variables, is always the sum of the expected values. Slide 2.14

The idea of how to determine the expected value of a function of a continuous random variable Y, say g(y), is exactly the same as in the discrete case. The terms g(y) must be weighted by f(y) and then all those products summed. This operation is carried out via integration, but the interpretation of the result is the same. Specifically, if Y is a continuous random variable, then Eg [ ( y)] = g( y) f( ydy ) y Some properties of mathematical expectation work for both discrete and continuous random variable. For the discrete case, these results are shown as follows: 1. If c is a constant, E[] c 2. If c is a constant and X is a random variable, then = c (2.3.3a) E[ cx ] = ce[ X ] (2.3.3b) Slide 2.15

3. If a and c are constants and X is a random variable, then E[ a+ cx] = a+ ce[ X] (2.3.3c) 4. If a, b, and c are constants and X and Y are random variables, then EaX [ + by+ c] = aex [ ] + bey [ ] + c A conditional mean is the mean of the conditional distribution and is defined by Eyx [ ] = yf( yx ) if yis discrete y Eyx [ ] = yf( yxdy ) if yis continuous y The conditional mean function E[y x] is called the regression of y on x. Slide 2.16

2.3.4 The Variance of a Random Variable The variance of a discrete or continuous random variable X, based on the rules in Section 2.3.3, is defined as the expected value of gx ( ) = [ X EX ( )] 2. Algebraically, var( X) = σ = E[ g( X)] = E[ X E( X)] = E[ X µ] 2 2 2 = EX [ ] [ EX ( )] = 2 2 ( x µ) 2 f( x) if x is discrete x (2.3.4) = ( x µ) 2 f( x) dx if x is continuous x where E[ X ] = µ. Examining g(x) = [X E(X)] 2, we observe that the variance of a random variable is the average squared difference between the random variable X and its mean variable E[X]. Thus, the variance of a random variable is the weighted Slide 2.17

average of the squared differences (or distances) between the values x of the random variable X and the mean (center of the probability density function) of the random variable. The larger the variance of a random variable, the greater the average squared distance between the values of the random variable and its mean, or the more spread out are the values of the random variable. Let a and c be constants, and let Z = a + cx. Then Z is a random variable and its variance is var(a + cx) = E[(a + cx) E(a + cx)] 2 = c 2 var(x) (2.3.5) The result in Equation (2.3.5) says that if you: 1. Add a constant to a random variable it does not affect its variance, or dispersion. This fact follows, since adding a constant to a random variable shifts the location of its probability density function but leaves its shape, and dispersion, unaffected. Slide 2.18

2. Multiply a random variable by a constant, the variance is multiplied by the square of the constant. The square root of the variance of a random variable is called the standard deviation; it is denoted by σ. It, too, measures the spread or dispersion of a distribution, and it has the advantage of being in the same units of measure as the random variable. A conditional variance is the variance of the conditional distribution: var[ yx ] = E[( y Eyx [ ]) 2 x] = ( y E[ y x]) 2 f( y x) if y is discrete y var[ yx ] = ( y Eyx [ ]) 2 f( yxdy ) if yis continuous y The computation can be simplified by using var[y x] = E[y 2 x] (E[y x]) 2. Slide 2.19

Two other measures often used to describe a probability distribution are skewness = E[( x µ) 3] and kurtosis = E[( x µ) 4] Skewness is a measure of the asymmetry of a distribution. For symmetric distributions, f (µ x) = f (µ + x) and skewness = 0. For asymmetric distributions, the skewness will be positive (negative) if the long tail is in the positive (negative) direction. Kurtosis is a measure of the thickness of the tails of the distribution. Slide 2.20

Two common measures are [( µ) 3] 3 skewness coefficient = E x σ and [( µ) 4] 4 degree of excess = E x 3 σ The second is based on the normal distribution, which has excess of zero. Slide 2.21

2.4 Using Joint Probability Density Functions Frequently we want to make probability statements about more than one random variable at a time. To answer probability questions involving two or more random variables, we must know their joint probability density function. For the continuous random variables X and Y, we use f(x,y) to represent their joint density function. A typical joint density function might look something like Figure 2.3. See Example 2.5. 2.4.1 Marginal Probability Density Functions If X and Y are two discrete random variables then Slide 2.22

f( x) = f( x, y) for each value X can take y f( y) = f( x, y) for each value Y can take x (2.4.1) Note that the summations in Equation (2.4.1) are over the other random variable, the one that we are eliminating from the joint probability density function. If the random variables are continuous the same idea works, with integrals replacing the summation sign as follows: f() x = f(,) x y dy y f( y) = f( x, y) dx x Slide 2.23

2.4.2 Conditional Probability Density Functions Often the chances of an event occurring are conditional on the occurrence of another event. For discrete random variables X and Y, conditional probabilities can be calculated from the joint probability density function f(x,y) and the marginal probability density function of the conditioning random variables. Specifically, the probability that the random variable X takes the value x given that Y = y, is written P[X = x Y = y]. This conditional probability is given by the conditional probability density function f(x y): Slide 2.24

f( x y) = P[ X = x Y = y] = f( y x) = P[ Y = y X = x] = f( x, y) f( y) f( x, y) f( x) (2.4.2) 2.4.3 Independent Random Variables Two random variables are statistically independent, or independently distributed, if knowing the value that one will take does not reveal anything about what value the other may take. When random variables are statistically independent, their joint probability density function factors into the product of their individual probability density functions, and vice versa. If X and Y are independent random variables, then f ( x, y) = f( x) f( y) (2.4.3) Slide 2.25

for each and every pair of values x and y. The converse is also true. If X 1,, X n are statistically independent the joint probability density function can be factored and written as f(x 1,x 2,,x n ) = f 1 (x 1 )f 2 (x 2 ) f n (x n ) (2.4.4) If X and Y are independent random variables, then the conditional probability density function of X, given that Y = y is f( x, y) f( x) f( y) f( x y) = f( x) f( y) = f( y) = (2.4.5) for each and every pair of values x and y. The converse is also true. Slide 2.26

2.5 The Expected Value of a Function of Several Random Variables: Covariance and Correlation In economics we are usually interested in exploring relationships between economic variables. The covariance literally indicates the amount of covariance exhibited by the two random variables. If X and Y are random variables, then their covariance is cov( XY, ) = E[( X EX [ ])( Y EY [ ])] (2.5.1) If X and Y are discrete random variables, f(x,y) is their joint probability density function, and g(x,y) is a function of them, then Slide 2.27

E[ g( XY, )] = g( x, y) f( x, y) (2.5.2) x y If X and Y are discrete random variables and f(x,y) is their joint probability density function, then cov( XY, ) = E[( X EX [ ])( Y EY [ ])] = [ x E( X)][ y E( Y)] f( x, y) x y (2.5.3) If X and Y are continuous random variables, then the definition of covariance is similar, with integrals replacing the summation signs as follows: cov( X, Y) f ( x, y) dxdy = x y Slide 2.28

The sign of the covariance between two random variables indicates whether their association is positive (direct) or negative (inverse). The covariance between X and Y is expected, or average, value of the random product [X E(X)][Y E(Y)]. If two random variables have positive covariance then they tend to be positively (or directly) related. See Figure 2.4. The values of two random variables with negative covariance tend to be negatively (or inversely) related. See Figure 2.5. Zero covariance implies that there is neither positive nor negative association between pairs of values. See Figure 2.6. The magnitude of covariance is difficult to interpret because it depends on the units of measurement of the random variables. The meaning of covariation is revealed more clearly if we divide the covariance between X and Y by their respective standard deviations. The resulting ratio is defined as the correlation between the random variables X and Y. If X and Y are random variables then their correlation is Slide 2.29

cov( XY, ) σxy ρ= = (2.5.4) var( X) var( Y) σσ x y If X and Y are independent random variables then the covariance and correlation between them are zero. The converse of this relationship is not true. Independent random variables X and Y have zero covariance, indicating that there is no linear association between them. However, just because the covariance or correlation between two random variables is zero does not mean that they are necessarily independent. Zero covariance means that there is no linear association between the random variables. Even if X and Y have zero covariance, they might have a nonlinear association, like X 2 + Y 2 = 1. If a, b, c, and d are constants and X and Y are random variables, then cov( ax + by, cx + dy) = acvar( X ) + bd var( Y) + ( ad + bc)cov( X, Y) Slide 2.30

Proof: cov( ax + by, cx + dy) = E[(( ax + by) E[ ax + by])(( cx + dy) E[ cx + dy])] = E[( ax+ by aex [ ] bey [ ])( cx+ dy cex [ ] dey [ ])] = E[( a( X E[ X]) + b( Y EY [ ]))( c( X E[ X]) + d( Y EY [ ]))] = EacX EX + bdy EY + ad+ bc X EX Y EY [ ( [ ]) 2 ( [ ]) 2 ( )( [ ])( [ ])] ace[ ( X E[ X]) ] + bde[( Y EY [ ]) ] + ( ad+ bc) E[( X E[ X])( Y EY [ ])] = 2 2 = acvar( X ) + bd var( Y) + ( ad + bc)cov( X, Y) Slide 2.31

2.5.1 The Mean of a Weighted Sum of Random Variables Let the function g(x,y) = ax + by where a and b are constants. This is called a weighted sum. Now use Equation (2.5.2) to find the expectation E[ ax + by ] = ae[ X ] + be[ Y ] (2.5.5) This rule says that the expected value of a weighted sum of two random variables is the weighted sum of their expected values. This rule works for any number of random variables whether they are discrete or continuous. If X and Y are random variables, then E[ X + Y] = E[ X] + E[ Y] (2.5.6) Slide 2.32

In general, the expected value of any sum is the sum of the expected values. 2.5.2 The Variance of a Weighted Sum of Random Variables If X, Y, and Z are random variables and a, b, and c are constants, then var[ax + by + cz] = a 2 var[x] + b 2 var[y] + c 2 var[z] + 2abcov[X,Y] + 2accov[X,Z] + 2bccov[Y,Z] (2.5.7) Proof: Slide 2.33

var[ ax + by + cz] [(( ) [ ]) 2] = E ax + by + cz E ax + by + cz [( ( [ ]) ( [ ]) ( [ ])) 2] = E a X E X + b Y EY + c Z E Z = Ea [ 2( X EX [ ]) 2+ b2( Y EY [ ]) 2+ c2( Z EZ [ ]) 2 + 2 ab( X E[ X ])( Y E[ Y]) + 2 ac( X E[ X ])( Z E[ Z]) + 2 bc( Y E[ Y])( Z E[ Z])] = ae 2 [( X EX [ ]) 2] + be 2 [( Y EY [ ])] 2 + c2e[( Z E[ Z])] 2 + 2 abe[( X E[ X ])( Y E[ Y])] + 2 ace[( X E[ X ])( Z E[ Z])] + 2 bce[( Y E[ Y])( Z E[ Z])] = a2var( X ) + b2var( Y) + c2var( Z) + 2abcov( X, Y) + 2accov( X, Z) + 2bccov( Y, Z) If X, Y, and Z are independent, or uncorrelated, random variables, then the covariance terms are zero and: var[ax + by + cz] = a 2 var[x] + b 2 var[y] + c 2 var[z] (2.5.8) Slide 2.34

If X, Y, and Z are independent, or uncorrelated, random variables, and if a = b = c = 1, then var[x + Y + Z] = var[x] + var[y] + var[z] (2.5.9) When the variance of a sum is the sum of the variances, the random variables involved must be independent, or uncorrelated. Slide 2.35

2.6 The Normal Distribution If X is a normally distributed random variable with mean β and variance σ 2, symbolized as X ~ N(β,σ 2 ), then its probability density function is expected mathematically as: 2 1 ( x β) f( x) = exp, < x< 2 2σ 2 2 πσ (2.6.1) where exp[a] denotes the exponential function e a. The mean β and variance σ 2 are the parameters of this distribution and they determine its location and dispersion. The range of the continuous normal random variable is minus infinity to plus infinity. See Figure 2.7. Slide 2.36

A standard normal random variable is one that has a normal probability density function with mean 0 and variance 1. If, X ~ N(β,σ 2 )then Z = X β σ ~ N(0,1) If X ~ N(β,σ 2 ) and a is a constant, then X β a β a β PX [ a] = P = P Z σ σ σ (2.6.2) If X ~ N(β,σ 2 ) and a and b are constants, then a X b a b Pa [ X b] P β β β P β Z β = = σ σ σ σ σ (2.6.3) Slide 2.37

When using Table 1, and Equations (2.6.2) and (2.6.3), to compute normal probabilities, remember that: 1. The standard normal probability density function is symmetric about zero. 2. The total amount of probability under the density function is 1. 3. Half the probability is on either side of zero. For example, if X ~ N(3,9), then using Table 1, P[4 X 6] = P[.33 Z 1] =.3413.1293 =.212 See Figure 2.8. For the purposes of statistical testing, it is useful to know that: 1. The probability that a single observation of a normally distributed variable X will lie within 1.96 standard deviations of its mean is approximately 95%. 2. The probability that a single observation of a normally distributed variable X will lie within 2.57 standard deviations of its mean is approximately 99%. Slide 2.38

If X ( 2 ) ( 2 ) ( 2 1 ~ N 1, 1, X2 ~ N 2, 2, X3 ~ N 3, 3) then β σ β σ β σ and c1, c2, and c 3 are constants, Z = c 1 X 1 + c 2 X 2 + c 3 X 3 ~ N[E(Z),var(Z)] (2.6.4) Slide 2.39

Exercises 2.1 2.2 2.3 2.4 2.5 2.6 2.7 2.8 2.10 2.11 2.15 2.16 2.18 2.19 2.21 2.22 2.24 Slide 2.40