Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Finite-state Feynman-Kac evolution for continuous jump rates

Statement

Let Xt be a finite-state continuous-time Markov jump process on [0,T] with initial law ρ and bounded continuous rates κxy(t). Let Vx:[0,T]→R be continuous for every state. For y∈E, define the weighted endpoint mass

Gy(t):=E[exp⁡(−∫0tVXs(s) ds)1{Xt=y}].

Then G(0)=ρ. If T>0, G is continuously differentiable on (0,T) with the corresponding one-sided derivatives at the endpoints, and it is the unique solution of

Gy′(t)=∑x≠yGx(t)κxy(t)−Gy(t)λy(t)−Vy(t)Gy(t).

If T=0, the unique function on the singleton time interval is G(0)=ρ, and no differential equation is asserted.

Facts & Assumptions

Given: A finite-state Markov jump process with bounded continuous rates, initial law ρ, and continuous functions Vx.

[F1]

Finite-state continuous-time Markov jump processes with bounded rates: conditional on state x at time t, no-jump survival over [t,t+h] is exp⁡(−∫tt+hλx(s) ds), and the first-jump density to state y is survival times κxy.

[F2]

Path densities and finite jump counts for bounded finite-state rates: on any interval of sufficiently small length, the probability of at least two jumps is bounded by a constant times the square of its length; the path has finitely many jumps almost surely.

[F3]

Expectation of a nonnegative or integrable random variable: expectation of a nonnegative or integrable random variable is its integral with respect to the probability law.

[F5]

The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a): a function differentiable on a nondegenerate closed interval, with one-sided endpoint derivatives and an integrable derivative, has integral of its derivative equal to its endpoint increment.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice, used through the Lebesgue path-density construction in [F2].

Proof

Given: The process, rates, initial law, and functions Vx from the Statement.

1.1A1F1F2F3F4algebra

If T=0, the single endpoint value is Gy(0)=ρy. Suppose T>0 and put K:=max⁡xsup⁡s∈[0,T]∣Vx(s)∣ and M:=max⁡xsup⁡s∈[0,T]λx(s). Write w(t):=exp⁡(−∫0tVXs(s) ds). Almost surely the path has finitely many jumps by [F2], so the integrand is piecewise continuous; its integral is the limit of coordinate-measurable Riemann sums. Thus the weights are measurable (assign any bounded value on the measurable exceptional null set) and satisfy 0<w(t)≤eKT. For 0≤u<v≤T and h:=v−u, ∣w(v)−w(u)∣≤eKT(eKh−1), while [F1] gives P(N(u,v]≥1)≤1−e−Mh≤Mh. Since an endpoint indicator can change only if a jump occurs, ∣Gy(v)−Gy(u)∣≤eKT(eKh−1+Mh). This bound tends to zero with h, uniformly in u,v, proving continuity on the entire closed interval.

2.1A1F1F2F3F4step 1.1algebra

For 0≤t≤T−h, condition on the history through t. Starting at y, the contribution of no jump to the additional weighted endpoint indicator is exp⁡(−∫tt+h(λy(s)+Vy(s)) ds)=1−(λy(t)+Vy(t))h+o(h). Starting at x≠y, exactly one jump to y contributes ∫tt+hHx(t,s)κxy(s)Hy(s,t+h)exp⁡(−∫tsVx(r) dr−∫st+hVy(r) dr) ds=κxy(t)h+o(h). The conditional bound from [F2], obtained by restarting the first-jump rule at t, bounds the probability of two or more jumps by (Mh)2 when Mh<1; their weighted contribution is at most eKh(Mh)2. The finitely many continuous rates and potentials have a common modulus of continuity ω(h)→0 on [0,T]. Hence the preceding remainders are O(hω(h)+h2) uniformly in the starting time and state. Multiply by w(t) and average, using the Markov property and the bound in step 1.1, to obtain Gy(t+h)=Gy(t)+hRy(t)+ry(t,h),Ry(t):=∑x≠yGx(t)κxy(t)−Gy(t)λy(t)−Vy(t)Gy(t), where sup⁡0≤t≤T−h, y∈E∣ry(t,h)∣/h→0.

3.1step 1.1step 2.1algebra

By step 1.1 and continuity of the rates and potentials, R is continuous. Step 2.1 gives the right derivative Gy′(t+)=Ry(t) for t<T. For t>0, apply its uniform expansion at t−h to get (Gy(t)−Gy(t−h))/h=Ry(t−h)+ry(t−h,h)/h→Ry(t). Thus the full derivative exists on (0,T), extends continuously as the stated one-sided derivatives at the endpoints, and satisfies the claimed equation. The defining expectation at zero gives Gy(0)=ρy.

4.1F5step 3.1algebra∎

If G and G~ are two solutions with the same initial vector, their difference D satisfies D(0)=0 and D(t)=∫0tA(s)D(s) ds by [F5], applied componentwise, where A(s)=Q(s)T−diag⁡(V(s)) in column convention. Its coefficients and D are continuous on [0,T]. Define ∥z∥∞:=max⁡y∣zy∣, B:=sup⁡smax⁡y∑x∣Ayx(s)∣<∞, and C:=sup⁡s∥D(s)∥∞<∞. Then ∥A(s)z∥∞≤B∥z∥∞. Starting from ∥D(t)∥∞≤C, induction in the integral equation gives ∥D(t)∥∞≤C(Bt)n/n! for every n≥1; the induction integrates sn, whose primitive is sn+1/(n+1), by [F5]. For each fixed t these bounds tend to zero, since successive terms have ratio Bt/(n+1), eventually at most 1/2. Hence D=0 and the solution is unique.

Depends on

Dependency tree · 2 levels

Sources