Lemma-15
OpenQAlgorithms.Papers.Independent.Gap20.P04.lemma15For , 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 CE 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 p.23, Lemma 15: same binary purifications and common mu for CE generation. -/
theorem lemma15 (p : ℝ) (h0 : 0 ≤ p) (h1 : p ≤ 1) :
(∀ lam : ℝ, 0 ≤ lam → lam ≤ 1 → ∃ mu ∈ Set.Icc (0 : ℝ) (1/2),
(binaryEnsemble mu).Valid ∧
IsGreatest (purifiedValues (ceScore (dephasingDilation p) lam))
(ceScore (dephasingDilation p) lam (binaryEnsemble mu))) ∧
capacityCE (dephasingDilation p) = ceHull (binaryCE (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 , define by
For a dilation , let be its receiver and environment partial-trace maps, and let , using continuous functional calculus. For a valid purified family —positive finite label and reference dimensions, nonnegative probabilities summing to , and unit purifications with reduced input matrices —put
For every , some makes the two-label family , with probabilities and unit purifications , valid and an attained maximizer of over all valid families. Moreover, setting
the closure of equals the closure of the convex hull of all nonnegative for which some satisfies and . The dilation has entries given by products of entries of ; all stated interval endpoints and zero probabilities in arbitrary families are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.