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
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
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 , 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 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 , 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
Gaussian process
Definition
Assume the Axiom of Choice The Axiom of Choice. A real stochastic process Stochastic processes and their finite-dimensional distributions is a Gaussian process if, for every integer , every time list , and every , the random variable
has a normal law for some and . Variance zero is allowed, so constant linear combinations are included.
Equivalently, for every such time list the evaluation vector 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.
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 satisfying the two equalities in the Statement.
Every finite evaluation vector of a Gaussian process has a possibly singular multivariate normal law. Gaussian process
Assume AC. The characteristic function of is , and it uniquely determines the law, including when is singular. Characteristic function of a multivariate normal law
Proof
Fix and times . By [F1], the vectors 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.
Write the common mean vector and covariance matrix as and . By [F2], both vector characteristic functions equal The uniqueness clause of [F2] therefore gives . 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.
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.
Positive semidefiniteness of the Brownian covariance kernel
Statement
The kernel on is symmetric and positive semidefinite: for every integer , times , and coefficients ,
Facts & Assumptions
Given: A finite time list and coefficient list as in the Statement.
Proof
Symmetry is immediate from . If , the displayed quadratic form is the empty sum . Now take , let be the increasing list of the distinct positive values among , and put . The list is finite and uniquely fixed by the given times; no choice function is used.
For every , Indeed, if the smaller of is both sides vanish, while if it is the right side telescopes to .
Substituting step 2.1 and rearranging only finite sums gives 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 , where the last sum is empty.
Source notes
Durrett and Sousi use the Brownian covariance kernel in their Gaussian constructions. The standard identity 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.
Consistency of Brownian finite-dimensional laws
Statement
Assume the Axiom of Choice. For every finite list of nonnegative times, there is a centered Gaussian law with covariance 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.
The matrix with entries is symmetric positive semidefinite, including for repeated and zero times. Positive semidefiniteness of the Brownian covariance kernel
Assume AC. Every finite-dimensional symmetric positive semidefinite covariance matrix defines a centered, possibly singular multivariate normal law. Multivariate normal law, including singular covariance
Assume AC. The characteristic function of is and uniquely determines its law, including singular . Characteristic function of a multivariate normal law
Proof
For , set equal to the unique law on the singleton empty tuple. For , [F1] makes an admissible covariance matrix, so [F2] supplies the centered law This remains well-defined when a time is zero, times repeat, or the covariance is singular.
Let be any map, let be the coordinate map , and take . For , [F3] gives The entry of is , so [F3] identifies the law of with . The case is the unique empty-tuple law.
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].
Source notes
Durrett, Section 7.1 (printed pp. 355–356), constructs the centered Gaussian finite-dimensional laws with covariance 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.
Kolmogorov construction of the canonical Gaussian process
Statement
Assume the Axiom of Choice. There is a probability measure on the cylinder sigma-algebra of under which the coordinate process is centered Gaussian and 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.
The centered Gaussian laws with covariance are well-defined and consistent under finite coordinate restriction. Consistency of Brownian finite-dimensional laws
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
Under that extension measure, the coordinate process realizes precisely the prescribed finite-dimensional distributions. The canonical coordinate process realizes consistent finite-dimensional laws
A process is Gaussian exactly when every finite evaluation vector has a possibly singular multivariate normal law. Gaussian process
A standard Borel structure may be presented by a Polish topology; the usual real metric is complete, and the embedded rationals form a countable dense subset. Standard Borel spaces Polish spaces are separable completely metrizable spaces and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in is countably infinite The rationals embed densely in the reals
Proof
By [F5], the usual real line is complete and has the countable dense subset , 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].
For every finite , use [F1] to put on the centered Gaussian law with covariance ; step 1.1 and [F2] give a probability on the cylinder sigma-algebra of with exactly those marginals. The empty marginal has mass one on the singleton empty product.
Let . By [F3], every finite evaluation vector of has the prescribed centered Gaussian law. Thus [F4] makes Gaussian, and its one- and two-coordinate marginals give and , including almost surely because its variance is zero.
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 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.
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.
Brownian covariance is equivalent to independent stationary normal increments
Statement
Assume the Axiom of Choice. Let be a real process with almost surely. The following are equivalent:
- is a centered Gaussian process with for all .
- For every finite list , the increments , , are mutually independent and have laws .
Facts & Assumptions
Given: AC, a real process with almost surely, and either condition 1 or condition 2.
Finite evaluation vectors of a Gaussian process are possibly singular multivariate normal, and every finite linear combination is normal. Gaussian process
Under AC, exists for every positive semidefinite and has a realization with independent standard normal coordinates. Multivariate normal law, including singular covariance
Under AC, the characteristic function of is and uniquely determines the vector law. Characteristic function of a multivariate normal law
A scalar law has characteristic function , including . Characteristic function of a normal law
Characteristic functions respect affine maps and multiply for finite sums of mutually independent real random variables. Characteristic functions under affine maps and independent sums
Under AC, equality of scalar characteristic functions determines the law. Uniqueness of a law from its characteristic function
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
Products of integrable functions of independent random variables factor in expectation. Expectations factor over finite products of independent random variables
Proof
Assume condition 1 and fix . By [F1], the increment vector is multivariate normal. It is centered, and If , expanding the four covariance terms and using gives Thus for , by [F3].
Conversely assume condition 2. Given any finite time list, discard repetitions only for the construction and write its distinct positive values as . Put . Then condition 2 makes these independent with , and telescoping with gives almost surely at every time in the original list.
By [F2], is also the joint law of the vector with independent standard normals . The joint-law identity in step 1.1 transfers every measurable-rectangle probability, so [F7] makes the mutually independent; their one-coordinate laws are . For this is the vacuous empty family. Hence condition 2 holds.
For coefficients attached to the original time list, step 1.2 rewrites By [F4]–[F5], its characteristic function is 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 a centered Gaussian process.
For , condition 2 decomposes into independent centered normal variables. Consequently [F8] gives while both means are zero by step 2.2; symmetry gives for every order of . The cases , , and follow from the same formula and 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.
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.
Brownian motion
Definition
Assume the Axiom of Choice The Axiom of Choice. A real process is a standard Brownian motion if:
- almost surely;
- for every finite list , the increments are mutually independent and have laws ; and
- there is one measurable event with such that is continuous on for every .
By Brownian covariance is equivalent to independent stationary normal increments, the first two clauses are equivalent to saying that is a centered Gaussian process with covariance . 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 , , and zero-length increments are respectively vacuous or already covered by ; 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.
Kolmogorov continuity criterion in one parameter
Statement
Let be a complete separable metric space and let be an -valued process. Suppose and a family of finite constants are given such that Then has a continuous modification . 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 .
Facts & Assumptions
Given: The metric-space, process, exponent, constant-family, and moment-bound hypotheses in the Statement.
Completeness means every Cauchy sequence converges in ; 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
For a nonnegative random variable and , on an arbitrary probability space. Markov's inequality for random variables
A finite or countable union has measure at most the sum of the member measures. Finite and countable subadditivity of measures
A geometric series of ratio strictly between zero and one converges. For , , and for the series diverges
If the sum of event probabilities is finite, only finitely many events occur almost surely. First Borel-Cantelli lemma for events
Bounded almost-everywhere convergence of measurable indicators implies convergence of their expectations. Dominated convergence
A modification agrees with the original process almost surely at every fixed time; this is weaker than indistinguishability. Process law, modification, and indistinguishability
The rationals are countable, and strictly between two real numbers lies a rational. is countably infinite The rationals embed densely in the reals
The sequence tends to zero. For the sequence is null, and for the sequence diverges to
Proof
Let be the nonnegative dyadic times. Fix an integer and a rational with . For , let be the event that some adjacent level- dyadic pair in has . These are measurable finite unions.
Each of the at most edges in step 1.1 has, by [F2] and the moment hypothesis, probability at most . Hence [F3] gives The exponent is positive, so [F4] makes the sum over finite and [F5] shows that, almost surely, only finitely many occur.
Intersect the probability-one conclusions of step 2.1 over the countable set of integer and rational , and call the resulting measurable event . Countability follows from [F8], and its complement is a countable union of null sets and is null by [F3]. Fix . The eventual edge bound can be enlarged over its finitely many exceptional levels to a finite satisfying for every level- edge in .
If and , compare each point with its level- dyadic floor. Successive binary floors differ by at most one edge of level , so step 3.1 and [F4] bound each tail by ; the two level- floors differ by at most one level- edge. Therefore Equality is trivial. Thus the sample values on the dense dyadic set are locally Hölder.
For , let be the largest level- dyadic not exceeding ; then by [F9]. On , step 4.1 makes Cauchy on any integer compact containing , so [F1] gives a unique limit. Define to be this limit on and on . Equivalently, the measurable maps on and on converge pointwise to .
Each is a Borel random element. Indeed, for a nonempty closed , continuity of and step 5.1 give the formula is also correct in the limiting direction because is closed, while the empty closed set has empty inverse image. Thus inverse images of closed, hence Borel, sets are measurable. No point of was selected: the already given supplies the value on .
Letting dyadic tend to arbitrary in step 4.1 shows on that . Hence every path of on is continuous and is locally -Hölder for every rational . For arbitrary , [F8] supplies one rational strictly between them; on , the -bound implies the -bound after multiplying its constant by . This gives all exponents simultaneously on the single event .
Fix and an integer . The moment hypothesis and [F2] give . Since off only the null event , the same convergence holds with . On the other hand, pointwise, so [F6] applied to makes the corresponding probabilities tend to zero. The triangle inequality now gives The left side is independent of , hence is zero; intersecting over gives almost surely. Thus [F7] makes a modification of , and step 6.2 supplies all promised path regularity. The constants were supplied as data, and every other construction was canonical or countably intersected, so no choice axiom is used.
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.
Gaussian even moments for Brownian increments
Statement
Assume the Axiom of Choice. If and a real random variable has law , then, for every integer , where for . In particular, when , this is the moment hypothesis of the one-parameter Kolmogorov criterion with , , and .
Facts & Assumptions
Given: Times , the stated increment law, and an integer .
Under AC, is the probability measure with density , and is its image under , including . Standard normal and normal laws The Axiom of Choice
A nonnegative expectation is the integral of the corresponding function against the random variable's law. Change of variables for expectation
Integration against the measure with density equals integration of the product with against Lebesgue measure. Integrating against a density agrees with integrating the product
Increasing nonnegative measurable functions may be passed to the limit under the integral. Monotone convergence for the integral
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 are differentiable on with integrable, then A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral
The power, product, and chain rules, together with , give . For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term Sums, scalar multiples, products and quotients: , , , and when The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with The exponential function is smooth and
The exponential is its nonnegative power series, so for and every integer , . The power-series, product-limit, IVP, functional-equation, and Picard definitions agree
Proof
Let be the coordinate map on the canonical probability space. By [F1]--[F3], for each integer , with either side initially allowed to be infinite.
For an integer and , [F5] on , applied to and , is legitimate by [F6] and gives The sign and factor two come from the odd power at the two endpoints and the evenness of .
Taking in [F7] shows 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 from [F1] yield recursively Thus and every is finite.
Put . By [F1], the law is that of ; applying [F2] to the nonnegative function and using step 2.1 gives This includes , when both sides vanish and the law is the Dirac mass at zero.
If , set and . Then , so step 3.1 reads The constant is finite and independent of . 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.
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.
Existence of continuous Brownian motion
Statement
Assume the Axiom of Choice. The canonical centered Gaussian coordinate process with covariance has a continuous modification , and is a standard Brownian motion. In particular, standard Brownian motion exists.
Facts & Assumptions
Given: The Axiom of Choice.
Under AC, the consistent Brownian Gaussian finite-dimensional laws define a canonical coordinate process with mean zero and covariance . Kolmogorov construction of the canonical Gaussian process
A normal increment of variance has fourth moment . Gaussian even moments for Brownian increments
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
For a real process starting at zero, centered Gaussian covariance is equivalent to independent stationary normal increments. Brownian covariance is equivalent to independent stationary normal increments
Brownian motion consists of the initial condition, those increments, and one probability-one continuity event. Brownian motion
The real line is complete; its embedded rationals are countable and dense, so it is separable. and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in Separability: the existence of an at most countable dense subset is countably infinite The rationals embed densely in the reals
A finite union of null events is null. Finite and countable subadditivity of measures
AC is available for the Gaussian-law and Kolmogorov-extension suppliers. The Axiom of Choice
Proof
By [F1], on the canonical coordinate probability space there is a centered Gaussian process with covariance . In particular almost surely, and [F4] gives for all .
By [F2] with , By [F6], the real target is complete and separable. Thus [F3], with , , and the supplied constants , gives a modification of and one probability-one event on which every path of is continuous.
Fix a finite time list . Since is a modification, each event 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 equal those of , so is centered Gaussian with covariance and almost surely.
Apply [F4] to : it has the independent increments on every finite increasing list. Together with from step 3.1 and the common continuity event from step 2.1, [F5] says that 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.
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.
Brownian paths are locally Holder below one half
Statement
Assume the Axiom of Choice. If is a standard Brownian motion, then there is one event of probability one such that, for every , every , and every , there is a finite constant satisfying Thus the assertion holds for the given continuous Brownian version, not merely for some unrelated modification.
Facts & Assumptions
Given: A standard Brownian motion .
Brownian increments have law , and the Brownian definition supplies one probability-one event of continuous paths. Brownian motion
For each integer , Brownian increments satisfy the Kolmogorov moment bound with exponent threshold . Gaussian even moments for Brownian increments
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
The rationals are countable and dense; a countable union of null events is null. is countably infinite The rationals embed densely in the reals Finite and countable subadditivity of measures
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
The natural numbers are cofinal in the reals. Every complete ordered field is Archimedean
AC is available to select the countable family of modifications furnished by [F3]. The Axiom of Choice
Proof
For each integer , [F1]--[F3] give a continuous modification of and a probability-one event on which its paths are locally Hölder for every exponent below . Use [F7] to select one such pair for each .
Let be the probability-one continuity event for from [F1]. For each and nonnegative rational , modification gives . By countability and subadditivity in [F4], the intersection has probability one.
Fix and . On every interval , the two real functions and are continuous and agree on the dense rational subset. By [F4]--[F5] they agree everywhere on , hence on . Therefore inherits all local Hölder exponents below .
Given , [F6] supplies an integer so large that , equivalently . Step 3.1 then gives the displayed Hölder bound on every , with its constant allowed to depend on . The same event 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].
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.
Uniform-on-compacts metric on continuous path space
Definition
Let be the set of continuous real-valued paths. For define Then is a finite metric on , and its metric topology is exactly the topology of uniform convergence on compact subsets of . We call it the uniform-on-compacts metric.
Facts & Assumptions
Given: Continuous paths .
The compact-convergence topology has basic neighborhoods requiring uniform closeness on one compact set. The topology of compact convergence on for metric and : uniform convergence on each compact subset of
A metric is symmetric, separates points, and satisfies the triangle inequality. Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric
Closed bounded real intervals are compact, and a continuous real function on a nonempty compact metric space attains a finite maximum. Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
The geometric series satisfies , and its tail tends to zero. For , , and for the series diverges For the sequence is null, and for the sequence diverges to
Every real bound is exceeded by an integer. Every complete ordered field is Archimedean
The paths under discussion are continuous maps. Continuity of a map of topological spaces at a point and globally
Verification
By [F3] and [F6], each maximum in the definition exists and is finite. Every summand lies in , so [F4] proves that the series converges to a finite value in .
Let be compact and let . If is empty, its basic neighborhood from [F1] is all of . Otherwise the identity function attains a finite maximum on by [F3], and [F5] gives an integer with . Put . If , then the th term gives hence throughout . Thus every compact-convergence basic neighborhood contains a -ball.
Conversely, given a -ball of radius , use [F4] to choose with . If , then the first terms sum to less than , while [F4] makes the remaining tail at most . Hence . The neighborhood controlling the compact interval therefore lies inside the metric ball.
Symmetry is termwise. If , every nonnegative summand is zero; hence on every , and therefore on their union . Conversely makes every term zero.
For each , the ordinary triangle inequality gives Since for , multiplication by and summation give . With step 2.1, [F2] proves that is a metric.
Steps 1.2 and 1.3 give mutual refinement of the neighborhood bases at every , so the two topologies coincide. Equivalently, exactly when 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.
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.
Under countable choice, continuous path space is Polish
Statement
Assume the Axiom of Countable Choice. The uniform-on-compacts metric makes 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 .
The metric induces compact convergence, with geometric weights on the interval suprema. Uniform-on-compacts metric on continuous path space For , , and for the series diverges For the sequence is null, and for the sequence diverges to
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 is complete then is complete in the uniform metric, and so is A uniform limit of continuous functions is continuous, so is closed in under the uniform metric
The real line is complete, and every interval is compact. and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
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
The rationals are countable and dense in the real line. is countably infinite The rationals embed densely in the reals
Finite products of countable sets are countable, and under 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 The Axiom of Countable Choice ()
The natural numbers are cofinal in the reals. Every complete ordered field is Archimedean
A topology is Polish when it is separable and induced by a complete metric. Polish spaces are separable completely metrizable spaces
Proof
Let be -Cauchy and fix . For every , eventually so its th summand forces . Thus the restrictions to are uniformly Cauchy. By [F2]--[F3] they have a unique continuous uniform limit .
For integers and a rational tuple , let be linear on every interval with node value , and constant after time . Let be the family of all these paths. For fixed , its parameter tuples form a finite power of , countable by repeated applications of [F5]--[F6]. The pairs are countable, so [F6], using the assumed exactly at its countable-union clause, makes countable.
Fix and . By [F1] and the geometric tail in its definition, choose with . By [F3]--[F4], is uniformly continuous on ; choose so implies . By [F7], choose with , and by the density in [F5] choose the finitely many rationals with . For the corresponding , convex interpolation between adjacent node errors gives Hence the first metric terms sum to less than and the tail to less than , so .
If , uniqueness of uniform limits makes . Hence for any integer is well defined; equivalently use the least such integer. Its restriction to each is , so is continuous and uniformly on every compact interval. By [F1], . Therefore the path-space metric is complete. No choice is used here: every is the unique limit.
Step 1.3 makes the countable family 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.
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.
Wiener measure on continuous path space
Definition
Assume the Axiom of Choice. Let be a continuous Brownian motion supplied by the existence theorem, and let be one measurable probability-one event on which all of its sample paths are continuous. Redefine and set Then is a Borel random element of with its uniform-on-compacts topology. Its law 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 , and its common measurable continuity event as in the Definition.
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
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
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
The rationals are countable, and between any two nonnegative reals lies a nonnegative rational. Thus is dense in with its relative topology. is countably infinite The rationals embed densely in the reals
Metric balls generate the metric topology, whose Borel sigma-algebra is generated by its open sets. Products and subsets of countable sets are countable. The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement The Borel sigma-algebra of a topological space A product of two at most countable sets is at most countable Every subset of an at most countable set is at most countable
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
By [F1], fix and as in the Definition. Every path is continuous: on it is a Brownian path, and off it is the zero path. For fixed , is measurable because for each Borel , its inverse image is together with exactly when .
Fix and . By path continuity and density [F4], Enumerate the countable rational set once. Each function under the supremum is measurable by step 1.1 and [F3], so [F3] makes measurable and finite.
By [F3], every finite partial sum is measurable; here . The partial sums converge pointwise to by [F2], so [F3] makes that distance measurable. Therefore the inverse image under of every open metric ball is measurable. By separability in [F2], fix a countable dense ; the balls with centers in 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], is Borel measurable and hence a random element by [F6].
By [F6], is a probability measure. For any finite times , the vectors and agree on , hence almost surely, so their laws coincide. The coordinate vector under 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 almost surely.
The zero path used on 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.
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.
Borel sigma-algebra of continuous path space is generated by coordinates
Statement
Put , give the uniform-on-compacts topology, and write . Then Here each expression on the right denotes the smallest sigma-algebra on making every displayed coordinate map measurable. No choice principle is used.
Facts & Assumptions
Given: The path space , its uoc metric , and its coordinate maps as in the Statement. Write for the sigma-algebra generated by all coordinates and for that generated by the nonnegative rational coordinates.
The uoc metric is and its topology is compact convergence. Uniform-on-compacts metric on continuous path space
A Borel sigma-algebra is generated by the open sets, and a family of sets has a unique smallest generated sigma-algebra. The Borel sigma-algebra of a topological space The sigma-algebra generated by a family of sets Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal
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
The rationals are countable and dense in the reals. There is a fixed bijection between and , recursion constructs nested finite codes, finite products of countable sets are countable, and a subset of a countable set is countable. is countably infinite The rationals embed densely in the reals 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
Closed bounded real intervals are compact, continuous real functions on them are uniformly continuous, and for every there is with . Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous For every in a complete ordered field there is a natural with
Every nonnegative real has an integer part, and . The geometric-series formula controls every tail . Integer part: for every real there is exactly one integer with For the sequence is null, and for the sequence diverges to For , , and for the series diverges
Metric balls form a base for the metric topology. The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
Proof
Fix and choose an integer with . If , then implies and hence . Thus every is continuous, so it is Borel measurable. Minimality in [F2] gives .
Fix and put . Then and , so by [F6]. For every , continuity gives . Every is -measurable by definition, so [F3] makes measurable. Hence by minimality, and therefore .
Let be the family of paths which, for some integers , are affine on each interval for , take rational values at all grid points , and are constant after . This family is countable without choice. Indeed, fix bijections and . Nested use of codes every finite sequence of naturals by one natural (and repeated application of decodes it); composing entries with codes every finite rational sequence. A further finite nesting codes together with that sequence, giving a surjection from a subset of onto . Thus [F4] makes at most countable.
The family is uoc dense. Given and , use [F6] to choose with . By [F5], is uniformly continuous on ; choose so that the oscillation of over distances at most is less than . By rational density, choose rational with for the finitely many (finite induction, not a choice principle), and let interpolate these values and remain constant after . On a grid interval, convex interpolation and the triangle inequality give . Consequently This also covers and .
Fix . For , continuity and rational density give Enumerating that rational set, [F3] makes -measurable. The finite partial sums of the metric formula are measurable by [F3] and converge pointwise to , so this distance is measurable. Hence every metric ball, with an arbitrary center, belongs to .
The balls with and positive rational 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 , let be the subfamily of these basic balls which are contained in . It is countable by [F4], every member belongs to by step 1.5, and . Thus every open set is in ; [F2] yields . Combining this with steps 1.1 and 1.2 proves all stated equalities. The zero path shows and are nonempty; singleton and zero-time coordinates cause no exception, and no countable family of nonempty sets was selected.
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.
Uniqueness of Wiener measure
Statement
Assume the Axiom of Choice. There is exactly one probability measure on for which the coordinate process is centered Gaussian with That probability is Wiener measure.
Facts & Assumptions
Given: AC, the uoc path space , and its coordinate maps .
Wiener measure exists as a probability on , and its coordinate process has the Brownian finite-dimensional distributions. A Brownian motion is equivalently a centered Gaussian process with covariance , in addition to path continuity. Wiener measure on continuous path space Brownian motion The Axiom of Choice
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
The Borel sigma-algebra of is generated by the nonnegative rational coordinate maps. Borel sigma-algebra of continuous path space is generated by coordinates
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
By [F1], Wiener measure is a probability measure on and its coordinate process is centered Gaussian with covariance . 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.
Let and be two probabilities with the stated property. By [F2], for every , every nonnegative rational list (with repetitions allowed), and Borel sets , Indeed this is equality of the two finite-dimensional laws on the Borel rectangle . The same equality is trivial for the empty intersection .
Let be the family of the finite intersections in step 1.2, including the empty intersection . It is a pi-system because the intersection of two members is obtained by concatenating their two finite lists. Moreover : the family contains every one-coordinate set , while every member is a finite intersection of such sets; now apply [F3].
Put . It contains because both measures have total mass one. If and , finite additivity gives . If with every , continuity from below gives . Hence is a lambda-system. Step 1.2 says , so [F4] and step 2.1 give . Thus .
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.
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.
Brownian scaling
Statement
Assume the Axiom of Choice. If is standard Brownian motion and , then is standard Brownian motion. After redefining 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 , and a real .
Brownian motion has a centered Gaussian finite-dimensional law with covariance 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
Every positive real has a unique positive square root, and nonzero reals have multiplicative inverses. Square roots exist: a unique with ; the positives are The reals form a field
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 . 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
AC supplies the normal-law and Brownian interfaces used in [F1] and [F3]. The Axiom of Choice
Proof
By [F2], is a well-defined positive real and . For any finite times and coefficients , The right side is normal by the Gaussian characterization in [F1], including when coefficients vanish or times repeat. Hence is Gaussian and centered.
For , Also almost surely. By [F1], therefore has mutually independent increments along every finite strictly increasing list.
Let be the single probability-one event on which is continuous. For , the map is continuous as a composition of continuous scalar and time maps. Thus the same event is a common continuity event for . Together with steps 1.1 and 2.1, this proves that is standard Brownian motion.
Define on and on . Every path of is continuous. For each fixed , the random variable is measurable because is measurable and is measurable. Since the Borel sigma-algebra of continuous path space is generated by the coordinates, [F3] makes a Borel random element, and its law is a probability. Its coordinate process has the same finite-dimensional laws as , because the two processes agree on ; hence it is centered Gaussian with covariance by steps 1.1 and 2.1. Uniqueness in [F3] identifies that probability with Wiener measure. When , and the process is unchanged; is excluded because neither nor the claimed covariance normalization is defined. AC is used only through [F1] and [F3].
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.
Brownian time inversion
Statement
Assume the Axiom of Choice. If is standard Brownian motion, then defines another standard Brownian motion. In particular, its continuity at is part of the conclusion, not an inference from its finite-dimensional laws alone.
Facts & Assumptions
Given: AC and a standard Brownian motion with one probability-one continuity event .
Brownian motion is centered Gaussian with covariance 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
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
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
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
The positive rationals are countable and dense, and for every there is with . is countably infinite The rationals embed densely in the reals For every in a complete ordered field there is a natural with
The intersection of two probability-one events has probability one. Basic identities for a probability measure
AC is inherited through the Gaussian and Brownian interfaces. The Axiom of Choice
Proof
For any finite positive times and coefficients , the linear combination is normal by [F1]. Appending any occurrences of only appends deterministic zero coordinates. Hence is a centered Gaussian process, including repeated-time and singular finite vectors.
For , If , both sides of the required identity are zero. Thus for all . By [F2], and have the same finite-dimensional laws.
Let and define 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 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 .
In put This is cylinder-measurable because all three index sets are countable by [F5]. The event has probability one by [F1] and [F6]. On , continuity of at zero gives , so . Equality from step 3.1 gives .
On , is continuous for every . Fix with and . Choose with by [F5], and then from the definition of . For every , fix an enumeration of the rationals and, for each integer , let be its least-indexed member of within of ; density in [F5] makes this canonical sequence converge to . Continuity gives . Since for all , we get . Therefore as . By [F6], the set of such has probability one, so has one common continuity event on .
Steps 1.1--2.1 give the centered Gaussian covariance characterization, and step 5.1 gives path continuity; [F1] therefore makes standard Brownian motion. The formula at is separately defined because 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.
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.
-dimensional Brownian motion
Definition
Assume the Axiom of Choice and let be a finite integer. An -valued process is a standard -dimensional Brownian motion if:
- almost surely;
- for every finite list , the vector increments are mutually independent and have laws ; and
- there is one measurable event with such that is continuous from to for every .
Equivalently, its coordinate processes are independent standard one-dimensional Brownian motions. Here independence of the processes means the following precise assertion. Put and equip with its cylinder sigma-algebra. The maps are independent random elements.
Facts & Assumptions
Given: AC, a finite integer , and an -valued process .
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
Under AC, exists for every positive semidefinite , is realized as with independent standard-normal coordinates, and is determined by the characteristic function , including when is singular. Multivariate normal law, including singular covariance Characteristic function of a multivariate normal law
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
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
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
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
AC supplies the normal-law and Brownian interfaces used above. The Axiom of Choice
Proof
We first record the diagonal-Gaussian fact used in both directions. If for , [F2] realizes that law as , where the coordinates of are independent standard normals. Equality of vector laws preserves every rectangle probability, so the coordinates of are independent and each has law . This includes , when every coordinate is the constant zero variable.
Conversely, suppose that are independent and each has law . For , [F3] gives This is the characteristic function of the existing law by [F2], and the uniqueness clause of [F2] identifies the vector laws. Thus . For this says exactly that is the scalar law; for both sides are the point mass at zero.
Each in the Definition is a random element: for every finite , the finite observation map 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.
Assume first that satisfies the three vector clauses of the Definition. Fix and put . The random vectors are independent, and by step 1.1 the coordinates within each fixed are independent variables. Hence, for arbitrary Borel sets , The rectangle criterion [F4] therefore makes the whole finite family mutually independent.
For a fixed , step 2.1 gives independent increments with the required scalar normal laws. The vector condition at time zero gives almost surely. On the vector continuity event every coordinate path is continuous by [F6]. Consequently each is standard one-dimensional Brownian motion by [F1].
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 , 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 independent. This proves the forward implication. Empty-support cylinders give or and obey the same formula.
Conversely, assume that the random elements are independent and that every is a standard one-dimensional Brownian motion. Fix and let This is a measurable function of , so [F4] makes independent. Within each , the scalar Brownian increments are independent and the th has law by [F1]. For arbitrary Borel , the same two-stage rectangle calculation as in step 2.1, now first over and then over , gives Hence all the scalar variables are mutually independent.
Group the independent scalar variables of step 3.3 by their time index . By [F4], the resulting sigma-algebras are independent. Each vector increment is measurable with respect to the th grouped sigma-algebra, so the vectors are independent. For fixed , its coordinates are independent variables; step 1.2 therefore gives .
For every , let be a probability-one event on which the path is continuous, and let . Because is finite, repeated finite subadditivity in [F6] gives On this one event, 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.
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 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.
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.
Existence and scaling of -dimensional Brownian motion
Statement
Assume the Axiom of Choice and let be finite.
- A standard -dimensional Brownian motion exists: one may take independent copies of the constructed one-dimensional Brownian path and assemble them coordinatewise.
- If is any standard -dimensional Brownian motion and , then is again standard -dimensional Brownian motion. Moreover, the random elements and have the same law on equipped with its cylinder sigma-algebra.
Facts & Assumptions
Given: AC, a finite integer , and, for the scaling assertion, a standard -dimensional Brownian motion and a real .
Under AC, standard one-dimensional Brownian motion exists, and its zero-repaired path random element has Wiener law on ; 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
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
A vector process is standard -dimensional Brownian motion exactly when its coordinate processes, regarded as cylinder-space random elements, are independent standard one-dimensional Brownian motions. -dimensional Brownian motion
For , the scaled process is standard one-dimensional Brownian motion whenever is. Measurable coordinatewise maps preserve independence. Brownian scaling Measurable coordinatewise functions preserve independence
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
AC is the only ambient choice assumption. The Axiom of Choice
Proof
Let be Wiener measure on from [F1]. By [F2], on some probability space there is a countable independent family of -valued random elements, each with law . Retain its first members.
For the scaling assertion, put and define by . This map is cylinder-measurable: the inverse image of a finite-coordinate cylinder supported on is a finite-coordinate cylinder supported on , with its base pulled back by coordinatewise scalar multiplication.
Define and for and . Every is a continuous path. Its finite evaluation laws are Brownian by [F1], so is standard one-dimensional Brownian motion, with the whole sample space as a continuity event and with its initial and increment laws supplied by . The inclusion , , is measurable because every target cylinder pulls back through finitely many Borel evaluation maps by [F1] and [F5]. Therefore the process random elements are independent by [F4].
Return now to the arbitrary standard -dimensional Brownian motion in the scaling hypothesis. By [F3], its coordinate-process random elements are independent and each coordinate is standard one-dimensional Brownian motion. Since , [F4] and step 1.2 show that the coordinate processes of remain independent, while scalar Brownian scaling makes every one of them standard Brownian motion.
Applying the coordinate equivalence [F3] to step 2.1 makes the assembled process a standard -dimensional Brownian motion. This proves existence and realizes it from independent copies of the constructed scalar path law.
The reverse direction of [F3] applied to step 2.2 shows that is standard -dimensional Brownian motion. The same common coordinate argument includes continuity at ; it is not inferred from finite-dimensional laws.
Any two standard -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 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 and uses step 3.2.
The path maps 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 on the full cylinder sigma-algebra.
The construction in steps 1.1--3.1 and the scaling and law conclusions in steps 1.2--5.1 establish both claims. When , the construction and scaling reduce to the scalar results. The empty coordinate case is excluded; empty time lists and repeated times were handled in step 4.1. At , is the identity, while is excluded because 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 , fixed scaling map, and cylinder-law comparison use no further choice. Thus the required process exists and the displayed scaling has the same -dimensional law.
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.
Continuous-time filtrations and all-pairs martingales
Definition
Assume the Axiom of Choice. On a probability space , a continuous-time filtration is a family of sub-sigma-algebras of such that whenever . A process is adapted when is measurable from to its state space at every .
For any process of random elements , its natural filtration is
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 , so is a filtration; every is -measurable, and minimality makes this the smallest filtration to which is adapted. No completion or right-continuous augmentation is included.
A real process is an all-pairs continuous-time martingale relative to when:
- is adapted;
- for every ; and
- for every ,
The equality in clause 3 is equality of the almost-everywhere classes in Conditional expectation as an ae class. At 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 , 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
- Perla Sousi, Advanced Probability, Section 6.1
- Nobuaki Yoshida, Probability Theory, Section 6.1
- Rick Durrett, Probability: Theory and Examples, Section 7.1
- Perla Sousi, Advanced Probability, Section 6.2
- Perla Sousi, Advanced Probability, Sections 6.1-6.2
- Nobuaki Yoshida, Probability Theory, Lemma 6.1.3
- Rick Durrett, Probability: Theory and Examples, Theorem 7.1.3
- Perla Sousi, Advanced Probability, Theorem 3.19
- Nobuaki Yoshida, Probability Theory, Section 6.3
- van der Vaart and Wellner, Weak Convergence and Empirical Processes, Sections 1.3 and 1.5
- A. W. van der Vaart and J. A. Wellner, Weak Convergence and Empirical Processes, Section 1.3
- Perla Sousi, Advanced Probability, Section 6.3
- Nobuo Yoshida, Probability Theory, Section 6.1
- Perla Sousi, Advanced Probability, Theorem 6.7
- Nobuo Yoshida, Probability Theory, Proposition 6.1.5 and Lemmas 6.1.6--6.1.7
- Nobuo Yoshida, Probability Theory, Definition 6.1.1, Lemma 6.1.3, and Proposition 6.1.4
- Perla Sousi, Advanced Probability, Sections 6.2--6.3
- Perla Sousi, Advanced Probability, Sections 2 and 3.1