Separable stochastic process 2026-11-05
A separable stochastic process admits a fixed countable set of indices that captures the relevant sample path behavior outside one common null set. In the usual real-valued setting on a metric space , one formulation requires a countable set that is a dense subset and a null set such that, whenever , each lies in the closure of . Thus and the corresponding process value can be approximated together from .
In particular, outside . The right side is a supremum over a countable set of random variables, so its measurability is accessible through the usual sigma-algebra operations. Continuous sample paths on have this property using the rational numbers as indices and endpoints.
The common null set matters. If has a uniform distribution on and , each fixed is zero almost surely, yet always. For any fixed countable , almost surely. Agreement at every fixed time therefore does not imply agreement of pathwise suprema.[ref]
Measurability Woes by David Pollard. Section 10.4, separable versions and the random-spike counterexample
Sigma-algebra Created 2026-09-24 Updated 2026-10-14
A sigma-algebra on a set is a collection of subsets such that , implies , and for all implies . Thus it contains the empty set and is closed under countable intersections as well. This is precisely the closure needed to apply countable additivity without leaving the domain of a measure.
For ,is a sigma-algebra. It describes observations that distinguish from the pair , but cannot distinguish from . The power set provides a finer sigma-algebra with all eight subsets. Both are valid; choosing a sigma-algebra records which questions the model can answer.
On the real numbers, the Borel sigma-algebra contains all open sets and everything generated from them by these operations. The Lebesgue measurable sets form a larger sigma-algebra, including all subsets of Borel null sets. Closure under countable unions accommodates constructions involving an entire sequence of observations or approximations.
Sigma-algebra generated by a collection 2026-10-31
The sigma-algebra generated by a collection is the smallest sigma-algebra containing all sets in that collection. The displayed intersection is over a nonempty family, since the power set is one candidate. An intersection of sigma-algebras contains the whole space and is closed under complements and countable unions, proving it is a sigma-algebra and establishing minimality.
For example, the half-lines generate the Borel sigma-algebra on the real line. They are Borel, and conversely and recover every open interval. Preimages of these half-lines similarly generate the sigma-algebra generated by a random variable.
Sigma-algebra generated by a random variable 2026-10-25
For a real random variable on a probability space, is the smallest sigma-algebra making a measurable function into the Borel sigma-algebra on . The collection of all inverse images of Borel sets is already a sigma-algebra, since inverse images preserve complements and countable unions; this proves the displayed formula without completing any measure.
Let a random vector have a finite actual range of values. Its nonempty fibres partition the sample space, and every event in is a union of those fibres. Thus each fibre is an atom of a sigma-algebra and has exactly elements. This assertion concerns the actual range; additional values attained only on null sets must still be counted when working with an uncompleted sigma-algebra literally.
To verify the claim, the fibres belong to as preimages of singleton Borel sets. Their unions form a finite sigma-algebra making measurable, so minimality of the generated sigma-algebra gives the reverse inclusion. Distinct subcollections have distinct unions because the fibres are nonempty and disjoint.
Consequently a finite history of finite-valued observations generates a finite natural filtration at each fixed time. It may be strictly smaller than the filtration of its driving continuous observations: a single uniform random variable already generates infinitely many distinct events with different probabilities.
Signed measure Created 2026-10-05 Updated 2026-11-05
A signed measure is a countably additive set function on a sigma-algebra that permits negative values. In the extended-real convention it takes values in , has value zero on the empty set, and does not take both and , so its additive sums are defined. The important finite case is real-valued on every measurable set.[ref]
For distinct points , the difference of Dirac measures is a finite signed measure. It has , and . Its variation measure is , whose total mass is , rather than the absolute value of its signed total mass. The total variation norm of a measure records both contributions before cancellation.
A Hahn decomposition separates a signed measure into a region on which all measurable subsets have nonnegative mass and a region on which all measurable subsets have nonpositive mass. It is the setwise counterpart of splitting an integrable function into its positive part and negative part.
Stochastic Fubini theorem Created 2026-10-06 Updated 2026-11-05
A stochastic Fubini theorem permits interchange of a parameter integral with a stochastic integral. One sufficient version uses a measure space with and a function measurable for the product of the predictable sigma-algebra and the parameter sigma-algebra and satisfiesThen both sides below exist in L2 space and are equal:For elementary parameter functions the identity is linearity of the Itô integral. Approximation in the displayed squared norm, the Itô isometry and the Cauchy-Schwarz inequality pass to the limit. Finite parameter measure is part of this sufficient version; more general versions require different integrability bounds. For example, inserting the deterministic indicator on gives .
Stopping-time sigma-algebra 2026-10-06
The information available at a stopping time is the sigma-algebraIn discrete time, for . A bounded stopping time permits conditional forms of the optional stopping theorem with respect to this sigma-algebra.
Sub-sigma-algebra Created 2026-10-25 Updated 2026-10-31
A sigma-algebra on the same underlying set as , with . In probability theory it represents information retained from the original probability space and is a possible conditioning collection for a conditional expectation.
Symmetrization as conditional expectation 2026-10-14
If a finite group acts by measure-preserving maps on a probability space, let be its invariant sigma-algebra. For an integrable random variable , the displayed group average is -measurable. For , changing variables under each group element gives . The average therefore satisfies the defining integral identity for conditional expectation. For permutations of exchangeable coordinates, averaging a product attached to distinct indices yields the sum over all ordered distinct -tuples divided by the falling factorial .
Tail sigma-algebra Created 2026-09-24 Updated 2026-10-14
For a sequence of random variables on a probability space , defineThe decreasing sigma-algebras are generated by the listed random variables. Their intersection consists of events expressible after discarding every finite prefix. No independence is required.[ref]
Probability: Theory and Examples (fifth edition) by Rick Durrett. Probability: Theory and Examples (fifth edition), §2.5 Convergence of Random Series, printed p. 81: definition of the tail sigma-field
The point is to distinguish a long observation record from a property of an infinite sequence. The event of seeing infinitely many heads and the event that sample means converge survive any finite change, while an exact first-head time does not. Kolmogorov's zero–one law adds the striking conclusion that under independence each tail event has probability zero or one; the tail sigma-algebra itself can still contain many nonempty sets.
An -bounded supermartingale has an almost sure convergence limit in . The conditional-expectation martingale has uniform integrability and converges to both almost surely and in . To identify its limit, test against every event in every finite-time sigma-algebra and use uniqueness on their generated sigma-algebra. Then is a supermartingale tending to zero almost surely. There is no general nonnegativity conclusion for , nor general convergence in L1 to zero: the negative of the fair-coin doubling martingale is a counterexample to both stronger assertions.
On with Lebesgue probability and the usual dyadic filtration, each displayed support is a dyadic atom. Its next split has one child of doubled height and one of zero height, preserving the conditional average. Hence the sequence is a martingale from time one. To extend it to the trivial time-zero sigma-algebra one must set : applying the same displayed formula at zero instead gives , which is not adapted and has the wrong expected value. The repaired martingale tends to zero almost surely while its expected values remain one, so it is not uniformly integrable.
Trace sigma-algebra 2026-10-31
For a measurable space and any subset , the trace sigma-algebra is the displayed family of subsets of . It contains , is closed under relative complements since , and is closed under countable unions. If , it equals . Without that measurability assumption, the traces need not be measurable sets in the original sigma-algebra.
Uniform integrability of conditional expectations Created 2026-10-05 Updated 2026-11-05
For one integrable random variable , the family , over arbitrary sigma-algebras , has uniform integrability. On , the defining property of conditional expectation gives , while by the Markov inequality. The integrable random variable has uniformly small absolute integrals over events of sufficiently small Probability.
Vector measure Created 2026-10-07 Updated 2026-11-05
A finite-dimensional vector measure is a countably additive map on a sigma-algebra. Equivalently, each component is a finite signed measure. For pairwise disjoint measurable sets , countable additivity means with convergence in the vector norm.
Its variation measure records size without cancellation:The supremum ranges over finite measurable partitions of . For on , the Euclidean norm gives , rather than the sum of component variations. The chosen vector norm matters.
The polar decomposition of a vector measure writes with unit direction almost everywhere for . It separates local direction from variation magnitude. Distributional derivatives in the bounded-variation space are important examples, and finite variation controls integration against bounded vector test functions.