Lemma-3
OpenQAlgorithms.Papers.Independent.Gap20.P04.lemma3Let 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. The right side is the one-use Holevo optimum. This makes weights below one redundant for the nontrivial CQ support trade-off; it does not assert that every zero-weight optimizer has nonnegative coherent information.
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 p.10, Lemma 3: subunit weights give the attained one-use Holevo maximum. -/
theorem lemma3 (U : Dilation I B E) (hU : PhysicalDilation U)
(lam : ℝ) (h0 : 0 ≤ lam) (h1 : lam < 1) :
EqualMax (purifiedValues (cqScore 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 sets with decidable equality, let satisfy , and let . Write and . For every valid purified input family , consisting of positive integers , probabilities summing to , and unit vectors , put , , and
where , with ; zero probabilities are allowed. There exists a real number that is simultaneously an attained greatest value of over all valid purified input families, and an attained greatest value of over those valid families for which every , including those of zero probability, equals for some unit vector .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.