Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2: constrained versus asymptotic extension additivity

Open
QAlgorithms.Papers.Independent.Gap48.P46.constrained_iff_asymptotic

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. The constraint A⊗B\mathcal A\otimes\mathcal BA⊗B includes every joint density with first marginal in A\mathcal AA and second marginal in B\mathcal BB, including correlated and entangled states.

Fix channels Φ,Ψ\Phi,\PsiΦ,Ψ and a nonempty closed constraint B\mathcal BB on Ψ\PsiΨ. Additivity for Φ\PhiΦ with every nonempty closed constraint A\mathcal AA and for Ψ\PsiΨ with constraint B\mathcal BB is equivalent to the following assertion: for every effect EEE and every λ≥0\lambda\ge0λ≥0, both extension limits exist and

lim⁡d→∞C‾(Φ^(E,λ/log⁡2d,d)⊗Ψ;SΦ^⊗B)=lim⁡d→∞C‾(Φ^(E,λ/log⁡2d,d))+C‾(Ψ;B).\lim_{d\to\infty}\overline C(\widehat\Phi(E,\lambda/\log_2d,d)\otimes\Psi;S_{\widehat\Phi}\otimes\mathcal B)=\lim_{d\to\infty}\overline C(\widehat\Phi(E,\lambda/\log_2d,d))+\overline C(\Psi;\mathcal B).d→∞lim​C(Φ(E,λ/log2​d,d)⊗Ψ;SΦ​⊗B)=d→∞lim​C(Φ(E,λ/log2​d,d))+C(Ψ;B).

The limits use the admissible tail d≥2d\ge2d≥2, λ≤log⁡2d\lambda\le\log_2dλ≤log2​d. The set B\mathcal BB need not be convex. This is the paper's fixed-pair constrained/asymptotic equivalence.

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.13–15, Theorem 2: fixed closed B, all closed A, iff every nonnegative
Shor tilt is asymptotically additive. B is not required to be convex. -/
theorem constrained_iff_asymptotic [Nonempty I] [Nonempty O] [Nonempty J] [Nonempty K]
    (Phi : Superop I O) (Psi : Superop J K) (hPhi : IsChannel Phi) (hPsi : IsChannel Psi)
    (B : Set (Matrix J J ℂ)) (hB : Constraint B) :
    (∀ A, Constraint A → ConstrainedAdditive Phi Psi A B) ↔ AsymptoticAdditive Phi Psi B := by sorry

end QAlgorithms.Papers.Independent.Gap48.P46

end
Source
On Shor's channel extension and constrained channels, arXiv:quant-ph/0306196v2, PDF p. 13, Theorem 2: constrained versus asymptotic extension additivity
Read-back

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

Let I,O,J,KI,O,J,KI,O,J,K be finite nonempty sets with decidable equality, let Φ:I→O\Phi:I\to OΦ:I→O and Ψ:J→K\Psi:J\to KΨ:J→K denote channels on matrix spaces, and let BBB be a nonempty closed set of density matrices on JJJ, not necessarily convex. A density matrix is positive semidefinite with trace 111, and a channel has a finite representation Λ(X)=∑jVjXVj†\Lambda(X)=\sum_jV_jXV_j^\daggerΛ(X)=∑j​Vj​XVj†​ with ∑jVj†Vj=1\sum_jV_j^\dagger V_j=1∑j​Vj†​Vj​=1. With 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)), let χΛ(ρ)\chi_\Lambda(\rho)χΛ​(ρ) be the supremum of H(Λ(ρ))−∑ipiH(Λ(ρi))H(\Lambda(\rho))-\sum_i p_iH(\Lambda(\rho_i))H(Λ(ρ))−∑i​pi​H(Λ(ρi​)) over finite density-matrix ensembles with nonnegative weights summing to 111 and average ρ\rhoρ, and let CΛ(S)=sup⁡ρ∈SχΛ(ρ)C_\Lambda(S)=\sup_{\rho\in S}\chi_\Lambda(\rho)CΛ​(S)=supρ∈S​χΛ​(ρ). Tensor products of channels act as (Φ⊗Ψ)(X⊗Y)=Φ(X)⊗Ψ(Y)(\Phi\otimes\Psi)(X\otimes Y)=\Phi(X)\otimes\Psi(Y)(Φ⊗Ψ)(X⊗Y)=Φ(X)⊗Ψ(Y), extended linearly. The following two properties are equivalent: for every nonempty closed set AAA of density matrices on III,

CΦ⊗Ψ({σ density:tr⁡Jσ∈A, tr⁡Iσ∈B})=CΦ(A)+CΨ(B);C_{\Phi\otimes\Psi} \bigl(\{\sigma\text{ density}:\operatorname{tr}_J\sigma\in A,\ \operatorname{tr}_I\sigma\in B\}\bigr) =C_\Phi(A)+C_\Psi(B);CΦ⊗Ψ​({σ density:trJ​σ∈A, trI​σ∈B})=CΦ​(A)+CΨ​(B);

and, for every matrix EEE with E≥0E\ge0E≥0 and 1−E≥01-E\ge01−E≥0, and every real λ≥0\lambda\ge0λ≥0, there exists a real LLL such that the following two sequences converge to LLL and L+CΨ(B)L+C_\Psi(B)L+CΨ​(B), respectively. At a natural index ddd satisfying d≥2d\ge2d≥2 and λ≤log⁡2d\lambda\le\log_2dλ≤log2​d, their values are the unrestricted capacity CTd(D(I×{0,…,d−1}))C_{\mathcal T_d}(\mathcal D(I\times\{0,\ldots,d-1\}))CTd​​(D(I×{0,…,d−1})) and the capacity of Td⊗Ψ\mathcal T_d\otimes\PsiTd​⊗Ψ constrained only by the JJJ-marginal lying in BBB; at every other index both values are 000. Here D\mathcal DD denotes the set of density matrices, q=λ/log⁡2dq=\lambda/\log_2dq=λ/log2​d, and Td(X)\mathcal T_d(X)Td​(X) is block diagonal with OOO-block (1−q)Φ(tr⁡labelX)(1-q)\Phi(\operatorname{tr}_{\mathrm{label}}X)(1−q)Φ(trlabel​X), scalar “none” entry qtr⁡((1−E)tr⁡labelX)q\operatorname{tr}((1-E)\operatorname{tr}_{\mathrm{label}}X)qtr((1−E)trlabel​X), and scalar entries qtr⁡(EXkk)q\operatorname{tr}(EX_{kk})qtr(EXkk​) for labels k<dk<dk<d.

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