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.

Normalized record measure and absence of explosion

Statement

Use the finite no-jump matrices La,Q,B,Vt and maps St of the no-jump survival lemma, assume AC, and fix a finite horizon U>0 and initial density matrix ρ. Put M={1,…,m}, possibly empty. For n≥1, let Δn(U)={(t1,…,tn):0<t1<⋯<tn<U} and En(U)=Δn(U)×Mn, with the Borel sigma-algebra from the Euclidean time coordinates and discrete marks. Let E0(U)={∅} be the empty-record singleton. The record space is ΩU=⨆n≥0En(U), with sigma-algebra AU={A⊆ΩU:A∩En(U) is Borel for every n}. On En(U) let μn be the restriction of the product of n copies of Borel Lebesgue measure on (0,U) and counting measure on Mn; let μ0 give the singleton mass one.

For a record with n>0, put t0=0, Wn=LanVtn−tn−1⋯La1Vt1 and KU=VU−tnWn; put W0=I and KU=VU on the empty record. Then PU(A)=∑n≥0∫A∩En(U)Tr⁡(KUρKU†) dμn defines a probability measure on (ΩU,AU). For 0<t≤U, the restriction RU,t keeps precisely the events strictly before t; it is measurable and its pushforward law is Pt. At t=0 the restriction is the empty record. The successive waiting laws are the marked kernels of the waiting-kernel lemma, with all waiting outcomes beyond the remaining horizon combined into the no-further-event outcome.

The associated counting process Nt=#{j:tj≤t}, 0≤t≤U, has measurable coordinates, is simple and non-explosive, and has right-continuous unit-jump paths. For each fixed t, an event exactly at t has probability zero, so using ≤t for Nt and <t for the restriction gives the same count almost surely. If Q≤rI with r≥0, then Pr⁡(Nt≥n)≤(rt)n/n! for every n≥1 and 0≤t≤U.

Facts & Assumptions

[F1]

No-jump evolution contracts the trace of positive matrices, and supplies Vt and Q. Finite no-jump propagator and survival identity

[F2]

The explicit normalized waiting kernels have the displayed survival, marked densities, measurable state updates and post-event states. Marked waiting law from finite no-jump evolution

[F3]

Tonelli applies to nonnegative product-measurable densities on sigma-finite products; it permits reordering event-time integrals, mark sums and nonnegative series. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[F4]

Assume AC. Its Countable Choice consequence is used for the Lebesgue-measure suppliers. The record and state formulas make no further selection of conditional versions. The Axiom of Choice

[F5]

Borel sigma-algebras are generated by open sets, product sigma-algebras by measurable rectangles, and measurability means that inverse images of measurable sets are measurable. The Borel sigma-algebra of a topological space The product sigma-algebra and its finite iterates A measurable function between measurable spaces

[F6]
[F7]

On any measure space, integrating a nonnegative measurable density over measurable sets defines a measure. The indefinite integral of a nonnegative measurable function is a measure

[F8]

A probability measure is a measure of total mass one; together with its measurable space it defines a probability space. Probability measures and probability spaces

[F9]

A family of measurable random elements indexed by time is a stochastic process. Here the count state space is N0 with its discrete sigma-algebra. Stochastic processes and their finite-dimensional distributions

[F10]

A conditional law of a random element Y given a random element P is a probability kernel C from the prefix space to the outcome space whose evaluations satisfy ∫P−1(B)C(P(ω),A) dP=P(P∈B,Y∈A) for every measurable A,B. This is the defining identity on σ(P), and does not condition by division by the probability of a singleton prefix. Conditional law given a random element

[F11]

For every Lebesgue measurable E⊆R and b∈R, the translate E+b is Lebesgue measurable and has the same Lebesgue measure. Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation

[F12]

The integral of a nonnegative simple function is the sum of its coefficients times the measures of its disjoint level sets. The nonnegative Lebesgue integral is the supremum of these simple integrals over all nonnegative simple minorants. The integral of a nonnegative simple function The nonnegative Lebesgue integral

Proof

Given: The finite no-jump data, AC, a finite horizon, initial state and record coordinates as in the statement.

Goal: Construct and normalize the measurable record law, prove measurable consistent restrictions, and bound its jump-count tails.

1.1givenF1F3F4F5F6algebra

The component Borel sigma-algebras agree with the time-and-mark product sigma-algebras: rational open boxes form a countable basis for each Euclidean time space, so open sets are countable unions of basic rectangles; the finite discrete mark space adds only finitely many pieces. Thus the ordered simplexes are measurable, and [F6] supplies the finite component base measures μn. The matrix densities are continuous in the time coordinates for each mark word and nonnegative, hence Borel measurable by [F5]. For n≥1, define qn(t) by integrating Tr⁡(WnρWn†) over the ordered n event times up to t and summing marks; let q0(t)=1. For any positive X, ∑aTr⁡(LaXLa†)=Tr⁡(QX)≤rTr⁡X, while each intervening Sv contracts trace. Summing marks successively from the last mark backwards bounds the summed integrand by rn. The ordered simplex has volume tn/n!, by iterating the elementary integral of tn−1/(n−1)!. Hence qn(t)≤(rt)n/n!. An available bound always exists: take r=∥Q∥, the largest eigenvalue of the positive matrix Q. If M is empty, every positive-event component is empty and qn(t)=0 for n≥1.

1.2F3F5F6F11F12constructalgebra

Write λ for Borel Lebesgue measure on R. Translation is a Borel bijection with Borel inverse, and [F11] gives λ(E+b)=λ(E) for every Borel E. For ℓ≥1 and b∈Rℓ, the translated product measure and λ⊗ℓ agree on rectangles by the one-dimensional identity, and are sigma-finite; the uniqueness clause in [F6], iterated through the finite factors, makes them equal on all product-Borel sets. For a Borel D⊆Rℓ and nonnegative Borel g on D+b, it follows first for indicators, then for nonnegative simple functions by their coefficient-sum definition, and finally for g by the supremum definition in [F12], that ∫D+bg(v) dλ⊗ℓ(v)=∫Dg(u+b) dλ⊗ℓ(u). The last passage uses the bijection between simple minorants given by composition with the translation and its inverse. Restricting to intervals or ordered simplexes preserves this identity, and summing unchanged discrete marks preserves it as well. With no time coordinates the identity is immediate. When b depends on a fixed prefix, apply this identity separately for each prefix and then use [F3] for the nonnegative outer integral; the translations used below depend continuously on the prefix time, so the composed integrands remain product-measurable.

2.1F3F5F6F7step 1.1construct

The family AU is a sigma-algebra: intersections with any component commute with complements relative to ΩU and with countable unions. By step 1.1 and [F7], each νn(An)=∫AnTr⁡(KUρKU†) dμn is a measure on En(U), including the singleton component. Define PU(A)=∑nνn(A∩En(U)). It vanishes at the empty set. For pairwise disjoint Aj∈AU, component countable additivity gives PU(⋃jAj)=∑n∑jνn(Aj∩En(U))=∑jPU(Aj). The interchange holds for nonnegative double series, since either order is the supremum of the sums over finite rectangles of indices, or by [F3] on counting spaces. Thus the proposed law is a countably additive measure before normalization.

3.1F1F2F3F8step 1.1step 1.2step 2.1algebra

Let pn(U)=νn(En(U)). For a prefix ending at tn, set X=WnρWn†, with X=ρ and tn=0 when n=0. The waiting-kernel identity, multiplied by Tr⁡X, says Tr⁡(SU−tn(X))+∑a∫0U−tnTr⁡(LaSu(X)La†) du=Tr⁡X. It also holds when Tr⁡X=0, since positivity then gives X=0. For each fixed prefix, step 1.2 permits the change from the absolute next-event time v∈(tn,U) to u=v−tn. Integrating prefixes by [F3] therefore gives pn(U)=qn(U)−qn+1(U), including n=0. Products of successive normalized waiting densities and terminal survival factors cancel their trace denominators, leaving exactly Tr⁡(KUρKU†); zero-density prefixes contribute zero. Hence ∑n=0k−1pn(U)=1−qk(U)→1: for rU>0, the bound (rU)k/k! has successive ratio rU/(k+1)≤1/2 eventually, and the case rU=0 is immediate. Therefore step 2.1 has total mass one and is a probability measure by [F8]. This argument holds for every density matrix and finite remaining horizon, without presupposing a stochastic existence theorem.

3.2F3F5F6F7F9step 1.1step 2.1algebraconstruct

For fixed 0<t<U, partition each En(U) according to k=#{j:tj<t}. These pieces are Borel, as the cut conditions are coordinate inequalities. On each piece RU,t is the coordinate projection onto the first k time-and-mark pairs, with the constant empty record for k=0. Inverse images of Borel subsets of Ek(t) are Borel by continuity of this projection, and taking the finite union over k and the countable union over n proves measurability for At. The endpoint restrictions are constant at zero and the identity at U. Also Nt=∑j=1n1{tj≤t} on En(U), so each Nt is measurable into the discrete space N0. By [F9], this family on (ΩU,AU,PU) is a stochastic process. For each fixed t, the coordinate sets {tj=t} have base measure zero by the product rectangle formula and Tonelli, because a singleton time has Lebesgue measure zero. Their finite union on each component, then countable union over components, has PU-measure zero by [F7] and step 2.1. Thus the strict and non-strict count conventions agree almost surely at each fixed time.

4.1F1F2F3F9step 1.1step 1.2step 3.1step 3.2algebra

Fix 0<t<U and a prefix of k events before t. Its unnormalized state at t is Xt=KtρKt† with weight w=Tr⁡Xt. If w>0, every completed continuation after t factors into the prefix weight times the same record density on horizon U−t with initial state Xt/w; this follows from multiplication of the matrices defining KU. Step 1.2 sends the absolute continuation times vj∈(t,U) to vj−t∈(0,U−t) without changing their product-time/counting-mark measure. By step 3.1 those continuation densities have total mass one. If w=0, positivity gives Xt=0 and every continuation density vanishes. The state maps are measurable by [F2]. Multiplying by the indicator of any Borel prefix event and using [F3] to integrate and sum continuations therefore leaves exactly its Pt weight. The null event at the cut, from step 3.2, is harmless. This proves (RU,t)∗PU=Pt; the endpoint cases are immediate. Finally Pr⁡(Nt≥n)=∑k≥npk(t)=qn(t)≤(rt)n/n!, using the telescoping identity and vanishing remainder; at t=0 both sides are zero for n≥1. Every record contains finitely many strictly ordered times, so its count path is right-continuous with unit jumps and finitely many jumps on the horizon. The process is therefore simple and non-explosive.

4.2F1F2F3F5step 1.2step 3.1algebraconstruct

To specify successive conditioning, fix an integer k≥0 and give Pk=Ek(U)⊔{∂} the component Borel sigma-algebra, with ∂ isolated. The random prefix Pk is the first k time-and-mark pairs when NU≥k, and is ∂ otherwise; P0 is always the empty record. Give D=((0,U)×M)⊔{†} the analogous sigma-algebra, with † the censored next-outcome symbol. Define Yk=(tk+1−tk,ak+1) when NU≥k+1, with t0=0, and Yk=† otherwise. On every record component these maps are either coordinate projections, continuous differences of coordinates, or constants on measurable pieces, so they are measurable by [F5]. For p∈Ek(U) write s(p)=tk (zero for k=0), wk(p)=Tr⁡(WkρWk†) and σ(p)=WkρWk†/wk(p) on wk>0. Integrating all continuations after s(p) gives prefix-law density wk(p) on Ek(U): indeed the matrix product factors as Wk followed by a record on horizon U−s(p), and step 1.2 shifts every continuation time by −s(p) without changing its base measure. Step 3.1 then normalizes that continuation for every positive-weight state. Precisely, for every Borel B⊆Ek(U), PU(Pk∈B)=∫Bwk(p) dμk(p). Zero-weight prefixes have zero mass; on them the matrix vanishes and all continuation weights vanish. This argument uses prefix densities, not probabilities of individual continuous prefixes.

5.1F1F2F3F5F6F10step 1.1step 4.2construct

For p∈Ek(U) with wk(p)>0, put h(p)=U−s(p) and define the candidate next-outcome kernel by Ck(p,A)=∑a∈M∫0h(p)1A((u,a))fσ(p),a(u) du+1A(†)sσ(p)(h(p)). Here fσ,a and sσ are the marked density and survivor in [F2]. For p=∂ or wk(p)=0 set Ck(p,⋅)=δ†. Every section is a probability measure: it is the [F2] waiting law with waiting times at or beyond h(p), including the infinite no-event outcome, sent to †; a finite endpoint has zero waiting-law mass. For each measurable A⊆D, its evaluation is Borel in p. Indeed wk is continuous on each mark component, the positive-weight set is open, and σ(p) is continuous there. The integrand on the fixed interval (0,U), multiplied by 1{u<h(p)}, is nonnegative and product-measurable, so its parameter integral is measurable by [F3]. The prefix base measure μk and interval Lebesgue measure are finite, as required there; the singleton case k=0 is immediate. The survivor term is continuous on each positive-weight component, and the complementary assignment is constant on a Borel set. Thus Ck is a probability kernel as required in [F10].

6.1F1F2F3F10step 1.2step 3.1step 4.1step 4.2step 5.1algebra∎

For any measurable A⊆D and Borel B⊆Ek(U), separating the next waiting time and mark from its later continuation gives PU(Pk∈B,Yk∈A)=∫Bwk(p)Ck(p,A) dμk(p). To see this directly, the branch with no further event has density wk(p)sσ(p)(U−s(p)) and outcome †. A next event (u,a) with 0<u<U−s(p) has density wk(p)fσ(p),a(u) after all later records have been integrated out by step 3.1 from the post-event state in [F2]. At zero next-event density its entire contribution is zero. Tonelli permits these nonnegative sums and iterated integrals; step 1.2 justifies the translation from the next absolute time v to u=v−s(p) and the shifts of later continuation times, for each fixed prefix, preserving the relevant Lebesgue integrals. Step 4.2 then identifies the displayed right side with ∫Pk−1(B)Ck(Pk(ω),A) dPU. On {Pk=∂} one has Yk=† and Ck=δ†, so the same identity holds for every measurable B⊆Pk. By [F10] this is exactly the conditional-law identity for Yk given Pk. It establishes each successive censored waiting law, including k=0 and the empty mark family, without invoking a general conditional-distribution existence theorem or selecting versions. Together with the process and tail arguments above, this proves all assertions.

Source notes

Plenio–Knight, Section IV.C, Eqs. (122), (124)–(128), is retained as contextual bibliography for the no-jump/jump split. No general existence theorem is imported from it. This item supplies its own finite-matrix and measure-construction arguments from the declared mathematical suppliers.

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