Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 1, p. 2 — characterization of pure stationary states

Proved
DissipativePrep.Unique.theorem_1

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

dissipative-state-preparationlindblad-master-equationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stationary-state

Let L\mathcal LL be the Liouvillian of Eq. (2) with Hermitian Hamiltonian HHH, jump operators c1,…,cmc_1,\dots,c_mc1​,…,cm​ and rates gl>0g_l>0gl​>0, and write P=∑lglcl†clP = \sum_l g_l c_l^\dagger c_lP=∑l​gl​cl†​cl​, Q=P−iHQ = P - iHQ=P−iH. Let ∣Φ⟩|\Phi\rangle∣Φ⟩ be a unit vector. Then L(∣Φ⟩⟨Φ∣)=0\mathcal L(|\Phi\rangle\langle\Phi|) = 0L(∣Φ⟩⟨Φ∣)=0 if and only if

  1. Q†∣Φ⟩=λ∣Φ⟩Q^\dagger|\Phi\rangle = \lambda|\Phi\rangleQ†∣Φ⟩=λ∣Φ⟩ for some λ∈C\lambda\in\mathbb Cλ∈C, and
  2. cl∣Φ⟩=λl∣Φ⟩c_l|\Phi\rangle = \lambda_l|\Phi\ranglecl​∣Φ⟩=λl​∣Φ⟩ for every lll, for some λl∈C\lambda_l\in\mathbb Cλl​∈C with
∑lgl ∣λl∣2=Re⁡(λ).\sum_l g_l\,|\lambda_l|^2 = \operatorname{Re}(\lambda).l∑​gl​∣λl​∣2=Re(λ).

The theorem reduces stationarity of a pure state to a common-eigenvector condition on the jump operators, which is the basis of the construction in §IV.

Formalization Note The page allows gl≥0g_l\ge 0gl​≥0; with gl=0g_l = 0gl​=0 the operator clc_lcl​ does not enter L\mathcal LL and condition 2 can fail, so gl>0g_l>0gl​>0 is assumed. ∣Φ⟩|\Phi\rangle∣Φ⟩ is required to be a unit vector (a state).

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 theorem_1 {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)) (hΦ : ‖Φ‖ = 1) :
    gkslGenerator (krausData H hH c g) (pureDensity Φ) = 0 ↔
      ∃ lam : ℂ, act (Qop H c g)ᴴ Φ = lam • Φ ∧
        ∃ lamL : Fin m → ℂ, (∀ l, act (c l) Φ = lamL l • Φ) ∧
          ∑ l, g l * ‖lamL l‖ ^ 2 = lam.re := by sorry

end DissipativePrep.Unique
Source
Kraus et al., Preparation of entangled states by quantum Markov processes, arXiv:0803.1463v3, p. 2, Theorem 1
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