Theorem-3
OpenQAlgorithms.Papers.Independent.Gap20.P04.theorem3Let 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.
Let be Hadamard and . If maximizes , then lies in the full CE region and
This is the upper classical-rate boundary at that consumption budget, allowing flat portions at . It need not select the least consumption among all tied classical-rate optimizers.
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.11,19--20, Theorem 3: upper C(E), with the flat lam=0 endpoint retained. -/
theorem theorem3 (U : Dilation I B E) (hU : PhysicalDilation U) (hH : Hadamard U)
(lam : ℝ) (h0 : 0 ≤ lam) (h1 : lam ≤ 1)
(e : PurifiedInputFamily I) (he : e.Valid)
(hmax : IsGreatest (purifiedValues (ceScore U lam)) (ceScore U lam e)) :
CEUpper (capacityCE U) (jointInfo U e, inputEntropy e) := 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 . Assume that applying to the input factor of every unit pure state with a reference of dimension , using the fixed enumeration of , produces a finite convex combination of products of positive semidefinite trace-one matrices. A valid purified input family consists of positive integers , probabilities summing to , and unit vectors ; zero probabilities are allowed. Put , , and
where , with . Define to consist of the nonnegative pairs for which some valid family satisfies and , and define
For every and every valid family , if is an attained greatest value of over all valid families , then , and every with satisfies .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.