Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 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.

Martingale and predictable bracket for a finite-state chain

Statement

Assume the Axiom of Choice. Let E be finite and nonempty, let L be a rate matrix on E, let X be its uniformized realization from the preceding existence result, and let f:E→R be bounded. Put g=Lf and Mt=f(Xt)−f(X0)−∫0tg(Xs) ds,Γf(i)=L(f2)(i)−2f(i)Lf(i). For every finite T, (Mt)0≤t≤T is a square-integrable martingale relative to the construction filtration, and At:=∫0tΓf(Xs) ds is its continuous predictable bracket: A0=0, A is increasing and predictable, and Mt2−At is a martingale. The bracket is understood in the continuous predictable increasing compensator convention stated in the proof.

Facts & Assumptions

Given: The finite-state rate matrix, the uniformized process, a bounded real function f, a finite horizon T, and the Axiom of Choice.

[A1]

Assume the Axiom of Choice. The all-pairs continuous-time martingale and conditional-expectation interfaces below carry this assumption (The Axiom of Choice).

[F1]

Finite-state generator chain: with λi=∑j≠iLij and q=max⁡iλi, if q=0 then L=0 and X is constant; if q>0, set R=I+L/q and take an R-Markov sequence Y and mutually independent rate-q exponential waiting times independent of the entire sequence Y, with Nt counting their arrivals and Xt=YNt. Uniformization constructs every finite-state rate matrix chain: X is adapted and has all-pairs conditional transition matrices ehL; when q>0, its proof also shows that N has independent rate-q Poisson increments and is independent of Y.

[F2]

Continuous-time adapted processes and martingales: a martingale is adapted, meaning Mt is Ft-measurable at every time, is integrable, and satisfies E[Mt∣Fs]=Ms almost surely for every s≤t; square-integrability requires EMt2<∞ at every time.

[F3]

Basic algebra and order properties of conditional expectation: conditional expectation is linear, preserves order and constants, and satisfies ∣E[Z∣G]∣≤E[∣Z∣∣G] for integrable Z.

[F4]

Progressively measurable and predictable processes: predictability is measurability for the sigma-algebra generated by (u,v]×A with A∈Fu and by time-zero sets.

[F5]

Fubini's theorem for L^1 functions on a sigma-finite product: for bounded jointly measurable functions on [0,T]×Ω, the time and probability integrals may be interchanged.

[F6]

A continuous finite-variation martingale is constant: a continuous martingale starting at zero with integrable finite total variation on [0,T] is indistinguishably zero.

[F7]

Taking out what is known: if Z is integrable and H is bounded and G-measurable, then E[HZ∣G]=HE[Z∣G].

[F8]

Tower property of conditional expectation: for H⊆G and integrable Z, E[E[Z∣G]∣H]=E[Z∣H]. All these conditional-expectation interfaces assume AC.

Proof

If q=max⁡iλi=0, then L=0 and the uniformized process is constant by [F1]. Thus g=0, Γf=0, and M=A=0. If B is any other bracket in the stated class, then B−A is a continuous martingale starting at zero with total variation bounded by the integrable random variable BT+AT; [F6] gives B=A indistinguishably. Hence the conclusion holds when q=0. For the remainder of the proof assume q>0.

1.1A1F1F2F3F5constructalgebra

Fix t>0 and a bounded function a:E→R. On [0,t], approximate a(Xu) by the process with value a(Xkt/2n) on ((k−1)t/2n,kt/2n], 1≤k≤2n, and value a(X0) at zero. Each approximation is B([0,t])⊗Ft-measurable by adaptedness of X in [F1], and converges pointwise by right continuity. The construction uses constant paths on its exceptional explosion event, so this argument applies there too. Its time integral is the Ft-measurable sum (t/2n)∑k=12na(Xkt/2n). These sums converge to ∫0ta(Xu) du: on a path with J jumps, the error is at most 2∥a∥∞Jt/2n, since only intervals containing a jump contribute. Thus the time integral is Ft-measurable, without completing the filtration. Taking a=g proves that M is adapted, also at t=0. By [F1], E[g(Xs+r)∣Fs]=(erLg)(Xs). The joint measurability just proved and boundedness allow [F5] on finite time intervals. Testing against each event in Fs gives E ⁣[∫ss+hg(Xu) du|Fs]=∫0h(erLLf)(Xs) dr=(ehLf−f)(Xs), where the last equality follows by termwise differentiation of the absolutely convergent finite-matrix exponential series. Also E[f(Xs+h)∣Fs]=(ehLf)(Xs). Subtracting and using adaptedness proves E[Ms+h∣Fs]=Ms for every s,h. On [0,T], ∣Mt∣≤2∥f∥∞+T∥Lf∥∞, so every Mt is square-integrable and [F2] gives the all-pairs martingale assertion.

2.1F1F4step 1.1constructalgebra

Since ∑jLij=0, Γf(i)=∑jLij(f(j)−f(i))2=∑j≠iLij(f(j)−f(i))2≥0. Thus A is increasing and bounded on [0,T]. The integral argument of step 1.1 with a=Γf proves that A is adapted. Also ∣At−As∣≤∥Γf∥∞∣t−s∣, so A is continuous. For T>0 and each n, the step process equal to AkT/2n on (kT/2n,(k+1)T/2n] and zero at time zero is predictable by [F4]; these processes converge pointwise to A by continuity. Therefore A is predictable; on the horizon T=0 the assertion is immediate from A0=0.

3.1A1F1step 1.1step 2.1algebra

Fix u and condition on Fu, writing Xu=i. For 0<h≤1, the number of uniformization events during (u,u+h] is Poisson with rate q=max⁡iλi by the exponential-clock construction in [F1]. If there is no event, ΔM:=Mu+h−Mu=−hg(i), whose square is O(h2). If there is exactly one event and the new state is j≠i, its probability is e−qhqhRij=e−qhhLij=hLij+O(h2), and ΔM=f(j)−f(i)+O(h) uniformly because the drift integral has magnitude at most h∥g∥∞. Its contribution to the conditional second moment is therefore hLij(f(j)−f(i))2+O(h2). A one-event self-transition contributes O(h3). The probability of at least two events is O(h2) and ΔM is uniformly bounded for h≤1, so its contribution is O(h2). Since E is finite, all error bounds are uniform in i, and E[(ΔM)2∣Fu]=hΓf(i)+O(h2). Also P(Xu+r≠i∣Fu)≤qr, so boundedness of Γf gives E ⁣[∫uu+hΓf(Xv) dv|Fu]=hΓf(i)+O(h2). Consequently ∣E[(ΔM)2−∫uu+hΓf(Xv) dv∣Fu]∣≤Ch2 for a finite constant C depending only on L,f,T.

4.1A1F2F3F7F8step 1.1step 3.1

Let Dt=Mt2−At. On any interval [u,u+h], Du+h−Du=2MuΔM+(ΔM)2−∫uu+hΓf(Xv) dv. On [0,T], Mu is bounded and Fu-measurable by step 1.1, so [F7] and the mean-zero increment give E[2MuΔM∣Fu]=2MuE[ΔM∣Fu]=0, while step 3.1 bounds the conditional expectation of the remaining terms by Ch2. For fixed s<t, divide [s,t] into n equal intervals of length h=(t−s)/n≤1. For the subdivision times u, Fs⊆Fu and every increment of D is integrable. Thus [F8], linearity and order in [F3], and the preceding bound imply ∣E[Dt−Ds∣Fs]∣≤nCh2=C(t−s)2/n. Letting n→∞ proves E[Dt∣Fs]=Ds. Thus M2−A is a martingale.

5.1A1F4F6step 2.1step 4.1∎

In this item, a continuous predictable bracket means a continuous predictable increasing process B with B0=0, EBT<∞, and M2−B a martingale. Steps 2.1 and 4.1 show that A has these properties. If B is another such process, then B−A is a continuous martingale starting at zero, and its total variation on [0,T] is at most BT+AT, which is integrable. By [F6], B−A is indistinguishably zero. Therefore A is the unique bracket in this stated continuous predictable compensator class, and it has the displayed formula.

Depends on

Dependency tree · 2 levels

Sources