Corollary-1
OpenQAlgorithms.Papers.Independent.Gap20.P04.corollary1Let 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, every and integer satisfy
where and both scalar maxima are attained. This recovers the full CQ trade-off, including convex combinations on flat faces.
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.11, Corollary 1: attained block additivity and full CQ single-letterization. -/
theorem corollary1 (U : Dilation I B E) (hU : PhysicalDilation U) (hH : Hadamard U)
(lam : ℝ) (hlam : 1 ≤ lam) (n : ℕ) (hn : 0 < n) :
RepeatedMax n (purifiedValues (cqScore U lam)) (purifiedValues (cqScore (dilationPower U n) lam)) ∧
capacityCQ U = oneCQ 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, and let satisfy . Denote the receiver and environment partial traces of by and . Assume that applying to the input factor of every unit pure state with a reference of dimension , after the fixed enumeration of , gives a finite convex combination of products of density matrices, meaning positive semidefinite trace-one matrices. For a valid purified input family , choose positive integers , probabilities summing to , and unit vectors , allowing zero probabilities, and set , . Define
where , with . Let , let consist of the nonnegative pairs bounded by for some valid family, and let
For every real and every positive integer , there exists a real such that is an attained greatest value of and is an attained greatest value of ; moreover, . The quantified integer excludes zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.