Theorem-2
OpenQAlgorithms.Papers.Independent.Gap20.P04.theorem2Let 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.
Suppose is Hadamard, , and a physical ensemble maximizes . Then its pair belongs to the full CQ capacity region and
Thus every such optimizer gives a supporting trade-off point; support ties are retained.
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.9--11, Theorem 2: Hadamard is standing in Section IV; all support ties allowed. -/
theorem theorem2 (U : Dilation I B E) (hU : PhysicalDilation U) (hH : Hadamard U)
(lam : ℝ) (hlam : 1 ≤ lam) (e : PurifiedInputFamily I) (he : e.Valid)
(hmax : IsGreatest (purifiedValues (cqScore U lam)) (cqScore U lam e)) :
CQSupport (capacityCQ U) lam (ensembleHolevoBits e.prob (fun x => receiverChannel U (e.input x)), ensembleCoherentBits U 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 . Write and . Assume that, after identifying the input with its fixed enumeration by , applying to the second factor of every unit pure state on produces a finite convex combination of products of density matrices. Here a density matrix is positive semidefinite with trace . A valid purified input family consists of positive integers , probabilities summing to , and unit vectors ; set , , and
where , with . Zero probabilities are allowed. For each , define as the set of nonnegative pairs satisfying and for some valid family, and put
For every real and every valid family , if is an attained greatest value of over all valid families , then , and every satisfies
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.