Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma-4

Open
QAlgorithms.Papers.Independent.Gap20.P04.lemma4

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 λ≥1\lambda\ge1λ≥1, define fλ(N)=max⁡ρ(χρ+λqρ)f_\lambda(\mathcal N)=\max_\rho(\chi_\rho+\lambda q_\rho)fλ​(N)=maxρ​(χρ​+λqρ​). If N1\mathcal N_1N1​ is Hadamard and N2\mathcal N_2N2​ is any CPTP channel on nonzero finite registers, then

fλ(N1⊗N2)=fλ(N1)+fλ(N2).f_\lambda(\mathcal N_1\otimes\mathcal N_2) =f_\lambda(\mathcal N_1)+f_\lambda(\mathcal N_2).fλ​(N1​⊗N2​)=fλ​(N1​)+fλ​(N2​).

All three maxima are attained, and the product optimization includes entangled inputs. This is strong two-channel additivity.

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.10--11, Lemma 4: strong additivity, second channel arbitrary, lam>=1. -/
theorem lemma4 (U : Dilation I B E) (V : Dilation J D F)
    (hU : PhysicalDilation U) (hV : PhysicalDilation V) (hH : Hadamard U)
    (lam : ℝ) (hlam : 1 ≤ lam) :
    AdditiveMax (purifiedValues (cqScore U lam)) (purifiedValues (cqScore V lam))
      (purifiedValues (cqScore (product U V) lam)) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P04

end
Source
Trade-off capacities of the quantum Hadamard channels, arXiv:1001.1732v2, PDF p. 10, Lemma-4
Read-back

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

Let I,B,E,J,D,FI,B,E,J,D,FI,B,E,J,D,F 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 and V:CJ→CD⊗CFV:\mathbb C^J\to\mathbb C^D\otimes\mathbb C^FV:CJ→CD⊗CF satisfy U†U=1U^\dagger U=1U†U=1 and V†V=1V^\dagger V=1V†V=1. For any such matrix WWW, write BW(ρ)\mathcal B_W(\rho)BW​(ρ) and EW(ρ)\mathcal E_W(\rho)EW​(ρ) for the receiver and environment partial traces of WρW†W\rho W^\daggerWρW†. Assume that applying EU\mathcal E_UEU​ to the input factor of every unit pure state on a reference space of dimension ∣I∣|I|∣I∣ tensored with CI\mathbb C^ICI, using the fixed enumeration of III, produces a finite convex combination of products of positive semidefinite trace-one matrices. A valid purified input family for WWW 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. 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

FW,λ(p,ψ)=S(BW(ρˉ))−∑xpxS(BW(ρx))+λ∑xpx(S(BW(ρx))−S(EW(ρx))),F_{W,\lambda}(p,\psi)= S(\mathcal B_W(\bar\rho))-\sum_xp_xS(\mathcal B_W(\rho_x)) +\lambda\sum_xp_x\bigl(S(\mathcal B_W(\rho_x))-S(\mathcal E_W(\rho_x))\bigr),FW,λ​(p,ψ)=S(BW​(ρˉ​))−x∑​px​S(BW​(ρx​))+λx∑​px​(S(BW​(ρx​))−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 U⊠VU\boxtimes VU⊠V by

(U⊠V)((b,d),(e,f)),(i,j)=U(b,e),iV(d,f),j.(U\boxtimes V)_{((b,d),(e,f)),(i,j)}=U_{(b,e),i}V_{(d,f),j}.(U⊠V)((b,d),(e,f)),(i,j)​=U(b,e),i​V(d,f),j​.

For every real λ≥1\lambda\ge1λ≥1, there exist real numbers s,ts,ts,t such that sss and ttt are attained greatest values of FU,λF_{U,\lambda}FU,λ​ and FV,λF_{V,\lambda}FV,λ​, respectively, and s+ts+ts+t is an attained greatest value of FU⊠V,λF_{U\boxtimes V,\lambda}FU⊠V,λ​, with each optimization ranging over all valid purified input families for its input space.

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