For mutually independent random variables, every tail event has . Identical probability distributions are unnecessary. The tail sigma-algebra is trivial in probability: its events have probability zero or one, though it can contain nonempty proper sets.[ref]
For a proof, set and . Independence extended from generating pi-systems makes independent of , hence of each tail event . The increasing union is a generating pi-system for . For fixed , the events satisfying form a Dynkin system. The pi-lambda theorem extends this equality to all . Taking gives
Thus is independent of itself, forcing the two stated values.[ref]
The useful feature is the absence of intermediate probabilities for infinite properties that ignore every finite prefix. It reduces some calculations to showing that a tail event has positive probability, or that its complement does. The theorem supplies no finite observation deadline, and an extra argument such as the calculation in infinitely many heads as a tail event is needed to decide which value occurs.
The pi-systems criterion says that if are pi-systems and for all , , then their generated sigma-algebras are independent. Necessity is immediate. We may add to either pi-system, since it does not alter the generated sigma-algebra or the product identities.
For sufficiency, fix and define
It contains , is closed under complements by subtraction from , and is closed under countable disjoint unions by countable additivity. Thus it is a lambda-system. It contains , so the pi-lambda theorem gives .
Now fix any and apply the same lambda-system argument to the sets satisfying the identity. The first step shows that this lambda-system contains , so it contains all . Thus the product identity holds on both entire sigma-algebras, proving their independence.
The tail sigma-algebra is
Fix . independence of the variables and the pi-systems criterion imply independence of from . Hence is independent of every finite-head sigma-algebra .
The increasing union is an algebra, hence a pi-system, and generates . Another pi-lambda argument extends the equality from that union to all of . Since itself belongs to , take :
Therefore
This is Kolmogorov zero-one law; no moment assumptions on the variables are needed.
A pi-system is a collection of subsets closed under binary intersections: implies . Induction then gives closure under every nonempty finite intersection. A pi-system need not contain complements or unions.
For each , the collection of events , together with the empty event, is a pi-system. Its generated sigma-algebra is , because the half-lines generate the Borel sigma-algebra and inverse images preserve intersections and the sigma-algebra operations.
The displayed probability identity says precisely that these two pi-systems are independent. Part (ii) makes and independent, which is the definition of independent random variables. Conversely independence of the random variables applies to the half-line events and gives the identity. Thus the joint cumulative distribution function factors exactly when the variables are independent.
Independence of the full sigma-algebras immediately gives independence of their generating pi-systems. For the converse, fix . On , define finite measures
They have the same total mass and agree on by assumption. The supplied measure-uniqueness theorem makes them equal on . Thus the independence formula holds for every and every .
Now fix such an arbitrary . The measures and on have equal total mass and agree on . A second application gives equality on all of . This proves independence extended from generating pi-systems.
A simple predictable process can be written
where each is bounded and -measurable. Define its integral to start at zero:
Refining the partition leaves this sum unchanged. Every summand is a martingale, by conditioning its future increment on the information at . Bounded coefficients and the bound on make the integral an L2-bounded continuous martingale. Its terminal value is the same sum with substituted at any infinite endpoint; martingale convergence supplies this limit.
We need the conditional square identity, rather than assuming independent increments. The Doob L2 maximal inequality gives . Localize the square identity for at level and bracket stopping times. The stopped identity and this maximal bound give by monotone convergence. Now
is integrable, so localization passes to conditional expectations and is a uniformly integrable martingale. Expanding a squared increment and using proves
The infinite endpoint follows from convergence and integrability of the bracket. The initial value need not be zero: the integral itself is zero-starting.
In the square of the terminal integral, all cross terms vanish. For , the th increment and both coefficients in its cross term are measurable at , whereas the conditional mean of the th increment there is zero. For the diagonal terms, the preceding conditional identity can be multiplied by the bounded . Therefore
This proves the Itô isometry for these simple integrands. Ordered stopping-time intervals also work, replacing the conditional identity by optional stopping theorem, but deterministic intervals suffice for the approximation requested here.
For that approximation, put on the predictable sigma-algebra. This is a finite measure. That sigma-algebra is generated, apart from the zero-time slice of measure zero, by rectangles with . The indicator of every such rectangle is a bounded simple predictable process.
Here is a density proof. Let be the closed linear span of these indicators in , and let contain the predictable sets whose indicators belong to . The whole space belongs to ; complements stay in ; and disjoint countable unions do also, because their finite partial indicator sums converge in under the finite measure. Thus is a Dynkin system containing the generating rectangle pi-system. The Pi-lambda theorem makes it the entire predictable sigma-algebra. Bounded predictable simple functions therefore belong to . Truncating any function and then approximating its truncated range by finitely many levels shows that every such function belongs to . A finite sum of rectangle indicators can be rewritten on one common deterministic time partition, with the coefficient on each interval measurable at its left endpoint; it is exactly an allowed simple process.
Consequently choose of this form with . This proves
It is density of simple predictable processes for finite measures, with a proof of the actual approximation step.
Finally apply the preceding isometry to , whose bracket is . The elementary integrals satisfy
Define the Itô integral as the limit of these elementary integrals. The same identity shows independence of the approximating sequence, linearity, mean zero, and . Applying the Doob inequality to the difference processes also gives uniform-in-time convergence on , with a continuous martingale version of the integral.
A pi-system is a collection closed under finite intersections. The uniqueness theorem says that two probability measures agreeing on a generating pi-system agree on its generated sigma-field. For finite measures one also fixes the total mass; for a sigma-finite version one requires a covering sequence from the pi-system with finite common masses. Adding the whole space to a pi-system of events causes no change to its generated sigma-field and preserves the stated independence condition.
Fix . On the finite measures and agree on and on the whole space. Uniqueness makes them agree for every . Now fix such an . On the measures and agree on and the whole space; a second application of uniqueness proves
Thus the two generated sigma-fields are independent. The extension is done one argument at a time, not by assuming the required independence for arbitrary unions.
For the independent random variables, let be the rectangles and let be the analogous rectangles in the . Both are pi-systems. Joint independence of the full list factors each combined rectangular probability into the product of the individual probabilities, hence into . Their generated sigma-fields are exactly and . The proved result therefore gives independence of the two vector-generated sigma-fields.
A pi-system is a family closed under finite intersections. A Dynkin system contains the whole underlying set, is closed under complements in it, and is closed under countable pairwise-disjoint unions.
Every sigma-algebra is both a pi-system and a Dynkin system. Conversely, in a family having both properties, intersections and complements give finite unions and differences. For any sequence in it, replace by the disjoint sets , which still belong to the family. Their disjoint union equals , proving closure under arbitrary countable unions. Thus the family is a sigma-algebra.
is a Dynkin system but not a pi-system. The whole ten-point set has even cardinality, complements preserve parity, and disjoint unions of even sets are even. Two even sets can intersect in a singleton, for example and .
is neither. The infinite set belongs to it, but its singleton complement does not, so it is not a Dynkin system. The two infinite sets and intersect in the excluded singleton, so it is not a pi-system.
is a pi-system but not a Dynkin system. Intersections of bounded open intervals are bounded open intervals or empty. However, the family does not contain the whole underlying set . None of the three families is a sigma-algebra.
The uniqueness theorem for measures says that two measures agreeing on a generating pi-system agree on its generated sigma-algebra, provided they are finite with the same total mass, or there is a common increasing exhaustion by pi-system sets of finite measure.
For the finite case let . Equality of total masses gives closure under complements, and countable additivity gives closure under disjoint countable unions. Thus is a Dynkin system containing the generating pi-system. The pi-lambda theorem puts the entire generated sigma-algebra inside .
For the exhaustion version, let with in the pi-system and . The finite measures and agree on the generating pi-system, since it is intersection-closed. The finite proof applies, and continuity from below of a measure as gives for every measurable . A finiteness hypothesis is essential to this standard extension-uniqueness statement.
A lambda-system contains the whole space and is closed under complements and countable disjoint unions. Let be the smallest lambda-system containing a pi-system . For , the family of with is a lambda-system containing , hence is all of . Fixing and repeating the argument shows is closed under intersections. A lambda-system closed under intersections is a sigma-algebra, so . This proves the pi-lambda theorem. If two probability measures agree on , the sets on which they agree form a lambda-system; thus they agree on .
The nonnegative form of Fubini's theorem, also called Tonelli theorem, states that for a nonnegative product-measurable function on two sigma-finite measure spaces, the product integral equals either iterated integral, allowing the value infinity.
For Lebesgue measure on the plane, a bounded interval rectangle has measure . Its preimage under is , which has the same measure. Under , its vertical slice at is , whose one-dimensional Lebesgue measure is by translation invariance. Tonelli therefore gives . Horizontal slices likewise prove the equality for . The interval rectangles form a generating pi-system. Sigma-finite measure uniqueness, obtained by the finite-measure pi-lambda argument on an increasing rectangular exhaustion, extends these equalities to all Borel sets. Completion extends them to all Lebesgue-measurable sets, since Borel null sets and their subsets remain null.
Writing , matrix multiplication gives
Thus rotations through angles in preserve measure. Their inverses and compositions do too; every plane rotation is a finite composition of these, including a right angle as two rotations through . Lebesgue measure is invariant under every rotation.
For independent random variables , let , , and let the tail sigma-algebra be . Kolmogorov zero-one law states that every has probability zero or one.
Such an event is independent of each by independence of the variables. The collection of events satisfying is a Dynkin system: it contains the whole space and is closed under complements and disjoint countable unions. It contains the pi-system , which generates . The pi-lambda theorem therefore makes independent of all of . Since itself belongs to ,
Use finite cutoff windows to avoid subtracting two infinite masses. Write for the unit disc, on loops surrounding , and . For , let . These increase to all loops in surrounding as .
On the finite-mass windows, the domain-containment events form a pi-system. Indeed, if are simply connected and contain , a simple loop surrounding that lies in both has its filled interior in both. It therefore lies in the component of containing , which is simply connected. Thus, on the support of ,
Inclusion-exclusion for the finite deficits gives
Taking and subtracting from gives the useful recovery formula
The assumed generation of the loop sigma-field by domain-containment events and the uniqueness theorem for measures now determine the finite restriction to . Increasing these windows recovers ; conformal transport recovers its restriction to any simply connected domain containing the marked point. If a simply connected domain omits , no loop in it can surround .
The argument uses finite annular deficits. This is the usual local-finiteness convention for these loop measures and is explicitly ensured by the finite logarithmic formula assumed in the continuation. Bare sigma-finiteness must not be used as permission for formal subtraction. This is the recovery of a loop measure from conformal deficits.
On a fixed underlying set, a pi-system is a nonempty family closed under finite intersections. A Dynkin system, also called a d-system, contains the whole underlying set, is closed under complements relative to it, and under countable disjoint unions. Equivalently it is closed under differences of nested members and increasing countable unions. A sigma-algebra contains the whole set, is closed under complements and arbitrary countable unions, hence also countable intersections. A Dynkin system need not be a sigma-algebra unless additional intersection closure is available.
Let be the closure of the simple predictable processes in the Hilbert space . Common refinement of deterministic partitions makes these processes a vector space. To prove density of simple predictable processes for finite measures, suppose . Since is a finite measure, the Cauchy-Schwarz inequality gives , so
defines a finite signed measure. The indicator of each predictable generating rectangle, including each time-zero rectangle, is a simple predictable process; hence vanishes on these rectangles.
Finite intersections of the rectangles are again rectangles or empty. Add the whole space to this pi-system. Its -mass is zero because is simple and converges to in by the dominated convergence theorem. The zero sets of form a lambda-system now that its total mass is zero. The Pi-lambda theorem therefore gives for every . Taking the sets where and gives -almost everywhere.
Thus and the orthogonal complement criterion for a closed subspace of a Hilbert space yields
Omitting the time-zero term would make this conclusion false when is concentrated at time zero.
If is measure-preserving, equality holds on every measurable set and hence on the specified -system. Conversely, let . Both finite measures have equal total mass. Therefore , complements of members remain in by subtracting from the finite total mass, and disjoint countable unions remain in by countable additivity. Thus is a Dynkin system.
It contains the generating pi-system , so Dynkin lemma gives . Consequently
This is exactly the measure-preserving property.
The map swaps each adjacent pair of binary digits: . Canonical expansions with no eventual all-ones tail remain canonical under this swap, and .
Under Lebesgue measure, any specified values of distinct binary digits have probability . Indeed they describe a union of dyadic intervals at the largest of the specified positions, with that total length. The preimage of a cylinder prescribing its first output digits prescribes distinct input digits and therefore has the same measure. The half-open dyadic intervals, with the empty set, form a pi-system generating the Borel sigma-algebra. Apply the preceding uniqueness result to obtain
The choice of binary expansion matters at dyadic endpoints for the map's pointwise definition; the chosen convention removes that ambiguity and those endpoints are null in the measure calculation.
The product sigma-algebra is
The product measure is the probability measure on this sigma-algebra satisfying
The measurable rectangles form a pi-system generating . Any two probability measures agreeing on them therefore agree on the generated sigma-algebra by the pi-lambda theorem, proving uniqueness.