Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§A.4: unitary mixing of two operator-sum representations

Proved
QAlgorithms.Papers.Independent.Support50.P41.krausUnitaryFreedom

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

prove2quantum

Let (Aμ)μ<m(A_\mu)_{\mu<m}(Aμ​)μ<m​ and (Bν)ν<n(B_\nu)_{\nu<n}(Bν​)ν<n​ be normalized operator-sum representations of the same channel on a nonzero finite-dimensional system. Append zero operators to both lists to obtain length L=max⁡(m,n)L=\max(m,n)L=max(m,n). There exists a unitary L×LL\times LL×L matrix UUU with

Aμ=∑ν<LUμνBν(μ<L).A_\mu=\sum_{\nu<L}U_{\mu\nu}B_\nu\qquad(\mu<L).Aμ​=ν<L∑​Uμν​Bν​(μ<L).

The unitary acts on representation labels and has the printed orientation without an extra complex conjugation.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P41

open QAlgorithms

open QAlgorithms.Entanglement (IsCompletelyPositive)

open QAlgorithms.Papers.Independent.Dependency50.P40 (IsPurification purificationFidelity)

open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)

open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)

open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing)

open QAlgorithms.Papers.Independent.Dependency50.P38 (vectorizeInputFirst)

open QAlgorithms.Papers.Independent.Gap20.P06 (dilationChannel environmentOutput dilatedVector)

open QAlgorithms.Papers.Independent.Information100.P50 (complementaryMap)

open QAlgorithms.Papers.Independent.Renew46.P43 (IsCountablePOVM classicalKLTerm countableEntropy)

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

attribute [local instance] Classical.propDecidable Classical.decEq

-- The accepted generic dilation functions fix classical equality on each factor.
-- Match that instance for Fin before forming their product unitary groups.

local instance (priority := 2000) (n : ℕ) : DecidableEq (Fin n) := Classical.decEq _

/-- PDF pp.36--37: zero padding and printed orientation of the unitary mixing of Kraus labels. -/
theorem krausUnitaryFreedom {d m n : ℕ} [NeZero d]
    (Phi : Superop (Fin d) (Fin d))
    (A : Fin m → Matrix (Fin d) (Fin d) ℂ) (hA : OperatorSum Phi A)
    (B : Fin n → Matrix (Fin d) (Fin d) ℂ) (hB : OperatorSum Phi B) :
    ∃ U : Matrix.unitaryGroup (Fin (max m n)) ℂ,
      ∀ k : Fin (max m n), padKraus A (max m n) k =
        ∑ l, (U : Matrix (Fin (max m n)) (Fin (max m n)) ℂ) k l •
          padKraus B (max m n) l := by sorry

end QAlgorithms.Papers.Independent.Support50.P41

end
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 37, §A.4: unitary mixing of two operator-sum representations
Read-back

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

For every positive integer ddd, every natural numbers m,nm,nm,n, every function Φ:Md(C)→Md(C)\Phi:M_d(\mathbb C)\to M_d(\mathbb C)Φ:Md​(C)→Md​(C), and matrix families A0,…,Am−1A_0,\ldots,A_{m-1}A0​,…,Am−1​ and B0,…,Bn−1B_0,\ldots,B_{n-1}B0​,…,Bn−1​, suppose

∑i=0m−1Ai†Ai=Id,∑j=0n−1Bj†Bj=Id,∀X∈Md(C), Φ(X)=∑iAiXAi†=∑jBjXBj†.\sum_{i=0}^{m-1}A_i^\dagger A_i=I_d,\qquad \sum_{j=0}^{n-1}B_j^\dagger B_j=I_d, \qquad \forall X\in M_d(\mathbb C),\ \Phi(X)=\sum_iA_iXA_i^\dagger=\sum_jB_jXB_j^\dagger.i=0∑m−1​Ai†​Ai​=Id​,j=0∑n−1​Bj†​Bj​=Id​,∀X∈Md​(C), Φ(X)=i∑​Ai​XAi†​=j∑​Bj​XBj†​.

Set N=max⁡(m,n)N=\max(m,n)N=max(m,n), and extend each family to length NNN by setting A~k=Ak\widetilde A_k=A_kAk​=Ak​ when k<mk<mk<m and A~k=0\widetilde A_k=0Ak​=0 otherwise, and B~l=Bl\widetilde B_l=B_lBl​=Bl​ when l<nl<nl<n and B~l=0\widetilde B_l=0Bl​=0 otherwise. There exists a unitary matrix U∈MN(C)U\in M_N(\mathbb C)U∈MN​(C) such that

∀k∈{0,…,N−1},A~k=∑l=0N−1UklB~l.\forall k\in\{0,\ldots,N-1\},\qquad \widetilde A_k=\sum_{l=0}^{N-1}U_{kl}\widetilde B_l.∀k∈{0,…,N−1},Ak​=l=0∑N−1​Ukl​Bl​.

Although m=0m=0m=0 and n=0n=0n=0 are included in the quantification, either value makes its corresponding normalization hypothesis impossible because d>0d>0d>0.

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

    Confirmed by the moderator at approval.

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