Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Vector Levy characterization

Statement

Assume the Axiom of Choice. Let d1 and let M=(M1,,Md) be an adapted Rd-valued process with continuous paths such that every coordinate Mi is a real continuous local martingale relative to (Ft)t0 in the sense of Continuous-time adapted processes and martingales. Suppose M0=0 almost surely and whose quadratic covariations in the sense of Quadratic covariation of Brownian Ito processes satisfy [Mi,Mj]t=δijt for all i,j and all t0. Then M is a standard d-dimensional Brownian motion d-dimensional Brownian motion, and for all 0s<t the vector increment MtMs is independent of Fs with law Nd(0,(ts)Id).

Facts & Assumptions

Given: AC, a filtered probability space with continuous-time filtration, an adapted Rd-valued continuous process M whose coordinates are real continuous local martingales, with M0=0 almost surely and [Mi,Mj]t=δijt, a vector λRd, and times 0s<t.

[F1]

Martingale linearity. Finite linear combinations of true integrable adapted martingales are martingales, by finite linearity of their event-integral identities. A true martingale is local using the deterministic localizers τk=k. The coordinates are proved to be true martingales in step 1.1 before this observation is used. Continuous-time adapted processes and martingales Conditional expectation as an ae class

[F2]

Bilinearity of covariation. For continuous processes whose pairwise covariations exist the covariation is bilinear: [X1+X2,Y]=[X1,Y]+[X2,Y] and [cX,Y]=c[X,Y], because cross-increment sums are exactly bilinear and probability limits are unique. Quadratic covariation of Brownian Ito processes

[F3]

Scalar characteristic exponential. For a real continuous local martingale N with N0=0 almost surely and [N]t=t, the characteristic-exponential lemma gives E[eiθ(NtNs)Fs]=eθ2(ts)/2. Here and throughout this proof E[U+iVFs] means E[UFs]+iE[VFs], for real integrable U,V; equalities mean the two real almost-sure class identities. This is exactly the componentwise convention of the supplier. Characteristic exponential for a continuous local martingale with deterministic clock Conditional expectation as an ae class

[F4]

Multivariate Fourier uniqueness and Gaussian laws. Finite Borel measures on Rn with equal Fourier transforms are equal. The laws N1(0,ts) and Nd(0,(ts)Id) have finite second moments and mean zero. The latter law exists, can be realized as the product of independent N(0,ts) coordinates, and its Fourier transform at λ is e(ts)λ2/2. Uniqueness of finite Borel measures from their Fourier transforms Multivariate normal law, including singular covariance Characteristic function of a multivariate normal law Standard normal and normal laws d-dimensional Brownian motion Monotone convergence for the integral

[F5]

Conditional expectations and towers. Conditional expectations are unique almost-sure classes; for AFs one has E[1AXFs]=1AE[XFs] and E[1AE[XFs]]=E[1AX]; the tower property passes conditional laws from one time to an earlier time. Conditional expectation as an ae class Tower property of conditional expectation

[F6]

AC bookkeeping. Choice is declared for conditional expectations, the characteristic-exponential supplier, Gaussian construction and Fourier uniqueness. The Axiom of Choice

Proof

technique · direct
1.1

First establish true coordinate martingales, without intersecting localizers. Apply [F3] to each Mi, since [Mi]t=t. For AFs, let μAi(C)=P(A{MtiMsiC}). This finite positive Borel measure has transform P(A)eθ2(ts)/2 by componentwise conditional event testing. Finite-measure Fourier uniqueness [F4] in dimension one identifies it with P(A)N1(0,ts), including when P(A)=0, without normalization. With A=Ω, this proves integrability and zero mean of each increment. At s=0, M0i=0 almost surely gives integrability of Mti; M0i is itself integrable. Integrating the identity function against μAi=P(A)N1(0,ts) gives E[1A(MtiMsi)]=0. The pushforward integral identity here follows first for indicators from the definition of μAi, then for simple functions and nonnegative increasing limits, and finally for integrable signed functions. Thus every coordinate is a true all-pairs martingale by its defining event tests.

F1F3F4F5
2.1

Fix λRd and put Xtλ=iλiMti. It is an integrable adapted martingale by step 1.1 and [F1], hence a local martingale, and has continuous paths on the finite intersection of the coordinate continuity events. It starts at zero almost surely. For every deterministic partition its square sums are exactly i,jλiλj times the respective cross sums. Their uniform error is bounded by the sum of the finitely many absolute coefficients times the corresponding uniform errors. The union bound therefore proves existence, not merely a formal use of bilinearity, of [Xλ]t=λ2t along every permitted sequence.

F1F2step 1.1
3.1

For λ0, Nλ=Xλ/λ satisfies the hypotheses of [F3]. Apply its componentwise identity at frequency θ=λ. This gives E[eiλ(MtMs)Fs]=e(ts)λ2/2. For λ=0 both sides are 1. No common exceptional set for all frequencies is needed: each fixed frequency identity gives a numerical equality of event integrals.

F2F3F5step 2.1
4.1

Conditional law of the vector increment: for each AFs define the finite Borel measure QA(Γ):=E[1A1{MtMsΓ}] on Rd; its Fourier transform is eiλxQA(dx)=E[1Aeiλ(MtMs)]=P(A)e(ts)λ2/2 by step 3.1 and [F5], which is P(A) times the Fourier transform of Nd(0,(ts)Id) by [F4]. By multivariate Fourier uniqueness [F4], QA=P(A)Nd(0,(ts)Id) for every AFs; in particular, with A=Ω, the increment has law Nd(0,(ts)Id), and with general A the identity is exactly the independence of the increment from Fs.

F4F5step 3.1
5.1

Finite lists of increments: for 0=t0<t1<<tn the increments MtjMtj1 are independent with laws Nd(0,(tjtj1)Id). Induction on n: the case n=1 is step 4.1; given the claim for n increments, the increment at tn+1 has conditional law Nd(0,(tn+1tn)Id) given Ftn and is independent of Ftn by step 4.1 applied with s=tn, hence independent of the sigma-algebra generated by the earlier increments, and [F5] multiplies the joint law.

F5step 4.1
6.1

Conclusion and boundary cases: M is adapted, continuous, starts at 0 almost surely, and its finite-dimensional increment laws are those of a standard d-dimensional Brownian motion by step 5.1; this is precisely the defining increment condition, so M is a standard d-dimensional Brownian motion with the stated filtration property. For d=1 the same Fourier event-test argument gives the scalar characterization; for λ=0 the linear combination is the zero process and the identity is trivial; the coordinate increments at s=t are zero with law N(0,0); the hypothesis δijt excludes degenerate covariance matrices, and no independence of the coordinates is assumed in the proof — the Brownian definition derives it from the verified vector increment laws; and AC has the uses declared in [F6].

F3F4F6step 5.1

Source notes

Van der Vaart states the multivariate Lévy characterization as Exercise 6.5, derived from the scalar theorem. The proof above uses the Cramér--Wold style reduction through linear functionals and multivariate Fourier uniqueness, which is the standard route when the exercise is not proved in the source. To avoid an unproved stopping assertion when combining coordinate localizers, the proof first derives true coordinate martingales from their unit clocks and then uses ordinary finite linearity.

Depends on

Used by

Nothing in the library uses this result yet.

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