Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§IV, p. 4 — for χ ⊥ |0ⁿ⟩ some monomial P of the σ_-^{(k)} has ⟨0ⁿ|P|χ⟩ ≠ 0

Proved
DissipativePrep.Unique.monomial

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

dissipative-state-preparationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1qubits

Let dk=σ−(k)d_k = \sigma_-^{(k)}dk​=σ−(k)​, k=1,…,nk = 1,\dots,nk=1,…,n, be the qubit lowering operators. For every nonzero vector χ\chiχ orthogonal to ∣0n⟩|0^n\rangle∣0n⟩ there is a finite word k1,…,krk_1,\dots,k_rk1​,…,kr​ (a monomial P(χ)=dk1⋯dkrP(\chi) = d_{k_1}\cdots d_{k_r}P(χ)=dk1​​⋯dkr​​ of the jump operators) such that

⟨0n∣ P(χ) ∣χ⟩≠0.\langle 0^n|\,P(\chi)\,|\chi\rangle \neq 0.⟨0n∣P(χ)∣χ⟩=0.

This is the property that rules out a nonzero subspace invariant under all dkd_kdk​ and orthogonal to ∣0n⟩|0^n\rangle∣0n⟩, and hence (via Theorem 2) shows that ∣0n⟩|0^n\rangle∣0n⟩ is the unique stationary state of L{dk}\mathcal L_{\{d_k\}}L{dk​}​.

Formalization Note "∣χ⟩|\chi\rangle∣χ⟩" is a state, so χ≠0\chi\neq 0χ=0 is assumed (the zero vector is orthogonal to everything). The empty word is the identity.

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 monomial {n : ℕ} (χ : EuclideanSpace ℂ (Fin (2 ^ n))) (hχ : χ ≠ 0)
    (horth : inner ℂ (ket (0 : Fin (2 ^ n))) χ = 0) :
    ∃ w : List (Fin n), inner ℂ (ket (0 : Fin (2 ^ n))) (act (w.map lower).prod χ) ≠ 0 := by sorry

end DissipativePrep.Unique
Source
Kraus et al., Preparation of entangled states by quantum Markov processes, arXiv:0803.1463v3, p. 4, §IV ("Furthermore, it is straightforward to show …")
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