Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Brownian Motion Construction and Continuity

1 · Prerequisites

2 · Summary

A Gaussian process is specified through all finite linear combinations, with singular covariance matrices and variance zero retained. Mean and covariance therefore determine every finite-dimensional law. For the Brownian kernel C(s,t)=min(s,t), positive semidefiniteness is proved by an explicit finite sum-of-squares calculation, and consistency is checked before Kolmogorov extension is invoked.

The canonical Gaussian coordinate process initially supplies the desired finite-dimensional laws, not continuous sample paths. The covariance description is shown equivalent to stationary independent normal increments, after which the Brownian definition records both the increment law and one measurable probability-one continuity event. Kolmogorov's one-parameter criterion, together with exact Gaussian even moments, constructs a continuous modification and yields local Holder regularity of every order below one half.

Continuous paths are then placed in C([0,),R) with the uniform-on-compacts metric. Its Polish structure and coordinate-generated Borel sigma-algebra make Wiener measure a genuine path-space probability law. Finite-dimensional Gaussian uniqueness consequently proves uniqueness of Wiener measure without silently enlarging the cylinder sigma-algebra on the unrestricted function space.

Scaling and time inversion are proved at the process level, including the continuity check at the inverted time zero. The final construction passes to finite-dimensional Brownian motion, proves existence and scaling in every finite dimension d1, and fixes the uncompleted natural-filtration and all-pairs martingale convention used by the radial example. Path continuity, filtration indexing, and martingale identities are kept as distinct notions.

Choice is declared where the arbitrary-index extension, Gaussian-law, or conditional-expectation interfaces require it. Deterministic kernel algebra, finite covariance calculations, and the explicit continuity estimates add no unrecorded selection principle. Densities, covariance calculations, constructions, martingales, and the limits of fixed-time modification appear on brownian-motion-construction-and-continuity-examples.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-09-14Open item page →

Gaussian process

Definition

Assume the Axiom of Choice The Axiom of Choice. A real stochastic process X=(Xt)tI Stochastic processes and their finite-dimensional distributions is a Gaussian process if, for every integer n1, every time list t1,,tnI, and every a1,,anR, the random variable

j=1najXtj

has a normal law N(m,σ2) for some mR and σ0. Variance zero is allowed, so constant linear combinations are included.

Equivalently, for every such time list the evaluation vector (Xt1,,Xtn) has a possibly singular multivariate normal law in the sense of Multivariate normal law, including singular covariance. Indeed, that definition says exactly that every scalar projection of the vector is normal. This also covers repeated times, zero coefficients, and singular covariance matrices; no distinct-time convention is needed for this definition.

Choice is declared because the library's scalar and multivariate normal-law interfaces construct their probability laws and independent standard-normal realizations under AC. The equivalence itself is only an unpacking of the finite-dimensional projection definition and makes no further selection.

Source notes

Sousi, Section 6.1, defines a Gaussian process through normal finite linear combinations. Yoshida, Section 6.1 (printed p. 173), uses the equivalent finite-dimensional multivariate-normal formulation. The present definition retains singular laws explicitly, as required by the library's normal-law interface.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Mean and covariance determine Gaussian finite-dimensional laws

Statement

Assume the Axiom of Choice. Two real Gaussian processes on the same index set that have the same mean function and covariance function have identical finite-dimensional distributions.

Facts & Assumptions

Given: AC and Gaussian processes X,Y satisfying the two equalities in the Statement.

[F1]

Every finite evaluation vector of a Gaussian process has a possibly singular multivariate normal law. Gaussian process

[F2]

Assume AC. The characteristic function of Nn(m,Σ) is uexp(iumuTΣu/2), and it uniquely determines the law, including when Σ is singular. Characteristic function of a multivariate normal law

Proof

technique · direct
1.1

Fix n1 and times t1,,tnI. By [F1], the vectors X(n)=(Xt1,,Xtn),Y(n)=(Yt1,,Ytn) are multivariate normal. Their mean vectors agree by the first given identity. Their covariance matrices agree entry by entry by the second identity, even if some times repeat and the common matrix is singular.

givenF1
2.1

Write the common mean vector and covariance matrix as m and Σ. By [F2], both vector characteristic functions equal uexp(iumuTΣu/2). The uniqueness clause of [F2] therefore gives X(n)=dY(n). Since the finite time list was arbitrary, all finite-dimensional distributions agree. The empty-coordinate law, if included as a convention, is the unique probability law on the singleton empty tuple. AC is used exactly through [F1]–[F2], not to choose a version of either process.

step 1.1F1F2

Source notes

Sousi, Section 6.1, records that the mean and covariance functions determine a Gaussian process in law. The proof above supplies the complete singular-law argument via the library's multivariate characteristic-function theorem.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Positive semidefiniteness of the Brownian covariance kernel

Statement

The kernel C(s,t)=min(s,t) on [0,) is symmetric and positive semidefinite: for every integer n0, times t1,,tn0, and coefficients a1,,anR, i,j=1naiajmin(ti,tj)0.

Facts & Assumptions

Given: A finite time list and coefficient list as in the Statement.

Proof

technique · direct
1.1

Symmetry is immediate from min(s,t)=min(t,s). If n=0, the displayed quadratic form is the empty sum 0. Now take n1, let 0=r0<r1<<rk be the increasing list of the distinct positive values among t1,,tn, and put A=i:tirai. The list is finite and uniquely fixed by the given times; no choice function is used.

given
2.1

For every i,j, min(ti,tj)==1k(rr1)1{tir}1{tjr}. Indeed, if the smaller of ti,tj is 0 both sides vanish, while if it is rm the right side telescopes to =1m(rr1)=rm.

step 1.1algebra
3.1

Substituting step 2.1 and rearranging only finite sums gives i,j=1naiajmin(ti,tj)==1k(rr1)(i:tirai)2==1k(rr1)A2. Every weight is positive and every square is nonnegative, so the quadratic form is nonnegative. This includes coincident times, zero times, zero coefficients, and the case k=0, where the last sum is empty.

step 1.1step 2.1algebra

Source notes

Durrett and Sousi use the Brownian covariance kernel in their Gaussian constructions. The standard identity min(s,t)=1[0,s]1[0,t] interprets it as a Gram kernel; step 2.1 evaluates that identity as a finite level sum, avoiding an unnecessary measure construction and therefore remaining choice-free.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Consistency of Brownian finite-dimensional laws

Statement

Assume the Axiom of Choice. For every finite list t=(t1,,tn) of nonnegative times, there is a centered Gaussian law μt with covariance Σ(t)ij=min(ti,tj). These laws are compatible with every coordinate selection map, hence with permutation, deletion, and repetition of coordinates. The empty list carries the unique probability law on the singleton empty tuple.

Facts & Assumptions

Given: AC and a finite list of nonnegative times.

[F1]

The matrix with entries min(ti,tj) is symmetric positive semidefinite, including for repeated and zero times. Positive semidefiniteness of the Brownian covariance kernel

[F2]

Assume AC. Every finite-dimensional symmetric positive semidefinite covariance matrix defines a centered, possibly singular multivariate normal law. Multivariate normal law, including singular covariance

[F3]

Assume AC. The characteristic function of Nn(0,Σ) is uexp(uTΣu/2) and uniquely determines its law, including singular Σ. Characteristic function of a multivariate normal law

Proof

technique · direct
1.1

For n=0, set μ() equal to the unique law on the singleton empty tuple. For n1, [F1] makes Σ(t) an admissible covariance matrix, so [F2] supplies the centered law μt=Nn(0,Σ(t)). This remains well-defined when a time is zero, times repeat, or the covariance is singular.

givenF1F2
2.1

Let θ:{1,,m}{1,,n} be any map, let R:RnRm be the coordinate map (Rx)j=xθ(j), and take Xμt. For uRm, [F3] gives EeiuRX=Eei(RTu)X=exp ⁣(12uTRΣ(t)RTu). The (j,k) entry of RΣ(t)RT is min(tθ(j),tθ(k)), so [F3] identifies the law of RX with μ(tθ(1),,tθ(m)). The case m=0 is the unique empty-tuple law.

step 1.1F3algebra
3.1

A bijective θ permutes coordinates, an injective coordinate selection deletes the unselected coordinates, and a noninjective θ repeats coordinates. Thus step 2.1 proves all three promised compatibilities, with both orders of any inverse permutation covered. AC is spent only in the existence and characteristic-function uniqueness suppliers [F2]–[F3].

step 2.1F2F3

Source notes

Durrett, Section 7.1 (printed pp. 355–356), constructs the centered Gaussian finite-dimensional laws with covariance min(s,t) and invokes Kolmogorov extension. The calculation above records the full selection-map consistency needed before that invocation and does not assume nonsingularity or distinct times.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Kolmogorov construction of the canonical Gaussian process

Statement

Assume the Axiom of Choice. There is a probability measure on the cylinder sigma-algebra of R[0,) under which the coordinate process Xt(x)=x(t) is centered Gaussian and E[XsXt]=min(s,t)(s,t0). This construction alone asserts neither continuous sample paths nor that the coordinate process is Brownian motion.

Facts & Assumptions

Given: The Axiom of Choice and the Brownian Gaussian finite-dimensional laws.

[F1]

The centered Gaussian laws with covariance min(ti,tj) are well-defined and consistent under finite coordinate restriction. Consistency of Brownian finite-dimensional laws

[F2]

Assume AC. A consistent family on arbitrary standard-Borel coordinate spaces has a unique extension to the cylinder sigma-algebra. Assuming the Axiom of Choice, Kolmogorov extension for arbitrary families of standard Borel coordinate spaces

[F3]

Under that extension measure, the coordinate process realizes precisely the prescribed finite-dimensional distributions. The canonical coordinate process realizes consistent finite-dimensional laws

[F4]

A process is Gaussian exactly when every finite evaluation vector has a possibly singular multivariate normal law. Gaussian process

Proof

technique · direct
1.1

By [F5], the usual real line is complete and has the countable dense subset Q, hence is Polish; its Borel measurable space is therefore standard Borel via the identity presentation. This verifies, rather than merely assumes, the coordinate-space hypothesis of [F2].

F2F5
2.1

For every finite F[0,), use [F1] to put on RF the centered Gaussian law with covariance (min(s,t))s,tF; step 1.1 and [F2] give a probability P on the cylinder sigma-algebra of R[0,) with exactly those marginals. The empty marginal has mass one on the singleton empty product.

step 1.1F1F2
3.1

Let Xt(x)=x(t). By [F3], every finite evaluation vector of X has the prescribed centered Gaussian law. Thus [F4] makes X Gaussian, and its one- and two-coordinate marginals give E[Xt]=0 and E[XsXt]=min(s,t), including X0=0 almost surely because its variance is zero.

step 2.1F3F4
4.1

The conclusion of [F2] is only a measure on the cylinder sigma-algebra realizing finite-coordinate laws; neither [F2] nor [F3] supplies a common full-measure set on which tXt(x) is continuous. Consequently step 3.1 does not establish the path-continuity clause needed for Brownian motion. AC is used in [F1]–[F2] and the Gaussian interface [F4], including the choices inside arbitrary-index Kolmogorov extension; no stronger regularity is inferred from it.

step 3.1F1F2F3F4

Source notes

Durrett, Section 7.1, Theorem 7.1.1 and the discussion immediately after it (printed pp. 355–356), separates the finite-dimensional Kolmogorov construction from the subsequent continuity theorem. Sousi, Section 6.2, makes the same separation before Theorem 6.4.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Brownian covariance is equivalent to independent stationary normal increments

Statement

Assume the Axiom of Choice. Let X=(Xt)t0 be a real process with X0=0 almost surely. The following are equivalent:

  1. X is a centered Gaussian process with Cov(Xs,Xt)=min(s,t) for all s,t0.
  2. For every finite list 0=t0<t1<<tn, the increments XtjXtj1, 1jn, are mutually independent and have laws N(0,tjtj1).

Facts & Assumptions

Given: AC, a real process X with X0=0 almost surely, and either condition 1 or condition 2.

[F1]

Finite evaluation vectors of a Gaussian process are possibly singular multivariate normal, and every finite linear combination is normal. Gaussian process

[F2]

Under AC, Nn(m,Σ) exists for every positive semidefinite Σ and has a realization m+Σ1/2Z with independent standard normal coordinates. Multivariate normal law, including singular covariance

[F3]

Under AC, the characteristic function of Nn(m,Σ) is uexp(iumuTΣu/2) and uniquely determines the vector law. Characteristic function of a multivariate normal law

[F4]

A scalar N(m,σ2) law has characteristic function uexp(imuσ2u2/2), including σ=0. Characteristic function of a normal law

[F5]

Characteristic functions respect affine maps and multiply for finite sums of mutually independent real random variables. Characteristic functions under affine maps and independent sums

[F6]

Under AC, equality of scalar characteristic functions determines the law. Uniqueness of a law from its characteristic function

[F7]

Mutual independence is the finite measurable-rectangle factorization property and hence depends only on the joint law. Independent random elements are characterized by finite rectangle probabilities

[F8]

Products of integrable functions of independent random variables factor in expectation. Expectations factor over finite products of independent random variables

Proof

technique · direct
1.1

Assume condition 1 and fix 0=t0<t1<<tn. By [F1], the increment vector Δ=(XtjXtj1)j=1n is multivariate normal. It is centered, and Var(Δj)=tjtj1. If i<j, expanding the four covariance terms and using ti1<titj1<tj gives Cov(Δi,Δj)=tititi1+ti1=0. Thus ΔNn(0,D) for D=diag(tjtj1), by [F3].

givenF1F3algebra
1.2

Conversely assume condition 2. Given any finite time list, discard repetitions only for the construction and write its distinct positive values as 0=r0<r1<<rk. Put Δ=XrXr1. Then condition 2 makes these independent with ΔN(0,rr1), and telescoping with X0=0 gives Xt=:rtΔ almost surely at every time in the original list.

given
2.1

By [F2], Nn(0,D) is also the joint law of the vector (tjtj1Zj)j=1n with independent standard normals Zj. The joint-law identity in step 1.1 transfers every measurable-rectangle probability, so [F7] makes the Δj mutually independent; their one-coordinate laws are N(0,tjtj1). For n=0 this is the vacuous empty family. Hence condition 2 holds.

step 1.1F2F7
2.2

For coefficients a1,,am attached to the original time list, step 1.2 rewrites j=1majXtj==1kbΔ,b=j:rtjaj. By [F4]–[F5], its characteristic function is =1kexp ⁣(12u2b2(rr1))=exp ⁣(12u2=1kb2(rr1)). By [F4] and [F6], this is a centered normal law, including the empty sum and variance zero. Since the list and coefficients were arbitrary, [F1] makes X a centered Gaussian process.

step 1.2F1F4F5F6algebra
3.1

For 0st, condition 2 decomposes Xt=Xs+(XtXs) into independent centered normal variables. Consequently [F8] gives E[XsXt]=E[Xs2]+E[Xs]E[XtXs]=s, while both means are zero by step 2.2; symmetry gives Cov(Xs,Xt)=min(s,t) for every order of s,t. The cases s=0, s=t, and t=0 follow from the same formula and X0=0 almost surely. Thus condition 1 holds. AC is used exactly in [F1]–[F4] and [F6], for the library's normal-law constructions and characteristic-function uniqueness; no path regularity is asserted.

step 1.2step 2.2F4F7F8algebra

Source notes

Yoshida's Lemma 6.1.3, printed pp. 173–174, proves both directions, including Gaussianity from independent normal increments. Sousi, Sections 6.1–6.2, uses the same characterization. The reverse direction here is stated for an arbitrary process, repairing the scaffold's circular assumption that the process was already Gaussian.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Brownian motion

Definition

Assume the Axiom of Choice The Axiom of Choice. A real process B=(Bt)t0 is a standard Brownian motion if:

  1. B0=0 almost surely;
  2. for every finite list 0=t0<t1<<tn, the increments BtjBtj1 are mutually independent and have laws N(0,tjtj1); and
  3. there is one measurable event A with P(A)=1 such that tBt(ω) is continuous on [0,) for every ωA.

By Brownian covariance is equivalent to independent stationary normal increments, the first two clauses are equivalent to saying that B is a centered Gaussian process with covariance min(s,t). Clause 3 is additional: it cannot be recovered from finite-dimensional distributions alone.

No filtration is part of this definition. In particular, no completed or right-continuous filtration and no Markov or martingale assertion is silently imposed. Modifications and indistinguishability retain the distinct meanings in Process law, modification, and indistinguishability. The cases n=0, t1=0, and zero-length increments are respectively vacuous or already covered by B0=0; the increment list itself is strictly increasing.

Choice is declared because the normal-law and Gaussian/increment-equivalence interfaces construct and identify normal laws under AC. The continuity clause selects no path and makes no additional use of choice.

Source notes

Sousi, Section 6.1 (printed p. 51), gives these three defining clauses. The common full-measure event formulation makes the pathwise quantifier explicit.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Kolmogorov continuity criterion in one parameter

Statement

Let (S,d) be a complete separable metric space and let X=(Xt)t0 be an S-valued process. Suppose α,β>0 and a family of finite constants (CT)T>0 are given such that E[d(Xt,Xs)α]CTts1+β(0s,tT). Then X has a continuous modification Y. Moreover, one version can be chosen such that, on one event of probability one, its paths are Hölder on every compact interval for every exponent 0<γ<β/α.

Facts & Assumptions

Given: The metric-space, process, exponent, constant-family, and moment-bound hypotheses in the Statement.

[F1]

Completeness means every Cauchy sequence converges in S; separability provides a countable dense subset. Complete metric space: every Cauchy sequence converges in the space Separability: the existence of an at most countable dense subset

[F2]

For a nonnegative random variable Z and a>0, P(Za)E[Z]/a on an arbitrary probability space. Markov's inequality for random variables

[F3]

A finite or countable union has measure at most the sum of the member measures. Finite and countable subadditivity of measures

[F5]

If the sum of event probabilities is finite, only finitely many events occur almost surely. First Borel-Cantelli lemma for events

[F6]

Bounded almost-everywhere convergence of measurable indicators implies convergence of their expectations. Dominated convergence

[F7]

A modification agrees with the original process almost surely at every fixed time; this is weaker than indistinguishability. Process law, modification, and indistinguishability

[F8]

The rationals are countable, and strictly between two real numbers lies a rational. Q is countably infinite The rationals embed densely in the reals

Proof

technique · direct
1.1

Let D={k2n:k,nN0} be the nonnegative dyadic times. Fix an integer N1 and a rational η with 0<η<β/α. For n0, let EN,η,n be the event that some adjacent level-n dyadic pair k2n,(k+1)2n in [0,N] has d(X(k+1)2n,Xk2n)>2nη. These are measurable finite unions.

given
2.1

Each of the at most N2n edges in step 1.1 has, by [F2] and the moment hypothesis, probability at most CN2n(1+βαη). Hence [F3] gives P(EN,η,n)NCN2n(βαη). The exponent is positive, so [F4] makes the sum over n finite and [F5] shows that, almost surely, only finitely many EN,η,n occur.

step 1.1F2F3F4F5
3.1

Intersect the probability-one conclusions of step 2.1 over the countable set of integer N1 and rational η(0,β/α), and call the resulting measurable event H. Countability follows from [F8], and its complement is a countable union of null sets and is null by [F3]. Fix ωH,N,η. The eventual edge bound can be enlarged over its finitely many exceptional levels to a finite K=K(ω,N,η) satisfying d(X(k+1)2n(ω),Xk2n(ω))K2nη for every level-n edge in [0,N].

step 2.1F3F8
4.1

If p,qD[0,N] and 2(m+1)<pq2m, compare each point with its level-m dyadic floor. Successive binary floors differ by at most one edge of level j+1, so step 3.1 and [F4] bound each tail by Kjm2(j+1)η=K2(m+1)η/(12η); the two level-m floors differ by at most one level-m edge. Therefore d(Xp(ω),Xq(ω))K ⁣(1+21η12η)2mηKpqη. Equality p=q is trivial. Thus the sample values on the dense dyadic set are locally Hölder.

step 3.1F4algebra
5.1

For t0, let qj(t) be the largest level-j dyadic not exceeding t; then 0tqj(t)<2j0 by [F9]. On H, step 4.1 makes (Xqj(t)(ω))j Cauchy on any integer compact containing t, so [F1] gives a unique limit. Define Yt(ω) to be this limit on H and X0(ω) on Hc. Equivalently, the measurable maps Zjt=Xqj(t) on H and Zjt=X0 on Hc converge pointwise to Yt.

step 4.1F1F9
6.1

Each Yt is a Borel random element. Indeed, for a nonempty closed FS, continuity of xd(x,F) and step 5.1 give {YtF}=r1J1jJ{d(Zjt,F)<1/r}; the formula is also correct in the limiting direction because F is closed, while the empty closed set has empty inverse image. Thus inverse images of closed, hence Borel, sets are measurable. No point of S was selected: the already given X0(ω) supplies the value on Hc.

step 5.1
6.2

Letting dyadic p,q tend to arbitrary s,t[0,N] in step 4.1 shows on H that d(Ys,Yt)Kstη. Hence every path of Y on H is continuous and is locally η-Hölder for every rational η<β/α. For arbitrary 0<γ<β/α, [F8] supplies one rational η strictly between them; on [0,N], the η-bound implies the γ-bound after multiplying its constant by max(1,Nηγ). This gives all exponents simultaneously on the single event H.

step 4.1step 5.1F8algebra
7.1

Fix t and an integer N>t. The moment hypothesis and [F2] give P(d(Xqj(t),Xt)>ε)CNεαqj(t)t1+β0. Since Zjt=Xqj(t) off only the null event Hc, the same convergence holds with Zjt. On the other hand, ZjtYt pointwise, so [F6] applied to 1{d(Zjt,Yt)>ε} makes the corresponding probabilities tend to zero. The triangle inequality now gives P(d(Xt,Yt)>2ε)P(d(Xt,Zjt)>ε)+P(d(Zjt,Yt)>ε)0. The left side is independent of j, hence is zero; intersecting over ε=1/r gives Xt=Yt almost surely. Thus [F7] makes Y a modification of X, and step 6.2 supplies all promised path regularity. The constants (CT) were supplied as data, and every other construction was canonical or countably intersected, so no choice axiom is used.

step 5.1step 6.2F2F6F7

Source notes

Durrett's Theorem 7.1.3, printed pp. 356–358, and Sousi's Theorem 3.19 give the complete dyadic Markov--Borel--Cantelli and chaining argument. The local proof also supplies the complete-target extension, Borel measurability of its pointwise metric limit, and the fixed-time modification argument. Yoshida Section 6.3 gives the same Hölder exponent threshold.

LemmaStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-14Open item page →

Gaussian even moments for Brownian increments

Statement

Assume the Axiom of Choice. If 0s,t and a real random variable XtXs has law N(0,ts), then, for every integer m1, EXtXs2m=cmtsm, where cm=EZ2m=(2m1)!!=13(2m1)< for ZN(0,1). In particular, when m2, this is the moment hypothesis of the one-parameter Kolmogorov criterion with α=2m, β=m1, and CT=cm.

Facts & Assumptions

Given: Times s,t0, the stated increment law, and an integer m1.

[F1]

Under AC, N(0,1) is the probability measure with density ϕ(x)=ex2/2/2π, and N(0,h) is its image under xhx, including h=0. Standard normal and normal laws The Axiom of Choice

[F2]

A nonnegative expectation is the integral of the corresponding function against the random variable's law. Change of variables for expectation

[F3]

Integration against the measure with density ϕ equals integration of the product with ϕ against Lebesgue measure. Integrating against a density agrees with integrating the product

[F4]

Increasing nonnegative measurable functions may be passed to the limit under the integral. Monotone convergence for the integral

[F5]

Compact-interval integration by parts includes its two endpoint terms. Under countable choice, a bounded Riemann-integrable function on a compact interval is Lebesgue integrable there with the same integral. If u,v are differentiable on [a,b] with u,v integrable, then abuv=u(b)v(b)u(a)v(a)abuv A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral

[F7]

The exponential is its nonnegative power series, so for R>0 and every integer k0, eR2/2(R2/2)k/k!. The power-series, product-limit, IVP, functional-equation, and Picard definitions agree

Proof

technique · direct
1.1

Let Z be the coordinate map on the canonical N(0,1) probability space. By [F1]--[F3], for each integer r0, EZ2r=Rx2rϕ(x)dx, with either side initially allowed to be infinite.

F1F2F3
1.2

For an integer R1 and r1, [F5] on [R,R], applied to u(x)=x2r1 and v(x)=ϕ(x), is legitimate by [F6] and gives RRx2rϕ(x)dx=2R2r1ϕ(R)+(2r1)RRx2r2ϕ(x)dx. The sign and factor two come from the odd power at the two endpoints and the evenness of ϕ.

F5F6algebra
2.1

Taking k=r+1 in [F7] shows 0R2r1ϕ(R)2r+1(r+1)!2πR30. The compact bridge in [F5] identifies every Riemann integral in step 1.2 with the corresponding Lebesgue integral. The truncated nonnegative integrands then increase to their whole-line counterparts, so [F4], step 1.1, and ϕ=1 from [F1] yield recursively c0=1,cr=(2r1)cr1. Thus cm=(2m1)!! and every cm is finite.

step 1.1step 1.2F1F4F5F7algebra
3.1

Put h=ts. By [F1], the law N(0,h) is that of hZ; applying [F2] to the nonnegative function xx2m and using step 2.1 gives EXtXs2m=EhZ2m=hmcm. This includes h=0, when both sides vanish and the law is the Dirac mass at zero.

givenstep 2.1F1F2algebra
4.1

If m2, set α=2m and β=m1>0. Then m=1+β, so step 3.1 reads EXtXsα=cmts1+β. The constant CT=cm is finite and independent of T. AC is used through [F1], which supplies the normal-law probability measure, and through the countable-choice hypothesis of the compact bridge used in step 2.1; all truncations and the recurrence are canonical.

step 2.1step 3.1F1algebra

Source notes

Durrett, Section 7.1, printed p. 358, uses the finite even moments of a normal increment in the Brownian continuity argument. Steps 1.1--2.1 supply the full compact-truncation integration-by-parts calculation, including the boundary term and its limit.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Existence of continuous Brownian motion

Statement

Assume the Axiom of Choice. The canonical centered Gaussian coordinate process with covariance E[XsXt]=min(s,t) has a continuous modification B, and B is a standard Brownian motion. In particular, standard Brownian motion exists.

Facts & Assumptions

Given: The Axiom of Choice.

[F1]

Under AC, the consistent Brownian Gaussian finite-dimensional laws define a canonical coordinate process X with mean zero and covariance min(s,t). Kolmogorov construction of the canonical Gaussian process

[F2]

A normal increment of variance ts has fourth moment 3ts2. Gaussian even moments for Brownian increments

[F3]

The one-parameter continuity criterion turns the corresponding moment bound into a continuous modification. It uses no choice once its constants are supplied. Kolmogorov continuity criterion in one parameter

[F4]

For a real process starting at zero, centered Gaussian covariance min(s,t) is equivalent to independent stationary normal increments. Brownian covariance is equivalent to independent stationary normal increments

[F5]

Brownian motion consists of the initial condition, those increments, and one probability-one continuity event. Brownian motion

[F7]

A finite union of null events is null. Finite and countable subadditivity of measures

[F8]

AC is available for the Gaussian-law and Kolmogorov-extension suppliers. The Axiom of Choice

Proof

technique · direct
1.1

By [F1], on the canonical coordinate probability space there is a centered Gaussian process X with covariance min(s,t). In particular X0=0 almost surely, and [F4] gives XtXsN(0,ts) for all s,t0.

givenF1F4
2.1

By [F2] with m=2, EXtXs4=3ts2. By [F6], the real target is complete and separable. Thus [F3], with α=4, β=1, and the supplied constants CT=3, gives a modification B of X and one probability-one event on which every path of B is continuous.

step 1.1F2F3F6
3.1

Fix a finite time list t1,,tn. Since B is a modification, each event {BtjXtj} is null; [F7] makes their finite union null. Hence the two evaluation vectors agree almost surely and have the same law. This includes the empty list, for which both laws are the unit mass on the empty tuple. Consequently all finite-dimensional laws of B equal those of X, so B is centered Gaussian with covariance min(s,t) and B0=0 almost surely.

step 1.1step 2.1F7
4.1

Apply [F4] to B: it has the independent N(0,tjtj1) increments on every finite increasing list. Together with B0=0 from step 3.1 and the common continuity event from step 2.1, [F5] says that B is standard Brownian motion. AC is used through [F1], [F2], [F4], and [F5] for normal-law construction and the arbitrary-index extension; the continuity construction [F3] adds no choice.

step 2.1step 3.1F1F2F3F4F5F8

Source notes

Durrett, printed pp. 355–358, constructs the canonical Gaussian process and then repairs its paths by the continuity theorem. Sousi, Section 6.2, follows the same route. Step 3.1 records the finite-union argument needed to preserve finite-dimensional laws under modification.

CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Brownian paths are locally Holder below one half

Statement

Assume the Axiom of Choice. If B is a standard Brownian motion, then there is one event H of probability one such that, for every ωH, every T>0, and every 0<γ<1/2, there is a finite constant K=K(ω,T,γ) satisfying Bt(ω)Bs(ω)Ktsγ(0s,tT). Thus the assertion holds for the given continuous Brownian version, not merely for some unrelated modification.

Facts & Assumptions

Given: A standard Brownian motion B.

[F1]

Brownian increments have law N(0,ts), and the Brownian definition supplies one probability-one event of continuous paths. Brownian motion

[F2]

For each integer m2, Brownian increments satisfy the Kolmogorov moment bound with exponent threshold (m1)/(2m). Gaussian even moments for Brownian increments

[F3]

The continuity criterion gives a continuous modification which is locally Hölder for every exponent below its threshold, simultaneously. Kolmogorov continuity criterion in one parameter

[F4]

The rationals are countable and dense; a countable union of null events is null. Q is countably infinite The rationals embed densely in the reals Finite and countable subadditivity of measures

[F5]

Two continuous real-valued maps agreeing on a dense subset are equal. Two continuous maps into a Hausdorff space that agree on a dense subset are equal

[F6]

The natural numbers are cofinal in the reals. Every complete ordered field is Archimedean

[F7]

AC is available to select the countable family of modifications furnished by [F3]. The Axiom of Choice

Proof

technique · direct
1.1

For each integer m2, [F1]--[F3] give a continuous modification Y(m) of B and a probability-one event Hm on which its paths are locally Hölder for every exponent below (m1)/(2m). Use [F7] to select one such pair for each m.

givenF1F2F3F7
2.1

Let C be the probability-one continuity event for B from [F1]. For each m and nonnegative rational q, modification gives P(Bq=Yq(m))=1. By countability and subadditivity in [F4], the intersection H=Cm2Hmm2qQ0{Bq=Yq(m)} has probability one.

step 1.1F1F4
3.1

Fix ωH and m2. On every interval [0,N], the two real functions tBt(ω) and tYt(m)(ω) are continuous and agree on the dense rational subset. By [F4]--[F5] they agree everywhere on [0,N], hence on [0,). Therefore B(ω) inherits all local Hölder exponents below (m1)/(2m).

step 2.1F4F5
4.1

Given 0<γ<1/2, [F6] supplies an integer m2 so large that 1/(2m)<1/2γ, equivalently γ<(m1)/(2m). Step 3.1 then gives the displayed Hölder bound on every [0,T], with its constant allowed to depend on ω,T,γ. The same event H works for all uncountably many γ, because only the countable integer family was intersected. AC is used exactly at step 1.1 and through the normal-law content of [F1]--[F2].

step 1.1step 3.1F1F2F6algebra

Source notes

Sousi and Yoshida give the Brownian Hölder conclusion below one half from even normal moments and Kolmogorov continuity. Steps 2.1--3.1 supply the explicit dense-set indistinguishability argument that transfers the property back to the given continuous Brownian version.

DefinitionDefinition: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Uniform-on-compacts metric on continuous path space

Definition

Let C=C([0,),R) be the set of continuous real-valued paths. For f,gC define duoc(f,g)=n=12n(1max0tnf(t)g(t)). Then duoc is a finite metric on C, and its metric topology is exactly the topology of uniform convergence on compact subsets of [0,). We call it the uniform-on-compacts metric.

Facts & Assumptions

Verification

technique · direct
1.1

By [F3] and [F6], each maximum in the definition exists and is finite. Every summand lies in [0,2n], so [F4] proves that the series converges to a finite value in [0,1].

F3F4F6
1.2

Let K[0,) be compact and let ε>0. If K is empty, its basic neighborhood from [F1] is all of C. Otherwise the identity function attains a finite maximum on K by [F3], and [F5] gives an integer N1 with K[0,N]. Put a=min(1/2,ε). If duoc(f,g)<2Na, then the Nth term gives 1maxtNf(t)g(t)<a, hence fg<ε throughout K. Thus every compact-convergence basic neighborhood contains a duoc-ball.

F1F3F5algebra
1.3

Conversely, given a duoc-ball of radius ε>0, use [F4] to choose N with 2N<ε/2. If maxtNf(t)g(t)<ε/2, then the first N terms sum to less than ε/2, while [F4] makes the remaining tail at most 2N<ε/2. Hence duoc(f,g)<ε. The neighborhood controlling the compact interval [0,N] therefore lies inside the metric ball.

F1F3F4algebra
2.1

Symmetry is termwise. If duoc(f,g)=0, every nonnegative summand is zero; hence f=g on every [0,n], and therefore on their union [0,). Conversely f=g makes every term zero.

step 1.1F2algebra
3.1

For each n, the ordinary triangle inequality gives maxtnf(t)h(t)maxtnf(t)g(t)+maxtng(t)h(t). Since 1(a+b)(1a)+(1b) for a,b0, multiplication by 2n and summation give duoc(f,h)duoc(f,g)+duoc(g,h). With step 2.1, [F2] proves that duoc is a metric.

step 1.1step 2.1F2algebra
4.1

Steps 1.2 and 1.3 give mutual refinement of the neighborhood bases at every f, so the two topologies coincide. Equivalently, duoc(fj,f)0 exactly when fjf uniformly on every compact subset. No choice is used: maxima and integer bounds exist with unique least choices if a witness is desired, and every sum is over the fixed natural order.

step 1.2step 1.3F1

Source notes

The bounded weighted-sum metric is the standard metrization of local uniform convergence. The verification records both neighborhood containments, including the empty compact set and the geometric tail.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Under countable choice, continuous path space is Polish

Statement

Assume the Axiom of Countable Choice. The uniform-on-compacts metric makes C([0,),R) a complete separable metric space. Consequently its metric topology, equivalently the topology of uniform convergence on compact sets, is Polish.

Facts & Assumptions

Given: The Axiom of Countable Choice and the uniform-on-compacts metric duoc.

[F2]

For a complete target, the continuous-function space on a nonempty domain is complete in the bounded uniform metric, and uniform limits are continuous. If (Y,d) is complete then YX is complete in the uniform metric, and so is C(X,Y) A uniform limit of continuous functions is continuous, so C(X,Y) is closed in YX under the uniform metric

[F4]

A continuous map on a compact metric space is uniformly continuous. Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous

[F5]

The rationals are countable and dense in the real line. Q is countably infinite The rationals embed densely in the reals

[F6]

Finite products of countable sets are countable, and under ACω a countable union of countable sets is countable. A product of two at most countable sets is at most countable Countable unions of at most countable sets, assuming ACω The Axiom of Countable Choice (ACω)

[F7]

The natural numbers are cofinal in the reals. Every complete ordered field is Archimedean

[F8]

A topology is Polish when it is separable and induced by a complete metric. Polish spaces are separable completely metrizable spaces

Proof

technique · direct
1.1

Let (fj) be duoc-Cauchy and fix n1. For every 0<ε<1, eventually duoc(fj,fk)<2nε, so its nth summand forces maxtnfj(t)fk(t)<ε. Thus the restrictions to [0,n] are uniformly Cauchy. By [F2]--[F3] they have a unique continuous uniform limit gn.

givenF1F2F3
1.2

For integers N,M1 and a rational tuple (r0,,rNM), let pN,M,r be linear on every interval [k/M,(k+1)/M] with node value rk, and constant after time N. Let P be the family of all these paths. For fixed N,M, its parameter tuples form a finite power of Q, countable by repeated applications of [F5]--[F6]. The pairs (N,M) are countable, so [F6], using the assumed ACω exactly at its countable-union clause, makes P countable.

F5F6
1.3

Fix f and ε>0. By [F1] and the geometric tail in its definition, choose N with n>N2n<ε/2. By [F3]--[F4], f is uniformly continuous on [0,N]; choose δ>0 so st<δ implies f(s)f(t)<ε/4. By [F7], choose M with 1/M<δ, and by the density in [F5] choose the finitely many rationals rk with rkf(k/M)<ε/4. For the corresponding pP, convex interpolation between adjacent node errors gives maxtNp(t)f(t)<ε/2. Hence the first N metric terms sum to less than ε/2 and the tail to less than ε/2, so duoc(p,f)<ε.

F1F3F4F5F7algebra
2.1

If m<n, uniqueness of uniform limits makes gn[0,m]=gm. Hence f(t)=gn(t) for any integer nmax(1,t) is well defined; equivalently use the least such integer. Its restriction to each [0,n] is gn, so f is continuous and fjf uniformly on every compact interval. By [F1], duoc(fj,f)0. Therefore the path-space metric is complete. No choice is used here: every gn is the unique limit.

step 1.1F1F2
3.1

Step 1.3 makes the countable family P from step 1.2 dense, so the metric space is separable. Combining this with completeness from step 2.1 and the topology identity from [F1], [F8] proves that the compact-convergence path space is Polish. Countable choice was used only in step 1.2; the finitely many rational approximations in step 1.3 are obtained by finite induction.

step 2.1step 1.2step 1.3F1F6F8

Source notes

The cited weak-convergence text uses this standard Polish path space. The local proof exhibits the compatible compact limits and an explicit dense family of eventually constant rational polygonal paths, so completeness and the exact choice use are visible.

DefinitionDefinition: AI-adaptedProof: AI-adaptedaudited 2026-09-14Open item page →

Wiener measure on continuous path space

Definition

Assume the Axiom of Choice. Let B be a continuous Brownian motion supplied by the existence theorem, and let A be one measurable probability-one event on which all of its sample paths are continuous. Redefine B~t(ω)={Bt(ω),ωA,0,ωA. and set W(ω)(t)=B~t(ω). Then W is a Borel random element of C([0,),R) with its uniform-on-compacts topology. Its law W=PW1 is called Wiener measure. It is a probability measure and its coordinate process has the Brownian finite-dimensional distributions.

Facts & Assumptions

Given: AC, a Brownian motion B, and its common measurable continuity event A as in the Definition.

[F1]

Under AC, a continuous Brownian motion exists together with one measurable probability-one event on which every one of its sample paths is continuous. Existence of continuous Brownian motion Brownian motion The Axiom of Choice

[F2]

The uoc formula is a metric inducing compact convergence, and this path space is Polish and therefore separable. Uniform-on-compacts metric on continuous path space Under countable choice, continuous path space is Polish Separability: the existence of an at most countable dense subset

[F3]

Countable suprema and pointwise limits of measurable real or extended-real functions are measurable; sums, scalar multiples, positive parts, and absolute values preserve measurability. Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable Closure properties of measurable functions used by the integral

[F4]

The rationals are countable, and between any two nonnegative reals lies a nonnegative rational. Thus Q[0,) is dense in [0,) with its relative topology. Q is countably infinite The rationals embed densely in the reals

[F6]

A measurable map into a measurable space is a random element, and its law is a probability measure. Random elements and real random variables The law of a random element is a probability measure

Verification

technique · direct
1.1

By [F1], fix B and A as in the Definition. Every path W(ω) is continuous: on A it is a Brownian path, and off A it is the zero path. For fixed t, B~t is measurable because for each Borel E, its inverse image is (A{BtE}) together with Ac exactly when 0E.

givenF1
2.1

Fix fC([0,),R) and n1. By path continuity and density [F4], Mn,f(ω):=max0tnW(ω)(t)f(t)=supqQ[0,n]B~q(ω)f(q). Enumerate the countable rational set once. Each function under the supremum is measurable by step 1.1 and [F3], so [F3] makes Mn,f measurable and finite.

step 1.1F3F4
3.1

By [F3], every finite partial sum DN,f=n=1N2n(1Mn,f) is measurable; here 1M=1(1M)+. The partial sums converge pointwise to duoc(W,f) by [F2], so [F3] makes that distance measurable. Therefore the inverse image under W of every open metric ball is measurable. By separability in [F2], fix a countable dense D; the balls with centers in D and positive rational radii form a countable basis, by the metric triangle inequality and rational density, and [F5] makes every subfamily countable. Every open set is therefore a countable union of such balls. Since open sets generate the Borel sigma-algebra by [F5], W is Borel measurable and hence a random element by [F6].

step 2.1F2F3F4F5F6
4.1

By [F6], W=PW1 is a probability measure. For any finite times t1,,tk, the vectors (B~tj)j=1k and (Btj)j=1k agree on A, hence almost surely, so their laws coincide. The coordinate vector (πtj)j=1k under W has exactly the former law by the pushforward definition. Thus the coordinate process under Wiener measure has every Brownian finite-dimensional law. Empty tuples have the unit law and π0=0 almost surely.

step 1.1step 3.1F6
5.1

The zero path used on Ac is fixed and canonical. AC is used only through [F1] to obtain the normal-law construction and Brownian process; redefining a given process on its one supplied null event, taking fixed rational suprema, and pushing forward use no further choice.

step 1.1step 4.1F1

Source notes

Durrett and Sousi construct Brownian motion from its finite-dimensional laws. The verification supplies the path-map measurability required before its law on continuous path space may honestly be called Wiener measure.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Borel sigma-algebra of continuous path space is generated by coordinates

Statement

Put C=C([0,),R), give C the uniform-on-compacts topology, and write πt(f)=f(t). Then B(C)=σ(πt:t0)=σ(πq:qQ[0,)). Here each expression on the right denotes the smallest sigma-algebra on C making every displayed coordinate map measurable. No choice principle is used.

Facts & Assumptions

Given: The path space C, its uoc metric d, and its coordinate maps as in the Statement. Write G for the sigma-algebra generated by all coordinates and GQ for that generated by the nonnegative rational coordinates.

[F1]

The uoc metric is d(f,g)=n12n(1Mn(f,g)),Mn(f,g)=max0tnf(t)g(t), and its topology is compact convergence. Uniform-on-compacts metric on continuous path space

[F3]

Countable suprema and pointwise limits of measurable real functions are measurable; finite sums, scalar multiples, positive parts, and absolute values preserve measurability. Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable Closure properties of measurable functions used by the integral

[F4]

The rationals are countable and dense in the reals. There is a fixed bijection between N2 and N, recursion constructs nested finite codes, finite products of countable sets are countable, and a subset of a countable set is countable. Q is countably infinite The rationals embed densely in the reals N×NN The recursion theorem A product of two at most countable sets is at most countable Every subset of an at most countable set is at most countable

Proof

technique · direct
1.1

Fix t0 and choose an integer n1 with tn. If ε>0, then d(f,g)<2nmin{1,ε} implies 2n(1Mn(f,g))<2nmin{1,ε} and hence πt(f)πt(g)Mn(f,g)<ε. Thus every πt is continuous, so it is Borel measurable. Minimality in [F2] gives GQGB(C).

F1F2
1.2

Fix t0 and put qj=2j2jt. Then qjQ[0,) and 0tqj<2j, so qjt by [F6]. For every fC, continuity gives πqj(f)πt(f). Every πqj is GQ-measurable by definition, so [F3] makes πt measurable. Hence GGQ by minimality, and therefore G=GQ.

F2F3F6
1.3

Let D be the family of paths which, for some integers N,m1, are affine on each interval [k/m,(k+1)/m] for 0k<mN, take rational values at all grid points k/m, and are constant after N. This family is countable without choice. Indeed, fix bijections e:NQ and p:NN2. Nested use of p1 codes every finite sequence of naturals by one natural (and repeated application of p decodes it); composing entries with e codes every finite rational sequence. A further finite nesting codes (N,m) together with that sequence, giving a surjection from a subset of N onto D. Thus [F4] makes D at most countable.

F4construct
1.4

The family D is uoc dense. Given fC and ε>0, use [F6] to choose N with n>N2n<ε/2. By [F5], f is uniformly continuous on [0,N]; choose m so that the oscillation of f over distances at most 1/m is less than ε/4. By rational density, choose rational ak with akf(k/m)<ε/4 for the finitely many 0kmN (finite induction, not a choice principle), and let gD interpolate these values and remain constant after N. On a grid interval, convex interpolation and the triangle inequality give g(t)f(t)<ε/2. Consequently d(f,g)n=1N2nMn(f,g)+n>N2n<ε. This also covers t=0 and t=N.

F1F4F5F6construct
1.5

Fix fC. For n1, continuity and rational density give Mn(g,f)=supqQ[0,n]πq(g)f(q). Enumerating that rational set, [F3] makes Mn(,f) GQ-measurable. The finite partial sums of the metric formula are measurable by [F3] and converge pointwise to d(,f), so this distance is measurable. Hence every metric ball, with an arbitrary center, belongs to GQ.

F1F3F4
2.1

The balls B(h,r) with hD and positive rational r form a countable base: countability follows from [F4], while density from step 1.4 and the triangle inequality put such a ball around every point inside any prescribed open ball. For an open U, let VU be the subfamily of these basic balls which are contained in U. It is countable by [F4], every member belongs to GQ by step 1.5, and U=VU. Thus every open set is in GQ; [F2] yields B(C)GQ. Combining this with steps 1.1 and 1.2 proves all stated equalities. The zero path shows C and D are nonempty; singleton and zero-time coordinates cause no exception, and no countable family of nonempty sets was selected.

F2F4F7step 1.1step 1.2step 1.4step 1.5

Source notes

Van der Vaart and Wellner use the standard fact that the Borel sigma-algebra on a separable continuous-function space is generated by evaluations. The proof above supplies the complete uoc and rational-coordinate argument, including an explicit choice-free countable basis.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Uniqueness of Wiener measure

Statement

Assume the Axiom of Choice. There is exactly one probability measure μ on B(C([0,),R)) for which the coordinate process πt(f)=f(t) is centered Gaussian with Covμ(πs,πt)=min(s,t),s,t0. That probability is Wiener measure.

Facts & Assumptions

Given: AC, the uoc path space C=C([0,),R), and its coordinate maps πt.

[F1]

Wiener measure exists as a probability on B(C), and its coordinate process has the Brownian finite-dimensional distributions. A Brownian motion is equivalently a centered Gaussian process with covariance min(s,t), in addition to path continuity. Wiener measure on continuous path space Brownian motion The Axiom of Choice

[F2]

Gaussian processes with identical mean and covariance functions have identical finite-dimensional laws, including singular laws and repeated-time lists. Mean and covariance determine Gaussian finite-dimensional laws

[F3]

The Borel sigma-algebra of C is generated by the nonnegative rational coordinate maps. Borel sigma-algebra of continuous path space is generated by coordinates

[F4]

A lambda-system contains the whole space, relative differences of nested members, and increasing countable unions. Measures are continuous from below, and a lambda-system containing a pi-system contains the sigma-algebra generated by that pi-system. Lambda-systems, or Dynkin systems Continuity from below for measures Dynkin's pi-lambda theorem

Proof

technique · direct
1.1

By [F1], Wiener measure is a probability measure on B(C) and its coordinate process is centered Gaussian with covariance min(s,t). Thus at least one probability with the stated property exists. AC is used here through the normal-law and Brownian construction interfaces; the uniqueness argument below makes no further use of it.

F1
1.2

Let μ and ν be two probabilities with the stated property. By [F2], for every k1, every nonnegative rational list q1,,qk (with repetitions allowed), and Borel sets AiR, μi=1k{f:f(qi)Ai}=νi=1k{f:f(qi)Ai}. Indeed this is equality of the two finite-dimensional laws on the Borel rectangle A1××Ak. The same equality is trivial for the empty intersection C.

F2
2.1

Let P be the family of the finite intersections in step 1.2, including the empty intersection C. It is a pi-system because the intersection of two members is obtained by concatenating their two finite lists. Moreover σ(P)=B(C): the family contains every one-coordinate set πq1(A), while every member is a finite intersection of such sets; now apply [F3].

F3step 1.2construct
3.1

Put D={AB(C):μ(A)=ν(A)}. It contains C because both measures have total mass one. If AB and A,BD, finite additivity gives μ(BA)=μ(B)μ(A)=ν(B)ν(A)=ν(BA). If AnA with every AnD, continuity from below gives μ(A)=limnμ(An)=limnν(An)=ν(A). Hence D is a lambda-system. Step 1.2 says PD, so [F4] and step 2.1 give B(C)=σ(P)D. Thus μ=ν.

F4step 1.2step 2.1
4.1

Step 1.1 proves existence and step 3.1 proves uniqueness, so Wiener measure is exactly the asserted probability. The covariance at time zero is zero, singleton laws and singular repeated-time vectors are covered by [F2], and both directions of “exactly one” have been established.

step 1.1step 3.1F2

Source notes

Durrett constructs Wiener measure from Brownian finite-dimensional laws. The local proof supplies the rational-cylinder pi-system and the complete pi-lambda uniqueness argument.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Brownian scaling

Statement

Assume the Axiom of Choice. If B=(Bt)t0 is standard Brownian motion and c>0, then Yt=c1/2Bct,t0, is standard Brownian motion. After redefining Y to be the zero path off a common probability-one continuity event, the resulting path-space random element has Wiener measure as its law.

Facts & Assumptions

Given: AC, a standard Brownian motion B, and a real c>0.

[F1]

Brownian motion has a centered Gaussian finite-dimensional law with covariance min(s,t) and has one probability-one continuity event; conversely those Gaussian laws give the required independent normal increments. Brownian motion Gaussian process Brownian covariance is equivalent to independent stationary normal increments

[F2]

Every positive real has a unique positive square root, and nonzero reals have multiplicative inverses. Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0} The reals form a field

[F3]

The Borel sigma-algebra of continuous path space is generated by its coordinate maps. A measurable path-space random element has a probability law, and Wiener measure is the unique Borel probability whose coordinates are centered Gaussian with covariance min(s,t). Borel sigma-algebra of continuous path space is generated by coordinates The law of a random element is a probability measure Wiener measure on continuous path space Uniqueness of Wiener measure

[F4]

AC supplies the normal-law and Brownian interfaces used in [F1] and [F3]. The Axiom of Choice

Proof

technique · direct
1.1

By [F2], a=1/c is a well-defined positive real and a2c=1. For any finite times t1,,tn and coefficients u1,,un, j=1nujYtj=aj=1nujBctj. The right side is normal by the Gaussian characterization in [F1], including when coefficients vanish or times repeat. Hence Y is Gaussian and centered.

F1F2algebra
2.1

For s,t0, Cov(Ys,Yt)=a2Cov(Bcs,Bct)=a2min(cs,ct)=min(s,t). Also Y0=aB0=0 almost surely. By [F1], Y therefore has mutually independent increments YtjYtj1N(0,tjtj1) along every finite strictly increasing list.

F1F2step 1.1algebra
3.1

Let A be the single probability-one event on which tBt(ω) is continuous. For ωA, the map taBct(ω) is continuous as a composition of continuous scalar and time maps. Thus the same event A is a common continuity event for Y. Together with steps 1.1 and 2.1, this proves that Y is standard Brownian motion.

F1step 1.1step 2.1
4.1

Define Y^t=Yt on A and Y^t=0 on Ac. Every path of Y^ is continuous. For each fixed t, the random variable Y^t is measurable because A is measurable and Yt is measurable. Since the Borel sigma-algebra of continuous path space is generated by the coordinates, [F3] makes ω(tY^t(ω)) a Borel random element, and its law is a probability. Its coordinate process has the same finite-dimensional laws as Y, because the two processes agree on A; hence it is centered Gaussian with covariance min(s,t) by steps 1.1 and 2.1. Uniqueness in [F3] identifies that probability with Wiener measure. When c=1, a=1 and the process is unchanged; c=0 is excluded because neither c1/2 nor the claimed covariance normalization is defined. AC is used only through [F1] and [F3].

F1F3F4step 1.1step 2.1step 3.1

Source notes

Sousi and Yoshida state Brownian scaling. The proof records both the process claim and the measurable path-law conclusion, rather than inferring continuity from finite-dimensional distributions.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Brownian time inversion

Statement

Assume the Axiom of Choice. If B=(Bt)t0 is standard Brownian motion, then Y0=0,Yt=tB1/t(t>0) defines another standard Brownian motion. In particular, its continuity at t=0 is part of the conclusion, not an inference from its finite-dimensional laws alone.

Facts & Assumptions

Given: AC and a standard Brownian motion B with one probability-one continuity event A.

[F1]

Brownian motion is centered Gaussian with covariance min(s,t) and a common continuity event; conversely a centered Gaussian process with this covariance and such continuity is Brownian. Brownian motion Gaussian process Brownian covariance is equivalent to independent stationary normal increments

[F2]

Two Gaussian processes with the same mean and covariance functions have equal finite-dimensional laws, including singular vectors and repeated indices. Mean and covariance determine Gaussian finite-dimensional laws

[F3]

On an arbitrary product measurable space, finite-coordinate cylinders generate the cylinder sigma-algebra and form a pi-system. A measurable random element has a probability law. Coordinate maps, finite-coordinate cylinders, and the cylinder σ-algebra Finite-coordinate cylinders form a π-system Random elements and real random variables The law of a random element is a probability measure

[F4]

A lambda-system is closed under nested relative differences and increasing unions; measures are continuous from below; a lambda-system containing a pi-system contains its generated sigma-algebra. Lambda-systems, or Dynkin systems Continuity from below for measures Dynkin's pi-lambda theorem

[F5]

The positive rationals are countable and dense, and for every ε>0 there is m1 with 1/m<ε. Q is countably infinite The rationals embed densely in the reals For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε

[F6]

The intersection of two probability-one events has probability one. Basic identities for a probability measure

[F7]

AC is inherited through the Gaussian and Brownian interfaces. The Axiom of Choice

Proof

technique · direct
1.1

For any finite positive times t1,,tn and coefficients uj, the linear combination j=1nujYtj=j=1nujtjB1/tj is normal by [F1]. Appending any occurrences of t=0 only appends deterministic zero coordinates. Hence Y is a centered Gaussian process, including repeated-time and singular finite vectors.

F1algebra
2.1

For 0<st, Cov(Ys,Yt)=stCov(B1/s,B1/t)=stmin(1/s,1/t)=s. If s=0, both sides of the required identity are zero. Thus Cov(Ys,Yt)=min(s,t) for all s,t0. By [F2], Y and B have the same finite-dimensional laws.

F1F2step 1.1algebra
3.1

Let I=Q(0,) and define ΦB,ΦY:ΩRI by their coordinates. Each map is measurable for the cylinder sigma-algebra: the sets whose inverse images are measurable form a sigma-algebra containing every coordinate inverse image, hence all finite-coordinate cylinders and their generated sigma-algebra. Their pushforward laws λB,λY are therefore probabilities by [F3]. Step 2.1 makes them equal on every finite-coordinate cylinder. The class of cylinder-measurable sets on which they agree is a lambda-system by normalization, nested finite differences, and continuity from below; [F3]--[F4] therefore give λB=λY.

F3F4step 2.1
4.1

In RI put H=m1N1qI, 0<q<1/N{x:x(q)<1/m}. This is cylinder-measurable because all three index sets are countable by [F5]. The event A0=A{B0=0} has probability one by [F1] and [F6]. On A0, continuity of B at zero gives ΦBH, so λB(H)=1. Equality from step 3.1 gives P(ΦYH)=λY(H)=1.

F1F3F5F6step 3.1
5.1

On A, tYt=tB1/t is continuous for every t>0. Fix ωA with ΦY(ω)H and ε>0. Choose m with 1/m<ε by [F5], and then N from the definition of H. For every t(0,1/N), fix an enumeration of the rationals and, for each integer k1, let qk be its least-indexed member of I(0,1/N) within 1/k of t; density in [F5] makes this canonical sequence converge to t. Continuity gives Yqk(ω)Yt(ω). Since Yqk(ω)<1/m for all k1, we get Yt(ω)1/m<ε. Therefore Yt(ω)0=Y0(ω) as t0. By [F6], the set of such ω has probability one, so Y has one common continuity event on [0,).

F5F6step 4.1
6.1

Steps 1.1--2.1 give the centered Gaussian covariance characterization, and step 5.1 gives path continuity; [F1] therefore makes Y standard Brownian motion. The formula at t=0 is separately defined because 1/t is unavailable there. Empty finite lists are vacuous, singleton and repeated-time laws were included in step 1.1, and AC is used only through [F1]--[F2], not in the fixed countable rational argument.

F1F2F7step 1.1step 2.1step 5.1

Source notes

Sousi Theorem 6.7 and Yoshida Proposition 6.1.5 use equality of the rational finite-dimensional laws and positive-time continuity to obtain continuity at zero. Steps 3.1--5.1 spell out the intervening cylinder-law and measurable-event arguments.

DefinitionDefinition: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

d-dimensional Brownian motion

Definition

Assume the Axiom of Choice and let d1 be a finite integer. An Rd-valued process B=(Bt)t0 is a standard d-dimensional Brownian motion if:

  1. B0=0 almost surely;
  2. for every finite list 0=t0<t1<<tn, the vector increments BtjBtj1,1jn, are mutually independent and have laws Nd(0,(tjtj1)Id); and
  3. there is one measurable event A with P(A)=1 such that tBt(ω) is continuous from [0,) to Rd for every ωA.

Equivalently, its d coordinate processes Bα=(Btα)t0 are independent standard one-dimensional Brownian motions. Here independence of the processes means the following precise assertion. Put I=[0,) and equip RI with its cylinder sigma-algebra. The maps Φα:ΩRI,Φα(ω)(t)=Btα(ω),1αd, are independent random elements.

Facts & Assumptions

Given: AC, a finite integer d1, and an Rd-valued process B=(Bt)t0.

[F1]

Standard one-dimensional Brownian motion starts at zero, has independent normal increments on every finite increasing time list, and has one common probability-one continuity event. Brownian motion

[F2]

Under AC, Nd(m,Σ) exists for every positive semidefinite Σ, is realized as m+Σ1/2Z with independent standard-normal coordinates, and is determined by the characteristic function exp(iumuTΣu/2), including when Σ is singular. Multivariate normal law, including singular covariance Characteristic function of a multivariate normal law

[F3]

Scalar normal characteristic functions and characteristic functions of finite independent sums have their usual formulas. Characteristic function of a normal law Characteristic functions under affine maps and independent sums

[F4]

Independence of random elements is characterized by finite rectangle probabilities. Disjoint groups of an independent sigma-algebra family remain independent, and measurable coordinatewise functions preserve independence. Independent random elements Independent random elements are characterized by finite rectangle probabilities Disjoint groups of an independent sigma-algebra family remain independent Measurable coordinatewise functions preserve independence

[F5]

Finite-coordinate cylinders generate the cylinder sigma-algebra and form a pi-system; independent pi-systems containing the whole space generate independent sigma-algebras. Coordinate maps, finite-coordinate cylinders, and the cylinder σ-algebra Finite-coordinate cylinders form a π-system Independent pi-systems generate independent sigma-algebras

[F6]

Continuity of a map into finite-dimensional Euclidean space is equivalent to continuity of all its coordinates. A finite intersection of probability-one events has probability one. A vector-valued function has a limit, or is continuous, if and only if each of its components does; with the algebra of continuous vector-valued functions Basic identities for a probability measure

[F7]

AC supplies the normal-law and Brownian interfaces used above. The Axiom of Choice

Proof

technique · direct proof of the asserted equivalence
1.1

We first record the diagonal-Gaussian fact used in both directions. If XNd(0,hId) for h0, [F2] realizes that law as hZ, where the coordinates of Z are independent standard normals. Equality of vector laws preserves every rectangle probability, so the coordinates of X are independent and each has law N(0,h). This includes h=0, when every coordinate is the constant zero variable.

F2F4
1.2

Conversely, suppose that X1,,Xd are independent and each has law N(0,h). For uRd, [F3] gives EeiuX=α=1dEeiuαXα=exp ⁣(h2α=1duα2). This is the characteristic function of the existing law Nd(0,hId) by [F2], and the uniqueness clause of [F2] identifies the vector laws. Thus XNd(0,hId). For d=1 this says exactly that N1(0,h) is the scalar N(0,h) law; for h=0 both sides are the point mass at zero.

F2F3
1.3

Each Φα in the Definition is a random element: for every finite FI, the finite observation map ω(Btα(ω))tF is measurable because the inverse image of each coordinate generator is measurable. Therefore the inverse images of all finite-coordinate cylinders, and hence of their generated cylinder sigma-algebra, are measurable.

F5
2.1

Assume first that B satisfies the three vector clauses of the Definition. Fix 0=t0<<tn and put Zj=BtjBtj1. The random vectors Zj are independent, and by step 1.1 the coordinates (Zjα)α=1d within each fixed j are independent N(0,tjtj1) variables. Hence, for arbitrary Borel sets Aj,αR, P ⁣(j=1nα=1d{ZjαAj,α})=j=1nP ⁣(Zjα=1dAj,α)=j=1nα=1dP(ZjαAj,α). The rectangle criterion [F4] therefore makes the whole finite family (Zjα)j,α mutually independent.

step 1.1F4
3.1

For a fixed α, step 2.1 gives independent increments with the required scalar normal laws. The vector condition at time zero gives B0α=0 almost surely. On the vector continuity event every coordinate path is continuous by [F6]. Consequently each Bα is standard one-dimensional Brownian motion by [F1].

F1F6step 2.1
3.2

For each α, let Πα be the pullbacks by Φα of finite-coordinate cylinders. These classes are pi-systems containing Ω by [F5], and σ(Πα)=σ(Φα). To check their independence, choose one cylinder from every member of any finite subfamily of the coordinates and take the sorted union of their finitely many time supports, adjoining time zero. On the probability-one event {B0=0}, each coordinate's finite observation vector equals a measurable affine function of its own block of scalar increments. Thus its cylinder probabilities equal those of that affine function. Step 2.1 makes all scalar increments independent; [F4] first groups them by α and then preserves independence under these measurable affine maps. The chosen cylinder probabilities therefore factor. Thus the pi-systems Πα are independent, and [F5] makes the full random elements Φ1,,Φd independent. This proves the forward implication. Empty-support cylinders give Ω or and obey the same formula.

givenF4F5step 2.1step 1.3
3.3

Conversely, assume that the random elements Φ1,,Φd are independent and that every Bα is a standard one-dimensional Brownian motion. Fix 0=t0<<tn and let Uα=(BtjαBtj1α)j=1n. This is a measurable function of Φα, so [F4] makes U1,,Ud independent. Within each Uα, the scalar Brownian increments are independent and the jth has law N(0,tjtj1) by [F1]. For arbitrary Borel Aj,α, the same two-stage rectangle calculation as in step 2.1, now first over α and then over j, gives P ⁣(α=1dj=1n{Uα,jAj,α})=α=1dj=1nP(Uα,jAj,α). Hence all the scalar variables Uα,j are mutually independent.

F1F4
4.1

Group the independent scalar variables of step 3.3 by their time index j. By [F4], the resulting sigma-algebras are independent. Each vector increment Zj=(U1,j,,Ud,j)=BtjBtj1 is measurable with respect to the jth grouped sigma-algebra, so the vectors Z1,,Zn are independent. For fixed j, its coordinates are independent N(0,tjtj1) variables; step 1.2 therefore gives ZjNd(0,(tjtj1)Id).

F4step 1.2step 3.3
5.1

For every α, let Cα be a probability-one event on which the path Bα is continuous, and let Eα={B0α=0}. Because d is finite, repeated finite subadditivity in [F6] gives P ⁣(α=1d(CαEα))=1. On this one event, B0=0 and the vector path is continuous by the coordinatewise criterion [F6]. Together with step 4.1 this proves the three vector clauses, and hence the reverse implication.

F1F6step 4.1
6.1

The empty increment list is vacuous; a one-increment list is covered by steps 2.1 and 4.1; repeated times and zero-length increments are excluded by the strictly increasing convention, while time zero and the singular zero-variance law are handled in steps 1.1, 1.2, 3.1, and 5.1. The assumption d1 excludes the empty-coordinate process. AC is used through [F1]--[F3] for the normal-law and Brownian interfaces and their law uniqueness; the finite regrouping, cylinder, and continuity arguments add no further choice.

F1F2F3F7step 1.1step 1.2step 2.1step 3.1step 1.3step 3.2step 3.3step 4.1step 5.1

Source notes

Yoshida Definition 6.1.1 gives the vector-increment definition, Lemma 6.1.3 identifies diagonal multivariate-normal increments with the scalar-coordinate increment family, and Proposition 6.1.4 states the coordinate-process equivalence. The proof above supplies the cylinder-sigma-algebra promotion needed for the word “independent” to apply to whole coordinate processes. Sousi Section 6.2 constructs the vector process from independent scalar Brownian motions.

CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Existence and scaling of d-dimensional Brownian motion

Statement

Assume the Axiom of Choice and let d1 be finite.

  1. A standard d-dimensional Brownian motion exists: one may take d independent copies of the constructed one-dimensional Brownian path and assemble them coordinatewise.
  2. If B is any standard d-dimensional Brownian motion and c>0, then Yt=c1/2Bct,t0, is again standard d-dimensional Brownian motion. Moreover, the random elements B and Y have the same law on (Rd)[0,) equipped with its cylinder sigma-algebra.

Facts & Assumptions

Given: AC, a finite integer d1, and, for the scaling assertion, a standard d-dimensional Brownian motion B and a real c>0.

[F1]

Under AC, standard one-dimensional Brownian motion exists, and its zero-repaired path random element has Wiener law on C([0,),R); under Wiener measure the coordinate process has all Brownian finite-dimensional laws. The Borel sigma-algebra of this path space is generated by its evaluations. Existence of continuous Brownian motion Wiener measure on continuous path space Borel sigma-algebra of continuous path space is generated by coordinates

[F2]

Under countable choice and dependent choice, every probability law is the common law of a countable independent family of random elements. AC supplies both required choice principles. Countably many independent copies of a prescribed law exist AC supplies countable selections and prescribed serial paths

[F3]

A vector process is standard d-dimensional Brownian motion exactly when its coordinate processes, regarded as cylinder-space random elements, are independent standard one-dimensional Brownian motions. d-dimensional Brownian motion

[F4]

For c>0, the scaled process tc1/2Xct is standard one-dimensional Brownian motion whenever X is. Measurable coordinatewise maps preserve independence. Brownian scaling Measurable coordinatewise functions preserve independence

[F5]

Finite-coordinate cylinders generate the arbitrary product cylinder sigma-algebra and form a pi-system. A measurable random element has a probability law, and two finite measures agreeing on a generating pi-system and on the whole space are equal. Coordinate maps, finite-coordinate cylinders, and the cylinder σ-algebra Finite-coordinate cylinders form a π-system The law of a random element is a probability measure Finite measures agreeing on a generating pi-system and on the whole space are equal

[F6]

AC is the only ambient choice assumption. The Axiom of Choice

Proof

technique · constructive
1.1

Let W be Wiener measure on C=C([0,),R) from [F1]. By [F2], on some probability space there is a countable independent family (Xα)α1 of C-valued random elements, each with law W. Retain its first d members.

F1F2construct
1.2

For the scaling assertion, put I=[0,) and define Tc:RIRI by (Tcf)(t)=c1/2f(ct). This map is cylinder-measurable: the inverse image of a finite-coordinate cylinder supported on F is a finite-coordinate cylinder supported on cF, with its base pulled back by coordinatewise scalar multiplication.

F5construct
2.1

Define B^tα=πt(Xα) and B^t=(B^t1,,B^td) for 1αd and t0. Every Xα(ω) is a continuous path. Its finite evaluation laws are Brownian by [F1], so B^α is standard one-dimensional Brownian motion, with the whole sample space as a continuity event and with its initial and increment laws supplied by W. The inclusion J:CR[0,), J(f)=(f(t))t, is measurable because every target cylinder pulls back through finitely many Borel evaluation maps by [F1] and [F5]. Therefore the process random elements JXα are independent by [F4].

step 1.1F1F4F5construct
2.2

Return now to the arbitrary standard d-dimensional Brownian motion B in the scaling hypothesis. By [F3], its coordinate-process random elements Φα=(Btα)t are independent and each coordinate is standard one-dimensional Brownian motion. Since (Ytα)t=TcΦα, [F4] and step 1.2 show that the coordinate processes of Y remain independent, while scalar Brownian scaling makes every one of them standard Brownian motion.

givenF3F4step 1.2
3.1

Applying the coordinate equivalence [F3] to step 2.1 makes the assembled process B^ a standard d-dimensional Brownian motion. This proves existence and realizes it from independent copies of the constructed scalar path law.

step 2.1F3
3.2

The reverse direction of [F3] applied to step 2.2 shows that Yt=c1/2Bct is standard d-dimensional Brownian motion. The same common coordinate argument includes continuity at t=0; it is not inferred from finite-dimensional laws.

F3step 2.2
4.1

Any two standard d-dimensional Brownian motions have the same finite-dimensional laws. Indeed, on a sorted finite time grid their vector increments are mutually independent with the same respective laws Nd(0,(tjtj1)Id) by [F3]. Their joint increment laws therefore agree on measurable rectangles and hence on the finite product sigma-algebra by [F5]; the cumulative-sum map gives equality of the evaluation-vector laws. An arbitrary finite, unordered, or repeated time list is a coordinate projection of the sorted distinct-time vector, and an empty list has the unit law. Applying this to B and Y uses step 3.2.

F3F5step 3.2
5.1

The path maps ΘB,ΘY:Ω(Rd)I are measurable because every finite-coordinate cylinder has a measurable preimage. Their laws are probabilities by [F5]. Step 4.1 makes those laws agree on all finite-coordinate cylinders, a generating pi-system, and their total masses are both one. Finite-measure uniqueness in [F5] therefore gives L(ΘB)=L(ΘY) on the full cylinder sigma-algebra.

F5step 4.1
6.1

The construction in steps 1.1--3.1 and the scaling and law conclusions in steps 1.2--5.1 establish both claims. When d=1, the construction and scaling reduce to the scalar results. The empty coordinate case d=0 is excluded; empty time lists and repeated times were handled in step 4.1. At c=1, Tc is the identity, while c=0 is excluded because c1/2 is undefined and would not preserve Brownian covariance. AC is used through [F1] and [F3] for Brownian and Gaussian laws and through [F2] for the countable product; the finite truncation to d, fixed scaling map, and cylinder-law comparison use no further choice. Thus the required process exists and the displayed scaling has the same d-dimensional law.

F1F2F3F6step 1.1step 2.1step 3.1step 1.2step 2.2step 3.2step 4.1step 5.1discharge-construct: step 1.1step 2.1

Source notes

Durrett, printed p. 359, constructs multidimensional Brownian motion from independent scalar coordinates. Sousi, printed pp. 52--53, gives the same construction and states Brownian scaling. The proof above additionally records the whole-process cylinder-law equality and the exact path-space use of the independent-copy theorem.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Continuous-time filtrations and all-pairs martingales

Definition

Assume the Axiom of Choice. On a probability space (Ω,F,P), a continuous-time filtration is a family (Ft)t0 of sub-sigma-algebras of F such that FsFt whenever 0st. A process X=(Xt)t0 is adapted when Xt is measurable from (Ω,Ft) to its state space at every t.

For any process of random elements X=(Xt)t0, its natural filtration is

FtX=σ ⁣({Xu1(C):0ut, C measurable in the state space of Xu}).

The generated sigma-algebra exists by Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal. Its generator families are nested in t, so (FtX)t0 is a filtration; every Xt is FtX-measurable, and minimality makes this the smallest filtration to which X is adapted. No completion or right-continuous augmentation is included.

A real process M=(Mt)t0 is an all-pairs continuous-time martingale relative to (Ft) when:

  1. M is adapted;
  2. EMt< for every t0; and
  3. for every 0st, E[MtFs]=Msalmost surely.

The equality in clause 3 is equality of the almost-everywhere classes in Conditional expectation as an ae class. At s=t it is the known-variable identity. The word “continuous-time” specifies the index set; it does not assert path continuity. Likewise the definition imposes neither right continuity nor completeness on the filtration. AC is declared exactly because the library's conditional-expectation existence theorem uses it; the filtration, adaptation, and natural-filtration constructions make no choices.

Source notes

Sousi, Section 2 and Definition 2.1, printed pp. 13--14, gives natural filtrations, adaptation, integrability, and the all-pairs martingale identity in discrete time. Section 3.1, printed pp. 28 and 33, replaces the index set by R+, defines continuous-time filtrations and adaptation, and states that the martingale definition is unchanged. The nonaugmentation and almost-everywhere-class conventions are made explicit here to match the library's conditional-expectation interface.

5 · Examples, counterexamples and false statements

None yet.

Sources