Scenario-1:
You are playing a game with your friend, which involves rolling a single die once. The rules of the game are that you’ll win if an even number shows up while your friend will win if an odd number shows up.
It should be immediately apparent to you that both you and your friend are equally likely to win this game. Why? Because you win in three possible cases, i.e, if one of the numbers
,
or
shows up, while your friend wins if one of
,
or
shows up. Since for a (fair) die, each of the six faces is equally likely to show up, we can safely state that since both of you have
favorable cases to your credit respectively, both of you are equally likely to be the winner.
Can we somehow quantify this discussion? That is, can we somehow assign numerical values to the various chances involved? It turns out that we can, and in a way that is very intuitively appealing, as follows:
Technically, we term any incident, an event (we will define events more precisely later; for the time being, just think of an event as an incident). Now, if an event
is sure to occur, we say that the probability of the occurrence of
is
, and we write this as
On the other hand, if an event
is sure not to occur, we say that the probability of the occurrence of
is
, and we write this as
For any event
that is likely to happen, we should then have
which means that the probability of
occurring must lie between
and
; it can be
at the most which implies that
is sure to occur; it can be
at the least which implies that
is sure not to occur.
Here are some simple examples:
Event | |
Event | |
Event |
Thus, we must have,
Coming back to the die-game you and your friend were playing, let us assign a numerical value to the chance of any of the six faces showing up.
This should be easy! There are six faces, and it is easy to observe that each of these six faces is equally likely to show up, which means that there is no reason why we should believe one face to be more likely to turn up than any other.
Thus, if we let
denote the probability of the
face turning up, we must have,
What we’ve stated till now is just that each of the six faces is equi-probable; we still haven’t obtained the numerical values to these probabilities.
To do so, observe that one of the six faces must show up:
Thus, we can intuitively assert that the probabilities of the six faces showing up must sum to
, because one face must show up. This means that
From
and
, we have
So far, so good! However, we’ve still not given any rigorous justification for
. For now, you’ll have to accept the validity of
on faith.
Now, the game’s rules were that you’ll win if an even number turns up. Thus, if we let
denote the event of you being the winner, we can safely state (according to what we’have been doing till now) that,
Similarly, if we let
denote the event that your friend wins, we should have
Thus, both you and your friend have a probability
of winning the game. This should have been otherwise obvious also! Since
and
must be equi-probable, and we also have
we must have |
Well, the preceeding discussion was too long for too simple an example. But it was necessary to get you tuned to the flavor of this subject.
No comments:
Post a Comment