Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Definite-parity Kraus representation

Open
QAlgorithms.Papers.Independent.Intakethird100.P44.definite_parity_kraus

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All Hilbert spaces are finite dimensional and nonzero, and every channel is completely positive and trace preserving on the full matrix algebra. Let CCC be total parity for a finite spinless-fermion Fock space, and put P=Q:X↦(X+CXC)/2\mathcal P=\mathcal Q:X\mapsto(X+CXC)/2P=Q:X↦(X+CXC)/2. A channel N\mathcal NN is physical if QNP=QN\mathcal Q\mathcal N\mathcal P=\mathcal Q\mathcal NQNP=QN. A Kraus operator has definite parity when it commutes or anticommutes with CCC. Then

[N has a normalized definite-parity Kraus representation]⟹N physical,\bigl[\mathcal N\text{ has a normalized definite-parity Kraus representation}\bigr]\Longrightarrow\mathcal N\text{ physical},[N has a normalized definite-parity Kraus representation]⟹N physical, N physical⟹QN=QNP has such a representation.\mathcal N\text{ physical}\Longrightarrow\mathcal Q\mathcal N=\mathcal Q\mathcal N\mathcal P\text{ has such a representation}.N physical⟹QN=QNP has such a representation.

The projected channel has the same physical-observable action. Both parity-preserving and parity-flipping Kraus operators are allowed.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P44
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P44

open scoped Matrix ComplexConjugate ComplexOrder

open QAlgorithms.Papers.Independent.Information100.P60 (Mat)

open QAlgorithms.Papers.Independent.Information100.P67 (mapFirst)

open QAlgorithms.Papers.Independent.Claimed50.P48 (operatorTraceDual)

open QAlgorithms.Papers.Independent.Renew46.P43 (purification)

variable {H K L J E F B : Type*}

variable [Fintype H] [DecidableEq H] [Fintype K] [DecidableEq K]

variable [Fintype L] [DecidableEq L] [Fintype J] [DecidableEq J]

variable [Fintype E] [DecidableEq E] [Fintype F] [DecidableEq F]

variable [Fintype B] [DecidableEq B]

/-- PDF p.3, Proposition 1. The converse represents the PHYSICALLY
EQUIVALENT projected channel QN, not necessarily N on forbidden coherences. 
Parity correction, PDF p.2 Eq.(1): printed i^(|omega|-1) for Majorana labels;
changed to i^m on 2m ordered modes. Why: the printed four-mode value is
anti-Hermitian with square -I, whereas the source requires parity sectors of
a Hermitian involution. Only this normalization (up to sign) is corrected. -/
theorem definite_parity_kraus {n : ℕ} (f : Fermions n)
    (N : Superop (Fin (2 ^ n)) (Fin (2 ^ n))) (hN : IsChannel N) :
    ((∃ (m : ℕ) (A : Fin m → Mat (Fin (2 ^ n))), IsKrausFamily A ∧
        N = krausApply A ∧ ∀ j, DefiniteParity (totalParity f) (A j)) →
      IsPhysicalChannel (parityProject (totalParity f)) (parityProject (totalParity f)) N) ∧
    (IsPhysicalChannel (parityProject (totalParity f)) (parityProject (totalParity f)) N →
      ∃ (m : ℕ) (A : Fin m → Mat (Fin (2 ^ n))), IsKrausFamily A ∧
        parityProject (totalParity f) ∘ N = krausApply A ∧
        ∀ j, DefiniteParity (totalParity f) (A j)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P44

end
Source
Approximate recovery with locality and symmetry constraints, arXiv:1806.10324v2, PDF p. 3, Proposition 1: definite-parity Kraus representation
Read-back

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

For every natural number nnn, let w0,…,w2n−1w_0,\ldots,w_{2n-1}w0​,…,w2n−1​ be Hermitian matrices on C2n\mathbb C^{2^n}C2n satisfying wiwj+wjwi=2δijIw_iw_j+w_jw_i=2\delta_{ij}Iwi​wj​+wj​wi​=2δij​I, put C=i nw0⋯w2n−1C=\mathrm{i}^{\,n}w_0\cdots w_{2n-1}C=inw0​⋯w2n−1​, and define P(X)=12(X+CXC)P(X)=\tfrac12(X+CXC)P(X)=21​(X+CXC). Let NNN be a channel on this space, meaning that it has a finite Kraus representation with ∑jAj†Aj=I\sum_jA_j^\dagger A_j=I∑j​Aj†​Aj​=I. The theorem asserts two implications: if there exist m≥0m\geq0m≥0 and matrices A0,…,Am−1A_0,\ldots,A_{m-1}A0​,…,Am−1​ with that normalization, N(X)=∑jAjXAj†N(X)=\sum_jA_jXA_j^\daggerN(X)=∑j​Aj​XAj†​ for every XXX, and each AjC=CAjA_jC=CA_jAj​C=CAj​ or AjC=−CAjA_jC=-CA_jAj​C=−CAj​, then P(N(P(X)))=P(N(X))P(N(P(X)))=P(N(X))P(N(P(X)))=P(N(X)) for every matrix XXX; conversely, if this last identity holds for every XXX, then there exist m≥0m\geq0m≥0 and normalized Kraus matrices of definite parity representing P∘NP\circ NP∘N:

P(N(X))=∑j=0m−1AjXAj†,AjC=CAj or AjC=−CAj.P(N(X))=\sum_{j=0}^{m-1}A_jXA_j^\dagger, \qquad A_jC=CA_j\ \text{or}\ A_jC=-CA_j.P(N(X))=j=0∑m−1​Aj​XAj†​,Aj​C=CAj​ or Aj​C=−CAj​.

The case n=0n=0n=0 is included, with C=IC=IC=I, PPP the identity map, and every matrix commuting with CCC.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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