Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 17: conjugate-channel linearization identities

Proved
QAlgorithms.Papers.Independent.Gap48.P36.conjugate_linearization

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

prove2quantum

All Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. Fix a normalized Kraus family FkF_kFk​, defining Φ(ρ)=∑kFkρFk†\Phi(\rho)=\sum_kF_k\rho F_k^\daggerΦ(ρ)=∑k​Fk​ρFk†​, and an integer p≥1p\ge1p≥1, and set (Rb)ka=(Fk)ba(R_b)_{ka}=(F_k)_{ba}(Rb​)ka​=(Fk​)ba​. Define Θ(F,p)=∑k1,…,kp⨂tFkt†Fkt+1\Theta(F,p)=\sum_{k_1,\ldots,k_p}\bigotimes_t F_{k_t}^\dagger F_{k_{t+1}}Θ(F,p)=∑k1​,…,kp​​⨂t​Fkt​†​Fkt+1​​ with cyclic indices. Let Lp∣a1,…,ap⟩=∣a2,…,ap,a1⟩L_p|a_1,\ldots,a_p\rangle=|a_2,\ldots,a_p,a_1\rangleLp​∣a1​,…,ap​⟩=∣a2​,…,ap​,a1​⟩, and Ω(Φ,p)=Φ^⊗p(Lp)\Omega(\Phi,p)=\widehat\Phi^{\otimes p}(L_p)Ω(Φ,p)=Φ⊗p(Lp​) with the computed Hilbert–Schmidt adjoint. Then

Ω(Φ,p)=Θ(ΦC,p)†=Θ(Φ,p)Lp.\Omega(\Phi,p)=\Theta(\Phi^C,p)^\dagger=\Theta(\Phi,p)L_p.Ω(Φ,p)=Θ(ΦC,p)†=Θ(Φ,p)Lp​.

These are operator identities on the full input tensor power; the adjoint is retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P36
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P36

open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal

open QAlgorithms.Papers.Independent.Claimed50.P48

open QAlgorithms.Papers.Independent.Information100.P67 (receiverChannel complementaryChannel)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy normalizedChoi)

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

open QAlgorithms.Papers.Independent.Information100.P03 (convexRoof)

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

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C D E K L A2 B2 C2 : Type*}

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

variable [Fintype E] [DecidableEq E] [Fintype K] [DecidableEq K]

variable [Fintype L] [DecidableEq L] [Fintype A2] [DecidableEq A2]

variable [Fintype B2] [DecidableEq B2] [Fintype C2] [DecidableEq C2]

/-- Theorem 17, PDF pp.26–27, (79): retain the adjoint of the conjugate linearizer.
The cyclic convention is fixed by L_p|k1,...,kp>=|k2,...,kp,k1>. -/
theorem conjugate_linearization [Nonempty A] [Nonempty B] [Nonempty K]
    (F : K → Matrix B A ℂ) (hF : IsKrausFamily F) (p : ℕ) (hp : 1 ≤ p) :
    channelLinearizer (krausApply F) p = (krausLinearizer (rowKraus F) p)ᴴ ∧
    channelLinearizer (krausApply F) p = krausLinearizer F p * leftCycle A p := by sorry

end QAlgorithms.Papers.Independent.Gap48.P36

end
Source
Properties of Conjugate Channels with Applications to Additivity and Multiplicativity, arXiv:quant-ph/0509126v3, PDF p. 27, Theorem 17: conjugate-channel linearization identities
Read-back

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

Let A,B,KA,B,KA,B,K be finite nonempty types with decidable equality, let FkF_kFk​ be complex matrices with rows indexed by BBB and columns by AAA, and suppose ∑k∈KFk†Fk=IA\sum_{k\in K}F_k^\dagger F_k=I_A∑k∈K​Fk†​Fk​=IA​. Let p≥1p\ge1p≥1 be a natural number and define Φ(X)=∑kFkXFk†\Phi(X)=\sum_kF_kXF_k^\daggerΦ(X)=∑k​Fk​XFk†​. For any finite index type III, let CI,pC_{I,p}CI,p​, indexed by IpI^pIp, have entry 111 at (x,y)(x,y)(x,y) exactly when xi=yi+1 mod px_i=y_{i+1\bmod p}xi​=yi+1modp​ for every iii, and 000 otherwise. Define the trace-dual map by (Φ#(Y))ab=tr⁡(Φ(Eba)Y)(\Phi^\#(Y))_{ab}=\operatorname{tr}(\Phi(E_{ba})Y)(Φ#(Y))ab​=tr(Φ(Eba​)Y), and define LΦ,p\mathcal L_{\Phi,p}LΦ,p​ entrywise by

(LΦ,p)x,y=∑u,v∈Bp(CB,p)u,v∏i=0p−1(Φ#(Euivi))xiyi.(\mathcal L_{\Phi,p})_{x,y} =\sum_{u,v\in B^p}(C_{B,p})_{u,v} \prod_{i=0}^{p-1}\bigl(\Phi^\#(E_{u_i v_i})\bigr)_{x_i y_i}.(LΦ,p​)x,y​=u,v∈Bp∑​(CB,p​)u,v​i=0∏p−1​(Φ#(Eui​vi​​))xi​yi​​.

For a family HjH_jHj​ of matrices with input index AAA, define

(KH,p)x,y=∑s∈Jp∏i=0p−1(Hsi†Hsi+1 mod p)xiyi,(\mathcal K_{H,p})_{x,y} =\sum_{s\in J^p}\prod_{i=0}^{p-1} (H_{s_i}^\dagger H_{s_{i+1\bmod p}})_{x_i y_i},(KH,p​)x,y​=s∈Jp∑​i=0∏p−1​(Hsi​†​Hsi+1modp​​)xi​yi​​,

where JJJ indexes that family, and define the reshuffled family RbR_bRb​, with rows indexed by KKK, by (Rb)ka=(Fk)ba(R_b)_{ka}=(F_k)_{ba}(Rb​)ka​=(Fk​)ba​. Then

LΦ,p=KR,p†,LΦ,p=KF,pCA,p.\mathcal L_{\Phi,p}=\mathcal K_{R,p}^\dagger, \qquad \mathcal L_{\Phi,p}=\mathcal K_{F,p}C_{A,p}.LΦ,p​=KR,p†​,LΦ,p​=KF,p​CA,p​.

These assertions include p=1p=1p=1.

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

    Confirmed by the moderator at approval.

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