Lemma-1
OpenQAlgorithms.Papers.Independent.Gap20.P04.lemma1Let 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.
Let , with the maximum over the ensembles above. For every integer ,
Both maxima are attained; the block maximum permits inputs entangled across uses. This supplies the third-plane bound for arbitrary channels.
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 pp.9,19, Lemma 1: h is an attained maximum; n>=1. -/
theorem lemma1 (U : Dilation I B E) (hU : PhysicalDilation U) (n : ℕ) (hn : 0 < n) :
RepeatedMax n (purifiedValues (jointInfo U)) (purifiedValues (jointInfo (dilationPower U n))) := 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 be a positive integer. For a matrix of this form, a valid purified input family consists of positive integers , numbers with , and unit vectors ; zero probabilities are allowed. Put , , , and , and define
where , with . Let have entries . There exists a real number such that is an attained greatest value of over all valid purified input families, and is an attained greatest value of over all valid purified input families for its input space. No uniqueness of maximizing families is asserted; is excluded.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.