A probability space is a measure space whose total measure is one. Its measurable subsets are events, and its measure is their probability.
An almost sure event is a measurable event of probability one. Countable intersections of such events still have probability one, allowing a conclusion to hold simultaneously for countably many parameter choices. Further deterministic reasoning may then extend it to uncountably many parameters, as in Brownian Hölder regularity or nowhere monotonicity of Brownian motion. An uncountable intersection need not preserve probability one without such additional reasoning.
A probability measure is tight if compact sets carry arbitrarily nearly all its mass. Every Borel probability measure on a Polish space is tight. The stronger family condition is uniform tightness.
For càdlàg processes on a finite horizon, compact containment together with uniformly small increments over pairs of bounded stopping times whose separation tends to zero is a sufficient criterion for tightness in the Skorokhod J1 topology. The increment condition is in probability, not merely at deterministic times. If in addition the largest jump tends to zero in probability, every limiting law is supported on continuous paths.
The same compact set must work simultaneously for every measure in the family. Prokhorov's theorem relates this condition to relative compactness for the weak topology of probability measures on a Polish space.
A zero-probability event has probability measure zero. It need not be empty: for a continuously distributed random variable, equality with a specified value is such an event. The complementary event occurs almost surely.
For observations or orbit points , the empirical measure is . Integrating a test function gives its sample average. For orbit points , the difference between and telescopes to , so on a compact metric space with continuous , every weak limit is invariant.
If finite Borel measures and on satisfyfor every compactly supported continuous function , then . This follows from the uniqueness part of the Riesz representation theorem; alternatively, continuous functions that approximate indicators from above and below recover the measure of every interval and hence every Borel set.
The Kolmogorov axioms require a probability measure to be nonnegative, normalized by , and countably additive on pairwise disjoint events.
The event that does not occur has probability . Conditioning on an event positively associated with negatively associates its complement with .
Two events are disjoint when they cannot both occur. For a finite family of pairwise disjoint events, the probability of their union is the sum of their probabilities, so that sum is at most one. This condition differs from the condition defining independent events.
On a product space , the cylinder sigma-algebra is generated by coordinate projections. Every event in it depends on at most countably many coordinates.