In the last post about probability, we talked about what probability is, its history and scope in today’s world. In this post we are going to talk about certain basic properties of probability so as to put some light on (not deeply engaging in mathematical technicalities) the firm mathematical foundation of it. The idea here is to reach the concept of expected value or expectation quickly so that I can introduce you to some finance concepts which depend on it. It is also going to open up the way for the conditional probability which in my opinion is the crux of this subject. Some amount of knowledge of sets such as intersection of two sets, union of two sets, their difference would be essential. I am going to address by and large the following questions in this post:
- What is a sample space and its events?
- What are axioms of probability?
- What is a random variable? Expectation? Variance?
Sample Space
In simple language, a sample space is the set of all the possible ‘outcomes’ we can expect of an ‘experiment’. There are two undefined terms which I am going to explain through examples. So consider tossing a coin, this is our experiment with possible outcomes as a head or a tail so . See in mathematics we can assume any kind of experiment which might not make any sense in real life for example one can consider an experiment of tossing a three-sided coin, with two heads and one tail. This also constitutes an example of valid experiment and outcomes. One can also consider a three-sided die with faces 1,2 and 3. Now suppose we roll the die twice then what could be the outcomes? The careful examination reveals that this is same as rolling two dice so the sample space
in this case is all the ordered pairs, that is,
. Note that the size or cardinality of the sample space is
, in general for an
-sided die with
throws the size of the sample space is
. So for your usual six-sided die rolled once the size of the sample space is
, for the twice case it is
pairs.
An event is a possible subset of the sample space
. In sophisticated mathematical language they are the subsets of
which form something known as a sigma algebra of the subsets of
. Mostly we are not going to be concerned with them as we would mostly be dealing with finite sample spaces. But for the sake of completeness let’s define ‘what is a sigma algebra.?’
A sigma algebra is a collection of subsets of
which satisfies following properties:
- (The empty set is in the collection)
.
- (Closed under complementation) If
, then
.
- (Closed under countable unions) If
, then
.
You should not get scared of the above definition but these things are necessary when you are going to study high level mathematics, more specifically measure theory and related fields, otherwise you don’t need them. For finite sets we consider all the combination (meaning union and intersection of subsets) of subsets as the sigma algebra, one can easily verify that it is indeed a sigma algebra. For example, if we roll a (usual) die twice then we can define an event as the set of all outcomes of the throw where sum of the numbers is even. Let’s find the size of
. So the sum is even when both the numbers on the pair are either even or odd, how many such pairs are there?
so we have size of
,
. Now how can we assign probability to this event
? If there is no other information given we can assume that each outcome is equally likely, that is each of them has equal probability, as the size of the sample space is
we can say that every pair has probability of
. Also we can see that each pair is different from other, that is they are mutually exclusive as a set (meaning
, they have nothing in common). For more than two sets, let’s say
we say that this collection of sets are pairwise disjoint if
for every
. We could add their individual probability to get the probability of their union. Now using this we can say that probability of
, added
times since size of
is
and probability of each outcome is
. So
. Let’s make this process more general by making them as axioms in the next section.
Axioms of probability
If you are new to axioms shaxioms, let me give you a brief description about their purpose in mathematics. They are basically a combination of what alphabet and grammar is to a language. They contain certain undefined things for example there is no exact definition of what is a set rather we have some agreed axioms which must be satisfied by these sets. Together, the sets and their axioms, form the building block of all of mathematics, which has a very interesting history. Anyway axioms make our study of mathematical objects and relations among them precise and well defined. So let me present here the axioms of probability based on the approach of the mathematician A.N. Kolmogorov.
Given a sample space and an associated sigma algebra
, a probability function is a function P with domain
that satisfies
for all
.
.
- If
are pairwise disjoint, then
.
Any function that satisfies the three axioms of probability mentioned above is called a probability function. In mathematical language, a set
with sigma algebra
and a probability function
is called as a probability space, denoted by
. Unless we are dealing with theorems we can usually get away with calling
as a sample space with understood sigma algebra and probability function. In coin toss experiment, we can assign the probabilities to each of the events in many ways, for example if we assume that the two events (Head or Tail) are equally likely then we know by axioms that
, which give each of them value of half as they are equal, this type of coin is called a fair coin. But we can give different probabilities to these events too as long as they satisfy our axioms of probability there is no issue. So suppose we define
and
this is also valid but you can see that such a coin wouldn’t be fair, it would be rigged towards head.
Some properties of probability function
If is a probability function and
and
are any event of the sample space
then,
;
;
, where
is the complement of
;
;
- If
then
.
Random Variable
A real valued function defined on a sample space is called a random variable. Although it is called a variable, it is a function, random denotes the randomness in the outcomes of the sample space after we perform an experiment. For example, in the coin toss experiment we can define a random variable as when we get head its value is
, otherwise
. So using a random variable we try to associate a numerical value to each outcome of the experiment. The random variables are further divided into two categories, discrete random variables and continuous random variables. We call a random variable discrete if its range is countable, that is if it is finite or countably infinite (like natural numbers we can arrange them as
and so on), otherwise it is called a continuous random variable. When
is a random variable we can define other random variables using
such as
,
etc.
Expectation
In this post, we won’t be discussing the continuous random variables let’s leave it for the future topic. Let’s talk about expected value or expectation of a (discrete) random variable. Mathematically, expectation of a random variable is defined as , where
‘s are all the values the random variable
can take and
is the corresponding probability. It is simply weighted mean of all the values the random variable takes. It is also called mean or simply average and is denoted by
. For example, suppose we define a random variable
based on a betting game of tossing a fair coin where you win
when head turns up and you lose
when tail comes up. So
can be thought of taking values
when winning and
when losing. Now the question is should you take the bet? These kinds of questions are answered by computing
and if
you should take the bet else not, remember here positive means winning. Let’s calculate,
, so you should take the bet and what we mean by this is on average you would win
.
We can also define the expectation of any random variable, say defined using another random variable, say
, for example
. for this
. In general, for any function
we can define
. Using the definition of expectation one can easily show that
, where
are constants,
is a random variable (Hint: use the fact that
).
Variance
There is another very useful concept associated with expectation which is known by the name of ‘variance’. It simply measures the spread of the given random variable from the mean or the expectation. Mathematically, , is the definition of variance of
, where
. Let’s calculate the variance from the preceding example, we know that
, therefore
, where
. The square root of variance of a random variable
is known as standard deviation, and is denoted by
.
References
[2] is the book for the beginners with plenty of examples, [1] is slightly more mathematical but a good introductory text in Statistics, and [3] is a good introduction to probability for mathematically oriented learners.
Leave a comment