Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite-dimensional purity decrease is equivalent to unitality

Proved
QAlgorithms.Papers.Independent.Frontier30.P22.finitePurityUnitality

by Goku · Oct 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let d≥1d\ge1d≥1, let HHH be a Hermitian d×dd\times dd×d matrix, and let (Fα)(F_\alpha)(Fα​) be any finite family of complex d×dd\times dd×d matrices, including the empty family. Set

L(X)=∑α(FαXFα†−12{Fα†Fα,X}),G(X)=−i[H,X]+L(X),Φt=etG.\mathcal L(X)=\sum_\alpha\left(F_\alpha X F_\alpha^\dagger-\frac12\{F_\alpha^\dagger F_\alpha,X\}\right),\qquad G(X)=-i[H,X]+\mathcal L(X),\qquad\Phi_t=e^{tG}.L(X)=α∑​(Fα​XFα†​−21​{Fα†​Fα​,X}),G(X)=−i[H,X]+L(X),Φt​=etG.

Here [A,B]=AB−BA[A,B]=AB-BA[A,B]=AB−BA, {A,B}=AB+BA\{A,B\}=AB+BA{A,B}=AB+BA, and a density matrix is positive semidefinite with trace one. For every density matrix ρ\rhoρ, purity p(ρ)=Tr⁡(ρ2)p(\rho)=\operatorname{Tr}(\rho^2)p(ρ)=Tr(ρ2) is nonincreasing along Φt\Phi_tΦt​, for t≥0t\ge0t≥0, if and only if

L(I)=G(I)=∑α[Fα,Fα†]=0.\mathcal L(I)=G(I)=\sum_\alpha[F_\alpha,F_\alpha^\dagger]=0.L(I)=G(I)=α∑​[Fα​,Fα†​]=0.

Equivalently, 2Re⁡Tr⁡(ρG(ρ))≤02\operatorname{Re}\operatorname{Tr}(\rho G(\rho))\le02ReTr(ρG(ρ))≤0 for every density matrix if and only if the same identity image vanishes.

This gives the finite-dimensional necessity-and-sufficiency interface, including d=1d=1d=1 and Hamiltonian-only dynamics.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier30_P22
Formal statement
noncomputable section

open Filter

open scoped BigOperators Matrix ComplexConjugate Topology

namespace QAlgorithms.Papers.Independent.Frontier30.P22

local notation "FD" => QAlgorithms.Papers.Independent.Dependency50.P16.LindbladData

local notation "finiteG" => QAlgorithms.Papers.Independent.Dependency50.P16.gkslGenerator

local notation "finiteEvolution" => QAlgorithms.Papers.Independent.Dependency50.P16.semigroupEvolution

/-- Theorem 2, PDF p.2, proved on p.3: for every nonzero finite dimension,
purity is nonincreasing for every density iff the dissipator annihilates I.
The equivalent instantaneous condition uses the source-normalized factor 2.
The accepted GKSL data use G=-i[H,.]+L with a one-half anticommutator. -/
theorem finitePurityUnitality {d : ℕ} (hd : 1 ≤ d) (D : FD d) :
    (finitePurityNonincreasing D ↔ finiteIdentityImage D = 0) ∧
    ((∀ rho : Matrix (Fin d) (Fin d) ℂ, QAlgorithms.IsDensityMatrix rho →
      2 * (rho * finiteG D rho).trace.re ≤ 0) ↔ finiteIdentityImage D = 0) ∧
    finiteG D 1 = finiteIdentityImage D := by sorry

end QAlgorithms.Papers.Independent.Frontier30.P22

end
Source
Conditions for strictly purity-decreasing quantum Markovian dynamics, arXiv:quant-ph/0411119v2, PDF p. 2, Theorem 2
Read-back

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

For every natural number d≥1d\ge1d≥1 and every datum D:FD(d)D:\mathrm{FD}(d)D:FD(d), write GD=finiteG(D)G_D=\mathrm{finiteG}(D)GD​=finiteG(D), EG(t,ρ)=finiteEvolution(G,t,ρ)E_G(t,\rho)=\mathrm{finiteEvolution}(G,t,\rho)EG​(t,ρ)=finiteEvolution(G,t,ρ), and Ja=D.jump(a)J_a=D.\mathrm{jump}(a)Ja​=D.jump(a), and set CD=∑a(JaJa†−Ja†Ja)C_D=\sum_a(J_aJ_a^\dagger-J_a^\dagger J_a)CD​=∑a​(Ja​Ja†​−Ja†​Ja​), summing over the field’s entire finite index type. The type FD\mathrm{FD}FD and the operations finiteG\mathrm{finiteG}finiteG and finiteEvolution\mathrm{finiteEvolution}finiteEvolution are not defined in the supplied code. The theorem asserts all three statements:

[∀ρ⪰0, tr⁡ρ=1, ∀ 0≤s≤t,Re⁡tr⁡ ⁣(EGD(t,ρ)2)≤Re⁡tr⁡ ⁣(EGD(s,ρ)2)]  ⟺  CD=0,[∀ρ⪰0, tr⁡ρ=1,2Re⁡tr⁡ ⁣(ρ GD(ρ))≤0]  ⟺  CD=0,GD(Id)=CD.\begin{gathered} \left[ \forall \rho\succeq0,\ \operatorname{tr}\rho=1,\ \forall\,0\le s\le t,\quad \operatorname{Re}\operatorname{tr}\!\left(E_{G_D}(t,\rho)^2\right) \le \operatorname{Re}\operatorname{tr}\!\left(E_{G_D}(s,\rho)^2\right) \right] \iff C_D=0,\\ \left[ \forall \rho\succeq0,\ \operatorname{tr}\rho=1,\quad 2\operatorname{Re}\operatorname{tr}\!\left(\rho\,G_D(\rho)\right)\le0 \right] \iff C_D=0,\\ G_D(I_d)=C_D. \end{gathered}[∀ρ⪰0, trρ=1, ∀0≤s≤t,Retr(EGD​​(t,ρ)2)≤Retr(EGD​​(s,ρ)2)]⟺CD​=0,[∀ρ⪰0, trρ=1,2Retr(ρGD​(ρ))≤0]⟺CD​=0,GD​(Id​)=CD​.​

Here every ρ\rhoρ is a complex d×dd\times dd×d matrix, IdI_dId​ is the identity matrix, and †\dagger† means conjugate transpose.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 19, 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