Probability Theory
- tags
- Math
Random variables and probability functions
First lets define some basic objects for thinking about the world probabilistically. For an event space \(\Sigma\) with events sampled from that space \(A \in \Sigma\). We assign a real value \(\Prob(A) \in \reals\) to every event in the space and call \(\Prob\) a probability distribution or probability measure if it follows the following axioms:
- \(\Prob(A) \geq 0 \forall A\)
- \(\Prob(\Sigma) = \sum_{A \in \Sigma} \Prob(A) = 1\)
- If the events are disjoint then
\[\Prob(\cup_{i} A_i) = \sum_i \Prob(A_i)\]
A Random Variable is a mapping from outcome spaces to real numbers \(X: \Sigma \rightarrow \reals\) that assigns a real value to \(X(\omega)\) to each outcome \(\omega\).
Given a random variable \(X\) we can define the cumulative distribution function (CDF) \(F_X: \reals \rightarrow [0, 1]\) of a random variable \(X\) is defined by \[ F_X(x) = \Prob(X \leq x) \]
(Example from (Wasserman 2004)) Flip a fair coin twice and let \(X\) be the number of heads. Then \(\Prob(X=0)=\Prob(X=2) = \frac{1}{4}\) and \(\Prob(X=1) = \frac{1}{2}\). The distribution function is \[ F_{X}(x) = \begin{cases} 0 \quad &x<0 \\ \frac{1}{4} \quad &0 \leq x < 1 \\ \frac{3}{4} \quad &1 \leq x < 2 \\ 1 \quad &x \geq 2. \end{cases} \]
A function F which maps the real line to \([0, 1]\) is a CDF if and only if:
- F is non-decreasing: \(x_1 < x_2 \rightarrow F(x_1) \leq F(x_2)\)
- F is normalized: \(\lim_{x\rightarrow-\infty} F(x) = 0\) and \(\lim_{x\rightarrow\infty} F(x) = 1\)
- F is right continuous: \(F(x) = F(x^+)\) where \(x^+\) implies approaching \(x\) from above.
We must define two probability functions depending on whether the random variable \(X\) is discrete or continuous. If the variable is discrete then we define the probability mass function for \(X\) by \[ f_X(x) = \Prob(X=x). \]
If the random variable \(X\) is continuous if there exits a function \(f_X\) such that
- \(f_X(x) \geq 0 \forall x \in X\)
- \(\int_{-\infty}^{\infty} f_X(x)dx = 1\)
- and for every \(a \leq b\) \[ \Prob(x < X < b) = \int_a^b f_X(x)dx. \]
The function \(f_X\) is called a probability density function we have that \[ F_X(x) = \int_{-\infty}^{x} f_X(t)dt \]
and \(f_X(x) = F^\prime_X(x)\) at all points \(x\) at which \(F_X\) is differentiable.
Expectations and different moments
The expected value, or mean, or first moment of \(X\) is defined to be
Basic Inequalities
Central Limit Theorem
Questions
- Central limit theorem
- Different kinds of probability distributions and when you would use them?
- What is PDF and CDF?
- What are the different moments and what do they mean?
- What is skewness?
- Different kinds of proving convergence.