Alphabeta Math
Pipeline-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.

Finite reduced dynamics, memory and quantum trajectories

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite channel families, semigroups, and CP-divisibility

Definition

Let d≥1 and let Φt:Md(C)→Md(C) be a family of finite quantum channels indexed by t≥0, where “finite quantum channel” has the meaning in Finite completely positive trace-preserving maps. The family obeys the semigroup law when Φ0=id⁡Md(C) and Φt+s=Φt∘Φs for every s,t≥0.

The family is CP-divisible when for every 0≤s≤t there exists a finite quantum channel Vt,s:Md(C)→Md(C) such that Φt=Vt,s∘Φs. CP-divisibility is this specified factorization property; the definition does not assert that it is a universal meaning of “Markovian”.

Remarks

The source literature distinguishes divisibility and time-homogeneous semigroup conditions and discusses several meanings of quantum Markovianity. This item fixes only the map properties used on this page.

LemmaStatement: AI-adaptedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Continuous finite-dimensional ordered-simplex integrals

Statement

Let T≥0, let n≥0 be an integer, and let V be a finite-dimensional real or complex vector space with a specified finite ordered basis and its coordinate topology. Put Dn(T)={0≤s1≤⋯≤sn≤T}, with D0(T)={()}. Let F:Dn(T)→V have continuous coordinates. Set G0=F. For 1≤k≤n, write y=(sk+1,…,sn)∈Dn−k(T) and put bk(y)=sk+1 if k<n, and bn(())=T. Define recursively

Gk(y)=∫0bk(y)Gk−1(sk,y) dsk,

integrating real coordinates, and real and imaginary parts of complex coordinates. Every integral exists and every Gk is continuous on its remaining parameter domain. Write In(F)=Gn(()); equivalently this is the iterated integral with limits 0≤s1≤⋯≤sn≤T. Degenerate one-variable integrals are zero. For n=0, set I0(F)=F(()); for n≥1 and T=0, In(F)=0.

These integrals are linear, independent of the chosen finite basis, and commute with finite-dimensional linear maps. For any norm ∥⋅∥ on V, the corresponding one-variable integral satisfies ∥∫abg(s) ds∥≤∫ab∥g(s)∥ ds for continuous g and a≤b. If ∥F(s)∥≤C on Dn(T), where C≥0, then

∥In(F)∥≤CTnn!.

Here the factor for n=0 is 1, including T=0. For scalar F=1, In(1)=Tn/n! with this convention. For real scalar F≥0, every partial integral Gk is nonnegative. No differentiability of F or choice principle is assumed.

Facts & Assumptions

Given: T,n,V,F and the ordered-coordinate domains in the Statement. A norm on V is needed only for its norm estimates.

[F3]

If f is continuous on a nondegenerate interval containing the image of a differentiable map ϕ with integrable derivative, affine substitution gives ∫f(ϕ(u))ϕ′(u) du=∫ϕ(0)ϕ(1)f(v) dv (Substitution: if φ is differentiable on [c,d] with φ′ integrable and f is continuous on an interval containing φ([c,d]), then ∫φ(c)φ(d)f=∫cd(f∘φ) φ′).

Proof

1.1givenF1F2algebra

First consider a continuous curve g:[a,b]→V. In a real basis e1,…,eq, its coordinate functions are integrable by [F1], and define its integral by their integrals. For a complex basis use the underlying real basis e1,ie1,…,eq,ieq; this is exactly the real-and-imaginary convention. The zero-dimensional space is immediate. In either case the triangle inequality gives ∥∑jcjej∥≤∑j∣cj∣∥ej∥. Thus coordinate convergence implies convergence in any chosen norm, without assuming norm equivalence. By [F2], tagged sums of g converge in that norm to its coordinate integral. The reverse triangle inequality and the same finite-coordinate bound show that s↦∥g(s)∥ is continuous, so it too is integrable. For each tagged partition, the norm of the vector sum is at most the corresponding sum of the scalar norms. Taking limits by [F2] proves ∥∫abg∥≤∫ab∥g∥ when a<b; for a=b both integrals are zero. A coordinate change or a linear map has entries given by a finite matrix, so scalar linearity [F2] proves that integration commutes with it, and hence proves basis independence. This also proves linearity, and [F2] proves that a nonnegative real curve has nonnegative integral. All statements concern finite lists of coordinates, and require only finitely many simultaneous estimates.

2.1givenF1F4step 1.1construct

Suppose Gk−1 is continuous on Dn−k+1(T), as is true initially for G0=F. For each y∈Dn−k(T), the curve v↦Gk−1(v,y) is continuous for 0≤v≤bk(y) and is integrable by step 1.1. Set b=bk and

H(u,y)=Gk−1(ub(y),y),0≤u≤1.

The evaluation map (u,y)↦(ub(y),y) is continuous and lands in Dn−k+1(T), because 0≤ub(y)≤b(y) and the coordinates of y are ordered. Thus H is coordinate-continuous. The parameter domain [0,1]×Dn−k(T) is closed and bounded in a finite-dimensional Euclidean space, hence compact by [F4]; when there are no remaining coordinates it is just [0,1]. The finite-coordinate inequality of step 1.1 shows that H is also continuous into any chosen norm on V. Apply [F4] with the Euclidean metric on the parameter domain and that norm metric on V. Uniform continuity gives, as y→y0 within its parameter domain,

sup⁡0≤u≤1∥H(u,y)−H(u,y0)∥⟶0.

Indeed the Euclidean distance from (u,y) to (u,y0) is ∣y−y0∣, independently of u. This conclusion also holds coordinate by coordinate if no norm was initially specified, by using the explicitly defined coordinate norm ∑j∣cj∣.

3.1givenF1F2F3step 1.1step 2.1algebra

If b(y)>0, apply [F3] in each real coordinate with ϕ(u)=ub(y) and f(v)=Gk−1(v,y) on [0,b(y)]. All its scalar continuity and differentiability hypotheses hold, and ϕ′ is constant and integrable. This gives

Gk(y)=b(y)∫01H(u,y) du.

If b(y)=0, both sides are zero by [F1], so the same identity holds. By linearity and step 1.1, for any fixed y0 its difference at y satisfies

∥Gk(y)−Gk(y0)∥≤Tsup⁡0≤u≤1∥H(u,y)−H(u,y0)∥+∣b(y)−b(y0)∣∥∫01H(u,y0) du∥.

The first term tends to zero by step 2.1 and the second by continuity of b. Thus Gk is continuous, including at parameters with b=0. If there are no remaining coordinates this is continuity on a singleton. Induction proves existence and continuity at every recursive stage. When T=0 and n≥1, already the first integration has equal endpoints, so all later integrals are zero; the specified n=0 value needs no integration.

4.1F1F2step 1.1step 3.1algebra

Apply the linearity, linear-map commutation and basis independence of step 1.1 successively at each stage. Every resulting coordinate curve is continuous by step 3.1, so these operations are legitimate at every stage and prove the corresponding claims for In. Likewise a nonnegative real F has nonnegative G1, then nonnegative G2, and so on by scalar monotonicity. No exchange of integration order or assertion of differentiability is involved.

5.1givenF1F2F5step 1.1step 3.1algebra∎

Suppose ∥F∥≤C. At the first stage step 1.1 and scalar monotonicity give ∥G1(y)∥≤Cb1(y). If k≥2 and the previous bound is ∥Gk−1(sk,y)∥≤Cskk−1/(k−1)!, the same integral inequality bounds ∥Gk(y)∥ by ∫0bk(y)Cvk−1/(k−1)! dv=Cbk(y)k/k!. The monomial primitive and integral evaluation follow from [F1] and [F5] when the endpoint is positive; equal endpoints give the same value zero. Induction gives the stated final bound. For scalar F=1 the same recursion is an equality at every stage, yielding In(1)=Tn/n!. For n=0 both assertions follow directly from I0(F)=F(()) and the factor convention.

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

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.

PostulateStatement: AI-adaptedProof: Not applicable‡ sources checked 2026-10-22Open item page →

Finite system-environment and Markov model assignments

Physical scope

A finite-dimensional non-relativistic quantum system and finite environment with a fixed product initial assignment and a declared joint unitary family. A time-homogeneous finite GKSL model is an optional, separately adopted approximation. No initial system-environment correlations, continuum reservoir limit, microscopic Markov derivation, apparatus realization, or experimental observation is asserted.

Postulate

Work with finite-dimensional system and environment spaces HS=Cd and HE=Cm, where d,m≥1, using the ordered tensor product HS⊗HE with the system factor first. A system or environment state is a positive semidefinite Hermitian matrix of trace one; these state matrices are dimensionless. At the initial time, for every allowed system state ρ, adopt the joint preparation ρ⊗η, where the fixed environment state η does not depend on ρ. For each t≥0, choose a declared unitary Ut on HS⊗HE, meaning Ut∗Ut=UtUt∗=I, with U0=I. The reduced system dynamics is the map Φt(ρ)=Tr⁡E ⁣(Ut(ρ⊗η)Ut∗), where for the fixed product basis the finite partial trace has entries (Tr⁡ER)αβ=∑j=1mR(α,j),(β,j). This assignment excludes initially correlated joint states. It imposes no one-parameter group, continuity, or semigroup law on Ut.

A time-homogeneous finite GKSL model may instead be selected as a separate approximation: choose a fixed finite-dimensional Hamiltonian matrix H=H∗ in joules, a constant ℏ>0 in joule-seconds, and finitely many jump matrices La in s−1/2, and use Tt=etL for t≥0 with L(X)=−iℏ[H,X]+∑a(LaXLa∗−12{La∗La,X}). Here L:Md(C)→Md(C) is complex-linear, [A,B]=AB−BA, {A,B}=AB+BA, and A∗ is conjugate transpose. The exponential means etL:=∑n=0∞tnLn/n!, with L0=id⁡ and powers given by composition. This series converges absolutely in the operator norm induced by the finite matrix trace norm ∥X∥1=Tr⁡X∗X, as in the finite GKSL semigroup theorem cited below; its hypotheses are exactly the finite Hermitian H, positive ℏ, and finite jump family specified here. Each application must state its rates and physical regime. Selecting this approximation is not a consequence of the finite unitary reduction, and this postulate claims no weak-coupling or reservoir limit.

In both alternatives, the parameter t indexing Ut or Tt denotes elapsed physical time measured in SI seconds. Thus tL in the GKSL exponential is dimensionless, since the adopted finite GKSL generator has units s−1.

Remarks

The diagram records only the defined finite-map composition. It supplies no proof of complete positivity or trace preservation.

diagram failed to render:
\rho \arrow[r, "{X\mapsto X\otimes\eta}"] \arrow[drr, "\Phi_t"'] &
\rho\otimes\eta \arrow[r, "{R\mapsto U_t R U_t^*}"] &
U_t(\rho\otimes\eta)U_t^* \arrow[d, "\operatorname{Tr}_E"] \\
& & \Phi_t(\rho)
Physics theoremStatement: AI-adaptedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Product-state reduced evolution is a channel

Physical scope

Exact reduced maps of finite-dimensional system and environment models with a fixed product initial assignment and unitary joint evolution. The theorem permits neither an initial-correlation extension nor a continuum bath or Markov limit; its finite example is a conditional model calculation, not an experiment.

Statement

In the finite product-state model, fix any t≥0 and define the complex-linear map Φt:Md(C)→Md(C) by Φt(X)=Tr⁡E ⁣(Ut(X⊗η)Ut∗). Then Φt is a finite quantum channel. The family t↦Φt need not obey the semigroup law and need not be CP-divisible. The terms “semigroup law” and “CP-divisible” have the definitions of Finite channel families, semigroups, and CP-divisibility.

Facts & Assumptions

Given: Integers d,m≥1, time t≥0, system and environment density matrices ρ∈Md(C) and η∈Mm(C), and a unitary Ut on Cd⊗Cm with the system factor first.

[A1]

Finite system-environment and Markov model assignments: η is fixed independently of every allowed input ρ, the joint initial state is ρ⊗η, and the reduced map is Φt(X)=Tr⁡E(Ut(X⊗η)Ut∗); the parameter t indexing Ut is elapsed physical time measured in seconds.

[F1]

Partial trace over a finite tensor factor: in the ordered product basis, (Tr⁡ER)αβ=∑jR(α,j),(β,j).

[F2]

The partial trace is characterized by the trace pairing and is basis-independent: the finite partial trace is characterized by the trace pairing and its coordinate map is independent of the chosen environment orthonormal basis.

[F3]

Finite matrix spectral and state calculus: every finite positive matrix has an orthonormal eigenbasis with nonnegative eigenvalues, and its trace is the sum of its diagonal entries in any orthonormal basis.

[F4]

Finite completely positive trace-preserving maps: a finite channel is a complex-linear map that is completely positive on every finite ancilla extension and trace-preserving on every matrix input.

[F5]

Complete finite Choi-Kraus equivalence: a finite map of Kraus form Ψ(X)=∑aKaXKa∗ is completely positive, and it is trace-preserving exactly when ∑aKa∗Ka=I.

[F6]

Finite channel families, semigroups, and CP-divisibility: CP-divisibility requires a finite channel Vt,s for every s≤t with Φt=Vt,s∘Φs; the semigroup law requires Φt+s=Φt∘Φs and Φ0=id⁡.

[F7]

The complex exponential by its power series: exp⁡z=∑n=0∞zn/n! and exp⁡0=1.

[F8]
[F9]

exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0: for real θ, exp⁡(iθ)=cos⁡θ+isin⁡θ and ∣exp⁡(iθ)∣=1.

[F10]

t↦(cos⁡t,sin⁡t) is a bijection from [0,2π) onto the real unit circle: there exists θ∈[0,2π) with (cos⁡θ,sin⁡θ)=(0,1).

Proof

technique · finite Kraus construction followed by an explicit two-qubit counterexample
1.1givenA1F1F2F3constructalgebra

By [F3], choose an orthonormal environment eigenbasis (∣k⟩)k=1m with η=∑k=1mpk∣k⟩⟨k∣, pk≥0, and ∑kpk=1. Use the fixed system basis from the model and its ordered product with this environment basis. By [F2], changing the environment basis does not change the partial-trace map in [F1]. For environment indices j,k define the system matrix Kjk by (Kjk)αβ:=pk(Ut)(α,j),(β,k). Expanding X⊗η, conjugating by Ut, and applying the coordinate formula [F1] gives, entry by entry, Φt(X)=∑j,k=1mKjkXKjk∗ for every X∈Md(C).

1.2givenA1F1F7F9constructalgebra

For a two-qubit instance take Z=diag⁡(1,−1), g>0 in s−1, Htot=ℏg Z⊗Z with ℏ in joule-seconds, and η=∣+⟩⟨+∣ where ∣+⟩=(∣0⟩+∣1⟩)/2 in the chosen environment Z eigenbasis. Put A=Z⊗Z and Pb=(I+bA)/2 for b=±1; direct multiplication gives PbPb′=δbb′Pb, P++P−=I, and A=∑b=±1bPb. Define the matrix exponential for this instance by the power series Ut:=∑n=0∞(−igt)nAn/n!. Since An=∑bbnPb, the series converges entrywise by the scalar exponential definition [F7] and equals ∑be−ibgtPb=e−itHtot/ℏ. In the ordered environment Z eigenbasis this is ∑b=±1Vb(t)⊗∣b⟩⟨b∣, where Vb(t)=diag⁡(e−ibgt,eibgt). By [F9], each scalar phase has modulus one, so Ut is unitary and U0=I. The partial trace in [F1] therefore gives Φt(X)=12(V+1(t)XV+1(t)∗+V−1(t)XV−1(t)∗), so for X=(azwc) the diagonal entries are unchanged and the off-diagonal entries are multiplied by κ(t)=12(e−2igt+e2igt)=cos⁡(2gt).

1.3F7F8F9F10algebra

By [F10], choose θ∈[0,2π) with cos⁡θ=0 and sin⁡θ=1; hence θ>0. Set s=θ/(2g)>0. Euler's identity [F9] gives eiθ=i, and [F7]–[F8] give e−iθ=(eiθ)−1=−i. Applying [F8] again yields κ(s)=0 and κ(2s)=12(e−2iθ+e2iθ)=−1.

2.1givenF4F5step 1.1algebra

For system basis indices β,δ, unitarity of Ut gives (∑j,kKjk∗Kjk)βδ=∑k=1mpk∑j=1m∑α=1d(Ut)(α,j),(β,k)‾(Ut)(α,j),(δ,k)=∑kpkδβδ=δβδ. Thus ∑j,kKjk∗Kjk=Id, so [F5] makes the Kraus map in step 1.1 completely positive and trace-preserving; by [F4], Φt is a finite channel.

3.1F3F6step 1.2step 1.3step 2.1algebra∎

Let X ⁣P=(0110) and ρ±=(I±X ⁣P)/2. Since X ⁣P=X ⁣P∗ and X ⁣P2=I, each ρ± is a projection; since Tr⁡X ⁣P=0, each has trace one. Steps 1.2 and 1.3 give Φs(ρ+)=Φs(ρ−)=I/2, while Φ2s(ρ+)=ρ− and Φ2s(ρ−)=ρ+. Consequently Φ2s(ρ+)≠Φs(Φs(ρ+))=I/2, so the semigroup law in [F6] fails. If a channel V2s,s satisfied Φ2s=V2s,s∘Φs, it would send the equal matrices Φs(ρ+) and Φs(ρ−) to equal outputs, contradicting the two distinct outputs at 2s. By step 2.1, the family consists of channels, so this contradiction proves it is not CP-divisible by [F6].

Remarks

The two-qubit recurrence is a conditional prediction of a finite unitary model. It is not a reported observation and does not establish a physical Markov limit.

Physics theoremStatement: AI-adaptedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Amplitude damping with operational time units

Physical scope

The exact finite-dimensional qubit time-homogeneous GKSL model with one amplitude-damping jump operator. The formulas are conditional model predictions; no vacuum continuum, reservoir limit, detector record, or empirical decay rate is asserted.

Statement

For the separately selected qubit GKSL model, let H=ℏω∣1⟩⟨1∣ with ω∈R in s−1 and ℏ>0 in joule-seconds, and let L=γ∣0⟩⟨1∣ with γ≥0 in s−1, so L has units s−1/2. For any initial density matrix ρ(0) in the ordered basis (∣0⟩,∣1⟩), the solution ρ(t)=etLρ(0) for t≥0 satisfies ρ11(t)=e−γtρ11(0), ρ00(t)=ρ00(0)+(1−e−γt)ρ11(0), ρ01(t)=e(iω−γ/2)tρ01(0), and ρ10(t)=e(−iω−γ/2)tρ10(0).

Facts & Assumptions

Given: The selected finite GKSL model, ω∈R, γ≥0, and a qubit density matrix ρ(0).

[A1]

Finite system-environment and Markov model assignments: the time-homogeneous finite GKSL equation is a separately adopted approximation, not inferred from the finite system-environment reduction; its time parameter t is elapsed physical time measured in seconds, so tL is dimensionless.

[F1]

Finite GKSL generators and units: L(X)=−iℏ[H,X]+LXL∗−12{L∗L,X} for the single-jump case.

[F2]

Every finite-dimensional normed space is Banach and The exponential series of a bounded operator: the finite matrix space is complete and the bounded-operator exponential is its norm-convergent power series.

[F3]

The complex exponential by its power series: exp⁡z=∑n=0∞zn/n! for z∈C.

[F4]

Finite matrix trace-norm ideal inequalities: ∥AXB∥1≤∥A∥ ∥X∥1 ∥B∥ for finite matrices.

[F5]

Finite GKSL generates CPTP semigroups: etL is a finite channel for every t≥0.

[F6]

Finite completely positive trace-preserving maps: a finite channel is completely positive and trace-preserving on all matrix inputs.

[F7]

exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential: on real arguments, the complex exponential agrees with the real exponential ex.

Proof

technique · compute powers of the finite GKSL generator on the four matrix units, then sum its defining exponential series
1.1givenA1F1algebra

Write Ejk=∣j⟩⟨k∣, j,k∈{0,1}, so I=E00+E11. In this basis, H=diag⁡(0,ℏω), L=γE01, and L∗L=γE11. Direct multiplication in [F1] gives L(E00)=0, L(E11)=γ(E00−E11), L(E01)=(iω−γ/2)E01, and L(E10)=(−iω−γ/2)E10.

2.1F1F2F3F4F7step 1.1algebra

The matrix space is finite-dimensional and complete by [F2]. The trace-ideal estimate [F4] applied to the finitely many left and right multiplications in [F1] bounds ∥L(X)∥1 by a finite constant times ∥X∥1, so L is bounded; [F2] therefore gives etL=∑n≥0tnLn/n!. Put D=E00−E11. Step 1.1 gives L(D)=−γD and L(E11)=γD; induction therefore gives Ln(E11)=γ(−γ)n−1D for n≥1. Summing this scalar series using [F3] and the real-extension clause [F7] yields etL(E11)=E11+(1−e−γt)D, including γ=0 because both the added coefficient and every positive power term then vanish. Also step 1.1 gives Ln(E00)=0 for n≥1, while the two coherence matrix units are eigenvectors, so [F3] gives etL(E01)=e(iω−γ/2)tE01 and etL(E10)=e(−iω−γ/2)tE10. Applying these four identities linearly to ρ(0)=∑j,kρjk(0)Ejk gives all four formulas in the Statement.

3.1A1F5F6step 2.1∎

By [F5] and [F6], the full evolution map is completely positive and trace-preserving for t≥0, so it carries each initial density matrix to a density matrix. These formulas are deductions within the selected approximation and assert no microscopic bath limit.

Remarks

The parameter γ is a model rate. Its numerical value and the regime in which this generator approximates a physical system must be supplied by a specific application; no measurement or statistical estimate is asserted here.

Physics theoremStatement: AI-adaptedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite jump expansion and ensemble equation

Physical scope

The exact finite-dimensional time-homogeneous GKSL approximation with finitely many bounded jump matrices. The jump expansion is one mathematical ensemble representation; it is not asserted to be unique, to identify an actual measurement record, or to arise from a microscopic reservoir.

Statement

Let d≥1, let H=H∗∈Md(C) have units joules, let ℏ>0 have units joule-seconds, and let L1,…,Lr∈Md(C) be a finite family with units s−1/2, where r≥0. For the selected time-homogeneous finite GKSL model, put L(X)=−iℏ[H,X]+∑a=1r(LaXLa∗−12{La∗La,X}). With K=−iH/ℏ−12∑aLa∗La and the finite branch operators of Finite GKSL jump-trajectory branches, each no-jump operator R(u)=euK is a contraction, each branch state Wa,s(t)ρWa,s(t)∗ is positive for ρ≥0, and for every density matrix ρ and t≥0,

etL(ρ)=∑n=0∞ ∑a∈{1,…,r}n ∫0<s1<⋯<sn<tWa,s(t)ρWa,s(t)∗ ds1⋯dsn,

where the n=0 term is R(t)ρR(t)∗ and branches with n≥1 are absent when r=0. The series converges in trace norm, uniformly on each bounded time interval; the sum of all branch weights is one. This is an ensemble representation of the finite GKSL solution, not a unique microscopic trajectory or a claim about a particular detector.

Facts & Assumptions

Given: Finite dimension d≥1, finite r≥0, H=H∗, ℏ>0, jump matrices La, a density matrix ρ, and t≥0.

[A1]

Finite system-environment and Markov model assignments: the time-homogeneous finite GKSL family is a separately selected approximation within the open-system model; it is not derived from the exact finite unitary reduction, and its time parameter t is elapsed physical time measured in seconds.

[F1]

Finite GKSL generators and units: L(X)=−iℏ[H,X]+∑a(LaXLa∗−12{La∗La,X}).

[F2]

Finite GKSL jump-trajectory branches: K=−iH/ℏ−12∑aLa∗La, R(u)=euK, and Wa,s(t) is the ordered product of no-jump factors and jump matrices; the branch state is WρW∗ and its weight density is the real scalar w=Tr⁡(WρW∗). For n≥1, continuous functions on the ordered simplex with values in Md(C) or in the finite-dimensional complex vector space of complex-linear maps Md(C)→Md(C) are integrated by repeated componentwise Riemann integration, splitting complex coordinates into real and imaginary parts; the value is basis-independent. A degenerate interval has integral zero, so the n≥1 simplex at t=0 contributes zero. The n=0 contribution is the no-jump branch.

[F3]

Every finite-dimensional normed space is Banach: every finite-dimensional normed matrix space is complete.

[F4]

The exponential series of a bounded operator: for a bounded operator A on a Banach space, euA is norm-continuous, differentiable with derivative AeuA, and satisfies ∥euA∥≤e∣u∣∥A∥.

[F5]

Finite matrix trace-norm ideal inequalities: the finite matrix trace norm is complete, satisfies ∥AXB∥1≤∥A∥ ∥X∥1 ∥B∥, and ∣Tr⁡X∣≤∥X∥1.

[F6]

Finite GKSL generates CPTP semigroups: etL is a trace-preserving finite channel for t≥0.

[F7]

The operator norm as the least bound and as the unit-sphere or unit-ball supremum: for a bounded linear map between normed spaces, its operator norm is the supremum of the output norm over the input unit ball; here ∥A∥1→1:=sup⁡∥X∥1≤1∥A(X)∥1.

[F9]

Newton–Leibniz needs only continuity on [a,b], differentiability on (a,b), and a Riemann-integrable extension of the interior derivative: if a real function is continuous on a closed interval, differentiable in its interior, and its derivative has a Riemann-integrable extension, the integral of that extension is the endpoint increment.

[F11]

Continuous finite-dimensional ordered-simplex integrals: every continuous finite-dimensional integrand on the closed ordered simplex has the recursive componentwise Riemann integrals in [F2], with every partial integral continuous in the remaining parameters. These integrals commute with linear maps and finite sums, preserve nonnegativity for real scalar integrands, and have norm at most the supremum norm of the integrand times tn/n!, including the stated zero-variable and zero-time conventions.

Proof

technique · split the bounded generator into no-jump and jump parts, iterate variation of constants, and control the remainder by a factorial bound
1.1givenA1F1F2F3F4F8F9algebra

Under [A1], put D=∑aLa∗La and K=−iH/ℏ−D/2. Then K+K∗=−D. The matrix space is complete by [F3], so [F4] differentiates R(u)=euK. For every vector v, ddu∥R(u)v∥2=⟨(K+K∗)R(u)v,R(u)v⟩=−∑a∥LaR(u)v∥2≤0. Since R(0)=I, the continuous derivative is integrable by [F8], and [F9] gives ∥R(u)v∥≤∥v∥ for u≥0, hence R(u) is a contraction.

1.2F1F2F4F5F8F9F11algebra

On Md(C) define N(X)=KX+XK∗, J(X)=∑aLaXLa∗, and Tu=euL. By [F5], these finite sums of left and right matrix multiplications are bounded in trace norm. Expanding [F1] gives L=N+J. Fix t>0. Integrate finite-dimensional matrix and superoperator entries by their real and imaginary components, using the repeated Riemann convention in [F2]. The curve s↦e(t−s)NTs has continuously differentiable entries by [F4]; its real and imaginary derivative components are continuous and hence integrable by [F8]. Differentiation gives dds(e(t−s)NTs)=e(t−s)NJTs, since L=N+J. Applying [F9] entrywise yields Tt=etN+∫0te(t−s)NJTs ds. This finite identity follows by induction on N: the base case is the displayed variation-of-constants identity, and substituting that identity for the final Ts1 in the remainder adds the next ordered-simplex term and a remainder with one more innermost time. Only finite linearity of the nested integrals is used; no integration order is exchanged. Thus, for each N≥0, Tt=∑n=0NSn(t)+QN+1(t), where S0(t)=etN, Sn(t)=∫0<s1<⋯<sn<te(t−sn)NJe(sn−sn−1)N⋯Jes1N ds for n≥1, and Qm(t)=∫0<s1<⋯<sm<te(t−sm)NJ(∏j=m−1,…,1e(sj+1−sj)NJ)Ts1 ds for m=N+1, where the product is ordered from left to right with descending j, and the empty product is the identity. For m=1 the intermediate exponential factors are absent: Q1(t)=∫0te(t−s1)NJTs1 ds1, exactly the displayed variation-of-constants remainder. In particular there is no extra es1N before Ts1. All these integrands are continuous in finite-dimensional coordinates on the closed ordered simplex; [F11] proves that every inner integral is continuous in its remaining parameters and hence the full repeated integral exists. The insertion of one further nested integral in the induction is therefore legitimate.

2.1F2F3F4step 1.2algebra

Left multiplication by K and right multiplication by K∗ commute; multiplying their absolutely norm-convergent exponential series and grouping by total degree with the binomial formula yields euN(X)=euKXeuK∗=R(u)XR(u)∗. This establishes the no-jump superoperator formula used in the norm estimates below.

3.1F2F4F5F7F8F9F10F11step 1.1step 1.2step 2.1algebra

From [F5] and [F7], ∥J(X)∥1≤(∑a∥La∥2)∥X∥1 and ∥N(X)∥1≤2∥K∥∥X∥1, so the induced 1→1 norms are finite. By step 2.1 and the contraction in step 1.1, [F5] gives ∥euN∥1→1≤1 for u≥0. The ordered-simplex volume is tn/n!: the zero-variable volume is 1; if the n-variable volume is sn/n!, then [F10] gives the primitive sn+1/(n+1)!, and [F8] makes the integrand Riemann integrable, so [F9] evaluates the next repeated integral as tn+1/(n+1)!. Induction proves the volume formula. The continuous-integrand norm bound in [F11], applied in the finite-dimensional superoperator space with norm ∥⋅∥1→1, now bounds each integral by that volume times its pointwise norm bound. Thus ∥Sn(t)∥1→1≤(t∥J∥1→1)n/n!. By [F4], ∥Ts∥1→1≤es∥L∥1→1, so ∥QN+1(t)∥1→1≤et∥L∥1→1(t∥J∥1→1)N+1/(N+1)!→0. Replacing t by any bound T gives summable bounds for all 0≤t≤T and a remainder tending uniformly to zero. Thus the series ∑nSn(t) converges in induced trace norm to Tt, uniformly on bounded time intervals.

4.1F2F4F5F6F8F11step 1.2step 2.1step 3.1∎

If t=0, then T0=id⁡ and R(0)=I; all positive-jump simplexes are empty, and the sole branch has weight Tr⁡ρ=1. For t>0, applying the operator identity from step 3.1 to ρ and expanding each occurrence of J in Sn(t) sums over labels a1,…,an. Step 2.1 turns each factor euN into the no-jump conjugation, so each integrand is Wa,s(t)ρWa,s(t)∗ by [F2]. This matrix is positive since ⟨WρW∗v,v⟩=⟨ρW∗v,W∗v⟩≥0 for every vector v; this argument uses only ρ≥0, proving branch positivity for all positive inputs. All label sums at fixed n are finite, and [F11] allows moving those sums and the finite-dimensional linear trace through the nested integrals. Trace-norm convergence from step 3.1 and the trace bound in [F5] then allow taking the trace of the infinite series. Each integrated branch weight is nonnegative: its continuous real trace integrand is pointwise nonnegative, and [F11] preserves this at every successive integration. For each vector v, the finite-dimensional linear functional X↦⟨Xv,v⟩ likewise commutes with these integrals by [F11]; its nonnegative integrand proves that every integrated branch state is positive. This positivity and convergence argument has not assumed the complete positivity of the final ensemble map. By [F6], Tr⁡(etLρ)=Tr⁡ρ=1, so the nonnegative integrated branch weights sum to one. If r=0, then J=0, all Sn with n≥1 vanish, and only the no-jump term remains.

Remarks

The derivation establishes a representation of the chosen finite GKSL equation. It does not identify the branches with unique physical paths, a unique unravelling, or observed detector events.

5 · Examples, experiments and counterexamples

None yet.

Sources