next up previous
Next: About this document ...

Lecture 8: Distribution functions
Not all random variables are discrete, nor, for modeling purposes, would we want to restrict our attention to discrete random variables. If we return, for a moment, to the problem of modeling ``draw a real number at random from [0,1]'' we noted that given any interval ${\cal I}\subset[0,1]$, the event that the number drawn is in $\cal I$ should have probability equal to the length of $\cal I$. Hence we want a probability space where $\Omega = [0,1]$, where the sigma field contains all subintervals of [0,1], and where the probability measure of an interval is its length. It is shown in courses on measure theory that such a probability space exists. (See, for example, Real and Complex Analysis by Walter Rudin.) The relevant random variable for this this example is $R(\omega) = \omega$. Here the range of R is all of [0,1], and as we explained earlier,

\begin{displaymath}
p_R(y) = \Pr(\{\omega:R(\omega) = y\}) = 0\end{displaymath}

for every y! Hence there is nothing to be gained from looking at the probability mass function. The solution is look at something different, called the distribution function of R, denoted by FR, defined by

\begin{displaymath}
F_R(t) = \Pr(\{\omega:R(\omega) \leq t\}).\end{displaymath}

Every random variable has a distribution function, and all the information about probablities involving the random variable can be derived from its distribution function.

For the moment, observe that

\begin{displaymath}
\Pr(R \in (a,b]) = \Pr(R \leq b) - \Pr(R \leq a) = F_R(b) - F_R(a).\end{displaymath}

Also notice that any distribution function is non-decreasing and has range contained in $(-\infty,\infty)$.

We will have to have another look at properties of probability measures to show how to use the distribution function to compute $\Pr(R \in {\cal I})$ for any interval.

Continuity properties of probability measures and distribution functions
Consider a sequence of events, $A_1 \subset A_2 \subset A_3\cdots$. We have

\begin{displaymath}
\bigcup_{j=1}^N A_j = A_N.\end{displaymath}

Define the limit of these sets, denoted by $\lim_{j\rightarrow \infty}A_j$ by

\begin{displaymath}
\lim_{j\rightarrow \infty}A_j = \bigcup_{j=1}^\infty A_j.\end{displaymath}

One justification for considering this to be a limit is that the sets An expand out to give us all of the union of the An. The following is an important consequence of the additivity axiom for probability measures:
If $A_1 \subset A_2 \subset A_3\cdots$, then

\begin{displaymath}
\lim_{n\rightarrow\infty}\Pr(A_n) = \Pr(\lim_{n\rightarrow\infty}A_n).\end{displaymath}

This is called the continuity property of probability measures, and is in fact, equivalent to the additivity axiom. The proof is relatively straightforward.

Put B1=A1 and Bn = An-An-1 for n > 1. The events Bn are disjoint and for each positive integer n

\begin{displaymath}
A_n = B_1 \cup B_2 \cup \cdots \cup B_n\end{displaymath}

From this we see that

\begin{displaymath}
\lim_{n\rightarrow\infty}A_n = B_1 \cup B_2 \cup \cdots.\end{displaymath}

Therefore

\begin{displaymath}
\begin{array}
{rcl}
\Pr(\lim_{n\rightarrow\infty}A_n)
& = &
...
 ...s\cup B_n)\ & = &
\lim_{n\rightarrow\infty}\Pr(A_n)\end{array}\end{displaymath}

as we claimed.

It is also the case that if we have events $\cdots
C_n\subset C_{n-1}\subset\cdots\subset C_1$ and we define

\begin{displaymath}
\lim_{n\rightarrow} C_n = C_1\cap C_2 \cap \cdots\end{displaymath}

then

\begin{displaymath}
\lim_{\rightarrow\infty}\Pr(C_n)
= 
\Pr(\lim_{n\rightarrow} C_n)\end{displaymath}

This is easily derived from the previous result by using Boole's identities.

These results are used to investigate the continuity of distribution functions. Let FR be the distribution function of the random variable R. Since distribution functions are non-decreasing they have left and right hand limits at all points. To see if FR is continuous at t it is suffient to check to see if

\begin{displaymath}
\begin{array}
{c}
\lim_{n\rightarrow\infty} F_R(t + n^{-1})\ \lim_{n\rightarrow\infty} F_R(t - n^{-1})\end{array}\end{displaymath}

converge to FR(t) when n takes only integer values. Fix a value t and let

\begin{displaymath}
C_n = R \in (-\infty,t+n^{-1}]\end{displaymath}

Observe that these sets are a nested decreasing sequence of events, and

\begin{displaymath}
\lim_{n\rightarrow\infty}C_n \equiv C_1\cap C_2 \cap C_3 \cap \cdots = R \leq
t. \end{displaymath}

Therefore

\begin{displaymath}
\lim_{n\rightarrow\infty}F_R(t+n^{-1}) = \lim{n\rightarrow\i...
 ...)
=
\Pr(\lim_{n\rightarrow\infty}C_n) = \Pr(R \leq t) = F_R(t),\end{displaymath}

so a distribution function is always continuous from the right.

Now put

\begin{displaymath}
A_n = R \in (-\infty,t-n^{-1}]\end{displaymath}

Observe that these sets are a nested increasing sequence of events, and

\begin{displaymath}
\lim_{n\rightarrow\infty}A_n \equiv A_1\cap A_2 \cap A_3 \cap \cdots = R < t. \end{displaymath}

Therefore

\begin{displaymath}
\lim_{n\rightarrow\infty}F_R(t-n^{-1}) = \lim{n\rightarrow\infty}\Pr(A_n)
=
\Pr(\lim_{n\rightarrow\infty}A_n) = \Pr(R < t),\end{displaymath}

and since

\begin{displaymath}
\begin{array}
{rcl}
R \leq t &=& (R < t)\cup (R = t)\ F_R(t) &=& \Pr(R<t) + p_R(t)\end{array}\end{displaymath}

we have

\begin{displaymath}
\lim_{x\rightarrow t^-}F_R(t) = F_R(t) - p_R(t)\end{displaymath}

so that FR is continuous from the right at t if and only if the probability that R equals t is zero. Therefore, FR is continuous at t if and only if the probability that R equals t is zero, and the jump in FR at t is equal to the probability that R equals t. The values of t for which FR jumps are called the atoms of the distribution of R. The limit from below at t of FR is denoted FR(t-). With this notation we have $\Pr(R < t) = F_R(t^-)$. Therefore,

\begin{displaymath}
\begin{array}
{rcl}
\Pr(a < R \leq b) & = & F_R(b) - F_R(a)\...
 ...(a)\ \Pr(a \leq R \leq b) & = & F_R(b^-) - F_R(a^-)\end{array}\end{displaymath}

so we have represented the probability that R is in any type of interval in terms of the distribution function of R.

In fact, a distribution function F is characterized by the following properties

It can be shown that for any function F with these properties there is a probability model $(\Omega,{\cal F},\Pr)$ and and a random variable R so that F is the distribution function of R.

Independence of random variables in general

We can show that any pair of random variables R and S is independent if for any pair of real numbers x and y,

\begin{displaymath}
\Pr(R < x, S < y) = F_R(x)F_S(y)\end{displaymath}

The function of two variables, FR,S defined by

\begin{displaymath}
F_{R,S}(x,y) = \Pr(R < x, S < y) \end{displaymath}

is called the joint distribution function of R and S. More generally, if $V = (V_1, \cdots, V_n)$ is a vector-valued random variable, its joint distribution function, FV, is the function on $(-\infty,\infty)^n$ defined by

\begin{displaymath}
F_V(x) = \Pr(V_1 \leq x_1, \cdots, V_n \leq x_n).\end{displaymath}

It can be shown that the components of V are independent if and only if

\begin{displaymath}
F_V(x) = \Pr(V_1 \leq x_1, \cdots, V_n \leq x_n) = \prod_{j=1}^n \Pr(V_j \leq
x_j) = \prod_{j=1}^n F_{V_j}(x_j). \end{displaymath}



 
next up previous
Next: About this document ...
Eric S Key
10/1/1998