Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma-11

Open
QAlgorithms.Papers.Independent.Gap20.P04.lemma11

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.

Choose one point sCQ(λ)s_{CQ}(\lambda)sCQ​(λ) on each supporting face maximizing C+λQC+\lambda QC+λQ, λ≥1\lambda\ge1λ≥1, of the full CQ region, and one point sCE(λ)s_{CE}(\lambda)sCE​(λ) maximizing C−λEC-\lambda EC−λE, 0≤λ≤10\le\lambda\le10≤λ≤1, of the full CE region. Include the resource endpoints and limits. Then

CCQ(N)=co⁡‾ MCQ({sCQ(λ):λ≥1}∪axis endpoints),\mathcal C_{CQ}(\mathcal N)=\overline{\operatorname{co}}\,\mathsf M_{CQ} \bigl(\{s_{CQ}(\lambda):\lambda\ge1\}\cup\text{axis endpoints}\bigr),CCQ​(N)=coMCQ​({sCQ​(λ):λ≥1}∪axis endpoints), CCE(N)=co⁡‾ MCE({sCE(λ):0≤λ≤1}∪zero-consumption endpoint).\mathcal C_{CE}(\mathcal N)=\overline{\operatorname{co}}\,\mathsf M_{CE} \bigl(\{s_{CE}(\lambda):0\le\lambda\le1\}\cup\text{zero-consumption endpoint}\bigr).CCE​(N)=coMCE​({sCE​(λ):0≤λ≤1}∪zero-consumption endpoint).

Here MCQ\mathsf M_{CQ}MCQ​ allows lowering both nonnegative rates; MCE\mathsf M_{CE}MCE​ allows lowering CCC and increasing consumption EEE. A single selection can omit points on constant-slope faces, which are recovered by convex combinations; no unique or smooth parametrization is asserted.

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,21, Lemma 11: one support optimizer per weight recovers the entire
resource region by convex combinations and endpoint limits. On the boundary,
nonselected points recovered by nontrivial combinations lie on constant-slope faces.
The selection hypotheses refer to full regularized regions, not one-use objectives
for an arbitrary channel, and make no uniqueness or differentiability assertion. -/
theorem lemma11 (U : Dilation I B E) (hU : PhysicalDilation U)
    (cqSelect ceSelect : ℝ → ℝ × ℝ)
    (hCQ : ∀ lam : ℝ, 1 ≤ lam → CQSupport (capacityCQ U) lam (cqSelect lam))
    (hCE : ∀ lam ∈ Set.Icc (0 : ℝ) 1,
      CESupport (capacityCE U) lam (ceSelect lam)) :
    capacityCQ U = selectedCQHull (capacityCQ U) cqSelect ∧
      capacityCE U = selectedCEHull (capacityCE U) ceSelect := by sorry

end QAlgorithms.Papers.Independent.Gap20.P04

end
Source
Trade-off capacities of the quantum Hadamard channels, arXiv:1001.1732v2, PDF p. 21, Lemma-11
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 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; these nonemptiness conditions and the isometry equation are what “physical dilation” requires. Define N(ρ)=Tr⁡E(UρU†)N(\rho)=\operatorname{Tr}_E(U\rho U^\dagger)N(ρ)=TrE​(UρU†) and Nc(ρ)=Tr⁡B(UρU†)N^c(\rho)=\operatorname{Tr}_B(U\rho U^\dagger)Nc(ρ)=TrB​(UρU†). Here a density matrix is positive semidefinite with trace 111, and H(ρ)=−Re⁡Tr⁡(f(ρ))H(\rho)=-\operatorname{Re}\operatorname{Tr}(f(\rho))H(ρ)=−ReTr(f(ρ)), where f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t is applied by continuous functional calculus. For any dilation VVV, consider every family consisting of positive integers ℓ,r\ell,rℓ,r, probabilities px≥0p_x\ge0px​≥0 with ∑x<ℓpx=1\sum_{x<\ell}p_x=1∑x<ℓ​px​=1, and vectors ψx∈C{0,…,r−1}×IV\psi_x\in\mathbb C^{\{0,\ldots,r-1\}\times I_V}ψx​∈C{0,…,r−1}×IV​ of norm 111 for every xxx, including labels of probability zero. Set ρx=Tr⁡reference∣ψx⟩⟨ψx∣\rho_x=\operatorname{Tr}_{\mathrm{reference}}|\psi_x\rangle\langle\psi_x|ρx​=Trreference​∣ψx​⟩⟨ψx​∣, ρˉ=∑xpxρx\bar\rho=\sum_xp_x\rho_xρˉ​=∑x​px​ρx​, and, using the receiver and environment maps of VVV, define

h=∑xpxH(ρx),χ=H(NV(ρˉ))−∑xpxH(NV(ρx)),q=∑xpx(H(NV(ρx))−H(NVc(ρx))),j=h+H(NV(ρˉ))−∑xpxH(NVc(ρx)).h=\sum_xp_xH(\rho_x),\qquad \chi=H(N_V(\bar\rho))-\sum_xp_xH(N_V(\rho_x)),\qquad q=\sum_xp_x\bigl(H(N_V(\rho_x))-H(N_V^c(\rho_x))\bigr),\qquad j=h+H(N_V(\bar\rho))-\sum_xp_xH(N_V^c(\rho_x)).h=x∑​px​H(ρx​),χ=H(NV​(ρˉ​))−x∑​px​H(NV​(ρx​)),q=x∑​px​(H(NV​(ρx​))−H(NVc​(ρx​))),j=h+H(NV​(ρˉ​))−x∑​px​H(NVc​(ρx​)).

Let C1(V)C_1(V)C1​(V) contain exactly the pairs (a,b)(a,b)(a,b) with a,b≥0a,b\ge0a,b≥0 for which some such family satisfies a≤χa\le\chia≤χ and b≤qb\le qb≤q, and let E1(V)E_1(V)E1​(V) contain exactly those with a,b≥0a,b\ge0a,b≥0 for which some such family satisfies a≤ja\le ja≤j and h≤bh\le bh≤b. For each positive integer nnn, define U(b,e),i(n)=∏k<nU(bk,ek),ikU^{(n)}_{(b,e),i}=\prod_{k<n}U_{(b_k,e_k),i_k}U(b,e),i(n)​=∏k<n​U(bk​,ek​),ik​​, and set

C={r∈R2:∃n≥1, nr∈C1(U(n))}‾,D={r∈R2:∃n≥1, nr∈E1(U(n))}‾.C=\overline{\{r\in\mathbb R^2:\exists n\ge1,\ nr\in C_1(U^{(n)})\}},\qquad D=\overline{\{r\in\mathbb R^2:\exists n\ge1,\ nr\in E_1(U^{(n)})\}}.C={r∈R2:∃n≥1, nr∈C1​(U(n))}​,D={r∈R2:∃n≥1, nr∈E1​(U(n))}​.

Thus these capacity definitions use only positive block lengths. Let sC,sE:R→R2s_C,s_E:\mathbb R\to\mathbb R^2sC​,sE​:R→R2 be arbitrary functions satisfying, for every real λ≥1\lambda\ge1λ≥1, sC(λ)∈Cs_C(\lambda)\in CsC​(λ)∈C and a+λb≤sC(λ)1+λsC(λ)2a+\lambda b\le s_C(\lambda)_1+\lambda s_C(\lambda)_2a+λb≤sC​(λ)1​+λsC​(λ)2​ for all (a,b)∈C(a,b)\in C(a,b)∈C, and, for every λ∈[0,1]\lambda\in[0,1]λ∈[0,1], sE(λ)∈Ds_E(\lambda)\in DsE​(λ)∈D and a−λb≤sE(λ)1−λsE(λ)2a-\lambda b\le s_E(\lambda)_1-\lambda s_E(\lambda)_2a−λb≤sE​(λ)1​−λsE​(λ)2​ for all (a,b)∈D(a,b)\in D(a,b)∈D. The endpoint parameters are included, and the functions’ values outside these parameter ranges are unrestricted. Then both equalities hold:

C=conv⁡R{(a,b):a,b≥0, ∃s∈R2, [(∃λ≥1, s=sC(λ)) ∨ (s∈C ∧ (s1=0∨s2=0))], a≤s1, b≤s2}‾,C=\overline{\operatorname{conv}_{\mathbb R} \left\{(a,b): a,b\ge0,\ \exists s\in\mathbb R^2,\ \left[ (\exists\lambda\ge1,\ s=s_C(\lambda)) \ \lor\ (s\in C\ \land\ (s_1=0\lor s_2=0)) \right],\ a\le s_1,\ b\le s_2 \right\}},C=convR​{(a,b):a,b≥0, ∃s∈R2, [(∃λ≥1, s=sC​(λ)) ∨ (s∈C ∧ (s1​=0∨s2​=0))], a≤s1​, b≤s2​}​, D=conv⁡R{(a,b):a,b≥0, ∃s∈R2, [(∃λ∈[0,1], s=sE(λ)) ∨ (s∈D ∧ s2=0)], a≤s1, s2≤b}‾.D=\overline{\operatorname{conv}_{\mathbb R} \left\{(a,b): a,b\ge0,\ \exists s\in\mathbb R^2,\ \left[ (\exists\lambda\in[0,1],\ s=s_E(\lambda)) \ \lor\ (s\in D\ \land\ s_2=0) \right],\ a\le s_1,\ s_2\le b \right\}}.D=convR​{(a,b):a,b≥0, ∃s∈R2, [(∃λ∈[0,1], s=sE​(λ)) ∨ (s∈D ∧ s2​=0)], a≤s1​, s2​≤b}​.
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