Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma-8

Proved
QAlgorithms.Papers.Independent.Gap20.P04.lemma8

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 any λ≥0\lambda\ge0λ≥0, suppose ρ\rhoρ maximizes j−λaj-\lambda aj−λa. Then (jρ,aρ)(j_\rho,a_\rho)(jρ​,aρ​) belongs to the one-use CE region and

C≤jρfor every (C,E)∈CCE(1)(N) with E≤aρ.C\le j_\rho\qquad\text{for every }(C,E)\in\mathcal C^{(1)}_{CE}(\mathcal N) \text{ with }E\le a_\rho.C≤jρ​for every (C,E)∈CCE(1)​(N) with E≤aρ​.

Thus the optimizer attains the upper classical rate at its budget. This includes λ=0\lambda=0λ=0 and does not require strict Pareto optimality.

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.19, Lemma 8: general one-use CE upper boundary, including lam=0.
At zero weight the proof's strict energy comparison fails; upper C(E) is the
figure-compatible boundary convention, not minimum-E selection among tied optimizers. -/
theorem lemma8 (U : Dilation I B E) (hU : PhysicalDilation U)
    (lam : ℝ) (h0 : 0 ≤ lam) (e : PurifiedInputFamily I) (he : e.Valid)
    (hmax : IsGreatest (purifiedValues (ceScore U lam)) (ceScore U lam e)) :
    CEUpper (oneCE 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. 19, Lemma-8
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. Write 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)], where f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x is applied by continuous functional calculus. A valid purified input family consists of positive integers L,RL,RL,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; 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

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

For every real λ≥0\lambda\ge0λ≥0, including λ=0\lambda=0λ=0, and every valid family eee whose value JU(e)−λh(e)J_U(e)-\lambda h(e)JU​(e)−λh(e) is an attained greatest value among all valid purified input families, the pair (JU(e),h(e))(J_U(e),h(e))(JU​(e),h(e)) belongs to

CU={(c,a):c,a≥0, ∃ valid t, c≤JU(t), h(t)≤a},\mathcal C_U=\{(c,a):c,a\ge0,\ \exists\text{ valid }t,\ c\le J_U(t),\ h(t)\le a\},CU​={(c,a):c,a≥0, ∃ valid t, c≤JU​(t), h(t)≤a},

and every (c,a)∈CU(c,a)\in\mathcal C_U(c,a)∈CU​ with a≤h(e)a\le h(e)a≤h(e) satisfies c≤JU(e)c\le J_U(e)c≤JU​(e). Zero probabilities and one-dimensional registers are permitted.

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