Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem-2

Open
QAlgorithms.Papers.Independent.Gap20.P04.theorem2

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.

Suppose N\mathcal NN is Hadamard, λ≥1\lambda\ge1λ≥1, and a physical ensemble ρ\rhoρ maximizes χ+λq\chi+\lambda qχ+λq. Then its pair (χρ,qρ)(\chi_\rho,q_\rho)(χρ​,qρ​) belongs to the full CQ capacity region and

C+λQ≤χρ+λqρfor every (C,Q)∈CCQ(N).C+\lambda Q\le\chi_\rho+\lambda q_\rho\qquad \text{for every }(C,Q)\in\mathcal C_{CQ}(\mathcal N).C+λQ≤χρ​+λqρ​for every (C,Q)∈CCQ​(N).

Thus every such optimizer gives a supporting trade-off point; support ties are retained.

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 pp.9--11, Theorem 2: Hadamard is standing in Section IV; all support ties allowed. -/
theorem theorem2 (U : Dilation I B E) (hU : PhysicalDilation U) (hH : Hadamard U)
    (lam : ℝ) (hlam : 1 ≤ lam) (e : PurifiedInputFamily I) (he : e.Valid)
    (hmax : IsGreatest (purifiedValues (cqScore U lam)) (cqScore U lam e)) :
    CQSupport (capacityCQ U) lam (ensembleHolevoBits e.prob (fun x => receiverChannel U (e.input x)), ensembleCoherentBits U e) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P04

end
Source
Trade-off capacities of the quantum Hadamard channels, arXiv:1001.1732v2, PDF p. 9, Theorem-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 sets with decidable equality, and let U:CI→CB⊗CEU:\mathbb C^I\to\mathbb C^B\otimes\mathbb C^EU:CI→CB⊗CE satisfy U†U=1U^\dagger U=1U†U=1. Write BU(ρ)=Tr⁡E(UρU†)\mathcal B_U(\rho)=\operatorname{Tr}_E(U\rho U^\dagger)BU​(ρ)=TrE​(UρU†) and EU(ρ)=Tr⁡B(UρU†)\mathcal E_U(\rho)=\operatorname{Tr}_B(U\rho U^\dagger)EU​(ρ)=TrB​(UρU†). Assume that, after identifying the input with its fixed enumeration by {0,…,∣I∣−1}\{0,\ldots,|I|-1\}{0,…,∣I∣−1}, applying EU\mathcal E_UEU​ to the second factor of every unit pure state on C∣I∣⊗CI\mathbb C^{|I|}\otimes\mathbb C^IC∣I∣⊗CI produces a finite convex combination of products of density matrices. Here a density matrix is positive semidefinite with trace 111. A valid purified input family fff consists of positive integers ℓ,r\ell,rℓ,r, probabilities px≥0p_x\ge0px​≥0 summing to 111, and unit vectors ψx∈Cr⊗CI\psi_x\in\mathbb C^r\otimes\mathbb C^Iψx​∈Cr⊗CI; set ρx=Tr⁡Cr∣ψx⟩⟨ψx∣\rho_x=\operatorname{Tr}_{\mathbb C^r}|\psi_x\rangle\langle\psi_x|ρx​=TrCr​∣ψx​⟩⟨ψx​∣, ρˉ=∑xpxρx\bar\rho=\sum_xp_x\rho_xρˉ​=∑x​px​ρx​, and

χU(f)=S(BU(ρˉ))−∑xpxS(BU(ρx)),QU(f)=∑xpx(S(BU(ρx))−S(EU(ρx))),\chi_U(f)=S(\mathcal B_U(\bar\rho))-\sum_xp_xS(\mathcal B_U(\rho_x)),\qquad Q_U(f)=\sum_xp_x\bigl(S(\mathcal B_U(\rho_x))-S(\mathcal E_U(\rho_x))\bigr),χU​(f)=S(BU​(ρˉ​))−x∑​px​S(BU​(ρx​)),QU​(f)=x∑​px​(S(BU​(ρx​))−S(EU​(ρx​))),

where S(ρ)=−∑jλjlog⁡2λjS(\rho)=-\sum_j\lambda_j\log_2\lambda_jS(ρ)=−∑j​λj​log2​λj​, with 0log⁡20=00\log_2 0=00log2​0=0. Zero probabilities are allowed. For each WWW, define RCQ(W)R_{\mathrm{CQ}}(W)RCQ​(W) as the set of nonnegative pairs (c,q)(c,q)(c,q) satisfying c≤χW(f)c\le\chi_W(f)c≤χW​(f) and q≤QW(f)q\le Q_W(f)q≤QW​(f) for some valid family, and put

CCQ(U)=⋃n≥1{(c,q):(nc,nq)∈RCQ(U(n))}‾,U(b,e),i(n)=∏j<nU(bj,ej),ij.C_{\mathrm{CQ}}(U)= \overline{\bigcup_{n\ge1}\{(c,q):(nc,nq)\in R_{\mathrm{CQ}}(U^{(n)})\}}, \quad U^{(n)}_{(b,e),i}=\prod_{j<n}U_{(b_j,e_j),i_j}.CCQ​(U)=n≥1⋃​{(c,q):(nc,nq)∈RCQ​(U(n))}​,U(b,e),i(n)​=j<n∏​U(bj​,ej​),ij​​.

For every real λ≥1\lambda\ge1λ≥1 and every valid family eee, if χU(e)+λQU(e)\chi_U(e)+\lambda Q_U(e)χU​(e)+λQU​(e) is an attained greatest value of χU(f)+λQU(f)\chi_U(f)+\lambda Q_U(f)χU​(f)+λQU​(f) over all valid families fff, then (χU(e),QU(e))∈CCQ(U)(\chi_U(e),Q_U(e))\in C_{\mathrm{CQ}}(U)(χU​(e),QU​(e))∈CCQ​(U), and every (c,q)∈CCQ(U)(c,q)\in C_{\mathrm{CQ}}(U)(c,q)∈CCQ​(U) satisfies

c+λq≤χU(e)+λQU(e).c+\lambda q\le\chi_U(e)+\lambda Q_U(e).c+λq≤χU​(e)+λQU​(e).
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