Lemma-9
OpenQAlgorithms.Papers.Independent.Gap20.P04.lemma9Let 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.
For every ,
Both maxima are attained, and the right side is the one-use Holevo optimum. Weights above one are therefore redundant for the nontrivial CE support trade-off.
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.19--20, Lemma 9: superunit CE weight gives the one-use Holevo maximum. -/
theorem lemma9 (U : Dilation I B E) (hU : PhysicalDilation U)
(lam : ℝ) (h1 : 1 < lam) :
EqualMax (purifiedValues (ceScore U lam)) (holevoValues 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 types with decidable equality, and let satisfy . Define , , and , with applied by continuous functional calculus. For a family with positive finite label and reference dimensions, nonnegative probabilities summing to , and unit vectors on reference , set , , , and
For every real , there is a real number that is simultaneously the attained greatest value of over all such families and the attained greatest value of over such families satisfying, for every label , for some unit vector . The purity requirement includes labels of probability zero; zero probabilities and one-dimensional registers remain allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.