Theorem-4
OpenQAlgorithms.Papers.Independent.Gap20.P04.theorem4Let and let be the qubit dephasing channel, where removes off-diagonal matrix entries. Write for binary entropy in bits and
For , define
For a family , , let be its closed convex resource-monotone hull: classical and quantum rates can be lowered. Let instead allow lowering the classical rate and increasing entanglement consumption, with nonnegative rates in both cases. These hulls include time sharing and endpoint limits.
Then
These are exact generating families for both trade-offs, retaining the degenerate flat portions at .
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.12,21--24, Theorem 4: the displayed families generate exactly both regions.
The endpoint flats are retained through resource-monotone hulls, not strict Pareto tests. -/
theorem theorem4 (p : ℝ) (h0 : 0 ≤ p) (h1 : p ≤ 1) :
capacityCQ (dephasingDilation p) = cqHull (dephasingCQ p) ∧
capacityCE (dephasingDilation p) = ceHull (dephasingCE 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 , including both endpoints, define , with indices , by
For a matrix , write and for 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 , using , set
Let contain the nonnegative pairs bounded coordinatewise by for some valid family, and let contain the nonnegative pairs satisfying and for some valid family. Define , where . Write , with zero terms interpreted as zero, and
Then is the closure of the convex hull of all nonnegative for which some satisfies and ; and is the closure of the convex hull of all nonnegative for which some satisfies and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.