# Almost surely

In probability theory, an event is said to happen **almost surely** (sometimes abbreviated as **a.s.**) if it happens with probability 1 (or Lebesgue measure 1).^{[1]} In other words, the set of possible exceptions may be non-empty, but it has probability 0. The concept is analogous to the concept of "almost everywhere" in measure theory.

In probability experiments on a finite sample space, there is often no difference between *almost surely* and *surely* (since having a probability of 1 often entails including all the sample points). However, this distinction becomes important when the sample space is an infinite set,^{[2]} because an infinite set can have non-empty subsets of probability 0.

Some examples of the use of this concept include the strong and uniform versions of the law of large numbers, and the continuity of the paths of Brownian motion.

The terms **almost certainly** (a.c.) and **almost always** (a.a.) are also used. **Almost never** describes the opposite of *almost surely*: an event that happens with probability zero happens *almost never*.^{[3]}

In general, an event can happen "almost surely", even if the probability space in question includes outcomes which do not belong to the eventâ€”as the following examples illustrate.

Imagine throwing a dart at a unit square (a square with an area of 1) so that the dart always hits an exact point in the square, in such a way that each point in the square is equally likely to be hit. Since the square has area 1, the probability that the dart will hit any particular subregion of the square is equal to the area of that subregion. For example, the probability that the dart will hit the right half of the square is 0.5, since the right half has area 0.5.

Next, consider the event that the dart hits exactly a point in the diagonals of the unit square. Since the area of the diagonals of the square is 0, the probability that the dart will land exactly on a diagonal is 0. That is, the dart will *almost never* land on a diagonal (equivalently, it will *almost surely* not land on a diagonal), even though the set of points on the diagonals is not empty, and a point on a diagonal is no less possible than any other point.

In number theory, this is referred to as "almost all", as in "almost all numbers are composite". Similarly, in graph theory, this is sometimes referred to as "almost surely".^{[7]}