Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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 GKSL jump-trajectory branches

Definition

Let d≥1, let r≥0 be an integer, let H=H∗∈Md(C) have units joules, let ℏ>0 have units joule-seconds, and let L1,…,Lr∈Md(C) have units s−1/2, with the finite GKSL convention of Finite GKSL generators and units. Put K=−iH/ℏ−12∑a=1rLa∗La and R(u)=euK for u≥0, with the exponential defined by its norm-convergent power series. For a density matrix ρ∈Md(C), meaning ρ=ρ∗≥0 and Tr⁡ρ=1, define the no-jump branch at time t≥0 by W∅,∅(t)=R(t) and its branch state by W∅,∅(t)ρW∅,∅(t)∗.

All time variables u,t,s1,…,sn are measured in seconds. For n≥1, a jump-history label is a=(a1,…,an)∈{1,…,r}n and its jump times are seconds 0<s1<⋯<sn<t. Define the corresponding branch operator by Wa,s(t)=R(t−sn)LanR(sn−sn−1)⋯La2R(s2−s1)La1R(s1) and the unnormalized branch state by Wa,s(t)ρWa,s(t)∗. Its branch-weight density is the real-valued scalar function wa,s(t)=Tr⁡(Wa,s(t)ρWa,s(t)∗). For n≥1, let Δ‾n(t)={(s1,…,sn)∈Rn:0≤s1≤⋯≤sn≤t} and Δn(t)={(s1,…,sn)∈Rn:0<s1<⋯<sn<t}. Use the same formula for Wa,s(t) on Δ‾n(t); it is continuous there because R(u)=euK is continuous for u≥0. If V is a finite-dimensional real or complex vector space and F:Δ‾n(t)→V has continuous coordinates in a basis, define ∫Δn(t)F(s) ds as exactly the repeated one-variable Riemann integral over the closed limits shown here ∫0tdsn∫0sndsn−1⋯∫0s2F(s1,…,sn) ds1, integrating each real coordinate; for complex coordinates, integrate their real and imaginary parts separately. This value is independent of the basis because a change of basis is a finite linear combination and scalar Riemann integration is linear. For V=R this defines the scalar integral of the density wa,s(t); the same convention applies to branch-state integrands with values in Md(C) and to integrands with values in the finite-dimensional complex vector space of complex-linear maps Md(C)→Md(C). The full recursion is well-defined for these arbitrary continuous integrands by Continuous finite-dimensional ordered-simplex integrals: every inner integral is continuous in all remaining ordered parameters, so the next integral exists. That lemma also proves basis independence, linear-map commutation, the norm bound by the supremum times tn/n!, and positivity for nonnegative real scalar integrands. Set ∫aaf(s) ds=0 for a degenerate interval; hence every n≥1 ordered-simplex integral at t=0 is zero. Let Δ0(t)={()} and define ∫Δ0(t)F=F(()); in the expansion, the n=0 contribution is the no-jump branch already defined above. For n≥1, Wa,s has units s−n/2 and wa,s has units s−n; integrating over the n time variables gives a dimensionless weight. If r=0, there are no branches with n≥1. This definition alone does not assert that the branch weights sum to one.

Remarks

The definition supplies formal finite jump labels, times, branch operators, and branch weights. The ensemble identity and normalization are proved separately; a branch is not asserted to be a detector record.

Depends on

Dependency tree · 2 levels

Sources