Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem-3

Open
QAlgorithms.Papers.Independent.Gap20.P04.theorem3

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.

Let N\mathcal NN be Hadamard and 0≤λ≤10\le\lambda\le10≤λ≤1. If ρ\rhoρ maximizes j−λaj-\lambda aj−λa, then (jρ,aρ)(j_\rho,a_\rho)(jρ​,aρ​) lies in the full CE region and

C≤jρwhenever (C,E)∈CCE(N) and E≤aρ.C\le j_\rho\qquad\text{whenever }(C,E)\in\mathcal C_{CE}(\mathcal N) \text{ and }E\le a_\rho.C≤jρ​whenever (C,E)∈CCE​(N) and E≤aρ​.

This is the upper classical-rate boundary at that consumption budget, allowing flat portions at λ=0\lambda=0λ=0. It need not select the least consumption among all tied classical-rate optimizers.

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.11,19--20, Theorem 3: upper C(E), with the flat lam=0 endpoint retained. -/
theorem theorem3 (U : Dilation I B E) (hU : PhysicalDilation U) (hH : Hadamard U)
    (lam : ℝ) (h0 : 0 ≤ lam) (h1 : lam ≤ 1)
    (e : PurifiedInputFamily I) (he : e.Valid)
    (hmax : IsGreatest (purifiedValues (ceScore U lam)) (ceScore U lam e)) :
    CEUpper (capacityCE U) (jointInfo U e, inputEntropy e) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P04

end
Source
Trade-off capacities of the quantum Hadamard channels, arXiv:1001.1732v2, PDF p. 11, Theorem-3
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. For any such matrix WWW, write BW(ρ)=Tr⁡environment(WρW†)\mathcal B_W(\rho)=\operatorname{Tr}_{\mathrm{environment}}(W\rho W^\dagger)BW​(ρ)=Trenvironment​(WρW†) and EW(ρ)=Tr⁡receiver(WρW†)\mathcal E_W(\rho)=\operatorname{Tr}_{\mathrm{receiver}}(W\rho W^\dagger)EW​(ρ)=Trreceiver​(WρW†). Assume that applying EU\mathcal E_UEU​ to the input factor of every unit pure state with a reference of dimension ∣I∣|I|∣I∣, using the fixed enumeration of III, produces a finite convex combination of products of positive semidefinite trace-one matrices. 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⊗Cinput(W)\psi_x\in\mathbb C^r\otimes\mathbb C^{\mathrm{input}(W)}ψx​∈Cr⊗Cinput(W); zero probabilities are allowed. Put ρ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

a(f)=∑xpxS(ρx),JW(f)=a(f)+S(BW(ρˉ))−∑xpxS(EW(ρx)),a(f)=\sum_xp_xS(\rho_x),\qquad J_W(f)=a(f)+S(\mathcal B_W(\bar\rho))-\sum_xp_xS(\mathcal E_W(\rho_x)),a(f)=x∑​px​S(ρx​),JW​(f)=a(f)+S(BW​(ρˉ​))−x∑​px​S(EW​(ρ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. Define RCE(W)R_{\mathrm{CE}}(W)RCE​(W) to consist of the nonnegative pairs (c,e)(c,e)(c,e) for which some valid family fff satisfies c≤JW(f)c\le J_W(f)c≤JW​(f) and a(f)≤ea(f)\le ea(f)≤e, and define

CCE(U)=⋃n≥1{(c,e):(nc,ne)∈RCE(U(n))}‾,U(b,e),i(n)=∏j<nU(bj,ej),ij.C_{\mathrm{CE}}(U)=\overline{\bigcup_{n\ge1}\{(c,e):(nc,ne)\in R_{\mathrm{CE}}(U^{(n)})\}}, \qquad U^{(n)}_{(b,e),i}=\prod_{j<n}U_{(b_j,e_j),i_j}.CCE​(U)=n≥1⋃​{(c,e):(nc,ne)∈RCE​(U(n))}​,U(b,e),i(n)​=j<n∏​U(bj​,ej​),ij​​.

For every 0≤λ≤10\le\lambda\le10≤λ≤1 and every valid family eee, if JU(e)−λa(e)J_U(e)-\lambda a(e)JU​(e)−λa(e) is an attained greatest value of JU(f)−λa(f)J_U(f)-\lambda a(f)JU​(f)−λa(f) over all valid families fff, then (JU(e),a(e))∈CCE(U)(J_U(e),a(e))\in C_{\mathrm{CE}}(U)(JU​(e),a(e))∈CCE​(U), and every (c,t)∈CCE(U)(c,t)\in C_{\mathrm{CE}}(U)(c,t)∈CCE​(U) with t≤a(e)t\le a(e)t≤a(e) satisfies c≤JU(e)c\le J_U(e)c≤JU​(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