Lemma-10
OpenQAlgorithms.Papers.Independent.Gap20.P04.lemma10Let 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.
Put . If is Hadamard, is arbitrary CPTP, and , then
All maxima are attained over the full pure-ensemble domain. This is strong additivity, with no Hadamard restriction on the second channel.
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, Lemma 10: strong CE additivity, second channel arbitrary, 0<=lam<=1. -/
theorem lemma10 (U : Dilation I B E) (V : Dilation J D F)
(hU : PhysicalDilation U) (hV : PhysicalDilation V) (hH : Hadamard U)
(lam : ℝ) (h0 : 0 ≤ lam) (h1 : lam ≤ 1) :
AdditiveMax (purifiedValues (ceScore U lam)) (purifiedValues (ceScore V lam))
(purifiedValues (ceScore (product U V) lam)) := 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. Let and satisfy . Assume additionally that the complementary map has this property: applying it to the second factor of every unit-vector projector on produces a finite convex combination of products of density matrices, where a density matrix is positive semidefinite with trace . Define
For any of these dilations , write and for the partial traces of over its environment and receiver, respectively, and let , using continuous functional calculus. A valid purified family has positive finite label and reference dimensions, nonnegative probabilities summing to , and unit vectors on reference input; its input matrices are . Define
For every real , there exist real such that is an attained greatest value of , is an attained greatest value of , and is an attained greatest value of , each over all valid purified families for its input space. Both endpoints of the interval for , zero probabilities, and one-dimensional registers are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.