Lemma-6
OpenQAlgorithms.Papers.Independent.Gap20.P04.lemma6For , 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 universal symmetric-output cloner, for every integer ,
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.15, Lemma 6: same purified binary ensemble, including lam=1.
The proof prints lam<1, but its factor 1-lam remains nonnegative at the endpoint. -/
theorem lemma6 (N : ℕ) (hN : 0 < N) :
(∀ lam : ℝ, 0 ≤ lam → lam ≤ 1 → ∃ mu ∈ Set.Icc (0 : ℝ) (1/2),
(binaryEnsemble mu).Valid ∧
IsGreatest (purifiedValues (ceScore (cloningDilation N) lam))
(ceScore (cloningDilation N) lam (binaryEnsemble mu))) ∧
capacityCE (cloningDilation N) = ceHull (binaryCE (cloningDilation 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
For every positive integer , put and define by
For a matrix , let and be the receiver and environment partial traces of . A valid purified input family consists of positive integers , probabilities summing to , and unit vectors ; zero probabilities are allowed. With , , and , taking , define
Let have two equally likely labels, a two-dimensional reference, and vectors
For every real , there exists such that is valid and is an attained greatest value of over all valid families . Furthermore, let consist of nonnegative pairs satisfying and for some valid family, and define
Then equals the closure of the convex hull of all nonnegative pairs satisfying and for some . The case is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.