Proposition 2: constant-composition common-message cq code
OpenQAlgorithms.Papers.Independent.Gap48.P39.constant_composition_common_codeLet be a finite cq broadcast channel with nonempty input alphabet and positive-dimensional outputs, and let be a probability distribution on . Fix and a nonnegative rate
where the information quantities are computed in in bits. For every sufficiently large positive blocklength , there is an indexed family of words, all of one empirical type with , and separate Bob and Charlie POVMs such that, for every message ,
The entire code is chosen before the message. This gives constant-composition common-message coding with a joint maximum-error criterion; injectivity of the indexed family is not assumed.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P39
noncomputable section
open scoped BigOperators Matrix ComplexConjugate
namespace QAlgorithms.Papers.Independent.Gap48.P39
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
open QAlgorithms.Papers.Independent.Claimed50.P08 (cqBlocks holevoInfo)
open QAlgorithms.Papers.Independent.Dependency50.P19 (both epr mutualInformation marginalRA marginalRB)
open QAlgorithms.Papers.Independent.Information100.P58 (Distribution)
open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity conditionalEntropy groupedChannelPower)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C X T E : Type}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype X] [DecidableEq X]
variable [Fintype T] [DecidableEq T] [Fintype E] [DecidableEq E]
/-- Proposition 2, PDF p.4: constant-composition common-message cq coding.
The code family is chosen before the message and the error is joint maximum error. -/
theorem constant_composition_common_code [Nonempty X] [Nonempty B] [Nonempty C]
(W : CQChannel X B C) (p : Distribution X) (epsilon delta R : ℝ)
(he : 0 < epsilon) (hd : 0 < delta) (hR : 0 ≤ R)
(hRate : R = min (holevoInfo p.val (fun x => traceRight (W.state x)))
(holevoInfo p.val (fun x => traceLeft (W.state x))) - delta) :
∃ n0 : ℕ, 0 < n0 ∧ ∀ n ≥ n0,
∃ D : CommonCode X B C n (rank n R), D.Good W p epsilon delta := by sorry
end QAlgorithms.Papers.Independent.Gap48.P39
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For nonempty finite types with decidable equality, let assign density matrices on , and let satisfy and . Write , , and , where is applied by continuous functional calculus. For real numbers , assume , , , and the exact equality
Then there exists a positive integer such that every admits words , positive semidefinite matrices on summing to , and positive semidefinite matrices on summing to , together with a function , such that , every word has frequency for every , and every message satisfies
The assumptions allow , giving one message. They impose no upper bound on ; the equality defining , together with , requires the displayed minimum to be at least .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.