Random Variables and CDFs
Week 3
Reading - Random Variables Generalities (FT 3)
Definition
We can consider a mapping between all of the sets in the -algebra of one measurable space to another sample space , where the mapping is measurable each set has a mapping. A random variable is a measurable function where the target sample space is the Borel set. Random variables are capital letters and their values are lowercase letters.
The sum, product, or composition of measurable functions are measurable functions, so those are still random variables.
We consider the preimage of to be , which is not precisely the inverse function. Itβs the set in the -algebra in the input sample space which generated the set .
Distribution
The distribution of a random variable is itself a random variable, denoted by . This variable is defined on the Borel set as a probability on the measurable space. We can consider the probability space of the distribution to be i.e. the sample space is all real numbers, the function mapping is the Borel subset (every interval and combination of such), and the distribution is the probability measure.
If we have a sequence of disjoint sets in the Borel subset of , then the distribution of () on the unions of those sequences is the same as the sum of the probability measure on each individual set.
We will consider the notation to mean that thereβs an outcome in sample space which maps to the set in
Cumulative Distribution Function
Formally, the cdf of a random variable is or the probability measure of the outcomes where the mapping to the real numbers is less than a specified number x.
This function has the properties that it is increasing, right continuous, and it approaches 0 and 1 from left and right, respectively.
The infinimum is the largest element smaller than every element of a set (aka itβs the element just to the left of the set in the order) and the supremum is the element to the right.
If we consider the variable.
For every cdf that exists, there exists a random variable that has that cdf.
A Borel function is a measurable function that maps from into .
Lecture Notes
CDF
with , where
These are equivalent ways of writing a cdf. This counts the accumulated probability less than or equal to x.
More interestingly, the cdf has these properties: increasing
The increasing property is fairly intuitive. Rigorously, you can show that for , . The interval from x to y must be 0 or greater, so then the cdf to y must be greater than the cdf to x.
You can also show that itβs right continuous, proof is beyond the scope, involves monotone class
for any x in the domain.
Letβs examine the first quadrant of an equation. We have . If we imagine the difference between that and , in a continuous function this is well-defined. But we might have a discontinuous function. This cannot be a cumulative distribution function. This is a complicated statement.
We can prove this by showing that
Why is this empty set? Because if you have the interval , left open interval says I donβt have it, right says I do, because they conflict then there must be an empty set.
This just becomes the probability measure of the sample space which is definitionally 1.
Most of the focus in this course will be calculation and not proof. But if you understand the proof, it will guide you in calculations.
Lemma 3.11: If we have as the cdf, then
This is known as the survival function. If you survive over sixty years, then you get your retirement money. This assumes that which is true if is a continuous random variable.
Proof is
Important identity:
This proof comes from the set inequality:
And then if we take the probability measure of all of these then we see that the right side is the cdf of y, left side is cdf of x disjoint with the other part so you can add them by earlier definition
Also known
this is us taking the left limit where
consequences of this? If this is left-continuous, it means that the limit is equal, which means this whole thing is equal to 0. However, itβs not left-continuous, then strictly larger than 0. This looks like when the dot is on the right and the open circle is on the left. This is allowed, and it happens when is a discrete random variable. Binomial, Poisson, Geometric random variables are all discrete.
Numerical
Roll a die, probability that number is smaller than five. (strictly less than on an exam)
alternatively, I could do the same with 5 and 6 and use the 1 - property. Two random variables are independent if
or put another way
Intuitively, this means that the outcome of does not affect the outcome of .
For any , where are independent
are mutually independent if
They are also pairwise independent in this case.
For an arbitrary family of random variables where we have some index set for , they are mutually independent if every finite subfamily is independent. That means any finite subset of the indices will cause this to be the case. This is not very useful as a way to prove independence because there are so many cases to prove, this is just a definition.
Letβs say we roll a fair die twice and we have represent the maximum of both rolls. The first question weβre interested in calculating the image of through and the distribution of .
total of 36 elements
the probability of observing any particular outcome is because itβs fair. This is clearly a mapping from the sample space to the set of six numbers. If we calculate probabilities:
This is 3 then 2 because you donβt want to double count the same number.
Now letβs get the cdf . Letβs consider each instance of
Obviously, this has to be 0 for less than 1 because thatβs not an outcome. For the rest of them, you add up the probabilities (because theyβre disjoint).
Another example.
You are given
We want to know the probability for up to 3.
We can solve for
We also want to show this inequality
You want to show that
Hint:
More interesting example 3.4
cdf
you have to find the conditions on a, b, c, d, that satisfies the properties of a cdf.
We have the property
Because thatβs if .
a gives you the same solution of 0.