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).   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,  because an infinite set can have non-empty subsets of probability 0.
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.  
Let be a probability space. An event happens almost surely if . Equivalently, happens almost surely if the probability of not occurring is zero: . More generally, any event (not necessarily in ) happens almost surely if is contained in a null set: a subset in such that .  The notion of almost sureness depends on the probability measure . If it is necessary to emphasize this dependence, it is customary to say that the event occurs P-almost surely, or almost surely .
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.
Consider the case where a (possibly biased) coin is tossed, corresponding to the probability space , where the event occurs if a head is flipped, and if a tail is flipped. For this particular coin, it is assumed that the probability of flipping a head is , from which it follows that the complement event, that of flipping a tail, has probability .
Now, suppose an experiment were conducted where the coin is tossed repeatedly, with outcomes and the assumption that each flip's outcome is independent of all the others (i.e., they are independent and identically distributed;i.i.d). Define the sequence of random variables on the coin toss space, where . i.e. each records the outcome of the th flip.
In this case, any infinite sequence of heads and tails is a possible outcome of the experiment. However, any particular infinite sequence of heads and tails has probability 0 of being the exact outcome of the (infinite) experiment. This is because the i.i.d. assumption implies that the probability of flipping all heads over flips is simply . Letting yields 0, since by assumption. The result is the same no matter how much we bias the coin towards heads, so long as we constrain to be strictly between 0 and 1. In fact, the same result even holds in non-standard analysis—where infinitesimal probabilities are not allowed. 
Moreover, the event "the sequence of tosses contains at least one " will also happen almost surely (i.e., with probability 1). But if instead of an infinite number of flips, flipping stops after some finite time, say 1,000,000 flips, then the probability of getting an all-heads sequence, , would no longer be 0, while the probability of getting at least one tails, , would no longer be 1 (i.e., the event is no longer almost sure).
In asymptotic analysis, a property is said to hold asymptotically almost surely (a.a.s.) if over a sequence of sets, the probability converges to 1. For instance, in number theory, a large number is asymptotically almost surely composite, by the prime number theorem; and in random graph theory, the statement " is connected" (where denotes the graphs on vertices with edge probability ) is true a.a.s. when, for some
- Almost everywhere, the corresponding concept in measure theory
- Convergence of random variables, for "almost sure convergence"
- Cromwell's rule, which says that probabilities should almost never be set as zero or one
- Degenerate distribution, for "almost surely constant"
- Infinite monkey theorem, a theorem using the aforementioned terms
- List of mathematical jargon
- "The Definitive Glossary of Higher Mathematical Jargon — Almost". Math Vault. 2019-08-01. Retrieved 2019-11-16.
- Weisstein, Eric W. "Almost Surely". mathworld.wolfram.com. Retrieved 2019-11-16.
- "Almost surely - Math Central". mathcentral.uregina.ca. Retrieved 2019-11-16.
- Grädel, Erich; Kolaitis, Phokion G.; Libkin, Leonid; Marx, Maarten; Spencer, Joel; Vardi, Moshe Y.; Venema, Yde; Weinstein, Scott (2007). Finite Model Theory and Its Applications. Springer. p. 232. ISBN 978-3-540-00428-8.
- Jacod, Jean; Protter (2004). Probability Essentials. Springer. p. 37. ISBN 978-3-540-438717.
- Williamson, Timothy (2007-07-01). "How probable is an infinite sequence of heads?". Analysis. 67 (3): 173–180. doi: 10.1093/analys/67.3.173. ISSN 0003-2638.
- Friedgut, Ehud; Rödl, Vojtech; Rucinski, Andrzej; Tetali, Prasad (January 2006). "A Sharp Threshold for Random Graphs with a Monochromatic Triangle in Every Edge Coloring". Memoirs of the American Mathematical Society. AMS Bookstore. 179 (845): 3–4. doi: 10.1090/memo/0845. ISSN 0065-9266. S2CID 9143933.
- Spencer, Joel H. (2001). "0. Two Starting Examples". The Strange Logic of Random Graphs. Algorithms and Combinatorics. 22. Springer. p. 4. ISBN 978-3540416548.