Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 19: an attained generalized Choi–Kraus factorization

Open
QAlgorithms.Papers.Independent.Intakenext100.P36.cb_representation

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let n,k≥1n,k\ge1n,k≥1 and let ϕ:Mn→Mk\phi:M_n\to M_kϕ:Mn​→Mk​ be complex-linear. There exist an integer m≤nkm\le nkm≤nk and matrices Ai∈Mk,nA_i\in M_{k,n}Ai​∈Mk,n​ and Bi∈Mn,kB_i\in M_{n,k}Bi​∈Mn,k​ such that, for every X∈MnX\in M_nX∈Mn​,

ϕ(X)=∑i=1mAiXBi,∥ϕ∥cb2=∥ϕ†∥⋄2=∥∑iAiAi†∥∥∑iBi†Bi∥.\phi(X)=\sum_{i=1}^m A_iXB_i,\qquad \|\phi\|_{\rm cb}^2=\|\phi^\dagger\|_\diamond^2=\left\|\sum_i A_iA_i^\dagger\right\|\left\|\sum_iB_i^\dagger B_i\right\|.ϕ(X)=i=1∑m​Ai​XBi​,∥ϕ∥cb2​=∥ϕ†∥⋄2​=​i∑​Ai​Ai†​​​i∑​Bi†​Bi​​.

The map ϕ†:Mk→Mn\phi^\dagger:M_k\to M_nϕ†:Mk​→Mn​ is defined by the bilinear trace identity Tr⁡(ϕ(X)Y)=Tr⁡(Xϕ†(Y))\operatorname{Tr}(\phi(X)Y)=\operatorname{Tr}(X\phi^\dagger(Y))Tr(ϕ(X)Y)=Tr(Xϕ†(Y)). Matrix norms are Euclidean operator norms; the diamond norm uses an input-dimension ancilla and unnormalized trace norm. Neither Kraus normalization nor positivity is assumed. An empty representation is allowed for the zero map.

This finite structural consequence of generalized Stinespring supplies an attained objective for the norm computation; an arbitrary supplied representation is not asserted to attain it.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P36
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ENNReal ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakenext100.P36

local notation "Mat" => QAlgorithms.Papers.Independent.Information100.P50.M

local notation "Map" => QAlgorithms.Papers.Independent.Information100.P50.Lin

open QAlgorithms.Papers.Independent.Dependency50.P49 (traceDual)

/-- Theorem 19, PDF p.8: an attained finite factorization with at most nk terms.
The representation is existential; an arbitrary supplied representation need not attain.
This concrete consequence of generalized Stinespring is used by the paper's algorithm. -/
theorem cb_representation {n k : ℕ} (hn : 0 < n) (hk : 0 < k) (phi : Map n k) :
    ∃ m : ℕ, m ≤ n * k ∧
      ∃ A : Fin m → Matrix (Fin k) (Fin n) ℂ,
      ∃ B : Fin m → Matrix (Fin n) (Fin k) ℂ,
        IsGeneralizedChoiKraus phi A B ∧
        extendedCBNorm phi ^ 2 = rectangularDiamondNorm (traceDual phi) ^ 2 ∧
        rectangularDiamondNorm (traceDual phi) ^ 2 =
          ENNReal.ofReal (specNorm (∑ i, A i * (A i)ᴴ) *
            specNorm (∑ i, (B i)ᴴ * B i)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P36

end
Source
Computing Stabilized Norms for Quantum Operations via the Theory of Completely Bounded Maps, arXiv:0711.3636v1, PDF p. 8, Theorem 19 (CB Representation Theorem)
Read-back

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

For positive natural numbers n,kn,kn,k and every complex linear map ϕ:Mn(C)→Mk(C)\phi:M_n(\mathbb C)\to M_k(\mathbb C)ϕ:Mn​(C)→Mk​(C), there exist a natural number m≤nkm\le nkm≤nk and matrices Ai∈Ck×nA_i\in\mathbb C^{k\times n}Ai​∈Ck×n, Bi∈Cn×kB_i\in\mathbb C^{n\times k}Bi​∈Cn×k, indexed by i<mi<mi<m, such that ϕ(X)=∑i<mAiXBi\phi(X)=\sum_{i<m}A_iXB_iϕ(X)=∑i<m​Ai​XBi​ for every XXX and

C(ϕ)2=D(ϕ∨)2=[∥∑i<mAiAi†∥op ∥∑i<mBi†Bi∥op]+.C(\phi)^2=D(\phi^\vee)^2 = \left[ \left\|\sum_{i<m}A_iA_i^\dagger\right\|_{\mathrm{op}}\, \left\|\sum_{i<m}B_i^\dagger B_i\right\|_{\mathrm{op}} \right]_+.C(ϕ)2=D(ϕ∨)2=​​i<m∑​Ai​Ai†​​op​​i<m∑​Bi†​Bi​​op​​+​.

Here [t]+[t]_+[t]+​ is the image of max⁡(t,0)\max(t,0)max(t,0) in [0,∞][0,\infty][0,∞], †\dagger† is conjugate transpose, ϕ∨\phi^\veeϕ∨ is the trace dual characterized by tr⁡(ϕ(X)Y)=tr⁡(Xϕ∨(Y))\operatorname{tr}(\phi(X)Y)=\operatorname{tr}(X\phi^\vee(Y))tr(ϕ(X)Y)=tr(Xϕ∨(Y)), and

C(ψ)=[sup⁡q∈N, X∈Mqu(C)∥X∥op≤1∥(idq⊗ψ)(X)∥op]+,D(ψ)=sup⁡X∈Mu2(C)∥X∥1≤1[∥(idu⊗ψ)(X)∥1]+C(\psi)= \left[\sup_{\substack{q\in\mathbb N,\ X\in M_{qu}(\mathbb C)\\\|X\|_{\mathrm{op}}\le1}} \|(\mathrm{id}_q\otimes\psi)(X)\|_{\mathrm{op}}\right]_+, \qquad D(\psi)= \sup_{\substack{X\in M_{u^2}(\mathbb C)\\\|X\|_1\le1}} [\|(\mathrm{id}_u\otimes\psi)(X)\|_1]_+C(ψ)=​q∈N, X∈Mqu​(C)∥X∥op​≤1​sup​∥(idq​⊗ψ)(X)∥op​​+​,D(ψ)=X∈Mu2​(C)∥X∥1​≤1​sup​[∥(idu​⊗ψ)(X)∥1​]+​

for a map ψ:Mu(C)→Mv(C)\psi:M_u(\mathbb C)\to M_v(\mathbb C)ψ:Mu​(C)→Mv​(C), with the supremum defining CCC taken in R\mathbb RR, amplification acting block by block, and ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​. Squares and equalities are in [0,∞][0,\infty][0,∞]. The representation may have m=0m=0m=0, in which case its sums and represented map are zero; no positivity or channel assumption is imposed on ϕ\phiϕ.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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