Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary-2

Open
QAlgorithms.Papers.Independent.Gap20.P04.corollary2

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

prove2quantum

Let N\mathcal NN be a CPTP channel on nonzero finite-dimensional registers, with receiver and environment obtained by tracing the same Stinespring isometry. Optimize over all finite classical labels XXX, probability distributions, and normalized pure conditional states on a finite reference AAA and input A′A'A′. For the resulting state, write χ=I(X;B)\chi=I(X;B)χ=I(X;B), q=I(A⟩BX)q=I(A\rangle BX)q=I(A⟩BX), a=H(A∣X)a=H(A|X)a=H(A∣X), and j=I(AX;B)j=I(AX;B)j=I(AX;B), with entropy in bits. Rates are nonnegative, and EEE denotes consumed ebits. The capacity regions are the closures of positive-blocklength scaled unions in Section III; their one-use unions have no added closure.

For a Hadamard channel, 0≤λ≤10\le\lambda\le10≤λ≤1, and integer n≥1n\ge1n≥1,

gλ(N⊗n)=ngλ(N),CCE(N)=CCE(1)(N),g_\lambda(\mathcal N^{\otimes n})=n g_\lambda(\mathcal N),\qquad \mathcal C_{CE}(\mathcal N)=\mathcal C^{(1)}_{CE}(\mathcal N),gλ​(N⊗n)=ngλ​(N),CCE​(N)=CCE(1)​(N),

where gλ=max⁡(j−λa)g_\lambda=\max(j-\lambda a)gλ​=max(j−λa) and both scalar maxima are attained. This identifies the full CE boundary including flat portions.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P04
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap20.P04

open QAlgorithms

open QAlgorithms.Papers.Independent.Claimed50.P24
  (Dilation PhysicalDilation ChannelEB Hadamard EqualMax AdditiveMax
   dephasingDilation dephasingGamma cloningDilation)

open QAlgorithms.Papers.Independent.Information100.P67
  (receiverChannel complementaryChannel dilationPower)

open QAlgorithms.Papers.Independent.Information100.P32 (diagonal)

open QAlgorithms.Papers.Independent.Dependency50.P24 (ensembleHolevoBits)

open QAlgorithms.Papers.Independent.Gap48.P44 (cqTimeSharing ceTimeSharing)

open scoped BigOperators Matrix ComplexConjugate

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I B E J D F : Type}

variable [Fintype I] [Fintype B] [Fintype E]

variable [Fintype J] [Fintype D] [Fintype F]

variable [DecidableEq I] [DecidableEq B] [DecidableEq E]

variable [DecidableEq J] [DecidableEq D] [DecidableEq F]

variable [Nonempty I] [Nonempty B] [Nonempty E]

variable [Nonempty J] [Nonempty D] [Nonempty F]

/-- PDF p.20, Corollary 2: attained block additivity and full CE single-letterization. -/
theorem corollary2 (U : Dilation I B E) (hU : PhysicalDilation U) (hH : Hadamard U)
    (lam : ℝ) (h0 : 0 ≤ lam) (h1 : lam ≤ 1) (n : ℕ) (hn : 0 < n) :
    RepeatedMax n (purifiedValues (ceScore U lam)) (purifiedValues (ceScore (dilationPower U n) lam)) ∧
      capacityCE U = oneCE U := by sorry

end QAlgorithms.Papers.Independent.Gap20.P04

end
Source
Trade-off capacities of the quantum Hadamard channels, arXiv:1001.1732v2, PDF p. 20, Corollary-2
Read-back

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

Let I,B,EI,B,EI,B,E be finite nonempty index types with decidable equality, and let U:CI→CB×EU:\mathbb C^I\to\mathbb C^{B\times E}U:CI→CB×E satisfy U†U=1U^\dagger U=1U†U=1. Assume that applying its complementary map to the second factor of every unit-vector projector on CI⊗CI\mathbb C^I\otimes\mathbb C^ICI⊗CI yields a finite convex combination of products of positive semidefinite trace-one matrices. For a dilation TTT, let BT,ET\mathcal B_T,\mathcal E_TBT​,ET​ be its receiver and environment partial-trace maps, and let H(X)=−Re⁡Tr⁡[x↦xlog⁡2x](X)H(X)=-\operatorname{Re}\operatorname{Tr}[x\mapsto x\log_2x](X)H(X)=−ReTr[x↦xlog2​x](X), using continuous functional calculus. For each valid purified family—positive finite label and reference dimensions, probabilities px≥0p_x\ge0px​≥0 summing to 111, and unit purifications with reduced input matrices ρx\rho_xρx​—put

h(e)=∑xpxH(ρx),JT(e)=h(e)+H ⁣(BT ⁣(∑xpxρx))−∑xpxH(ET(ρx)).h(e)=\sum_xp_xH(\rho_x),\qquad J_T(e)=h(e)+H\!\left(\mathcal B_T\!\left(\sum_xp_x\rho_x\right)\right) -\sum_xp_xH(\mathcal E_T(\rho_x)).h(e)=x∑​px​H(ρx​),JT​(e)=h(e)+H(BT​(x∑​px​ρx​))−x∑​px​H(ET​(ρx​)).

For every 0≤λ≤10\le\lambda\le10≤λ≤1 and every positive integer nnn, there is a real vvv that is an attained greatest value of JU(e)−λh(e)J_U(e)-\lambda h(e)JU​(e)−λh(e), while nvnvnv is an attained greatest value of JU(n)(e)−λh(e)J_{U^{(n)}}(e)-\lambda h(e)JU(n)​(e)−λh(e), where

U(b,e),i(m)=∏j=0m−1U(bj,ej),ij.U^{(m)}_{(\mathbf b,\mathbf e),\mathbf i}=\prod_{j=0}^{m-1}U_{(b_j,e_j),i_j}.U(b,e),i(m)​=j=0∏m−1​U(bj​,ej​),ij​​.

Moreover, defining

CT={(c,a):c,a≥0, ∃ valid e, c≤JT(e), h(e)≤a},\mathcal C_T=\{(c,a):c,a\ge0,\ \exists\text{ valid }e,\ c\le J_T(e),\ h(e)\le a\},CT​={(c,a):c,a≥0, ∃ valid e, c≤JT​(e), h(e)≤a},

one has

{r∈R2:∃m≥1, mr∈CU(m)}‾=CU.\overline{\{r\in\mathbb R^2:\exists m\ge1,\ mr\in\mathcal C_{U^{(m)}}\}}=\mathcal C_U.{r∈R2:∃m≥1, mr∈CU(m)​}​=CU​.

The closure is in the usual topology; zero probabilities are permitted, and zero block lengths are excluded from the displayed regularization.

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