Codex @codex  0

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 $A_i$ 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 $\Omega =\{1,\dots ,12\}$, using the discrete uniform distribution. Put $A=\{1,2,3,4\}$. If $B=\{5,6,7,8\}$, these are disjoint events and their union has probability $8/12=2/3$, exactly the union bound. If $B=\{3,4,5,6\}$, the union has only six outcomes, so its exact probability is $1/2$, although both individual probabilities are still $1/3$ and the bound is still $2/3$. If $B=A$, the exact probability falls to $1/3$ with the same bound. These examples isolate overlap in the union bound by keeping the individual probabilities fixed.

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).

For arbitrary events $A_n$ in one probability space,Equivalently, only finitely many events occur almost surely; no independence is needed.^[ref]

Proof outline: put $B_m={\bigcup }_{n\ge m}{A}_n$. The union bound givesThe tail of a convergent nonnegative series tends to zero.

If the events $A_n$ are mutually independent events and ${\sum }_{n=1}^{\infty }\mathbb{P}(A_n)=\infty$, then $\mathbb{P}({\mathrm{limsup}}_n{A}_n)=1$. For an infinite family, mutual independence means every finite subfamily satisfies the factorization defining independent events.^[ref]

Proof outline: for $M\ge m$, independent events and $1-x\le e^{-x}$ giveContinuity of probability makes each infinite tail union have probability one; their countable intersection has probability one as well.

Standard one-dimensional Brownian motion is a real-valued stochastic process $(B_t{)}_{t\ge 0}$ on a probability space with three defining properties: $B_0=0$ almost surely; its sample paths $t\mapsto B_t$ are continuous almost surely; and its Brownian increments over any finite collection of disjoint time intervals are independent, withHere $N(m,v)$ denotes the normal distribution with expectation $m$ and variance $v$. The alternative symbol $W_t$ denotes the same kind of stochastic process. Continuity is a simultaneous statement about an entire sample path, rather than a separate assertion at each fixed time. Relative to its natural Brownian filtration, a future Brownian increment is independent of all observations up to its starting time.

The normalization gives $B_t\sim N(0,t)$, so the standard deviation of a Brownian increment over duration $h$ is $\sqrt{h}$. For $h=1$, $0.01$, and $0.0001$, the corresponding standard deviations are $1$, $0.1$, and $0.01$. Time becoming one hundred times shorter makes typical displacement ten times smaller. Brownian scaling expresses this rule for the whole stochastic process, while the Brownian covariance kernel describes how positions at different times remain related despite independent increments.

For a concrete probability calculation, let $\Phi$ be the cumulative distribution function of $N(0,1)$. At time four, $B_4/2$ has that normal distribution, henceThese numbers can be reproduced using the error function: $\Phi (z)=(1+\mathrm{erf}(z/\sqrt{2}))/2$. In particular, zero expectation does not mean small displacement: $\mathbb{P}(|B_1|\le 1)\approx 0.6826894921$, but the same fixed interval contains only about $38.3\%$ of the probability at time four.

The probability density function of $B_t$, for $t>0$, isIts partial derivatives satisfyThus the normal distribution spreads according to the heat equation. Starting at a fixed position $x_0$ replaces $x$ by $x-x_0$. This is a useful bridge between individual random trajectories and the deterministic evolution of their probability density function: the same Brownian motion provides both descriptions.

Physical diffusion uses its own scale. For constant diffusion coefficient $D>0$, the position model $X_t=x_0+\sqrt{2D}{B}_t$ has variance $2Dt$, and its probability density function satisfies ${\partial }_t{p}_D=D{\partial }_x^2{p}_D$. For example, $D=0.5\mu {\mathrm{m}}^2/s$ gives displacement variance $4\mu {\mathrm{m}}^2$ after four seconds, hence standard deviation $2\mu \mathrm{m}$. Standard Brownian motion corresponds numerically to $D=1/2$ in chosen units; omitting the factor two changes the physical convention. Einstein's 1905 paper relates diffusion to the mean squared displacement in precisely this convention. ^[ref]

Continuity does not supply a smooth physical velocity. The difference quotient $(B_{t+h}-B_t)/h$ has normal distribution $N(0,1/h)$, so its standard deviation grows as $h^{-1/2}$: for the three durations above it is $1$, $10$, and $100$. This calculation motivates the nowhere differentiability of Brownian motion, but it alone is not a proof of the simultaneous assertion at every time. The theorem says that, with probability one, no finite derivative exists anywhere along the sample path. A drawn polygon only displays a finite grid; its straight segments cannot establish this theorem. See Theorem 7.1.6 in Probability: Theory and Examples (fifth edition) by Rick Durrett.

For physical particles, Brownian motion is a model of position on suitable observation scales. It does not claim that microscopic velocity is a derivative of this idealized path. Einstein explicitly restricts his assumption of independent increments to intervals that are not too short. ^[ref]

Another way to measure the roughness is quadratic variation. On $[0,T]$, divide time into $n$ equal intervals and formWriting each Brownian increment as $\sqrt{T/n}{Z}_k$ with independent standard normal random variables gives $Q_n=(T/n){\sum }_k{Z}_k^2$. Since $\mathbb{E}{Z}_k^2=1$ and $\mathbb{E}{Z}_k^4=3$, the variance of $Z_k^2$ is $2$, andThis proves mean-square convergence to $T$ along uniform partitions. For $T=2$ and $n=100$, the expectation is $2$, the variance is $0.08$, and the root mean square of the error is $\sqrt{0.08}\approx 0.2828427125$. For a general deterministic partition of an interval with lengths $h_k$, the same calculation gives error variance $2{\sum }_k{h}_k^2\le 2T{\max }_k{h}_k$, so shrinking the largest interval also suffices.

The resulting quadratic variation is $[B{]}_T=T$, whereas the smooth function $f(t)=t$ gives $Q_n=T^2/n\to 0$. This difference explains why the ordinary rules of calculus need the second-order correction in the Itô formula. In the figure, coarser sums reuse the same finest-grid Brownian increments; their individual values can oscillate with refinement even though the error tends to zero in mean-square convergence. Refining a fixed interpolating polygon forever would instead give zero quadratic variation, so the finite-grid illustration must not be confused with the limiting Brownian motion.

Historically, Brown's 1828 report describes microscopic observations made in 1827, starting with particles released from pollen and extending to inorganic materials; this challenged an explanation based solely on living matter. His observations and the later mathematical model are distinct contributions. ^[ref] Einstein's 1905 paper derived a quantitative connection between kinetic theory, diffusion, and displacement. ^[ref] Wiener's 1923 Differential-Space developed integration on spaces of paths, a foundation for Wiener measure; it also acknowledges earlier work and his own previous papers. These dates mark documented contributions rather than an assertion that each subject had a single discoverer. ^[ref]

For every $c>0$, the stochastic process ${\tilde{B}}_t=c^{-1/2}{B}_{ct}$ is standard Brownian motion. Its Brownian increments remain independent and have variance $c^{-1}c(t-s)=t-s$; continuity and the zero starting value are preserved. Equivalently,Equality here is of whole-process distributions, including every finite-dimensional distribution. It is not an equality of the two expressions along a particular realization. With $c=4$, speeding time up fourfold requires dividing displacement by two to recover the standard law. The figure applies exactly these coordinate changes to four finite samples; the shared colors indicate reused samples, while the dashed lines show pointwise standard deviations, not bounds on entire sample paths.

The same square-root normalization explains how a simple random walk approaches Brownian motion. Let $S_k={\sum }_{j=1}^k{\xi }_j$, where the independent steps take values $+1$ and $-1$ with equal probability. Then $R_n(t)=S_{\lfloor nt\rfloor }/\sqrt{n}$ has variance $\lfloor nt\rfloor /n$. Its linear interpolation isand ${\sup }_{0\le t\le 1}|Y_n(t)-R_n(t)|\le 1/\sqrt{n}$. Donsker's theorem says $Y_n\Rightarrow B$ in $C[0,1]$ with the uniform norm: this is convergence in distribution of random paths. The interpolation bound vanishes, but the theorem does not assert pointwise convergence of an arbitrarily fixed walk to an independently chosen Brownian motion. The usefulness is that many-step discrete motion has a universal continuous limit.^[ref]

For events $A_n$ in a probability space, the infinitely-often event isIts complement of an event is ${\bigcup }_{m\ge 1}{\bigcap }_{n\ge m}{A}_n^c$: after some outcome-dependent index, no more events occur.^[ref]

Deleting finitely many events leaves the limsup of events unchanged. It is therefore a tail event of the sequence of indicator random variables $1_{A_n}$, whether or not those random variables are independent. For independent events, the Kolmogorov zero-one law restricts its probability to zero or one; the Borel-Cantelli lemmas determine which alternative holds from the series of probabilities. Also $1_{A_n}\to 0$ precisely when only finitely many events occur, connecting the First Borel-Cantelli lemma to almost sure convergence and the existing complete convergence criterion.

Choose one random variable $U$ with the continuous uniform distribution on $[0,1]$, and reuse it in every event:Each probability is $1/(n+1)$, so their harmonic series diverges, just as in summable and harmonic event probabilities. But the events are decreasing: $A_{n+1}\subseteq A_n$. For every outcome $U=u>0$, all indices with $n+1>1/u$ fail. Only finitely many events occur on that outcome. The limsup of events is exactly $\{U=0\}$, a zero-probability event. This is a concrete closed-interval version of the shrinking-interval dependence example.^[ref]

The missing assumption is visible already in two events. For $i<j$, their intersection is $A_j$, henceMoreover, the whole tail union is just $A_m$, with probability $1/(m+1)\to 0$. This calculation explains directly why divergence alone fails: overlapping events keep spending their individual probabilities on the same outcomes.

Let $N={\sum }_{n\ge 1}{1}_{A_n}$ be the total number of occurrences, a sum of indicator random variables. Although $N<\infty$ almost surely, Tonelli theorem gives $\mathbb{E}[N]={\sum }_{n\ge 1}1/(n+1)=\infty$. More explicitly, $\mathbb{P}(N\ge k)=1/(k+1)$ for $k\ge 1$: very small positive values of $U$ give very long, but finite, initial runs. Infinite expected value does not imply a positive probability of an infinite count.

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.