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.

Finite no-jump and ordered-jump expansion

Statement

Take the finite-dimensional GKSL data d,H,L1,…,Lm and channel Nt=etL from the finite GKSL interface, with t≥0. The matrix spectral norm means ∥X∥=sup⁡∥v∥2≤1∥Xv∥2 on Cd, where ∥v∥2=(∑i∣vi∣2)1/2; map norms are induced by this matrix norm. Put G=−iH−12∑aLa†La and E(u)=euG. For n≥1, indices a1,…,an∈{1,…,m} and ordered times 0≤s1≤⋯≤sn≤t, define Ka1⋯an(s1,…,sn)=E(t−sn)LanE(sn−sn−1)⋯La1E(s1); for n=0 put K∅=E(t). All matrix-valued integrals are taken entrywise. For n≥2, the ordered-integral notation means the nested one-dimensional Riemann integral

∫0≤s1≤⋯≤sn≤tf(s) ds1⋯dsn:=∫0t∫0sn⋯∫0s2f(s1,…,sn) ds1⋯dsn.

For n=1 it means ∫0tf(s1) ds1. Then

Nt(X)=E(t)XE(t)†+∑n=1∞∑a1,…,an∫0≤s1≤⋯≤sn≤tKa1⋯an(s)XKa1⋯an(s)† ds1⋯dsn.

The series converges absolutely in the operator norm induced by the matrix spectral norm. Thus E(t) is the no-jump amplitude and E(t−s)LaE(s) is the single-jump amplitude at time s; these names describe terms of this mathematical expansion. If g=∥G∥ and j=∑a∥La∥2, the norm of the sum of all terms with at least N jumps is at most e2gt∑n=N∞(jt)n/n! for N≥1.

As t↓0, E(t)=I+tG+O(t2) in matrix norm and Nt(X)=E(t)XE(t)†+t∑aLaXLa†+O(t2)∥X∥ uniformly in X. Consequently the finite amplitudes E(t) and tLa represent the channel through first order, with an O(t2) induced-norm error; they are not asserted to give the exact channel at finite time.

Facts & Assumptions

[F1]

The finite GKSL interface defines L(X)=−i[H,X]+∑a(LaXLa†−{La†La,X}/2) and Nt=etL for finite matrices, Hermitian H, a finite family of La, and t≥0. Finite GKSL evolution and the QEC channel interface

[F2]

On a complex Banach space, a strongly continuous bounded operator family with a continuous norm majorant has a unique solution given by its uniformly convergent iterated Volterra series. Banach-space Volterra and Dyson series with a norm remainder

[F3]

Every finite-dimensional complex normed space is complete. Every finite-dimensional normed space is Banach

[F4]

A bounded operator exponential is norm differentiable, obeys the group law and the bound ∥euA∥≤e∣u∣∥A∥, and has quadratic remainder at zero. The exponential series of a bounded operator

[F5]

On Cd with its Euclidean norm, the matrix operator norm in the statement makes Md(C) a complete normed matrix algebra with ∥AB∥≤∥A∥∥B∥, ∥A†∥=∥A∥, and ∥I∥=1. Finite matrix algebras with the operator norm are C star algebras

[F6]

A continuous curve in a complete normed real space has a norm-Riemann integral, linear in the curve and commuting with bounded real-linear maps; its indefinite integral has derivative equal to the curve. The integral is bounded by interval length times the supremum norm. Complex matrix spaces can be used as real spaces here. Riemann integration of continuous curves in a complete normed space, with the fundamental theorem of calculus and coefficient functionals

Proof

Given: The finite matrices and nonnegative time in the statement. Matrix norms below are spectral norms, and map norms are their induced operator norms.

Goal: Establish the ordered expansion, its tail bound, and the stated short-time approximation.

1.1givenF1F2F3F4F5algebra

Define A(X)=GX+XG† and J(X)=∑aLaXLa†. Direct expansion of [F1] gives L=A+J. By [F5], ∥A∥≤2g and ∥J∥≤j, so L is bounded too. The matrix space is Banach by [F5], while Cd and the finite-dimensional space of matrix-space linear maps with the induced norm are Banach by [F3]. The entry functional obeys ∣Xij∣≤∥X∥: the jth column has Euclidean norm at most ∥X∥ and each entry has modulus at most that column norm. Conversely ∥X∥≤∑i,j∣Xij∣, by the triangle inequality applied to X=∑i,jXijEij and ∥Eij∥=1. These inequalities show that the exponential series in the finite GKSL interface has the same entrywise sum as the spectral-norm exponential here. By [F4], euA(X)=E(u)XE(u)†: for u≥0 both sides solve the same linear differential equation with initial value X, by differentiating the right side and using uniqueness in [F2]. For u<0 apply the same argument to −A and −G. In particular ∥euA∥≤e2∣u∣g by [F4] and [F5].

2.1givenF2F4F6step 1.1algebra

For fixed X set Y(t)=e−tAetLX. Differentiation using [F4] yields Y′(t)=B(t)Y(t), Y(0)=X, where B(t)=e−tAJetA. On every finite interval [0,T], B is norm-continuous and ∥B(t)∥≤je4Tg, so [F2] applies. To obtain the series in map norm as well, apply [F2] on the Banach space of matrix-space linear maps to the coefficient Φ↦B(s)Φ, with initial map the identity; its norm is bounded by je4Tg. The recursion in [F2] nests the earliest time innermost, exactly as in the ordered-integral convention of the statement. By [F6], a fixed bounded linear map commutes with each integral. Thus its iterated integrals, multiplied on the left by etA, have integrand e(t−sn)AJe(sn−sn−1)A⋯Jes1AX on 0≤s1≤⋯≤sn≤t; the exponential group law cancels adjacent factors. Expanding the finite sums in J and using step 1.1 gives exactly the displayed amplitudes and integrals.

3.1F2F6step 1.1step 2.1algebra

The integrals in step 2.1 exist in norm by the Volterra recursion [F2]; moving the fixed linear factors through them and expanding the finite sums uses [F6]. For each matrix entry, the real and imaginary parts of X↦Xij are bounded real-linear functionals by step 1.1, so [F6] identifies these norm integrals with entrywise integrals. The same conclusion holds for the map-valued integrands: apply the bounded evaluation maps Φ↦Φ(X) and then matrix-entry functionals. The inequality ∥∫f∥≤∫∥f∥ follows by the triangle inequality on each Riemann sum and passage to the limits; ∥f∥ is continuous. Finally, the nested integral of the constant 1 is Vn(t)=tn/n!: start with V0(t)=1 and use Vn(t)=∫0tVn−1(u) du and the polynomial antiderivative, by the fundamental theorem in [F6]. This is the ordered integration weight used below.

4.1givenF5step 1.1step 2.1step 3.1algebra

For ordered times the nonnegative propagation intervals sum to t. Therefore each n-jump integrand has induced norm at most e2gt∏k=1n∥Lak∥2. Summing indices gives e2gtjn. Applying the integral norm bound successively and using Vn(t)=tn/n! from step 3.1 gives the factorial factor. Thus the n-jump term has norm at most e2gt(jt)n/n!. The exponential majorant proves absolute induced-norm convergence and the stated tail bound.

5.1givenF4step 1.1step 2.1step 3.1step 4.1algebra∎

By [F4], ∥E(t)−I−tG∥≤t2g2etg/2. For the one-jump term, write its integrand as e(t−s)AJesA; subtracting J and using ∥euA−I∥≤e2ug−1 for u≥0 (from the series in [F4] and ∥A∥≤2g) bounds the difference by j(e2tg−1) for each s∈[0,t]. Hence its integral differs from tJ by at most tj(e2tg−1). Step 4.1 bounds all terms with at least two jumps by e2gt(jt)2ejt/2. Both bounds are O(t2) as t↓0, and tJ(X)=∑a(tLa)X(tLa)†. This proves the approximation and its uniform induced-norm error.

Depends on

Used by · 11

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.