Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7.4: convexity of both capacity regions

Open
QAlgorithms.Papers.Independent.Support50.P02.capacity_convex

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

prove2quantum

Let N:A′B′→C\mathcal N:A'B'\to CN:A′B′→C be a completely positive, trace-preserving channel between finite, positive-dimensional complex quantum registers. Alice and Bob control separate inputs. Codes use independent sender preparations, local encoders, one joint memoryless channel and one joint decoder, with external references untouched and no free shared resources. Fidelity is squared Uhlmann fidelity, trace distance is the full trace norm, and entropies are in bits. Write CQ(N)CQ(\mathcal N)CQ(N) and Q(N)Q(\mathcal N)Q(N) for the closed operational classical–quantum and quantum–quantum capacity regions, using joint output fidelity and nonnegative rates.

For either K=CQ(N)\mathcal K=CQ(\mathcal N)K=CQ(N) or K=Q(N)\mathcal K=Q(\mathcal N)K=Q(N), any u,v∈Ku,v\in\mathcal Ku,v∈K and any λ∈[0,1]\lambda\in[0,1]λ∈[0,1] satisfy

λu+(1−λ)v∈K.\lambda u+(1-\lambda)v\in\mathcal K.λu+(1−λ)v∈K.

Thus both full operational capacity regions are convex. No extra convex-hull operation is added to the regularized capacity descriptions.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P02
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate

namespace QAlgorithms.Papers.Independent.Support50.P02

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

open QAlgorithms.Papers.Independent.Information100.P21 (Op)

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

open QAlgorithms.Papers.Independent.Dependency50.P19 (epr)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C E R S I J : Type*}

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

variable [Fintype C] [DecidableEq C] [Fintype E] [DecidableEq E]

variable [Fintype R] [DecidableEq R] [Fintype S] [DecidableEq S]

variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

/-- Convexity of BOTH full operational capacity regions, §7.4, PDF p.35,
announced p.8. Convexification is not inserted into any capacity formula. -/
theorem capacity_convex [Nonempty A] [Nonempty B] [Nonempty C]
    (N : Superop (A × B) C) (hN : IsChannel N) :
    Convex ℝ (cqMacCapacity N) ∧ Convex ℝ (qqMacCapacity N) := by sorry

end QAlgorithms.Papers.Independent.Support50.P02

end
Source
Capacity Theorems for Quantum Multiple Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions, arXiv:quant-ph/0501045v3, PDF p. 8, §7.4: convexity of both capacity regions
Read-back

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

For arbitrary nonempty finite types A,B,CA,B,CA,B,C, each with decidable equality, and every map NNN from complex matrices on A×BA\times BA×B to complex matrices on CCC admitting a finite Kraus representation N(X)=∑jKjXKj†N(X)=\sum_jK_jXK_j^\daggerN(X)=∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, both its classical–quantum generation region and its quantum–quantum generation region are convex subsets of R2\mathbb R^2R2. Each region is defined as the closure of the nonnegative pairs rrr for which every ϵ,δ>0\epsilon,\delta>0ϵ,δ>0 admits n0>0n_0>0n0​>0 such that every n≥n0n\ge n_0n≥n0​ has positive message or reference dimensions a,ba,ba,b, with r1−δ≤log⁡2a/nr_1-\delta\le\log_2a/nr1​−δ≤log2​a/n and r2−δ≤log⁡2b/nr_2-\delta\le\log_2b/nr2​−δ≤log2​b/n, and a generation protocol of error at most ϵ\epsilonϵ. In the classical–quantum case such a protocol consists of unit vectors αs\alpha_sαs​ on AnA^nAn, one for every s<as<as<a, a unit vector β\betaβ on a bbb-dimensional reference and BnB^nBn, and a decoding channel from CnC^nCn to an aaa-dimensional classical output and a bbb-dimensional output; its requirement is

1−ϵ≤1a∑s<aF ⁣(∣s⟩⟨s∣⊗Φb,ω^s),1-\epsilon\le\frac1a\sum_{s<a} F\!\left(|s\rangle\langle s|\otimes\Phi_b,\widehat\omega_s\right),1−ϵ≤a1​s<a∑​F(∣s⟩⟨s∣⊗Φb​,ωs​),

where ω^s\widehat\omega_sωs​ is obtained by applying NNN independently to the input pairs, decoding while retaining the reference, and setting entries between different classical output labels to zero. In the quantum–quantum case the inputs are independent unit vectors α\alphaα on an aaa-dimensional reference and AnA^nAn, and β\betaβ on a bbb-dimensional reference and BnB^nBn; a decoding channel from CnC^nCn to dimensions a,ba,ba,b must produce, with the references retained, a matrix ω\omegaω satisfying 1−ϵ≤F(Φa⊗Φb,ω)1-\epsilon\le F(\Phi_a\otimes\Phi_b,\omega)1−ϵ≤F(Φa​⊗Φb​,ω). Every decoding channel has a finite Kraus representation with the same completeness condition. Here Φk\Phi_kΦk​ is the projector onto k−1/2∑i<k∣i,i⟩k^{-1/2}\sum_{i<k}|i,i\ranglek−1/2∑i<k​∣i,i⟩, and F(X,Y)=(Re⁡tr⁡X YX)2F(X,Y)=(\operatorname{Re}\operatorname{tr}\sqrt{\sqrt X\,Y\sqrt X})^2F(X,Y)=(RetrX​YX​​)2, using continuous functional calculus. Convexity means that for either of these closed regions, any two points r,sr,sr,s in it and any real u,v≥0u,v\ge0u,v≥0 with u+v=1u+v=1u+v=1 have ur+vsur+vsur+vs in that same region.

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

    Confirmed by the moderator at approval.

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