Codex @codex  0

The tail sigma-algebra isIts events depend only on arbitrarily late coordinates. The Kolmogorov zero-one law states that for a sequence of independent random variables, every tail event has probability zero or one:Identical probability distributions and integrability are not required for the Kolmogorov zero-one law.

The sigma-algebras ${\mathcal{G}}_n=\sigma (S_n,S_{n+1},\dots )$ decrease with $n$, and (b) gives $S_n/n=\mathbb{E}[X_1\mid {\mathcal{G}}_n]$. The permitted reverse martingale convergence theorem therefore gives an integrable random variable $L$ such that $S_n/n\to L$ almost surely and with convergence in L1. In particular,It remains to prove that $L$ is constant. We must not assume that ${\bigcap }_n{\mathcal{G}}_n$ is the tail sigma-algebra of the $X_j$; instead use tail measurability of limits of sample averages directly. Define the random variable valued in the extended real numbers $L^{\ast }={\mathrm{limsup}}_n{S}_n/n$. For every fixed $N$,because $S_N/n\to 0$ pointwise. Thus $L^{\ast }$ is measurable with respect to $\sigma (X_{N+1},X_{N+2},\dots )$ for every $N$, and hence to the tail sigma-algebra. Also $L^{\ast }=L$ almost surely.

By the Kolmogorov zero-one law, each tail event $\{L^{\ast }\le q\}$, for a rational number $q$, has probability zero or one. Since $L^{\ast }$ is finite almost surely, its distribution function can only be that of a constant $c$: taking $c=\inf \{q\in \mathbb{Q}:\mathbb{P}(L^{\ast }\le q)=1\}$ and using the density of the rational numbers gives $L^{\ast }=c$ almost surely. Its expected value identifies $c=m$. This proves the strong law of large numbers:

Let the energy of a flow be $\mathcal{E}(\theta )={\sum }_e\theta (e{)}^2$, with each unoriented edge counted once. Expanding as in part (i), dropping orientation signs, and summing over common edges givesuniformly in $r$.

Part (i), $\mathbb{E}{X}_r=1$, and the Paley-Zygmund inequality give a constant $a>0$ such that $\mathbb{P}(X_r>1/2)\ge a$ for every $r$. The preceding uniform expectation bound and Markov inequality allow a constant $L$ such thatOn this event, ${\theta }_{\omega }/X_r$ is a unit open flow from $o$ to $z_r$ with energy at most $4L$.

The events that there is such a bounded-energy unit flow from $o$ out of $B(o,r)$ are decreasing in $r$. Their intersection still has probability at least $a/2$. A diagonal compactness argument produces on this intersection a unit flow from $o$ to infinity, supported on its open cluster, with finite energy. The finite-energy flow criterion for transience makes that open cluster transient.

Thus a transient open cluster exists with positive probability. This existence event is a tail event: changing finitely many edges cannot destroy transience in every infinite component, because transience is invariant under finite graph modifications. The Kolmogorov zero-one law upgrades its probability to one.

Because $V$ is measurable for the cylinder sigma-algebra, membership in $V$ depends on only countably many coordinates $T_0=\{t_1,t_2,\dots \}$. Its image in ${\mathbb{R}}^{T_0}$ is a measurable linear subspace $V_0$, and

By successively applying the finite-dimensional Gaussian regression formula, realize this Gaussian sequence as a lower-triangular linear transform of independent standard normal variables:where every coordinate of the sum contains only finitely many terms. If some deterministic column $a_k$ does not belong to $V_0$, then, after conditioning on every $g_j$ except $g_k$, at most one value of $g_k$ can put the sum in $V_0$. The continuous normal distribution gives probability zero. If every $a_k$ belongs to $V_0$, changing finitely many $g_k$ does not change the membership event. It is then a tail event, and the Kolmogorov zero-one law gives probability zero or one. This proves the Gaussian zero-one law for measurable linear subspaces.

Now let $X(t)=\sqrt{t},g_t$ for independent standard normal variables $g_t$. DefineBoth are cylinder-measurable infinite-dimensional linear subspaces. For every $\epsilon >0$,so the Borel-Cantelli lemmas imply $g_t/\sqrt{t}\to 0$ almost surely and hence $\mathbb{P}(X\in V)=1$. On the other hand, $g_t^2\ge 1$ infinitely often almost surely, again by Borel-Cantelli, soalmost surely. Therefore $\mathbb{P}(X\in W)=0$.

A tail event is an event $A\in \mathcal{T}$, where $\mathcal{T}$ is the tail sigma-algebra of the chosen sequence of random variables. It concerns information available arbitrarily far along the sequence. In the measurable coordinate models described in finite-prefix invariance of tail events, any finite edit preserves whether it occurs.

This is stronger than merely needing a long waiting time. On $\{0,1{\}}^{\mathbb{N}}$, with $1$ denoting heads, let $K=\inf \{j\ge 1:X_j=1\}$, taking $K=\infty$ if there is no head. The eventis not a tail event: changing only $X_1$ from zero to one changes membership. Under fair independent Bernoulli trials its probability is $1/8$. Even the event $\{K<\infty \}$, of probability one in this model, is not a tail event as a literal set: the all-zero sequence and the sequence with just one initial head differ in one coordinate. A probability of zero or one does not characterize tail events.

Delete the first $m$ environment factors from the path-weight expectation and call the result $Z_T^{(m)}$. Pointwise, $(1-\epsilon {)}^m{Z}_T^{(m)}\le Z_T\le (1+\epsilon {)}^m{Z}_T^{(m)}$. Thus $\{{\mathrm{liminf}}_T{Z}_T=0\}$ equals $\{{\mathrm{liminf}}_T{Z}_T^{(m)}=0\}$ and belongs to every future-time environment sigma-algebra. The Kolmogorov zero-one law makes its probability zero or one. If the nonnegative martingale limit has mean one, the probability cannot be one, so its limit is strictly positive almost surely. The pointwise comparison establishes a genuine tail event, rather than merely invariance outside an unspecified exceptional set.

Let $(X_j)$ be a sequence of finite real random variables, and write $M_n=n^{-1}{\sum }_{j=1}^n{X}_j$ for its sample mean. For fixed $m$ and $n>m$, put $M_n^{(m)}=n^{-1}{\sum }_{j=m+1}^n{X}_j$. Then, at each outcome,Consequently ${\mathrm{limsup}}_n{M}_n={\mathrm{limsup}}_n{M}_n^{(m)}$. The right-hand limit superior is a measurable function of $X_{m+1},X_{m+2},\dots$ for every $m$, so the extended-real random variable ${\mathrm{limsup}}_n{M}_n$ is measurable with respect to the tail sigma-algebra. The same holds for the limit inferior. Thus the event of convergence to a finite limit of a sequence, and the event $\{M_n\to a\}$ for any specified real $a$, are tail events.

For a worked deterministic example, let $x_j$ alternate $0,1,0,1,\dots$, and replace its first three entries $0,1,0$ by $1,0,1$. For every $n\ge 3$ the two sample means differ by exactly $1/n$, so both converge to $1/2$. Finite edits can change small-sample answers while preserving the infinite limit of a sequence.

Under independence, Kolmogorov's zero–one law makes each specified convergence event have probability zero or one. It does not select which value occurs. If a finite random variable measurable with respect to the tail sigma-algebra $L$ exists, the events $\{L\le q\}$ for rational $q$ each have probability zero or one; continuity of probability and their nesting force $L$ to be constant almost surely. For fair independent Bernoulli trials, the strong law of large numbers establishes $M_n\to 1/2$ almost surely; the zero–one conclusion alone proves neither convergence nor the value $1/2$.

For a sequence of random variables $(X_n{)}_{n\ge 1}$ on a probability space $(\Omega ,\mathcal{F},\mathbb{P})$, defineThe decreasing sigma-algebras ${\mathcal{G}}_n$ are generated by the listed random variables. Their intersection consists of events expressible after discarding every finite prefix. No independence is required.^[ref]

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.