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.
-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.
Depends on
- Brownian motion
- Multivariate normal law, including singular covariance
- Characteristic function of a multivariate normal law
- Characteristic function of a normal law
- Characteristic functions under affine maps and independent sums
- 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
- Coordinate maps, finite-coordinate cylinders, and the cylinder $\sigma$-algebra
- Finite-coordinate cylinders form a $\pi$-system
- Independent pi-systems generate independent sigma-algebras
- 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
- The Axiom of Choice
Used by
- Autonomous Euler–Maruyama scheme and interpolation Algorithm
- Dyadic Brownian bridge increment tree Algorithm
- Euler–Maruyama recursion Algorithm
- Predictor-corrector sampling for score SDEs Algorithm
- Existence and scaling of d-dimensional Brownian motion Corollary
- Vector Levy characterization Corollary
- Explicit Euler moments diverge for a cubic dissipative SDE Counterexample
- Brownian motion started at x Definition
- Continuous Brownian Ito processes Definition
- Euler–Maruyama step process and continuous interpolation Definition
- Itô SDE data and strong solution Definition
- Locally Lipschitz Itô SDE on an open state domain Definition
- Underdamped Langevin equation and canonical Gibbs density Definition
- A learned-drift bias that persists after solver error vanishes Example
- A stationary Ornstein–Uhlenbeck diffusion reverses to itself Example
- A verified weak-order contract for the Ornstein–Uhlenbeck process Example
- Euler–Maruyama for a constant-coefficient additive-noise equation Example
- Harmonic functions of planar Brownian motion Example
- Noise destabilizes explicit Euler while drift-implicit Euler contracts Example
- Planar coordinate hitting does not imply point hitting Example
- Radial second moment of multidimensional Brownian motion Example
- Shared-increment Euler coupling and payoff rates Example
- A deterministic Itô integral has independent Gaussian increments Lemma
- A square-integrable predictable step Itô integral is its finite sum Lemma
- Adjacent iid vector functionals admit a finite-moment strong approximation Lemma
- All-moment Euler interpolation increment bound under autonomous hypotheses Lemma
- An L1 maximal bound for finite-energy Brownian Itô integrals Lemma
- Euler–Maruyama one-step moment and increment estimates Lemma
- Finite-moment iid vectors admit a strong Gaussian approximation Lemma
- Langevin diffusion has a reversible density and compact minorization Lemma
- Pathwise relative-entropy error of the Langevin Euler interpolation Lemma
- Planar Brownian annular exit probability Lemma
- Uniform finite-horizon moments for tamed Euler approximations Lemma
- Anderson's bounded-start reverse-time diffusion theorem Theorem
- CIR paths stay positive and do not explode under the Feller condition Theorem
- Dynkin formula for bounded Brownian stopping Theorem
- Euler–Maruyama uniform moments and interpolation increments Theorem
- Euler–Maruyama weak order one under backward regularity Theorem
- Lamperti drift-implicit CIR scheme converges on finite horizons in probability Theorem
- Multidimensional Ito formula for Brownian-driven processes Theorem
…and 3 more results.
Dependency tree · two levels
86 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Nobuo Yoshida, Probability Theory, Definition 6.1.1, Lemma 6.1.3, and Proposition 6.1.4 (standard reference, not scraped)
- Perla Sousi, Advanced Probability, Section 6.2 (standard reference, not scraped)