Alphabeta Math
TheoremStatement: 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.

Forward equation and stationary laws for finite-state rate processes

Statement

Let Xt be a finite-state continuous-time Markov jump process on [0,T] with finite state set E, bounded continuous rates κxy(t), and row generator Q(t) under the first-jump convention. Let px(t):=P(Xt=x) and regard p(t) as a row vector. If T>0, then p is continuously differentiable on (0,T) with the corresponding one-sided derivatives at the endpoints, and

py′(t)=∑x∈E, x≠ypx(t)κxy(t)−py(t)λy(t),p′(t)=p(t)Q(t).

If T=0, the differential assertion is vacuous and the only time marginal is p(0). In either case, if a probability row vector π satisfies πQ(t)=0 for every t∈[0,T] and p(0)=π, then p(t)=π for all t∈[0,T]. For constant rates this says that every generator-stationary probability vector is an invariant law of the process.

Facts & Assumptions

Given: A finite state set, bounded continuous rates, the rate-process convention, and an initial probability row vector.

[F1]

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

[F2]

Path densities and finite jump counts for bounded finite-state rates: on a short interval, the probability of at least two jumps is O(h2), and each finite path has the stated jump-time density.

[F4]

The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a) evaluates the integral of an integrable derivative as the endpoint difference, including one-sided endpoint derivatives.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice, carried by the Lebesgue path-density argument in [F2].

Proof

Given: The data in the Statement.

1.1A1F1F2F3algebra

If T=0, the only time is t=0 and p(0) is its initial law. Suppose T>0. By the first-jump convention, the no-jump probability from x over [t,t+h] is Hx(t,t+h)=exp⁡(−∫tt+hλx(s) ds)=1−λx(t)h+o(h). For x≠y, the probability of exactly one jump x→y and no further jump is ∫tt+hHx(t,s)κxy(s)Hy(s,t+h) ds=κxy(t)h+o(h). Paths with at least two jumps contribute O(h2) by [F2]. Hence the conditional endpoint transition probabilities equal κxy(t)h+o(h) for y≠x, and 1−λx(t)h+o(h) for y=x. Averaging this expansion over the finite states gives ∣py(t+h)−py(t)∣=O(h); the same estimate from the left shows p is continuous. By the Markov property, for each y∈E, py(t+h)=py(t)(1−λy(t)h)+∑x≠ypx(t)κxy(t)h+o(h). There are finitely many states, so the remainder remains o(h) after summation. Dividing by h and taking h↓0 gives the stated forward equation; applying the same expansion at t−h gives the left derivative. Its right-hand side is continuous because the rate functions and each px are continuous, hence p is continuously differentiable on the interior, with the corresponding one-sided derivatives at the endpoints.

2.1F3F4step 1.1algebra

Suppose πQ(t)=0 and p(0)=π. The constant function p(t)=π satisfies the forward equation. If d(t) is the difference of any other solution and π, then d(0)=0 and d′=dQ. For t>0, each component of d is differentiable on [0,t], with one-sided endpoint derivatives, and its derivative is continuous, hence integrable. Applying the second fundamental theorem in [F4] componentwise gives d(t)=∫0td(s)Q(s) ds. For t=0 this identity holds by the zero-interval convention. Use the vector 1-norm ∥d∥1:=∑x∣dx∣ and let B:=sup⁡s∈[0,T]max⁡x∑y∣Qxy(s)∣<∞, the maximum absolute row sum. Let D:=sup⁡s∈[0,T]∥d(s)∥1<∞. Since d is a row vector, the triangle inequality gives ∥d(s)Q(s)∥1≤∑x∣dx(s)∣∑y∣Qxy(s)∣≤B∥d(s)∥1. Iterating the integral equation yields ∥d(t)∥1≤D(Bt)n/n! for every integer n≥1. This bound tends to zero as n→∞, so d(t)=0 for every t. Therefore p(t)=π.

3.1step 2.1algebra∎

In the constant-rate case, πQ=0 is exactly the coordinate condition ∑x≠yπxκxy=πyλy for each y, so step 2.1 proves invariance of the stated generator-stationary law.

Depends on

Dependency tree · 2 levels

Sources