Lemma-13
OpenQAlgorithms.Papers.Independent.Gap20.P04.lemma13For , let assign probability to each of the unit purifications
Their input marginals are and . For any specified channel, write for the output Holevo information, conditional coherent information, joint mutual information, and conditional reference entropy, in bits.
For the qubit -dephasing channel, for every ,
Moreover, the closed convex resource-monotone hull of equals the full CQ capacity region. Thus one common binary spectrum suffices, including time sharing on constant-slope 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 pp.21--22, Lemma 13: purified binary ensemble attains CQ maxima and generates
all CQ trade-offs for p-dephasing, including both endpoint channels. -/
theorem lemma13 (p : ℝ) (h0 : 0 ≤ p) (h1 : p ≤ 1) :
(∀ lam : ℝ, 1 ≤ lam → ∃ mu ∈ Set.Icc (0 : ℝ) (1/2),
(binaryEnsemble mu).Valid ∧
IsGreatest (purifiedValues (cqScore (dephasingDilation p) lam))
(cqScore (dephasingDilation p) lam (binaryEnsemble mu))) ∧
capacityCQ (dephasingDilation p) = cqHull (binaryCQ (dephasingDilation p)) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real , let have entries
For any dilation , write for its receiver and environment partial-trace maps and , using continuous functional calculus. A valid purified family has positive finite label and reference dimensions, probabilities summing to , and unit purifications with reduced input matrices ; define
For every real , there is such that the family , with two equally likely labels and purifications
is valid and attains the greatest value of over all valid families. Furthermore, writing
the closure of equals the closure of the convex hull of all nonnegative satisfying and for some . Here has entries given by products of entries of ; both endpoints for and zero probabilities in arbitrary families are allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.