Theorem-1
OpenQAlgorithms.Papers.Independent.Gap20.P04.theorem1Let 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 , probability distributions, and normalized pure conditional states on a finite reference and input . For the resulting state, write , , , and , with entropy in bits. Rates are nonnegative, and 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.
If both two-resource capacity regions equal their one-use ensemble unions, then
The three-dimensional union uses all of (17)–(19) for the same ensemble. The result reduces full CQE single-letterization to the CQ and CE trade-offs.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P04
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.8--9, Theorem 1: both two-resource regions suffice; all three planes remain. -/
theorem theorem1 (U : Dilation I B E) (hU : PhysicalDilation U)
(hCQ : capacityCQ U = oneCQ U) (hCE : capacityCE U = oneCE U) :
capacityCQE U = oneCQE U := by sorry
end QAlgorithms.Papers.Independent.Gap20.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty index sets with decidable equality, and let satisfy . For any such matrix , write and . A valid purified input family consists of positive integers , probabilities summing to , and unit vectors , for ; probabilities may be zero. Set , , and, using , with , define
Define to contain exactly the nonnegative pairs for which some valid family satisfies and ; define similarly by and ; and define to contain exactly the coordinatewise nonnegative triples for which some valid family satisfies
For each of these three region definitions, let
If and , then .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.