Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

p. 3 and footnote [35] — D′ = D: Q†ψ = iλψ with λ real iff ψ is dark

Proved
DissipativePrep.Unique.dprime_eq_dark

by mikedeng1 · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

dark-statesdissipative-state-preparationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let HHH be Hermitian, c1,…,cmc_1,\dots,c_mc1​,…,cm​ jump operators with rates gl>0g_l>0gl​>0, P=∑lglcl†clP = \sum_l g_l c_l^\dagger c_lP=∑l​gl​cl†​cl​ and Q=P−iHQ = P - iHQ=P−iH. Then

D′={ψ:Q†ψ=iλψ for some λ∈R}  =  {ψ:clψ=0 for all l, and Hψ=Eψ for some E∈R}=D.D' = \{\psi : Q^\dagger\psi = i\lambda\psi \text{ for some } \lambda\in\mathbb R\} \;=\; \{\psi : c_l\psi = 0 \text{ for all } l, \text{ and } H\psi = E\psi \text{ for some } E\in\mathbb R\} = D.D′={ψ:Q†ψ=iλψ for some λ∈R}={ψ:cl​ψ=0 for all l, and Hψ=Eψ for some E∈R}=D.

The right-hand side is the paper's set D=K(P)∩ES(H)D = K(P)\cap ES(H)D=K(P)∩ES(H) of dark vectors (the union over the eigenvalues EEE of HHH; the zero vector belongs to both sides). The identity is used in the proof of Theorem 2 to show that a stationary state maps DDD into itself.

Formalization Note gl>0g_l>0gl​>0 is assumed so that K(P)K(P)K(P) is the common kernel of the clc_lcl​.

Preamble
import Mathlib
import Definitions.Def_DissipativePrep_Unique_Model

open scoped Matrix ComplexConjugate
open QAlgorithms QAlgorithms.Papers.Independent.Dependency50.P16
Formal statement
namespace DissipativePrep.Unique

theorem dprime_eq_dark {d m : ℕ} (H : Matrix (Fin d) (Fin d) ℂ) (hH : H.IsHermitian)
    (c : Fin m → Matrix (Fin d) (Fin d) ℂ) (g : Fin m → ℝ) (hg : ∀ l, 0 < g l) :
    {ψ : EuclideanSpace ℂ (Fin d) | ∃ lam : ℝ, act (Qop H c g)ᴴ ψ = (Complex.I * lam) • ψ} =
      {ψ | (∀ l, act (c l) ψ = 0) ∧ ∃ E : ℝ, act H ψ = (E : ℂ) • ψ} := by sorry

end DissipativePrep.Unique
Source
Kraus et al., Preparation of entangled states by quantum Markov processes, arXiv:0803.1463v3, p. 3 (proof of Theorem 2), with footnote [35], p. 10
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me