Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6: block additivity and operational single-letterization

Open
QAlgorithms.Papers.Independent.Gap48.P46.operational_single_letterization

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

prove2quantum

All quantum systems are nonzero finite-dimensional complex Hilbert spaces. States are positive semidefinite trace-one matrices, and channels are CPTP maps on the full matrix algebra. All entropies and logarithms are in bits. An ensemble is a finite probability distribution of states, with zero weights permitted. For a channel Φ\PhiΦ, write χΦ(ρ)\chi_\Phi(\rho)χΦ​(ρ) for the maximum ensemble Holevo information at mean ρ\rhoρ, H^Φ(ρ)\widehat H_\Phi(\rho)HΦ​(ρ) for the minimum average output entropy at that mean, and C‾(Φ;A)\overline C(\Phi;\mathcal A)C(Φ;A) for the maximum of χΦ\chi_\PhiχΦ​ over a nonempty closed mean constraint A\mathcal AA.

Fix a channel Φ\PhiΦ, a positive observable AAA, and a feasible nonnegative budget α\alphaα. For n≥1n\ge1n≥1 let A(n)=∑i=1nI⊗(i−1)⊗A⊗I⊗(n−i)A^{(n)}=\sum_{i=1}^nI^{\otimes(i-1)}\otimes A\otimes I^{\otimes(n-i)}A(n)=∑i=1n​I⊗(i−1)⊗A⊗I⊗(n−i). Assume the nnn-use weak allocation identity for every n≥1n\ge1n≥1: the block capacity is the attained maximum of ∑iC‾(Φ;A,αi)\sum_i\overline C(\Phi;A,\alpha_i)∑i​C(Φ;A,αi​) over feasible allocations with ∑iαi=nα\sum_i\alpha_i=n\alpha∑i​αi​=nα. Then

C‾(Φ⊗n;A(n),nα)=nC‾(Φ;A,α)(n≥1),C(Φ;A,α)=C‾(Φ;A,α).\overline C(\Phi^{\otimes n};A^{(n)},n\alpha)=n\overline C(\Phi;A,\alpha)\quad(n\ge1),\qquad C(\Phi;A,\alpha)=\overline C(\Phi;A,\alpha).C(Φ⊗n;A(n),nα)=nC(Φ;A,α)(n≥1),C(Φ;A,α)=C(Φ;A,α).

Operational CCC is the supremum of nonnegative rates achievable by collective block encoders and decoding POVMs with vanishing maximum message error, each codeword satisfying its additive budget. Integer message counts and asymptotic rates in bits are used. It is not defined by the regularization identity cited from [2].

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P46
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P46

open scoped Matrix ComplexConjugate ENNReal ComplexOrder

open Filter

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)

open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntropyBits)

open QAlgorithms.Papers.Independent.Dependency50.P23 (IsEB)

open QAlgorithms.Papers.Independent.Information100.P08
  (Ensemble ensembleAverage outputHolevo mixedRoof)

variable {I O J K : Type} [Fintype I] [Fintype O] [Fintype J] [Fintype K]

variable [DecidableEq I] [DecidableEq O] [DecidableEq J] [DecidableEq K]

/-- PDF pp.15–16, §6: the conditional n-use weak identity implies block additivity
and single-letter operational capacity. The operational capacity is defined by codes. -/
theorem operational_single_letterization [Nonempty I] [Nonempty O]
    (Phi : Superop I O) (hPhi : IsChannel Phi) (A : Matrix I I ℂ) (hA : A.PosSemidef)
    (alpha : ℝ) (halpha : alpha ∈ budgetDomain A) (hweak : BlockWeak Phi A alpha) :
    (∀ n : ℕ, 1 ≤ n → constrainedChiCapacity (piSuperop (fun _ : Fin n => Phi))
      (linearConstraint (blockObservable A n) ((n : ℝ) * alpha)) =
        (n : ℝ) * constrainedChiCapacity Phi (linearConstraint A alpha)) ∧
    constrainedOperationalCapacity Phi A alpha = constrainedChiCapacity Phi (linearConstraint A alpha) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P46

end
Source
On Shor's channel extension and constrained channels, arXiv:quant-ph/0306196v2, PDF p. 16, §6: block additivity and operational single-letterization
Read-back

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

Let I,OI,OI,O be finite nonempty sets with decidable equality, let Φ\PhiΦ be a channel with a finite Kraus representation satisfying ∑jVj†Vj=1\sum_jV_j^\dagger V_j=1∑j​Vj†​Vj​=1, and let A≥0A\ge0A≥0 be a matrix on III. A density matrix is positive semidefinite with trace 111. Define H(X)=−Re⁡tr⁡(cfc⁡[x↦xlog⁡2x](X))H(X)=-\operatorname{Re}\operatorname{tr}(\operatorname{cfc}[x\mapsto x\log_2x](X))H(X)=−Retr(cfc[x↦xlog2​x](X)), define χΛ(ρ)\chi_\Lambda(\rho)χΛ​(ρ) as the supremum of H(Λ(ρ))−∑jpjH(Λ(ρj))H(\Lambda(\rho))-\sum_jp_jH(\Lambda(\rho_j))H(Λ(ρ))−∑j​pj​H(Λ(ρj​)) over finite density-matrix ensembles with nonnegative weights summing to 111 and average ρ\rhoρ, and put CΛ(S)=sup⁡ρ∈SχΛ(ρ)C_\Lambda(S)=\sup_{\rho\in S}\chi_\Lambda(\rho)CΛ​(S)=supρ∈S​χΛ​(ρ). Set SA(a)={ρ density:Re⁡tr⁡(Aρ)≤a}S_A(a)=\{\rho\text{ density}:\operatorname{Re}\operatorname{tr}(A\rho)\le a\}SA​(a)={ρ density:Retr(Aρ)≤a}, DA={a≥0:SA(a)≠∅}D_A=\{a\ge0:S_A(a)\ne\varnothing\}DA​={a≥0:SA​(a)=∅}, and fix α∈DA\alpha\in D_Aα∈DA​. For n≥1n\ge1n≥1, let A(n)=∑i=0n−11⊗i⊗A⊗1⊗(n−i−1)A^{(n)}=\sum_{i=0}^{n-1}1^{\otimes i}\otimes A\otimes1^{\otimes(n-i-1)}A(n)=∑i=0n−1​1⊗i⊗A⊗1⊗(n−i−1), and let Φ⊗n\Phi^{\otimes n}Φ⊗n act on each factor by Φ\PhiΦ, extended linearly from elementary tensors. Assume that, for every n≥1n\ge1n≥1, CΦ⊗n(SA(n)(nα))C_{\Phi^{\otimes n}}(S_{A^{(n)}}(n\alpha))CΦ⊗n​(SA(n)​(nα)) equals the supremum of ∑iCΦ(SA(ai))\sum_iC_\Phi(S_A(a_i))∑i​CΦ​(SA​(ai​)) over allocations ai∈DAa_i\in D_Aai​∈DA​ with ∑iai=nα\sum_i a_i=n\alpha∑i​ai​=nα, and that this supremum is attained. Then

CΦ⊗n(SA(n)(nα))=nCΦ(SA(α))(n≥1),Cop=CΦ(SA(α)).C_{\Phi^{\otimes n}}(S_{A^{(n)}}(n\alpha)) =nC_\Phi(S_A(\alpha))\quad(n\ge1), \qquad C_{\mathrm{op}}=C_\Phi(S_A(\alpha)).CΦ⊗n​(SA(n)​(nα))=nCΦ​(SA​(α))(n≥1),Cop​=CΦ​(SA​(α)).

Here CopC_{\mathrm{op}}Cop​ is the supremum of all R≥0R\ge0R≥0 such that, for every real ϵ,δ>0\epsilon,\delta>0ϵ,δ>0, there exists a natural N≥1N\ge1N≥1 such that every n≥Nn\ge Nn≥N admits a positive number MMM of messages, density matrices ρw\rho_wρw​ on InI^nIn, and positive semidefinite measurement matrices QwQ_wQw​ on OnO^nOn with ∑wQw=1\sum_wQ_w=1∑w​Qw​=1, satisfying, for every message www, Re⁡tr⁡(A(n)ρw)≤nα\operatorname{Re}\operatorname{tr}(A^{(n)}\rho_w)\le n\alphaRetr(A(n)ρw​)≤nα and Re⁡tr⁡(QwΦ⊗n(ρw))≥1−ϵ\operatorname{Re}\operatorname{tr}(Q_w\Phi^{\otimes n}(\rho_w))\ge1-\epsilonRetr(Qw​Φ⊗n(ρw​))≥1−ϵ, together with n(R−δ)≤log⁡2Mn(R-\delta)\le\log_2Mn(R−δ)≤log2​M.

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