Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma-9

Open
QAlgorithms.Papers.Independent.Gap20.P04.lemma9

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 every λ>1\lambda>1λ>1,

max⁡ρ(jρ−λaρ)=max⁡pure conditional input ensemblesχ.\max_\rho(j_\rho-\lambda a_\rho) =\max_{\text{pure conditional input ensembles}}\chi.ρmax​(jρ​−λaρ​)=pure conditional input ensemblesmax​χ.

Both maxima are attained, and the right side is the one-use Holevo optimum. Weights above one are therefore redundant for the nontrivial CE support trade-off.

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.19--20, Lemma 9: superunit CE weight gives the one-use Holevo maximum. -/
theorem lemma9 (U : Dilation I B E) (hU : PhysicalDilation U)
    (lam : ℝ) (h1 : 1 < lam) :
    EqualMax (purifiedValues (ceScore U lam)) (holevoValues U) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P04

end
Source
Trade-off capacities of the quantum Hadamard channels, arXiv:1001.1732v2, PDF p. 19, Lemma-9
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. Define B(ρ)=Tr⁡E(UρU†)\mathcal B(\rho)=\operatorname{Tr}_E(U\rho U^\dagger)B(ρ)=TrE​(UρU†), E(ρ)=Tr⁡B(UρU†)\mathcal E(\rho)=\operatorname{Tr}_B(U\rho U^\dagger)E(ρ)=TrB​(UρU†), and H(X)=−Re⁡Tr⁡[f(X)]H(X)=-\operatorname{Re}\operatorname{Tr}[f(X)]H(X)=−ReTr[f(X)], with f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x applied by continuous functional calculus. For a family eee with positive finite label and reference dimensions, nonnegative probabilities pxp_xpx​ summing to 111, and unit vectors ψx\psi_xψx​ on reference ⊗I\otimes I⊗I, set ρx=Tr⁡ref∣ψx⟩⟨ψx∣\rho_x=\operatorname{Tr}_{\mathrm{ref}}|\psi_x\rangle\langle\psi_x|ρx​=Trref​∣ψx​⟩⟨ψx​∣, ρˉ=∑xpxρx\bar\rho=\sum_xp_x\rho_xρˉ​=∑x​px​ρx​, h(e)=∑xpxH(ρx)h(e)=\sum_xp_xH(\rho_x)h(e)=∑x​px​H(ρx​), and

JU(e)=h(e)+H(B(ρˉ))−∑xpxH(E(ρx)),χU(e)=H(B(ρˉ))−∑xpxH(B(ρx)).J_U(e)=h(e)+H(\mathcal B(\bar\rho))-\sum_xp_xH(\mathcal E(\rho_x)),\qquad \chi_U(e)=H(\mathcal B(\bar\rho))-\sum_xp_xH(\mathcal B(\rho_x)).JU​(e)=h(e)+H(B(ρˉ​))−x∑​px​H(E(ρx​)),χU​(e)=H(B(ρˉ​))−x∑​px​H(B(ρx​)).

For every real λ>1\lambda>1λ>1, there is a real number vvv that is simultaneously the attained greatest value of JU(e)−λh(e)J_U(e)-\lambda h(e)JU​(e)−λh(e) over all such families and the attained greatest value of χU(e)\chi_U(e)χU​(e) over such families satisfying, for every label xxx, ρx=∣ux⟩⟨ux∣\rho_x=|u_x\rangle\langle u_x|ρx​=∣ux​⟩⟨ux​∣ for some unit vector ux∈CIu_x\in\mathbb C^Iux​∈CI. The purity requirement includes labels of probability zero; zero probabilities and one-dimensional registers remain allowed.

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