Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
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.

Jump-record instruments and conditional intensity

Statement

Assume AC and use the normalized finite-record process and its GKSL ensemble. Let Ft be the filtration generated by the times and marks observed up to t. The conditional state σt is obtained by no-jump propagation and trace normalization between events and by the marked update at events. Every finite measurable partition of the record space defines a finite instrument: integrate X↦KUXKU† over each cell. Its total channel is eUL. With the left-limit state at an event, the process has predictable intensity λt=Tr⁡(Qσt−), bounded by r whenever Q≤rI. In the counting-process contract with Yt=1, At=∫0tλs ds is continuous and predictable, and Nt−At is a square-integrable martingale for all pairs of times in [0,U].

Facts & Assumptions

[F1]

The marked waiting densities and survival give conditional state updates and their exact hazard. Marked waiting law from finite no-jump evolution

[F2]

The normalized finite-record measure has consistent restriction laws and tails Pr⁡(Nt≥n)≤(rt)n/n!. Normalized record measure and absence of explosion

[F3]

Summing record maps gives the finite GKSL channel. Finite jump-record ensemble equals the GKSL channel

[F4]

A finite instrument consists of completely positive maps whose sum preserves trace; its outcome states are normalized outputs at positive weights. Finite instruments and conditional states

[F5]

The intensity contract requires a predictable finite density, a continuous integrated compensator and an all-pairs square-integrable martingale. Simple counting-process intensity and compensator contract

[F6]

Tonelli permits summing nonnegative record densities and integrating event times. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[F7]

Fubini permits absolutely integrable signed or matrix entries and conditional expected integrals. Fubini's theorem for L¹ functions on a sigma-finite product

[F8]

Assume AC for the probability, filtration and integration interfaces. The Axiom of Choice

[F9]

On [0,U], the predictable sigma-algebra is generated by (s,u]×B with 0≤s<u≤U and B∈Fs and by {0}×B with B∈F0. Predictable real processes are closed under pointwise limits and are progressively measurable. Progressively measurable and predictable processes

Proof

Given: The finite-record law, the history filtration and Q≤rI, with any finite r≥∥Q∥ available when no smaller bound is specified.

Goal: Connect records, instruments, conditional hazards and the compensator contract.

1.1givenF1F2F3F4algebra

Integrating conjugation by KU over a measurable cell preserves positivity at every ancilla dimension, since the integral of each nonnegative quadratic form is nonnegative. The integrals exist by the positive trace bound and decomposition into four positive parts. Their sum over a finite partition is the GKSL channel by [F3], hence trace-preserving, so [F4] applies. Conditional on a recorded prefix the remaining law starts from its normalized output: the kernel-product factors in [F2] cancel exactly as in [F1]. This also identifies the conditional state before the next event as the normalized no-jump state. This is the particular instrument chosen by the given La; the channel alone does not select a unique monitoring instrument.

2.1F1F2step 1.1algebra

At a time with no intervening event the survivor from the current state is sσ(u) and its derivative is minus the summed marked density. Thus the no-event conditional hazard is Tr⁡(Qσ^(u)) by [F1]. On the finite-record space of [F2], the conditional state has continuous no-jump evolution between finitely many events and the prescribed right-hand reset at each event; the zero-density reset convention in [F1] defines it on every record. The Borel state maps in [F1], composed along the finite observed prefix, show that the state and its left-limit state are measurable functions of that prefix. Thus t↦σt−, with σ0−=ρ, is adapted and left-continuous on (0,U]. In particular λt=Tr⁡(Qσt−), with λ0=Tr⁡(Qρ), is a real adapted process with left-continuous paths on (0,U] and values in [0,r].

3.1F9step 2.1construct

To prove the needed predictability implication locally, let H be any real adapted process with left-continuous paths on (0,U], with H0 measurable for F0. Put qk=kU/2n and define Ht(n)=H01{0}(t)+∑k=02n−1Hqk1(qk,qk+1](t). For each Borel set C⊆R, its inverse image is {0}×{H0∈C} together with the finite union of (qk,qk+1]×{Hqk∈C}; all are predictable generators by adaptedness and [F9]. Thus every H(n) is predictable. At t=0 these approximants equal H0; for each t>0 the selected left endpoints are strictly below t and tend to t, so left-continuity gives Ht(n)→Ht on every record. Pointwise-limit closure in [F9] proves that H is predictable. Apply this to the process λ from step 2.1. The constant process Yt=1 is also predictable by the same construction.

4.1F6F9step 2.1step 3.1algebra

By [F9], predictability of λ makes its restriction to [0,t]×Ω measurable for B([0,t])⊗Ft for each fixed t. Apply the section-integral measurability in Tonelli to this nonnegative function on the product of the finite Lebesgue time space and (Ω,Ft,P); both measures are finite. It follows that At=∫0tλs ds is Ft-measurable. The pathwise bound 0≤λ≤r gives ∣At−As∣≤r∣t−s∣, so A is adapted and continuous on every record, with A0=0, AU≤rU and E[AU]≤rU. Apply the local approximation of step 3.1 to H=A, including its deterministic time-zero value, to conclude that A is predictable.

5.1F1F2F6F7F8step 1.1step 4.1algebra

Here is an explicit verification of the martingale requirement, rather than an inference from the hazard formula alone. Starting from any state at time s, let Zn(v) be the integral over exactly n events in (s,v) of their unnormalized record state propagated without further events up to v. The expected rate density of the next event after these n events is Tr⁡(QZn(v)): integrate and sum the last marked jump and then all continuations after it, whose conditional mass is one by [F2]. Consequently E[Nu−Ns]=∫su∑n≥0Tr⁡(QZn(v)) dv. On the other hand the weight of each n-event state at v is its trace, and multiplying that weight by its normalized hazard cancels the normalization. Hence E[λv]=∑n≥0Tr⁡(QZn(v)). Tonelli justifies both identities, and the sums are bounded by r, since the trace weights sum to one. The same computation applies conditional on every prefix at s, by consistency and the explicit kernels. Integrating against an arbitrary bounded measurable function of that prefix, and using Fubini, gives E[Nu−Ns∣Fs]=E[∫suλv dv∣Fs] for each fixed s≤u. Thus N−A is an all-pairs martingale.

6.1F2F5F6step 4.1step 5.1algebra∎

For an integer-valued nonnegative variable NU, NU2=∑n=1NU(2n−1). By the tail bound and Tonelli, E[NU2]≤∑n≥1(2n−1)(rU)n/n!<∞; convergence follows by the ratio test, or by the exponential series. Since AU≤rU, every Nt−At is square-integrable. Together with step 4.1 and the martingale identity, this establishes every clause of [F5].

Source notes

Plenio–Knight, Section IV.C, Eqs. (122), (124)–(128), motivates the no-jump/jump split in a cavity example. This item supplies its own finite-matrix argument; no general existence theorem is imported from that example.

Depends on

Used by · 2

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources