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

Universal Lindblad equation with correction

PDF p. 9: Eq. (S2.3), interpretation on p. 10

Statement

Assume the Axiom of Choice and Countable Choice. Adopt the system–bath postulate and the independent ULE jump and modified-state contracts, including their centered stationary Gaussian bath, normalized finite coupling channels, finite kernel moments, remote-past factorized preparation and short-memory regime. Assume that the exact interaction-picture reduced operator r(t) is differentiable and that the system propagator U(t) is differentiable with U˙(t)=−iHS(t)U(t). Let ρ(t)=U(t)r(t)U(t)†. The interaction-picture jumps L~λ and Hermitian Lamb shift Λ~ are those of the jump contract; put Lλ=UL~λU† and Λ=UΛ~U†. The commutator and anticommutator are [A,B]=AB−BA and {A,B}=AB+BA.

Define D~t(X)=−i[Λ~(t),X]+∑λ(L~λ(t)XL~λ(t)†−12{L~λ(t)†L~λ(t),X}) and ξ(t)=U(t)(r˙(t)−D~t(r(t)))U(t)†. Then ∂tρ=−i[HS(t)+Λ(t),ρ]+∑λ(Lλ(t)ρLλ(t)†−12{Lλ(t)†Lλ(t),ρ})+ξ(t). The correction records the departure of the exact derivative from the stated time-local Lindblad-form generator; the article describes it as accounting for deviations from exact Markovianity.

The independently supplied quantitative residual bound applies instead to a modified interaction-picture operator σ, with ∥σ−r∥≤Γτ and ∥σ˙−D~t(σ)∥≤2Γ2τ in spectral norm. Here Γ=4γ(∫∥h(s)∥2,1ds)2 and τ=∫∣s∣∥h(s)∥2,1ds/∫∥h(s)∥2,1ds use the jump contract's kernel h. These bounds do not by themselves bound ξ or establish a uniform trajectory error after dropping it.

Facts & Assumptions

[F1]

The postulate supplies the conditional coupling model, the short-memory regime and the kernel definitions, including the remote-past preparation and finite nonzero kernel moments. ULE system–bath coupling and short bath memory

[F2]

The jump contract supplies the interaction-picture jump operators and Hermitian Lamb shift under the stated independent bath and preparation hypotheses. ULE jump construction under independent bath hypotheses

[F3]

The modified-state contract supplies the two spectral-norm bounds for the interaction-picture operator σ, with the ULE generator identified by the jump contract. ULE residual bound and the modified-state distinction

[F4]

The finite GKSL interface specifies the displayed commutator, anticommutator and Lindblad-form terms; its time-independent channel result is not invoked for this time-dependent equation. Finite GKSL evolution and the QEC channel interface

[F5]

For compatible finite matrices, the real Fréchet differential rules are d(AB)=dA B+A dB and d(A†)=(dA)†. Matrix differentials obey the sum rule, product rule, and adjoint rule

[A1]

Assume the Axiom of Choice for the adopted postulate's self-adjoint bath unitary-group construction, and Countable Choice for its Hilbert-space, trace and kernel constructions and the independent ULE contracts. Assume the differentiability stated above. The Axiom of Choice The Axiom of Countable Choice (AC_ω)

Proof

Given: The model and regularity hypotheses, the ULE coefficients, and the definitions in the statement.

Goal: Obtain the displayed equation for the exact reduced operator and state the scope of the independent modified-operator estimates.

1.1F2F4A1

By definition of ξ, r˙=D~t(r)+U†ξU. The generator has the displayed finite Lindblad form with coefficients supplied by [F2], using the conventions in [F4]. This identity defines the exact-state residual and does not estimate it.

2.1F1F3F5A1step 1.1∎

Apply [F5] to the differentiable matrix curves, twice for the three-factor product: substituting their increments hU˙+o(h) and hr˙+o(h) into the supplied first-order remainder formulas gives ρ˙=U˙rU†+Ur˙U†+Ur(U˙)†. Since U˙=−iHSU and HS=HS†, the adjoint rule gives (U˙)†=iU†HS. The two derivatives of U give −i[HS,ρ]; conjugating each term of D~t(r) gives the corresponding term with Λ and Lλ, and conjugating U†ξU gives ξ. This proves the displayed equation. Here [F1] is adopted under [A1], including full Choice for the postulate's bath unitary-group construction. Independently, [F3] gives the stated bounds for σ under [F1]; it supplies neither a bound on the derivative of σ−r nor the asserted bound for ξ.

Source notes

The article's reduced-state notation and interpretation are attributed to Eq. (S2.3). The exact-state equation here is an identity with an explicitly defined residual. The nontrivial residual estimate is retained only for the modified operator supplied by the independent ULE contract. The finite-preparation tail and its applicability conditions are stated in the jump contract; no unchanged remote-past residual constant is claimed for arbitrary finite preparation.

Depends on

Used by · 1

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