Lemma-8
ProvedQAlgorithms.Papers.Independent.Gap20.P04.lemma8Let 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 any , suppose maximizes . Then belongs to the one-use CE region and
Thus the optimizer attains the upper classical rate at its budget. This includes and does not require strict Pareto optimality.
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.19, Lemma 8: general one-use CE upper boundary, including lam=0.
At zero weight the proof's strict energy comparison fails; upper C(E) is the
figure-compatible boundary convention, not minimum-E selection among tied optimizers. -/
theorem lemma8 (U : Dilation I B E) (hU : PhysicalDilation U)
(lam : ℝ) (h0 : 0 ≤ lam) (e : PurifiedInputFamily I) (he : e.Valid)
(hmax : IsGreatest (purifiedValues (ceScore U lam)) (ceScore U lam e)) :
CEUpper (oneCE 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 types with decidable equality, and let satisfy . Write , , and , where is applied by continuous functional calculus. A valid purified input family consists of positive integers , probabilities summing to , and unit vectors ; put , , and
For every real , including , and every valid family whose value is an attained greatest value among all valid purified input families, the pair belongs to
and every with satisfies . Zero probabilities and one-dimensional registers are permitted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.