Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-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.

Characteristic exponential for a continuous local martingale with deterministic clock

Statement

Assume the Axiom of Choice. Let M be a real continuous local martingale relative to a filtration (Ft)t0 Continuous-time adapted processes and martingales with M0=0 almost surely, and suppose that its quadratic variation in the sense of Quadratic covariation of Brownian Ito processes satisfies [M]t=t for every t0: for every deterministic partition sequence of [0,T] with mesh tending to 0, the squared-increment sums of M converge to t uniformly in probability. Then for every real θ:

  1. Increments are conditionally Gaussian. For all 0s<t, E[eiθ(MtMs)Fs]=eθ2(ts)/2almost surely, the left side being the complex conditional expectation defined componentwise.
  2. The characteristic exponential is a complex martingale. The process Zt:=exp(iθMt+θ2t2), interpreted through its real and imaginary parts, is a complex martingale relative to (Ft): EZt< and E[ZtFs]=Zs almost surely for all st. In particular the real and imaginary parts of Z are real martingales bounded in modulus by eθ2t/2 at time t.

Facts & Assumptions

Given: The Statement's AC, filtration, continuous local martingale M, deterministic clock and real θ.

[F1]

The localizing sequence must increase to infinity; stopping requires separately establishing the martingale property of each doubly stopped piece. Continuous-time adapted processes and martingales Continuous-time filtrations and all-pairs martingales Continuous-time stopping times and stopped sigma-algebras

[F2]

Optional sampling applies to the finite discrete-time martingale obtained by sampling deterministic grid points. Conditional expectations of one integrable terminal variable are uniformly integrable, and uniform integrability plus convergence in probability gives L1 convergence. Optional sampling for bounded stopping times Uniform integrability of conditional expectations of one variable Uniform integrability plus convergence in probability implies L1 convergence

[F3]

The clock assumption concerns both step and partial-increment sums, uniformly in probability, along every deterministic vanishing-mesh partition sequence. Suprema use measurable continuous-path normalizations. Quadratic covariation of Brownian Ito processes Quadratic variation along a partition sequence Convergence in probability

[F4]

Conditional expectations are identified by event integrals. A bounded measurable test variable can replace an event indicator: first use linearity for simple variables, then bounded simple approximations and dominated convergence. Consequently bounded known factors can be pulled out, and martingale increments have zero expectation against every bounded earlier-measurable factor. Complex identities are obtained componentwise. Conditional expectation as an ae class Tower property of conditional expectation Dominated convergence

[F5]

Real Taylor's remainder bound applied separately to sine, cosine and the real exponential gives, for z2m and 0hT, eiθz+θ2h/2=1+iθz+θ22(hz2)+R(z,h),R(z,h)Cθ,m,T(z3+hz+h2+hz2). Indeed eiθz=1+iθzθ2z2/2+O(z3) and eθ2h/2=1+θ2h/2+O(h2); multiply these equalities on the indicated bounded rectangle. A uniform derivative bound gives a uniform Taylor remainder bound Taylor polynomials and their remainders

[F7]

AC supplies the conditional-expectation interface and the inherited countable-choice use in uniform continuity. The Axiom of Choice AC supplies countable selections and prescribed serial paths

Proof

technique · direct
1.1

First handle exceptional paths without imposing completeness on the original filtration. There is a measurable null set DF outside which M is continuous and M0=0. Put Gt={AN:AFt, NF, ND}. This is a sub-sigma-algebra of F: complements preserve the symmetric difference, and a countable union differs from the union of the A's by a measurable subset of D. AC permits choosing representations for such a countable family. The Gt are increasing and contain D. Set M~t=Mt off D and 0 on D. It is Gt-adapted, starts at zero everywhere, and has everywhere continuous paths. Each original localizer τk is a Gt-stopping time. The process M~τk agrees off D with MτkM0, and its stopped values are measurable: a continuous adapted process evaluated at tτk is the pointwise limit of the finite sums obtained by rounding that time upward on deterministic grids of [0,t]. Every Gs event differs from an Fs event on D, so their integrals agree. Thus M~τk is a Gt martingale. The clock assumption is unchanged by agreement off D. We work with this normalized process and filtration until the final descent.

F1F3F4F7
1.2

Here is the stopping argument needed for these continuous martingales. Let X be an everywhere continuous martingale for Gt, and ρ a stopping time. Fix 0s<t; take finite deterministic grids of [0,t] containing s whose mesh tends to zero, and round ρt upward to a grid point ρn. Its grid stopping test is {ρnu}={ρu} for grid points u<t, so finite-grid optional sampling applies. Write Vn=Xρn and Wn=Xsρn. Each is a conditional expectation of the single terminal variable Xt with respect to its grid stopped sigma-algebra; hence each sequence is uniformly integrable. Continuity gives VnXtρ and WnXsρ pointwise, therefore in probability and then in L1. The finite-grid stopped martingale identity is E[1AVn]=E[1AWn] for AGs: telescope the increments after s, multiplied by 1{ρn>u}, whose factor is measurable at the left grid endpoint u. Passing to L1 limits gives the same identity for Xρ. Its adaptedness follows by the upward-grid approximation on each [0,t]. Thus Xρ is a martingale without right continuity of the filtration.

F1F2F4F6
2.1

Suppress the tilde for now. Define σm=inf{u0:Mum}m, m1. For t<m, its stopping event is {max0utMum}; for tm it is Ω. The maximum is attained and equals the supremum over a countable dense set together with the endpoints, so the event belongs to Gt; at t=0 it is empty. Continuity and M0=0 give Mtσmm. Compact boundedness gives σm on every path. Apply step 1.2 to each martingale Mτk and ρ=σm: Mτkσm is a martingale and is bounded by m. Dominated convergence as k proves N:=Mσm is a bounded continuous martingale. The original τk, not σmτk, is the sequence that localizes this stopped process.

F1F4F6step 1.1step 1.2
3.1

For a deterministic partition of [0,T], the partial-increment square sum of N at u is exactly the partial-increment square sum of M at uσm. Hence its uniform error against uσm is bounded by the original uniform clock error. Its step version differs by at most the squared maximal oscillation of N on partition intervals, which tends to zero pathwise. Thus the stopped clock is uσm uniformly in probability. A partition sequence on [s,t] can be extended by vanishing-mesh deterministic partitions on [0,s] and [t,T]; subtracting the sums at s gives the same assertion there, with clock q(u)=(uσm)(sσm).

F3F6step 2.1
4.1

Fix 0s<tT. On a partition s=u0<<uJ=t put zj=Nuj+1Nuj, hj=(uj+1σm)(ujσm), and A(u)=exp(iθ(NuNs)+θ2q(u)/2). The process A is continuous on [s,t], adapted there and bounded in modulus by K=eθ2T/2. In particular A(s)=1 and A(uj+1)=A(uj)eiθzj+θ2hj/2.

F1step 2.1step 3.1
4.2

To justify weighted clock convergence, first take a fixed deterministic grid s=r0<<rl=t and bounded random coefficients λa. Assign coefficient λa when the left endpoint uj lies in [ra,ra+1). For sufficiently fine partitions each cell crosses at most one of the finitely many distinct block boundaries. Inserting the boundaries changes each affected squared increment by at most twice the squared oscillation of N on that cell, by (a+b)2a2b2=2ab. Reassigning split increments to their blocks costs at most another constant times that squared oscillation. The total weighted error is at most ClmaxaλaωN(mesh(πn))20 pathwise, where ωN is the modulus of continuity on [s,t]. On the refined partition each block sum converges in probability to q(ra+1)q(ra) by step 3.1. Finite addition and bounded multiplication therefore prove convergence of the weighted sums to aλa(q(ra+1)q(ra)). This argument does not require the coefficients to be independent of the increments.

F3F6step 3.1
5.1

Write Qn=jzj2, Xj=NujNs, and Ln=jXjzj. The identity Qn=(NtNs)22Ln is a finite telescope. For j<k, the factors XjzjXk are bounded and Guk-measurable; testing the centered increment zk proves orthogonality. Similarly Ezjzk=0. Therefore EQn=E(NtNs)24m2 and ELn2=jE(Xj2zj2)4m2EQn16m4. Squaring the telescope with (a+b)22a2+2b2 yields EQn2160m4. The maximal increment dn=maxjzj tends to zero pathwise and is at most 2m, so Edn20. Cauchy--Schwarz gives E(dnQn)0. Since 0hjmesh(πn) and jhjT, the four remainder sums of [F5] are bounded respectively by dnQn, Tdn, Tmesh(πn) and mesh(πn)Qn. Consequently EjA(uj)R(zj,hj)0.

F4F5F6step 4.1
6.1

Now take the left-endpoint staircase Al of the continuous process A on deterministic grids with mesh tending to zero. Put el=sup[s,t]AlA, with the endpoint t assigned A(t). Then el0 pathwise and el2K. The error in the weighted square sums is at most elQn and the error in their proposed limits is at most Tel. Explicitly, for R>0, P(elQn>ε)P(Qn>R)+P(el>ε/R)4m2/R+P(el>ε/R). Choose R first, then l, then n for the fixed staircase convergence of step 4.2. This proves jA(uj)zj2stA(u)1{u<σm}du in probability. The integral is the ordinary pathwise integral up to tσm, zero when σms; the sums jA(uj)hj converge to it pathwise, their error being at most TωA(mesh(πn)). Thus Sn=jA(uj)(hjzj2)0 in probability. Since SnK(T+Qn), its second moments are uniformly bounded. For each ε>0, Cauchy--Schwarz gives ESnε+(ESn2)1/2P(Sn>ε)1/2. Taking n, then ε0, gives ESn0.

F3F6step 4.1step 5.1step 4.2
7.1

Let Y be any bounded Gs-measurable real or complex variable. For each j, the factor YA(uj) is bounded and Guj-measurable, so E[YA(uj)zj]=0. Telescope the identity in step 4.1 and apply [F5]. The sum of the linear terms has zero expectation; the expectation of the compensator term tends to zero by step 6.1 and that of the remainders by step 5.1. The left side does not depend on the partition, so E[Yexp(iθ(NtNs)+θ2((tσm)(sσm))/2)]=E[Y].

F4F5step 4.1step 5.1step 6.1
8.1

Let m in step 7.1. The stopped increments and clocks converge almost surely to M~tM~s and ts, while the exponential modulus is at most eθ2(ts)/2. Dominated convergence proves the conditional increment identity for M~ and Gs. In particular it holds for indicators of original Fs events. Since M=M~ off D, and the original fixed-time values are Ft-measurable, these event tests establish exactly clause 1 for the original process and filtration.

F4F6step 1.1step 7.1
9.1

The original Zt is Ft-measurable with deterministic modulus eθ2t/2. Using the bounded known factor Zs in clause 1 gives E[ZtFs]=Zs. Real and imaginary parts give clause 2. For s=t, including s=t=0, the increment exponential is 1; for θ=0, Z1. The unit clock is the stated normalization; the identically zero process is excluded by the positive-time clock hypothesis. No converse is asserted and no general stochastic integral is introduced. AC has the uses in [F7] and step 1.1.

F4F7step 8.1

Source notes

Van der Vaart, Theorem 6.1, printed p. 119, proves the characteristic-exponential identity using general Ito calculus. The stopped-martingale proof in Theorem 4.21, printed pp. 41--42, uses finite grids and an integrability limit. Here those ingredients are proved directly using only finite-grid optional sampling, terminal conditional-expectation uniform integrability and the stated partition clock. The temporary enlargement by measurable subsets of one fixed null set is constructed explicitly and the final identity is tested against the original filtration; no usual-filtration hypothesis is added.

Depends on

Used by

Dependency tree · two levels

101 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