34
$\begingroup$

I recently asked a question and got a great answer that involved proving that "X is almost surely one of the roots of P".

I know (now) that "almost surely" means "with probability 1", but I've never understood why that phrase exists.

When something has a probability of 1, it's going to happen, no almost about it. What's the story there? I've tried looking this up online, but I just got more definitions, not meaningful explanations.

$\endgroup$
2
  • 13
    $\begingroup$ Suppose you pick a number at random between $0$ and $1$. The probability is $1$ that you will not pick $.5$. Yet, you can't rule out the possibility of picking $.5$. $\endgroup$
    – littleO
    Sep 20, 2015 at 3:37
  • 3
    $\begingroup$ Probability-0 events can happen: what's the probability that a uniformly distributed random variable $U[0,1]$ takes the value $a$, for a given $a \in [0,1]$? $\endgroup$
    – Chappers
    Sep 20, 2015 at 3:39

3 Answers 3

34
$\begingroup$

In terms of the sample space of events $Ω$, an event $E$ happens almost surely if $P(E) = 1$, whereas an event happens surely if $E=Ω $.

An example: suppose we are (independently) flipping a (fair) coin infinitely many times. The event

$$\{ \text{I will get heads infinitely often}\}$$ is an almost sure event (because it is possible get only a finite number of heads...but how likely is that? Rigorous proof uses Borel Cantelli, if you are interested)

In contrast, $$\{\text{ I will get heads or tails on my 16th flip} \}$$ must happen. This is a sure event.

$\endgroup$
8
  • 1
    $\begingroup$ I think you meant that the negation of the first event is almost sure. $\endgroup$
    – yoann
    Sep 20, 2015 at 9:19
  • $\begingroup$ As in? $P(\text{heads i.o}) = 0$? $\endgroup$ Sep 20, 2015 at 9:20
  • 1
    $\begingroup$ @yoann: the second Borel Cantelli lemma (en.wikipedia.org/wiki/Borel–Cantelli_lemma) states that if $A_n$ are independent events with $∑P(A_n) = ∞$, then $A_n$ occurs infinitely often (the event $A_n\ i.o$ is precisely $\limsup_{n→∞} A_n$). Here $A_n = \{\text{$n$th flip is heads}\}$ and $P(A_n) = 1/2$ so we do indeed have $P(A_n i.o) = 1$. $\endgroup$ Sep 20, 2015 at 9:38
  • 1
    $\begingroup$ @yoann I also misread that; you need to read it as "I will get an infinite number of heads, ignoring any tails that I get" rather than "I will only get heads" $\endgroup$
    – Dave
    Sep 20, 2015 at 9:58
  • 1
    $\begingroup$ @Dave Ah, I see the confusion. Sorry :) In my defense, 'infinitely often' is reasonably standard notation. The situation is not unlike the fact that as I move along the positive integers $n=1,2,3,…$, $n$ will be even infinitely often, but I make no claims that it happens all the time(or even at what frequency!). $\endgroup$ Sep 20, 2015 at 10:07
10
$\begingroup$

There is a difference between "almost surely" and "surely."

Consider choosing a real number uniformly at random from the interval $[0,1]$. The event "$1/2$ will not be chosen" has probability $1$, but is not impossible.

I recommend reading the relevant Wikipedia article, which I found very clarifying when I was learning probability.

$\endgroup$
1
  • 7
    $\begingroup$ To clarify the difference between 'surely' and 'almost surely': if you pick a real number uniformly at random from $[0,1]$, you will almost surely pick a number larger than zero, and surely pick a nonnegative number. $\endgroup$
    – Hugh
    Sep 20, 2015 at 12:43
3
$\begingroup$

Subtle difference is present.

If some event occurs, then it has probability measure $1$. But if some event occurs with probability $1$, then the event need not occur, and the event that the event does not occur has probability measure $0$.

Note that probability is not about what happenED, for if so then we do not need probability theory. Probability is about what may happen.

So it is not that a random walk must go back to the origin, but that it will go back to the origin with probability $1$.

You may be referred to the original, axiomatic treatment of probability by A. Kolmogorov

$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .