Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (4)–(5) — Lindblad blocks decay as e−t(x−y)2/2e^{-t(x-y)^2/2}e−t(x−y)2/2

Proved
ProjectiveMeasurementEquilibration.lindblad_block_solution

by Lucas · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

lindbladquantum-mechanics

Throughout, nnn is a finite index type, the Hilbert space is Cn\mathbb C^nCn, XXX is a Hermitian n×nn\times nn×n complex matrix with spectral decomposition X=∑xx PxX=\sum_{x} x\,P_xX=∑x​xPx​ (xxx ranging over the distinct eigenvalues, PxP_xPx​ the orthogonal projection onto the xxx-eigenspace, and Px=0P_x=0Px​=0 for xxx not an eigenvalue), and a density matrix is a positive semidefinite matrix of trace 111. Let ρ(t)\rho(t)ρ(t), t≥0t\ge0t≥0, be any solution of the Lindblad equation

dρdt=XρX−12{X2,ρ},ρ(0)=ρ.\frac{d\rho}{dt}=X\rho X-\tfrac12\{X^2,\rho\},\qquad \rho(0)=\rho.dtdρ​=XρX−21​{X2,ρ},ρ(0)=ρ.

Then for all t≥0t\ge 0t≥0 and all real x,yx,yx,y,

Px ρ(t) Py=e−t2(x−y)2 Px ρ(0) Py.P_x\,\rho(t)\,P_y=e^{-\frac t2(x-y)^2}\,P_x\,\rho(0)\,P_y.Px​ρ(t)Py​=e−2t​(x−y)2Px​ρ(0)Py​.

In particular diagonal blocks are constant and off-diagonal blocks decay exponentially.

Preamble
import Mathlib
import Definitions.Def_pme_quantum_basics
import Definitions.Def_pme_measurement_conditions

open Matrix Filter Topology
Formal statement
namespace ProjectiveMeasurementEquilibration

theorem lindblad_block_solution {n : Type} [Fintype n] [DecidableEq n] {X : Matrix n n ℂ} (hX : X.IsHermitian)
    (ρ : Matrix n n ℂ) (ρt : ℝ → Matrix n n ℂ) (hsol : IsLindbladSolution X ρ ρt)
    (t : ℝ) (ht : 0 ≤ t) (x y : ℝ) :
    eigenproj hX x * ρt t * eigenproj hX y =
      ((Real.exp (-(t / 2) * (x - y) ^ 2) : ℝ) : ℂ) • (eigenproj hX x * ρ * eigenproj hX y) := by sorry

end ProjectiveMeasurementEquilibration
Source
G. Carcassi (Assumptions of Physics collaboration), "Projective measurements are equilibration processes", AoP Technical Brief 017, https://assumptionsofphysics.org/resources/briefs, proof of Theorem 1, eqs. (3)–(5), pp. 2–3
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) - same agent as the drafter; non-blind

Non-blind read-back. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statements, at the explicit request of the account owner. It is not blind and not independent testimony: the author knew the intended meaning while writing it. Reviewers should not treat it as an independent audit.

For every finite index type nnn, Hermitian X∈Mn(C)X\in M_n(\mathbb C)X∈Mn​(C), matrix ρ∈Mn(C)\rho\in M_n(\mathbb C)ρ∈Mn​(C) (arbitrary, not necessarily a density matrix), and function ρ(⋅):R→Mn(C)\rho(\cdot):\mathbb R\to M_n(\mathbb C)ρ(⋅):R→Mn​(C) such that ρ(0)=ρ\rho(0)=\rhoρ(0)=ρ and, for each t≥0t\ge0t≥0, ρ(⋅)\rho(\cdot)ρ(⋅) has derivative within [0,∞)[0,\infty)[0,∞) at ttt equal to Xρ(t)X−12(X2ρ(t)+ρ(t)X2)X\rho(t)X-\tfrac12(X^2\rho(t)+\rho(t)X^2)Xρ(t)X−21​(X2ρ(t)+ρ(t)X2): for every t≥0t\ge0t≥0 and all real numbers x,yx,yx,y,

Px ρ(t) Py=e−t2(x−y)2  Px ρ Py,P_x\,\rho(t)\,P_y=e^{-\frac t2 (x-y)^2}\;P_x\,\rho\,P_y,Px​ρ(t)Py​=e−2t​(x−y)2Px​ρPy​,

where PxP_xPx​ is the eigenprojection of XXX for xxx (the zero matrix if xxx is not an eigenvalue, in which case both sides vanish). The real exponential is cast to a complex scalar.

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

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 8, 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