Lemma-7
OpenQAlgorithms.Papers.Independent.Gap20.P04.lemma7Let 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 arbitrary channels , let over all physical ensembles. Then
The three maxima are attained; the product input domain includes entanglement between the two inputs. No Hadamard assumption is imposed.
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 7: unrestricted two-channel h additivity, with attainment.
No Hadamard assumption and no copy of the proof's inconsistent B1 subscript. -/
theorem lemma7 (U : Dilation I B E) (V : Dilation J D F)
(hU : PhysicalDilation U) (hV : PhysicalDilation V) :
AdditiveMax (purifiedValues (jointInfo U)) (purifiedValues (jointInfo V))
(purifiedValues (jointInfo (product U V))) := 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 and satisfy and . For any such matrix , a valid purified input family consists of positive integers , probabilities summing to , and unit vectors , allowing zero probabilities. Put , , and
where , with . Define the product matrix by
There exist real numbers such that is an attained greatest value of , is an attained greatest value of , and is an attained greatest value of , with each optimization ranging over all valid purified input families for the corresponding input space.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.