Algebra of sets Created 2026-10-06 Updated 2026-10-25
A nonempty collection of subsets of a fixed universe closed under complements and finite unions, hence also finite intersections. It generates a sigma-algebra by allowing countable set operations. A countable generating algebra provides one simultaneous family of test indicators for measure-theoretic arguments.
Let have the fair Bernoulli distribution and set for every . Each coordinate has the same fair probability distribution as in the independent model, but the coordinates are dependent: , whereas the product of the marginal probabilities is . Every future sigma-algebra equals , so the tail sigma-algebra also equals .
The tail event of infinitely many heads is now exactly , with probability . For the finite-window events in infinitely many heads as a tail event,
The sample space can even be the same full Cartesian product in both models: the dependent probability measure assigns mass to each of the all-zero and all-one sequences. Then is the same literal tail event in both models. Only the probability measure and its independence properties change.
Figure 1.
More independent trials increase the chance of a head; repeated copies of one coin do not
. Exact constructed probabilities for at least one head in a window of coordinates. The independent curve is and tends to one; the shared-coin curve stays at . These are calculations from the two specified probability measures, not measurements or simulated frequencies. Details.
In the Ellentuck topology, suppose every open set is completely Ramsey and every meagre set is completely Ramsey-null. If is contained in a meagre set for some open , first refine a basic neighbourhood without changing its stem to avoid that exceptional set, and then refine again to be homogeneous for . The resulting neighbourhood is homogeneous for . Sets with such an open representative form a sigma-algebra: countable unions collect the meagre errors, and complements replace by its interior, differing only on the nowhere-dense boundary of . This proves that all star-Borel sets are completely Ramsey.
Boole's inequality 2026-10-14
Boole's inequality, also called the union bound, bounds the probability that at least one of several events occurs by adding their individual probabilities. For a finite or countable family of events in the same probability space,
The union includes outcomes where several events occur together. There is no independence assumption: adding the individual probabilities counts such outcomes repeatedly, which can only make the sum larger. The cap at one uses the total mass of a probability measure. For infinitely many events, the sum is a nonnegative series, possibly infinite; an infinite sum gives only the bound one. This is countable subadditivity of a measure specialized to a probability measure. See Probability: Theory and Examples (fifth edition) by Rick Durrett (Section 1.1, Theorem 1.1.1(ii), printed p. 2).
For example, choose uniformly from the twelve outcomes , using the discrete uniform distribution. Put . If , these are disjoint events and their union has probability , exactly the union bound. If , the union has only six outcomes, so its exact probability is , although both individual probabilities are still and the bound is still . If , the exact probability falls to with the same bound. These examples isolate overlap in the union bound by keeping the individual probabilities fixed.
Figure 1.
The same individual event probabilities give different exact union probabilities as overlap increases
. Each panel is a fully specified discrete uniform distribution on twelve numbered outcomes. Blue means only, orange means only, purple means their intersection, and white means neither. The bottom bars compare the exact union probability with the sum of the individual probabilities. The three unions contain eight, six, and four outcomes; the sum counts eight in every panel. Details.
The union bound is useful when each event is easy to control but their joint behavior is difficult to determine. A short proof uses indicator functions: at every outcome,
Taking expected values and using linearity of expectation proves the finite bound.[ref] For a countable family, the finite unions increase to the full union; continuity of probability passes the finite inequalities to the limit. The closure of a sigma-algebra under countable unions ensures that this limiting union is an event. For the continuity of probability step, see Probability: Theory and Examples (fifth edition) by Rick Durrett (Section 1.1, Theorem 1.1.1(iii), printed p. 2).
Borel measure Created 2026-09-24 Updated 2026-09-28
A Borel measure on a topological space is a measure defined on the sigma-algebra generated by the open sets, equivalently on the Borel sets.
Borel set Created 2026-09-24 Updated 2026-10-14
A Borel set in a topological space belongs to the smallest sigma-algebra containing every open set.
Borel sigma-algebra Created 2026-09-29 Updated 2026-10-31
The Borel sigma-algebra of a topological space is the sigma-algebra generated by its open sets. Its members are exactly the Borel sets.
Bounded Girsanov density for exit of an unstable linear diffusion Created 2026-10-14 Updated 2026-11-05
Under , let be standard Brownian motion started at zero and let be its first exit from . The Itô formula makes
the stochastic exponential with integrand . Since , it is a uniformly integrable martingale and defines on the whole original sigma-algebra. The Girsanov theorem makes a Brownian motion under .
At exit, and , so . On , integrate these likelihood bounds in to obtain
A lower bound on gives an upper bound on in terms of ; reversing that direction gives an invalid comparison.
For a probability law on , take the sequence space with product measure . The coordinate maps form an independent and identically distributed sequence with common law , and they generate the product sigma-algebra.
Carathéodory's criterion Created 2026-10-14 Updated 2026-10-31
A set is measurable for an outer measure when every set is split additively by :
The measurable sets form a sigma-algebra, and the restriction of to it is a complete measure.
A premeasure on an algebra of sets extends to a measure on the generated sigma-algebra. The extension is unique when the premeasure is sigma-finite.
Complete measure 2026-10-05
A measure is complete when every subset of each null set is a measurable set. Such a subset also has measure zero by monotonicity. The completion of a measure extends it to a complete measure by adjoining all subsets of measurable null sets to its sigma-algebra.
Completion of a measure Created 2026-09-29 Updated 2026-11-05
The completion of a measure extends a measure space so that every subset of a measurable null set is measurable. Its completed sigma-algebra is
and the extension is . This is well-defined: two such representations differ only inside a measurable null set, so their measurable parts have the same measure. The extension agrees with on and is a complete measure.[ref]
For example, completing the Borel measure given by length on the real line gives Lebesgue measure on the Lebesgue measurable sets, including every subset of every Borel null set. Completion of a measure changes which sets are measurable; it does not identify distinct sets. If and differ only on a null set, they can still be different sets in the completed sigma-algebra. Equality modulo null sets is an additional quotient construction.
Complex measure Created 2026-10-06 Updated 2026-10-07
A complex measure is a countably additive complex-valued set function on a sigma-algebra. Its total variation norm of a measure is obtained by taking the supremum of sums over finite measurable partitions. For finite variation and absolute continuity of measures with respect to a sigma-finite positive measure, the Radon-Nikodym theorem supplies an integrable complex density.
Conditional expectation Created 2026-09-24 Updated 2026-10-14
The conditional expectation is the average of a random variable that can be predicted using specified information. It is itself a random variable: the average appropriate to one observed group may differ from that appropriate to another group. The sigma-algebra records which events can be distinguished with the available information.
For a real integrable random variable on a probability space and a sub-sigma-algebra , the conditional expectation is the almost surely unique integrable random variable that is measurable with respect to and satisfies
Its average therefore agrees with that of on every distinguishable event. The integral characterization handles discrete observations, continuous observations, and information that is not given by a single numerical value.[ref]
If the information tells us which member of a finite measurable partition contains the outcome, then on every member of positive probability,
Here is an indicator function. Zero-probability members do not determine a unique value, which is why uniqueness is only almost surely. For square-integrable , this same conditional mean is the best predictor among -measurable random variables under mean squared error; the conditional variance describes its remaining error. A conditional mean is generally not the same as the actual observed value of .[ref]
Conditional expectation from finite-measure densities Created 2026-10-07 Updated 2026-11-05
On a finite measure space , let be integrable and let be a sub-sigma-algebra. The finite measure on is absolutely continuous with respect to . The Radon-Nikodym theorem produces a -measurable density with
It is unique almost everywhere. Positive and negative parts extend the construction to real integrable , and real and imaginary parts handle complex . On a probability space, this is conditional expectation.
The finite-base assumption, or a suitable sigma-finiteness assumption on the restricted measure, must not be omitted. On with counting measure, take the trivial sub-sigma-algebra and . A measurable candidate density is constant. Its integral over the whole space is either zero or infinite, never . Thus a globally sigma-finite base measure need not remain sigma-finite after restriction to a smaller sigma-algebra.
For independent and identically distributed random variables that are integrable random variables, with , symmetry gives . The decreasing sigma-algebras generated by these future sums permit application of the reverse martingale convergence theorem.
Conditional Fatou lemma Created 2026-09-28 Updated 2026-11-05
For nonnegative random variables on a probability space and a sub-sigma-algebra ,
almost surely, with extended nonnegative conditional expectations allowed. Use one common full-probability set for the countably many conditional inequalities.
Put . Then , and monotonicity of conditional expectation gives
Conditional monotone convergence gives the limit of the left side, proving the claim. That conditional convergence statement follows by integrating the increasing conditional expectations on every event in and applying ordinary monotone convergence.
Testing the ordinary Fatou lemma on events alone is not the whole argument: it bounds an integral by a lower limit of integrals, which is not automatically the integral of the conditional lower limit. The increasing tail infima supply the needed order comparison.
Conditional independence Created 2026-09-24 Updated 2026-10-14
Random variables and are conditionally independent given when, for every pair of Borel sets , the following identity holds almost surely:
Here conditional probabilities are conditional expectations of the corresponding indicator random variables given the sigma-algebra generated by . This defines the condition even when . In terms of regular conditional distributions, the conditional joint law is the product of the conditional marginal distributions for almost every conditioning value.
For discrete random variables, at every with , the condition becomes
Where , this is equivalent to . Once is known, observing provides no further information about .[ref]
For a worked example, suppose a latent variable chooses between two environments with . Given , take to be independent and identically distributed with a Bernoulli distribution of parameter , where and . Think of two separate trials run under the same quiet or active environment. Their conditional joint probability mass functions, with rows and columns , are
Each is exactly the product of its own conditional marginal distributions: for , and for . Thus are conditionally independent given .
If the environment is unobserved, the law of total probability averages the two tables:
Both unconditional marginal distributions are fair, but . The law of total expectation gives
Figure 1.
An unobserved shared environment creates statistical dependence between conditionally independent trials
. The first two tables show independent Bernoulli trials at conditional success probabilities and . Averaging them with equal weights gives the third table. The fourth table is the product of the resulting unconditional marginal distributions, which differs from the actual joint table. These are stipulated model probabilities, not observed frequencies. Details.
Observing makes the active environment more plausible, so it raises to . Knowing the actual environment removes this source of statistical dependence. The covariance induced by a shared latent variable lemma explains the calculation without listing all the outcomes.
This is why conditional independence is useful in statistical modelling: a model can multiply simple conditional laws and then average over a shared latent variable. The resulting observations can remain statistically dependent. Conditional independence graphs organize such information relations; their interpretation as causes requires additional assumptions from causal inference. Conditioning describes the information available to an observer. It does not, by itself, describe what would happen if an experimenter changed a variable.
For a measurable partition and a sigma-algebra , the conditional information function is
The conditional expectation in this formula is positive almost everywhere on . Without conditioning, the information is .