Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pending
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.

Forward Kolmogorov duality gives reversed martingales

Statement

Let X be a continuous Markov process on [0,T] in Rd with positive transition densities q and positive C1,2 marginal densities p. Suppose its marginal and transition identities define the Bayes-reversed kernels. Write Lrf=br,i∂if+12ar,ij∂ijf, with Borel coefficients and symmetric a, and Lr∗z=−∂i(br,iz)+12∂i∂j(ar,ijz). Assume ∂rpr=Lr∗pr classically. Put Aij(r,x)=pr(x)ar,ij(x), suppose its first state derivatives exist, and define Ci=−prbr,i+∑j∂jAij. Impose the following forward analytic hypotheses. For every compact K⊂Rd, ∫0T ⁣∫K[∑i∣Ci∣+∑i,jpr∣ar,ij∣]dx dr<∞. For every t∈(0,T] and f∈Cc∞(Rd), the actual forward conditional expectation gt,f(r,x)=∫q(r,x;t,y)f(y)dy,0<r<t, has a C1,2 version on (0,t)×Rd satisfying the backward Kolmogorov equation ∂rgt,f+Lrgt,f=0. For every ϕ∈Cc∞(Rd), assume the spatial adjoint identity ∫prϕLrgt,f dx=∫gt,fLr∗(prϕ) dx holds for almost every r∈(0,t); the integrals are finite. These are assumptions on the original forward transition family, not on a reversed process.

Define Drϕ=pr−1{Lr∗(prϕ)−ϕLr∗pr}, using the classical product rule. Then Yu=XT−u, with its natural reversed filtration Gu=σ(Yv:0≤v≤u), has the Bayes-reversed kernels and, for each such ϕ, ϕ(Yu)−ϕ(Y0)−∫0uDT−vϕ(Yv)dv is a true martingale. In particular DT−u is its extended martingale generator on compact smooth tests. No pointwise small-time transition-quotient limit is asserted.

Statement references

Anderson, Section 5, printed pp. 322–324: uses both forward and backward Kolmogorov equations. The finite-time martingale identity under the explicit hypotheses above is proved below.

Facts & Assumptions

Given: the forward process, densities, operators and analytic hypotheses in the Statement.

[F1]

The marginal and Chapman–Kolmogorov identities make the Bayes kernels probability kernels; Bayes' formula identifies them with the reversed conditional laws. Bayes-reversed transition kernels for a diffusion

[F2]

Fubini applies to an absolutely integrable time-state integrand, and dominated convergence applies to random variables bounded by an integrable random variable. Fubini's theorem for L^1 functions on a sigma-finite product Dominated convergence

[F3]

Given compact K in an open set O⊂Rd, there is a smooth compactly supported function in O, between zero and one, equal to one near K. Test function cutoffs and euclidean localization

[F4]

A lambda-system containing a generating pi-system contains the generated sigma-algebra. Dynkin's pi-lambda theorem

Proof

Given: all hypotheses and notation in the Statement.

1.1givenF1F2algebra

The adjoint product rule and symmetry give prDrϕ=(−prbr,i+∂jAij)∂iϕ+12Aij∂ijϕ. If K contains the support of ϕ, boundedness of its derivatives and the first displayed integrability hypothesis imply ∫0TE∣Drϕ(Xr)∣dr=∫0T ⁣∫Kpr∣Drϕ∣dxdr<∞. Thus every random time integral below is integrable. Bayes' formula gives the reversed Markov kernels and their composition by [F1].

2.1givenF2step 1.1algebra

Fix 0<s<t≤T and f∈Cc∞, and write g=gt,f. On every compact subinterval of (0,t), the product pr(x)ϕ(x)g(r,x) has a continuous time derivative and compact state support. The ordinary fundamental theorem of calculus and [F2] therefore differentiate its state integral. The forward marginal equation, backward equation and assumed spatial adjoint identity yield ddr∫prϕgrdx=∫ϕgrLr∗prdx−∫prϕLrgrdx=−∫prgrDrϕdx. This last function is integrable on (0,t) because ∣gr∣≤∥f∥∞ and step 1.1 holds. Also ∫prϕgrdx=E[ϕ(Xr)f(Xt)]. Integrate between interior times and then approach s and t; continuity of X and boundedness of ϕ,f justify the endpoint limits by [F2]. The same argument lets s↓0. Hence, for 0≤s<t≤T, E ⁣[f(Xt){ϕ(Xs)−ϕ(Xt)−∫stDrϕ(Xr)dr}]=0. Fubini in the last term is justified by step 1.1 and ∥f∥∞.

3.1F2F3F4step 2.1

Denote the integrable expression in braces by Z. For an open O, put Kn={x:∣x∣≤n, dist⁡(x,Oc)≥1/n}, taking distance to the empty set as infinity. Each Kn is compact in O, and every x∈O belongs to all sufficiently late Kn. Take the cutoffs fn by the explicit rational-ball construction in [F3] (using the least code of a finite rational cover at each n), supported in O, with 0≤fn≤1 and fn=1 on Kn. Then fn→1O pointwise. Step 2.1 and dominated convergence with bound ∣Z∣ give E[Z1{Xt∈O}]=0. This includes O=Rd. The Borel sets B for which E[Z1{Xt∈B}]=0 form a lambda-system, since Z is integrable and its total expectation is zero. Open sets are a generating pi-system, so [F4] proves E[Z∣Xt]=0.

4.1F1F2step 1.1step 3.1∎

Set s=T−v and t=T−u for 0≤u<v≤T. Step 3.1 gives the zero conditional expectation of the compensated increment between u and v given Yu. The reversed Markov property from step 1.1 makes the same conditional expectation given Gu zero: first this holds for bounded functions of finitely many future reversed coordinates by the Markov factorization, then bounded monotone approximation gives it for the future reversed path segment, and [F2] and step 1.1 permit its integrable time integral. Thus the displayed compensated process is a true G-martingale. The operator is its extended martingale generator by this identity.

Depends on

Used by

Dependency tree · two levels

22 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