Alphabeta Math
Physics theoremStatement: AI-adaptedProof: AI-generatedPipeline-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 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.

Depends on

Dependency tree · 2 levels

Sources