Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5.1 / (70),(71): normalized CP encoding replacement

Open
QAlgorithms.Papers.Independent.Gap20.P07.normalizedCP_encodingReplacement

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

prove2quantum

Let H,KH,KH,K have finite dimensions η,κ≥1\eta,\kappa\ge1η,κ≥1, let ρ\rhoρ be a density matrix on HHH, let E:H→KE:H\to KE:H→K be completely positive with tr⁡E(ρ)=1\operatorname{tr}E(\rho)=1trE(ρ)=1, and let T:K→HT:K\to HT:K→H be CPTP. No trace condition on EEE at other inputs is assumed. There exists a CPTP replacement E~\widetilde EE such that

Fe(ρ,TE~)≥Fe(ρ,TE)2.F_e(\rho,T\widetilde E)\ge F_e(\rho,TE)^2.Fe​(ρ,TE)≥Fe​(ρ,TE)2.

If η≤κ\eta\le\kappaη≤κ, it has the form E~(X)=VXV∗\widetilde E(X)=VXV^*E(X)=VXV∗ for an isometry V:H→KV:H\to KV:H→K. If η>κ\eta>\kappaη>κ, it has the form

E~(X)=W∗XW+tr⁡((IH−WW∗)X)κIK\widetilde E(X)=W^*XW+\frac{\operatorname{tr}((I_H-WW^*)X)}{\kappa}I_KE(X)=W∗XW+κtr((IH​−WW∗)X)​IK​

for an isometry W:K→HW:K\to HW:K→H. Fidelity is the unnormalized squared CP-map formula. Both dimensional branches belong to the replacement result.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped Topology ENNReal NNReal Matrix ComplexOrder ComplexConjugate

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus

namespace QAlgorithms.Papers.Independent.Gap20.P07

open QAlgorithms

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsTraceClass IsTraceClassChannel traceSize rankOne tensorApply)

open QAlgorithms.Papers.Independent.Frontier30.P14
  (Operation isometryCoeff conjugateKernel)

open QAlgorithms.Papers.Independent.Claimed50.P35
  (stabilizedTraceClassNorm traceClassTensorMap traceClassChannelPower
   transpose transposeBound TraceLinear tracePair MeasurePrepare)

open QAlgorithms.Papers.Independent.Gap48.P29 (fe FiniteCPMap)

/-- PDF pp.20--22, Proposition 5.1, (70)--(71): E is CP and normalized only on
rho. Both dimension branches and their isometry directions are retained. -/
theorem normalizedCP_encodingReplacement (eta kappa : ℕ) (heta : 0 < eta) (hkappa : 0 < kappa)
    (rho : Matrix (Fin eta) (Fin eta) ℂ) (hrho : IsDensityMatrix rho)
    (E : Superop (Fin eta) (Fin kappa)) (hE : FiniteCPMap E) (htrace : (E rho).trace = 1)
    (T : Superop (Fin kappa) (Fin eta)) (hT : IsChannel T) :
    ∃ replacement : Superop (Fin eta) (Fin kappa), IsChannel replacement ∧
      (fe rho (T ∘ E))^2 ≤ fe rho (T ∘ replacement) ∧
      (eta ≤ kappa → ∃ V : Matrix (Fin kappa) (Fin eta) ℂ,
        V.conjTranspose * V = 1 ∧ ∀ X, replacement X = V * X * V.conjTranspose) ∧
      (kappa < eta → ∃ W : Matrix (Fin eta) (Fin kappa) ℂ,
        W.conjTranspose * W = 1 ∧ ∀ X,
          replacement X = W.conjTranspose * X * W +
            ((((1 - W * W.conjTranspose) * X).trace / (kappa : ℂ))) • 1) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 20, Proposition 5.1 / (70),(71): normalized CP encoding replacement
Read-back

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

For all positive integers η,κ\eta,\kappaη,κ, every positive semidefinite ρ∈Mη(C)\rho\in M_\eta(\mathbb C)ρ∈Mη​(C) with tr⁡ρ=1\operatorname{tr}\rho=1trρ=1, every map E:Mη(C)→Mκ(C)E:M_\eta(\mathbb C)\to M_\kappa(\mathbb C)E:Mη​(C)→Mκ​(C) equal on all matrices to a complex linear map whose blockwise amplification id⁡[r]⊗E\operatorname{id}_{[r]}\otimes Eid[r]​⊗E preserves positive semidefiniteness for every r∈Nr\in\mathbb Nr∈N, and every map T:Mκ(C)→Mη(C)T:M_\kappa(\mathbb C)\to M_\eta(\mathbb C)T:Mκ​(C)→Mη​(C) admitting a finite Kraus representation with ∑aKa†Ka=Iκ\sum_aK_a^\dagger K_a=I_\kappa∑a​Ka†​Ka​=Iκ​, suppose that the complex trace satisfies tr⁡(E(ρ))=1\operatorname{tr}(E(\rho))=1tr(E(ρ))=1. There then exists a map E′:Mη(C)→Mκ(C)E':M_\eta(\mathbb C)\to M_\kappa(\mathbb C)E′:Mη​(C)→Mκ​(C) admitting a finite Kraus representation with identity Kraus sum such that

Fe(ρ,T∘E)2≤Fe(ρ,T∘E′),Fe(ρ,L)=Re⁡∑i,j,k,ℓ=0η−1ρjiρℓk‾ [L(Ejℓ)]ik,F_e(\rho,T\circ E)^2\le F_e(\rho,T\circ E'), \qquad F_e(\rho,L)= \operatorname{Re}\sum_{i,j,k,\ell=0}^{\eta-1} \rho_{ji}\overline{\rho_{\ell k}}\,[L(E_{j\ell})]_{ik},Fe​(ρ,T∘E)2≤Fe​(ρ,T∘E′),Fe​(ρ,L)=Rei,j,k,ℓ=0∑η−1​ρji​ρℓk​​[L(Ejℓ​)]ik​,

where EjℓE_{j\ell}Ejℓ​ denotes a matrix unit. Moreover, if η≤κ\eta\le\kappaη≤κ, there is V∈Mκ×η(C)V\in M_{\kappa\times\eta}(\mathbb C)V∈Mκ×η​(C) with V†V=IηV^\dagger V=I_\etaV†V=Iη​ and E′(X)=VXV†E'(X)=VXV^\daggerE′(X)=VXV† for every XXX; if κ<η\kappa<\etaκ<η, there is W∈Mη×κ(C)W\in M_{\eta\times\kappa}(\mathbb C)W∈Mη×κ​(C) with W†W=IκW^\dagger W=I_\kappaW†W=Iκ​ and, for every XXX,

E′(X)=W†XW+tr⁡((Iη−WW†)X)κ Iκ.E'(X)=W^\dagger XW+ \frac{\operatorname{tr}((I_\eta-WW^\dagger)X)}{\kappa}\,I_\kappa.E′(X)=W†XW+κtr((Iη​−WW†)X)​Iκ​.

The hypotheses impose normalization of EEE at ρ\rhoρ and do not impose a trace nonincrease condition on EEE. Equality of the dimensions falls under the first alternative.

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