Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Time-averaged generator insertions reproduce the master equation

Proved
QAlgorithms.Papers.Independent.Advance50.P39.propagatorInsertion

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Consider the finite constant transport generator M\mathcal MM with positive recombination, nonnegative trapping, Hermitian coherent evolution, and trace-preserving Lindblad phonon dynamics, and a fixed positive semidefinite trace-one initial matrix ρ0\rho_0ρ0​. Choose any finite decomposition M=∑kMk\mathcal M=\sum_k\mathcal M_kM=∑k​Mk​ into complex-linear process maps. Write F(t,s)=e(t−s)M\mathcal F(t,s)=e^{(t-s)\mathcal M}F(t,s)=e(t−s)M and ρ(t)=F(t,0)ρ0\rho(t)=\mathcal F(t,0)\rho_0ρ(t)=F(t,0)ρ0​. For every t>0t>0t>0, each insertion integrand is integrable on [0,t][0,t][0,t], and

dρ(t)dt=∑k1t∫0tF(t,s)MkF(s,0)ρ0 ds=Mρ(t).\frac{d\rho(t)}{dt}=\sum_k\frac1t\int_0^t \mathcal F(t,s)\mathcal M_k\mathcal F(s,0)\rho_0\,ds =\mathcal M\rho(t).dtdρ(t)​=k∑​t1​∫0t​F(t,s)Mk​F(s,0)ρ0​ds=Mρ(t).

This is the source's insertion representation of the master equation. The post-evolution and pre-evolution remain in their displayed order; individual process maps need not commute with the total generator.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P39
Formal statement
noncomputable section

open MeasureTheory Filter

open scoped BigOperators Matrix ComplexOrder Topology Matrix.Norms.L2Operator

open QAlgorithms.Papers.Independent.Dependency50.P16 (sandwich semigroupEvolution)

namespace QAlgorithms.Papers.Independent.Advance50.P39

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.5, Eq. (10): averaged insertions sum to the master-equation velocity.
No individual process is assumed to commute with M; t=0 is excluded. 
Source-model correction: printed Eq.(5) has A_m A_n^dagger loss products;
changed here to A_n^dagger A_m in canonical GKSL form, because the printed
order fails the source excitation-preservation assumption. The microscopic
phonon-rate formula remains deferred; see the item correction record. -/
theorem propagatorInsertion {n r : ℕ} (D : TransportData n)
    (rho0 : SiteMatrix n) (hstate : QAlgorithms.IsDensityMatrix rho0)
    (parts : Fin r → Superoperator n) (hparts : ∑ k, parts k = transportGenerator D)
    (t : ℝ) (ht : 0 < t) :
    (∀ k, IntervalIntegrable
      (fun s => insertionIntegrand (transportGenerator D) (parts k) rho0 t s) volume 0 t) ∧
    HasDerivAt (transportState (transportGenerator D) rho0)
      (∑ k, averagedInsertion (transportGenerator D) (parts k) rho0 t) t ∧
    (∑ k, averagedInsertion (transportGenerator D) (parts k) rho0 t) =
      transportGenerator D (transportState (transportGenerator D) rho0 t) := by sorry

end QAlgorithms.Papers.Independent.Advance50.P39

end
Source
Role of quantum coherence in chromophoric energy transport, arXiv:0806.4725v2, PDF p. 5, §V, Eq.(10): time-averaged generator insertion equals the master equation
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For all natural numbers n,rn,rn,r, let DDD consist of n>0n>0n>0, real numbers ℏ,γ>0\hbar,\gamma>0ℏ,γ>0, real numbers κi≥0\kappa_i\ge0κi​≥0 for 0≤i<n0\le i<n0≤i<n, a Hermitian matrix H∈Cn×nH\in\mathbb C^{n\times n}H∈Cn×n, a natural number qqq, and arbitrary matrices Jℓ∈Cn×nJ_\ell\in\mathbb C^{n\times n}Jℓ​∈Cn×n for 0≤ℓ<q0\le\ell<q0≤ℓ<q. Define

Q=ℏγIn+diag⁡(ℏκi),G(X)=−1ℏ(QX+XQ)−iℏ(HX−XH)+∑ℓ=0q−1[JℓXJℓ†−12(Jℓ†JℓX+XJℓ†Jℓ)].Q=\hbar\gamma I_n+\operatorname{diag}(\hbar\kappa_i), \qquad G(X)=-\frac1\hbar(QX+XQ)-\frac{i}{\hbar}(HX-XH) +\sum_{\ell=0}^{q-1}\left[J_\ell XJ_\ell^\dagger-\frac12(J_\ell^\dagger J_\ell X+XJ_\ell^\dagger J_\ell)\right].Q=ℏγIn​+diag(ℏκi​),G(X)=−ℏ1​(QX+XQ)−ℏi​(HX−XH)+ℓ=0∑q−1​[Jℓ​XJℓ†​−21​(Jℓ†​Jℓ​X+XJℓ†​Jℓ​)].

Let ρ0\rho_0ρ0​ be positive semidefinite with trace 111, let BkB_kBk​ for 0≤k<r0\le k<r0≤k<r be arbitrary complex-linear endomorphisms of Cn×n\mathbb C^{n\times n}Cn×n satisfying ∑kBk=G\sum_k B_k=G∑k​Bk​=G, and let t>0t>0t>0. Set

Ak(t)=1t∫0te(t−s)G ⁣(Bk(esG(ρ0))) ds.A_k(t)=\frac1t\int_0^t e^{(t-s)G}\!\left(B_k(e^{sG}(\rho_0))\right)\,ds.Ak​(t)=t1​∫0t​e(t−s)G(Bk​(esG(ρ0​)))ds.

The theorem asserts that every integrand in this definition is interval integrable on [0,t][0,t][0,t], that the real-parameter function u↦euG(ρ0)u\mapsto e^{uG}(\rho_0)u↦euG(ρ0​) has derivative ∑kAk(t)\sum_k A_k(t)∑k​Ak​(t) at u=tu=tu=t, and that

∑k=0r−1Ak(t)=G(etG(ρ0)).\sum_{k=0}^{r-1}A_k(t)=G(e^{tG}(\rho_0)).k=0∑r−1​Ak​(t)=G(etG(ρ0​)).

Neither qqq nor rrr is required to be positive; their sums are empty when the corresponding index count is zero, and the decomposition hypothesis still applies.

Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me