Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 3: global unconstrained implies constrained additivity

Open
QAlgorithms.Papers.Independent.Gap48.P46.global_unconstrained_iff_constrained

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.

Let global unconstrained additivity mean capacity additivity for every pair of finite-dimensional channels without constraints. Let global constrained additivity mean the corresponding statement for every such pair with every nonempty closed mean constraint pair. Then

global unconstrained additivity⟺global constrained additivity.\text{global unconstrained additivity}\quad\Longleftrightarrow\quad\text{global constrained additivity}.global unconstrained additivity⟺global constrained additivity.

The forward implication is Corollary 3; taking full-state constraints gives the converse. Neither conjecture is assumed to hold unconditionally.

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 p.15, Corollary 3: implication between global conjectures; full-state
constraints supply the reverse implication. -/
theorem global_unconstrained_iff_constrained :
    GlobalUnconstrained ↔ GlobalConstrained := by sorry

end QAlgorithms.Papers.Independent.Gap48.P46

end
Source
On Shor's channel extension and constrained channels, arXiv:quant-ph/0306196v2, PDF p. 15, Corollary 3: global unconstrained implies constrained additivity
Read-back

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

For a finite index set HHH, let D(H)\mathcal D(H)D(H) denote the positive semidefinite complex matrices of trace 111, and put 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)). For a channel Λ\LambdaΛ, 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 all finite ensembles of density matrices with nonnegative weights summing to 111 and average ρ\rhoρ, and define CΛ(S)=sup⁡ρ∈SχΛ(ρ)C_\Lambda(S)=\sup_{\rho\in S}\chi_\Lambda(\rho)CΛ​(S)=supρ∈S​χΛ​(ρ). Channels here are maps with finite Kraus representations X↦∑jVjXVj†X\mapsto\sum_jV_jXV_j^\daggerX↦∑j​Vj​XVj†​, where ∑jVj†Vj=1\sum_jV_j^\dagger V_j=1∑j​Vj†​Vj​=1; their tensor product is the linear extension of X⊗Y↦Φ(X)⊗Ψ(Y)X\otimes Y\mapsto\Phi(X)\otimes\Psi(Y)X⊗Y↦Φ(X)⊗Ψ(Y). The following global assertions are equivalent: for every four finite nonempty index types A,B,C,DA,B,C,DA,B,C,D with decidable equality and every pair of channels Φ:A→B\Phi:A\to BΦ:A→B, Ψ:C→D\Psi:C\to DΨ:C→D, the unrestricted identity

CΦ⊗Ψ(D(A×C))=CΦ(D(A))+CΨ(D(C))C_{\Phi\otimes\Psi}(\mathcal D(A\times C)) =C_\Phi(\mathcal D(A))+C_\Psi(\mathcal D(C))CΦ⊗Ψ​(D(A×C))=CΦ​(D(A))+CΨ​(D(C))

holds; and, for every such choice of types and channels and every pair of nonempty closed sets S⊆D(A)S\subseteq\mathcal D(A)S⊆D(A), T⊆D(C)T\subseteq\mathcal D(C)T⊆D(C), the identity

CΦ⊗Ψ({σ∈D(A×C):tr⁡Cσ∈S, tr⁡Aσ∈T})=CΦ(S)+CΨ(T)C_{\Phi\otimes\Psi} \bigl(\{\sigma\in\mathcal D(A\times C): \operatorname{tr}_C\sigma\in S,\ \operatorname{tr}_A\sigma\in T\}\bigr) =C_\Phi(S)+C_\Psi(T)CΦ⊗Ψ​({σ∈D(A×C):trC​σ∈S, trA​σ∈T})=CΦ​(S)+CΨ​(T)

holds. The constrained sets in the second assertion need not be convex.

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