Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pendingjudge pass (gpt-6-luna)
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.

Reversed kernels, generator, and martingale problem

Statement

Let Xt have continuous paths on [0,T] and be Markov on Rd, meaning its conditional future law given the past depends only on its current state; nonexplosive means it remains in Rd throughout this finite interval. Let it have forward generator Ltϕ=bt⋅∇ϕ+12at:D2ϕ, where at=σtσtT is symmetric and Lt∗r=−∂i(bt,ir)+12∂i∂j(at,ijr). Assume positive C1,2 marginal densities pt and positive transition densities q(s,x;t,y) satisfy the marginal identity and Chapman–Kolmogorov identity, and that ∂tpt=Lt∗pt and ∂tq(s,x;t,y)=Lt∗,yq(s,x;t,y) hold classically. Assume for every ϕ∈Cc∞(Rd) that the transition-density integrals can be differentiated in time, the resulting derivatives are integrable, and integration by parts in the state variable has no boundary term.

Define Ku,v by the Bayes-reversed kernel formula for 0≤u≤v≤T. Then the reversed process Yu=XT−u is Markov with transitions Ku,v. For compact smooth ϕ, define the formal adjoint candidate operator L~uϕ(y)=LT−u∗(pT−uϕ)(y)−ϕ(y)LT−u∗pT−u(y)pT−u(y). The product rule gives the identity L~uϕ=b~u⋅∇ϕ+12aT−u:D2ϕ,b~u=−bT−u+∇ ⁣⋅aT−u+aT−u∇log⁡pT−u, with (∇ ⁣⋅a)i=∑j∂jaij. These Bayes-kernel and formal product identities use only the preceding hypotheses.

For the martingale conclusion, impose additionally the following forward analytic conditions. For every compact K⊂Rd, with Aij(r,x)=pr(x)ar,ij(x) and Ci=−prbr,i+∑j∂jAij, ∫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 has a C1,2 version on (0,t)×Rd, solves ∂rgt,f+Lrgt,f=0, and satisfies ∫prϕLrgt,fdx=∫gt,fLr∗(prϕ)dx for each compact smooth ϕ and almost every r<t. All coefficient expressions in these conditions are Borel. These are conditions on the original forward transition family.

Under these additional forward analytic conditions, L~u is the extended martingale generator of Y: for its natural reversed filtration Gu=σ(Yr:0≤r≤u), every compact-test compensated process is a martingale, hence a local martingale. The unconditional formal candidate identity alone makes no martingale or pointwise transition-quotient assertion.

Statement references

Anderson, Section 5, printed pp. 322–324: gives the reverse Kolmogorov-equation approach as context; the full kernel and martingale argument is proved here.

Tang and Zhao, Section 2.2, PDF pp. 3–5: states the reverse-drift formula and explicitly gives a heuristic derivation.

Facts & Assumptions

Given: the positive density, forward equation, regularity, differentiation, and no-boundary-term hypotheses in the Statement; L∗ is the formal adjoint of L. The additional forward analytic hypotheses are imposed when proving the martingale conclusion.

[F1]

The Bayes-reversed kernels are probability kernels and compose in reverse order by the forward marginal and Chapman–Kolmogorov identities. Bayes-reversed transition kernels for a diffusion

[F2]

The forward backward-Kolmogorov and local weighted integrability conditions in the Statement imply the finite-time reversed compact-test martingale identity by differentiating ∫prϕgt,f(r,⋅) and integrating in time. Forward Kolmogorov duality gives reversed martingales

[F3]

The explicit local weighted bound makes ∫0TE∣Drϕ(Xr)∣dr finite for each compact smooth test; Fubini then justifies the conditional time integral. No varying-endpoint transition quotient or partition limit is used. Fubini's theorem for L^1 functions on a sigma-finite product

[F4]

For Aij=aijp, symmetry of a and the product rule give Lt∗(pϕ)−ϕLt∗p=p(−bi+1p∂j(paij))∂iϕ+12paij∂ijϕ. This is an algebraic expansion of the displayed formal adjoint.

Proof

Given: the process and base hypotheses in the Statement; impose its additional forward analytic conditions for steps 2.1–3.1.

1.1F1

Bayes' formula gives the one-step reversed conditional law: for Borel A, the joint density of (XT−v,XT−u) is pT−v(x)q(T−v,x;T−u,y), while the later marginal is pT−u(y). Their ratio is exactly Ku,v(y,A). The kernel is normalized and composes by [F1], so the finite-dimensional reversed laws have the Markov factorization with these kernels.

2.1F2step 1.1

Put t=T−u and Dtϕ=pt−1{Lt∗(ptϕ)−ϕLt∗pt}. Under the additional forward analytic conditions in the Statement, the hypotheses are exactly those of [F2], so that result gives the compensated-test martingale with coefficient DT−u. Thus the displayed operator is the extended martingale generator. This argument uses the finite-time product identity for the actual forward transition family.

3.1F1F2F3step 1.1step 2.1

Under the same additional conditions, [F2] gives for 0≤s<t≤T and every bounded Borel f the identity E ⁣[f(Xt){ϕ(Xs)−ϕ(Xt)−∫stDrϕ(Xr)dr}]=0. Reversed Markov conditioning and [F3] therefore give zero conditional expectation of every compensated increment given Gu, as required. The explicit bound gives a true martingale, hence a local martingale.

4.1step 2.1F4∎

Expanding the adjoint in step 2.1, the drift part contributes −pbi∂iϕ. The second-order product rule contributes ∂j(paij)∂iϕ+12paij∂ijϕ after summing and using symmetry of a. Divide by p and use p−1∂j(paij)=∂jaij+aij∂jlog⁡p to obtain the stated reverse drift and diffusion matrix.

Depends on

Used by

Dependency tree · two levels

17 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