Corollary-2
OpenQAlgorithms.Papers.Independent.Gap20.P04.corollary2Let 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 a Hadamard channel, , and integer ,
where and both scalar maxima are attained. This identifies the full CE boundary including flat portions.
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.20, Corollary 2: attained block additivity and full CE single-letterization. -/
theorem corollary2 (U : Dilation I B E) (hU : PhysicalDilation U) (hH : Hadamard U)
(lam : ℝ) (h0 : 0 ≤ lam) (h1 : lam ≤ 1) (n : ℕ) (hn : 0 < n) :
RepeatedMax n (purifiedValues (ceScore U lam)) (purifiedValues (ceScore (dilationPower U n) lam)) ∧
capacityCE U = oneCE 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 . Assume that applying its complementary map to the second factor of every unit-vector projector on yields a finite convex combination of products of positive semidefinite trace-one matrices. For a dilation , let be its receiver and environment partial-trace maps, and let , using continuous functional calculus. For each valid purified family—positive finite label and reference dimensions, probabilities summing to , and unit purifications with reduced input matrices —put
For every and every positive integer , there is a real that is an attained greatest value of , while is an attained greatest value of , where
Moreover, defining
one has
The closure is in the usual topology; zero probabilities are permitted, and zero block lengths are excluded from the displayed regularization.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.