P Formula Sheet

General Probability

  • Basic Probability Relationships:

    • Pr(AB)=Pr(A)+Pr(B)Pr(AB)Pr(A \cup B) = Pr(A) + Pr(B) - Pr(A \cap B)

    • Pr(ABC)=Pr(A)+Pr(B)+Pr(C)Pr(AB)Pr(BC)Pr(AC)+Pr(ABC)Pr(A \cup B \cup C) = Pr(A) + Pr(B) + Pr(C) - Pr(A \cap B) - Pr(B \cap C) - Pr(A \cap C) + Pr(A \cap B \cap C)

    • Pr(Ac)=1Pr(A)Pr(A^c) = 1 - Pr(A)

  • Law of Total Probability:

    • Pr(B)=Pr(BA)Pr(B) = Pr(B \cap A)

  • De Morgan’s Law:

    • Pr[(AB)c]=Pr(AcBc)Pr[(A \cup B)^c] = Pr(A^c \cap B^c)

    • Pr[(AB)c]=Pr(AcBc)Pr[(A \cap B)^c] = Pr(A^c \cup B^c)

  • Conditional Probability:

    • Pr(AB)=Pr(AB)Pr(B)Pr(A|B) = \frac{Pr(A \cap B)}{Pr(B)}

  • Independence:

    • Pr(AB)=Pr(A)Pr(B)Pr(A \cap B) = Pr(A) \cdot Pr(B)

    • Pr(AB)=Pr(A)Pr(A|B) = Pr(A)

  • Bayes’ Theorem:

    • Pr(𝐴𝐴&|𝐵𝐵) =

      Pr(𝐵𝐵|𝐴𝐴& ) ⋅ Pr(𝐴𝐴&)

      ∑ Pr(𝐵𝐵|𝐴𝐴") ⋅ Pr(𝐴𝐴" )#

  • Combinatorics:

    • n!=n(n1)21n! = n \cdot (n-1) \cdot … \cdot 2 \cdot 1

    • <em>nP</em>k=n!(nk)!<em>nP</em>k = \frac{n!}{(n-k)!}

    • <em>nC</em>k=(nk)=(nnk)=n!(nk)!k!<em>nC</em>k = \binom{n}{k} = \binom{n}{n-k} = \frac{n!}{(n-k)! \cdot k!}

    • Partition = n!k<em>1!k</em>2!k<em>m!\frac{n!}{k<em>1! \cdot k</em>2! \cdot … \cdot k<em>m!}, where k</em>1+k<em>2++k</em>m=nk</em>1 + k<em>2 + … + k</em>m = n

    • Probability = number of outcomes that satisfy the eventtotal number of outcomes\frac{\text{number of outcomes that satisfy the event}}{\text{total number of outcomes}}

Univariate Probability Distributions

  • Learn both discrete and continuous cases.

  • Probability Mass Function (PMF):

    • pX(x)=1\sum p_X(x) = 1

    • Pr(X=a)=0Pr(X = a) = 0 (continuous)

  • Cumulative Distribution Function (CDF):

    • F<em>X(x)=Pr(Xx)=p</em>X(i)F<em>X(x) = Pr(X \le x) = \sum p</em>X(i)

    • Pr(a<Xb)=F<em>X(b)F</em>X(a)Pr(a < X \le b) = F<em>X(b) - F</em>X(a)

    • f<em>X(x)=ddxF</em>X(x)f<em>X(x) = \frac{d}{dx} F</em>X(x) (continuous)

  • Survival Function:

    • S<em>X(x)=1F</em>X(x)=Pr(X>x)S<em>X(x) = 1 - F</em>X(x) = Pr(X > x)

  • Expected Value:

    • E[g(X)]=g(x)fX(x)dxE[g(X)] = \int g(x) \cdot f_X(x) dx

    • E[g(X)]=<em>0g(x)S</em>X(x)dxE[g(X)] = \int<em>0^\infty g'(x) \cdot S</em>X(x) dx, for x0x \ge 0 and g(0)=0g(0) = 0

    • E[g(X)jXk]=<em>jkg(x)f</em>X(x)dxPr(jXk)E[g(X)|j \le X \le k] = \frac{\int<em>j^k g(x) \cdot f</em>X(x) dx}{Pr(j \le X \le k)}

    • E[c]=cE[c] = c

    • E[cg(X)]=cE[g(X)]E[c \cdot g(X)] = c \cdot E[g(X)]

    • E[g<em>1(X)++g</em>n(X)]=E[g<em>1(X)]++E[g</em>n(X)]E[g<em>1(X) + \cdots + g</em>n(X)] = E[g<em>1(X)] + \cdots + E[g</em>n(X)]

  • Variance, Standard Deviation, and Coefficient of Variation:

    • Var[X]=E[(Xμ)2]=E[X2](E[X])2Var[X] = E[(X - \mu)^2] = E[X^2] - (E[X])^2

    • Var[aX+b]=a2Var[X]Var[aX + b] = a^2 \cdot Var[X]

    • Var[c]=0Var[c] = 0

    • SD[X]=Var[X]SD[X] = \sqrt{Var[X]}

    • CV[X]=SD[X]E[X]CV[X] = \frac{SD[X]}{E[X]}

  • Percentiles:

    • The 100pth100p^{th} percentile is the smallest value of π<em>p\pi<em>p where F</em>X(πp)pF</em>X(\pi_p) \ge p.

  • Modes:

    • The mode(s) of a random variable is/are the value(s) where the probability function is maximized.

Discrete Distributions

  • Discrete Uniform:

    • PMF: 1ba+1\frac{1}{b - a + 1}, x=a,a+1,,bx = a, a+1, …, b

    • Mean: a+b2\frac{a+b}{2}

    • Variance: (ba+1)2112\frac{(b-a+1)^2 - 1}{12}

  • Binomial:

    • PMF: (nx)px(1p)nx\binom{n}{x} p^x (1-p)^{n-x}, x=0,1,,nx = 0, 1, …, n

    • Mean: npnp

    • Variance: np(1p)np(1-p)

    • Special Properties: Sum of independent binomials with same p is binomial (n=ni,pn = \sum n_i, p)

  • Hypergeometric:

    • PMF: (Kx)(NKnx)(Nn)\frac{\binom{K}{x} \cdot \binom{N-K}{n-x}}{\binom{N}{n}}

    • Mean: nKNn \cdot \frac{K}{N}

    • Variance: nKNNKNNnN1n \cdot \frac{K}{N} \cdot \frac{N-K}{N} \cdot \frac{N-n}{N-1}

  • Geometric (X = # trials until 1st success):

    • PMF: (1p)x1p(1-p)^{x-1}p, x=1,2,3,x = 1, 2, 3, …

    • Mean: 1p\frac{1}{p}

    • Variance: 1pp2\frac{1-p}{p^2}

    • Memoryless property: (XcX>c)X(X-c | X > c) \sim X

  • Geometric (X = # failures before 1st success):

    • PMF: (1p)xp(1-p)^x p, x=0,1,2,x = 0, 1, 2, …

    • Mean: 1pp\frac{1-p}{p}

  • Negative Binomial (X = # trials until rth success):

    • PMF: (x1r1)pr(1p)xr\binom{x-1}{r-1} p^r (1-p)^{x-r}, x=r,r+1,r+2,x = r, r+1, r+2, …

    • Mean: rp\frac{r}{p}

    • Variance: r(1p)p2\frac{r(1-p)}{p^2}

    • Special Properties: Sum of r independent geometric(p) is negative binomial (r=ri,pr = \sum r_i, p)

  • Negative Binomial (X = # failures until rth success):

    • PMF: (r+x1r1)pr(1p)x\binom{r+x-1}{r-1} p^r (1-p)^x, x=0,1,2,x = 0, 1, 2, …

    • Mean: r(1p)p\frac{r(1-p)}{p}

  • Poisson:

    • PMF: eλλxx!\frac{e^{-\lambda} \cdot \lambda^x}{x!}, x=0,1,2,x = 0, 1, 2, …

    • Mean: λ\lambda

    • Variance: λ\lambda

    • Special Properties:

      • Sum of independent Poissons is Poisson (λ=λi\lambda = \sum \lambda_i)

      • Non-overlapping intervals are independent

Continuous Distributions

  • Continuous Uniform:

    • PDF: 1ba\frac{1}{b-a}, axba \le x \le b

    • CDF: xaba\frac{x-a}{b-a}

    • Mean: a+b2\frac{a+b}{2}

    • Variance: (ba)212\frac{(b-a)^2}{12}

    • (Xc<X<d)Uniform(c,d)(X|c < X < d) \sim Uniform(c, d)

    • (XcX>c)Uniform(0,bc)(X-c | X > c) \sim Uniform(0, b-c)

  • Exponential:

    • PDF: 1θexθ\frac{1}{\theta} e^{-\frac{x}{\theta}}, x>0x > 0

    • CDF: 1exθ1 - e^{-\frac{x}{\theta}}

    • Mean: θ\theta

    • Variance: θ2\theta^2

    • Memoryless property: (XcX>c)X(X-c | X > c) \sim X

  • Gamma:

    • PDF: xα1exθΓ(α)θα\frac{x^{\alpha-1} e^{-\frac{x}{\theta}}}{\Gamma(\alpha) \cdot \theta^\alpha}, x>0x > 0

    • CDF: 1k=0α1exθ(xθ)kk!1 - \sum_{k=0}^{\alpha-1} \frac{e^{-\frac{x}{\theta}} (\frac{x}{\theta})^k}{k!}, α=1,2,3,\alpha = 1, 2, 3, …

    • Mean: αθ\alpha \theta

    • Variance: αθ2\alpha \theta^2

    • Special properties: Sum of α\alpha independent exponentials(θ\theta) is Gamma(α,θ\alpha, \theta)

  • Normal:

    • PDF: 1σ2πe12(xμσ)2\frac{1}{\sigma \sqrt{2\pi}} e^{-\frac{1}{2} (\frac{x-\mu}{\sigma})^2}, <x<- \infty < x < \infty

    • Z=XμσZ = \frac{X - \mu}{\sigma}

    • CDF: Pr(Zz)=Φ(z)Pr(Z \le z) = \Phi(z)

    • Mean: μ\mu

    • Variance: σ2\sigma^2

    • Symmetry: Pr(Zz)=Pr(Zz)Pr(Z \le z) = Pr(Z \ge -z)

    • Special properties:

      • Sum of independent normals is normal (μ=μ<em>i,σ2=σ</em>i2\mu = \sum \mu<em>i, \sigma^2 = \sum \sigma</em>i^2)

  • LogNormal:

    • PDF: 1xσ2πe12(lnxμσ)2\frac{1}{x \sigma \sqrt{2\pi}} e^{-\frac{1}{2} (\frac{ln x - \mu}{\sigma})^2}, x>0x > 0

    • CDF: Φ(lnxμσ)\Phi(\frac{ln x - \mu}{\sigma})

    • Mean: eμ+12σ2e^{\mu + \frac{1}{2} \sigma^2}

    • Variance: e2μ+σ2(eσ21)e^{2\mu + \sigma^2} (e^{\sigma^2} - 1)

    • If X is lognormal then lnX is normal

    • Product of independent lognormals is lognormal (μ=μ<em>i,σ2=σ</em>i2\mu = \sum \mu<em>i, \sigma^2 = \sum \sigma</em>i^2)

  • Beta:

    • PDF: Γ(a+b)Γ(a)Γ(b)xa1(1x)b1\frac{\Gamma(a+b)}{\Gamma(a)\Gamma(b)} x^{a-1} (1-x)^{b-1}, 0x10 \le x \le 1

    • CDF: No closed form

    • Mean: aa+b\frac{a}{a+b}

    • Variance: ab(a+b)2(a+b+1)\frac{ab}{(a+b)^2 (a+b+1)}

    • Beta(1, 1) is Uniform(0, 1)

Multivariate Probability Distributions

  • Joint PMF and CDF:

    • <em>x</em>ypX,Y(x,y)=1\sum<em>x \sum</em>y p_{X,Y}(x, y) = 1

    • F<em>X,Y(x,y)=</em>ix<em>jyp</em>X,Y(i,j)F<em>{X,Y}(x, y) = \sum</em>{i \le x} \sum<em>{j \le y} p</em>{X,Y}(i, j)

    • F<em>X,Y(x,)=F</em>X(x)F<em>{X,Y}(x, \infty) = F</em>X(x)

    • F<em>X,Y(,y)=F</em>Y(y)F<em>{X,Y}(\infty, y) = F</em>Y(y)

    • SX,Y(x,y)=Pr[(X>x)(Y>y)]S_{X,Y}(x, y) = Pr[(X > x) \cap (Y > y)]

  • Marginal Distributions and Conditional Distributions:

    • p<em>X(x)=</em>ypX,Y(x,y)p<em>X(x) = \sum</em>y p_{X,Y}(x, y)

    • p<em>Y(y)=</em>xpX,Y(x,y)p<em>Y(y) = \sum</em>x p_{X,Y}(x, y)

    • p<em>XY(xY=y)=p</em>X,Y(x,y)pY(y)p<em>{X|Y}(x|Y=y) = \frac{p</em>{X,Y}(x, y)}{p_Y(y)}

  • Joint Expected Value and Conditional Expectation:

    • E[g(X,Y)]=<em>x</em>yg(x,y)pX,Y(x,y)E[g(X, Y)] = \sum<em>x \sum</em>y g(x, y) \cdot p_{X,Y}(x, y)

    • E[XY=y]=<em>xxp</em>XY(xY=y)E[X|Y=y] = \sum<em>x x \cdot p</em>{X|Y}(x|Y=y)

  • Weighted Average:

    • For conditional random variables of Y denoted as C<em>1C<em>1 and C</em>2C</em>2 with weights a<em>1+a</em>2=1a<em>1 + a</em>2 = 1

      • f<em>Y(y)=a</em>1f<em>C</em>1(y)+a<em>2f</em>C2(y)f<em>Y(y) = a</em>1 f<em>{C</em>1}(y) + a<em>2 f</em>{C_2}(y)

      • F<em>Y(y)=a</em>1F<em>C</em>1(y)+a<em>2F</em>C2(y)F<em>Y(y) = a</em>1 F<em>{C</em>1}(y) + a<em>2 F</em>{C_2}(y)

      • S<em>Y(y)=a</em>1S<em>C</em>1(y)+a<em>2S</em>C2(y)S<em>Y(y) = a</em>1 S<em>{C</em>1}(y) + a<em>2 S</em>{C_2}(y)

      • E[Yk]=a<em>1E[C</em>1k]+a<em>2E[C</em>2k]E[Y^k] = a<em>1 E[C</em>1^k] + a<em>2 E[C</em>2^k]

  • Double Expectation and Law of Total Variance:

    • E[X]=E[E[XY]]E[X] = E[E[X|Y]]

    • Var[X]=E[Var[XY]]+Var[E[XY]]Var[X] = E[Var[X|Y]] + Var[E[X|Y]]

  • Covariance and Correlation Coefficient:

    • Cov[X,Y]=E[XY]E[X]E[Y]Cov[X, Y] = E[XY] - E[X]E[Y]

    • Cov[aX,bY]=abCov[X,Y]Cov[aX, bY] = ab \cdot Cov[X, Y]

    • Cov[X,X]=Var[X]Cov[X, X] = Var[X]

    • Var[aX+bY]=a2Var[X]+b2Var[Y]+2abCov[X,Y]Var[aX + bY] = a^2 Var[X] + b^2 Var[Y] + 2ab \cdot Cov[X, Y]

    • ρX,Y=Corr[X,Y]=Cov[X,Y]Var[X]Var[Y]\rho_{X,Y} = Corr[X, Y] = \frac{Cov[X, Y]}{\sqrt{Var[X]Var[Y]}}

  • Independence:

    • F<em>X,Y(x,y)=F</em>X(x)FY(y)F<em>{X,Y}(x, y) = F</em>X(x) \cdot F_Y(y)

    • f<em>X,Y(x,y)=f</em>X(x)fY(y)f<em>{X,Y}(x, y) = f</em>X(x) \cdot f_Y(y)

    • f<em>XY(xy)=f</em>X(x)f<em>{X|Y}(x|y) = f</em>X(x)

    • f<em>YX(yx)=f</em>Y(y)f<em>{Y|X}(y|x) = f</em>Y(y)

    • E[g(X)h(Y)]=E[g(X)]E[h(Y)]E[g(X) \cdot h(Y)] = E[g(X)] \cdot E[h(Y)]

    • Cov[X,Y]=0Cov[X, Y] = 0

    • ρX,Y=0\rho_{X,Y} = 0

  • Multinomial Distribution:

    • Pr(X<em>1=x</em>1,,X<em>k=x</em>k)=n!x<em>1!x</em>k!p<em>1x</em>1p<em>kx</em>kPr(X<em>1 = x</em>1, …, X<em>k = x</em>k) = \frac{n!}{x<em>1! \cdot … \cdot x</em>k!} \cdot p<em>1^{x</em>1} \cdot … \cdot p<em>k^{x</em>k}

    • E[X<em>i]=np</em>iE[X<em>i] = np</em>i

    • Var[X<em>i]=np</em>i(1pi)Var[X<em>i] = np</em>i(1 - p_i)

    • Cov[X<em>i,X</em>j]=np<em>ip</em>jCov[X<em>i, X</em>j] = -np<em>i p</em>j, for iji \ne j

  • Expectation and Variance for Sum and Average of IID Random Variables:

    • S=X<em>1++X</em>nS = X<em>1 + … + X</em>n

    • X=[X<em>1++X</em>n]/n\overline{X} = [X<em>1 + … + X</em>n]/n

    • E[S]=nE[Xi]E[S] = n \cdot E[X_i]

    • E[X]=E[Xi]E[\overline{X}] = E[X_i]

    • Var[S]=nVar[Xi]Var[S] = n \cdot Var[X_i]

    • Var[X]=(1/n)Var[Xi]Var[\overline{X}] = (1/n) \cdot Var[X_i]

  • Central Limit Theorem:

    • The sum or average of a large number of independent and identically distributed (i.i.d.) random variables approximately follows a normal distribution.

  • Order Statistics:

    • X(k)X_{(k)} = kth order statistic

    • X<em>(1)X<em>{(1)} = min(X</em>1,X<em>2,,X</em>nX</em>1, X<em>2, …, X</em>n)

    • X<em>(n)X<em>{(n)} = max(X</em>1,X<em>2,,X</em>nX</em>1, X<em>2, …, X</em>n)

    • For i.i.d. random variables,

      • S<em>X</em>(1)(x)=[SX(x)]nS<em>{X</em>{(1)}}(x) = [S_X(x)]^n

      • F<em>X</em>(n)(x)=[FX(x)]nF<em>{X</em>{(n)}}(x) = [F_X(x)]^n

      • f<em>X</em>(k)(x)=n!(k1)!(nk)![F<em>X(x)]k1f</em>X(x)[SX(x)]nkf<em>{X</em>{(k)}}(x) = \frac{n!}{(k-1)! (n-k)!} \cdot [F<em>X(x)]^{k-1} \cdot f</em>X(x) \cdot [S_X(x)]^{n-k}

Insurance and Risk Management

  • Learn both discrete and continuous cases

  • Unreimbursed Loss, L

    • If X is the loss and Y is the payment (ie reimbursed loss), then X = Y + L

    • L = X - Y, and E[L] = E[X] - E[Y]

  • Deductible

    • Y = 0, X <= d , X-d, X > d

    • E[Y] = integral(x-d) * fX(x) dx from d to infinity = integral(SX(x)) dx from d to infinity

    • For exponential: d * Pr(X > d)

  • Policy Limit

    • Y = X, X <= u, u, X > u

    • E[Y] = integral(x * fX(x) dx) from 0 to u + u * SX(u) = integral(SX(x) dx) from 0 to u

    • For exponential: u * Pr(X < u)

  • Deductible and Policy Limit

    • Y= 0, X <= d, X-d, d < X < d+u, u, X >= d+u

    • E[Y] = integral((x-d) * fX(x) dx) from d to d+u + u * SX(d+u) = integral(SX(x) dx) from d to d+u

    • For exponential: theta * Pr( d < X < d+u)