Theorem 1: superposition coding inner bound
OpenQAlgorithms.Papers.Independent.Support50.P26.superposition_inner_boundLet be a finite nonempty input alphabet and let be finite-dimensional nonzero complex output registers. A classical–quantum broadcast channel is a family of positive trace-one operators . For each finite nonempty auxiliary alphabet and probability law , compute the information quantities in bits from
Let consist of the nonnegative rate pairs satisfying
Every pair in is operationally achievable. Specifically, for every there is such that for every there is a deterministic -use encoder with positive integer message sizes , rates , and two separate collective decoding POVMs whose joint error averaged over independent uniform messages is at most . Moreover, writing ,
This gives an inner bound without a degradedness assumption and retains the theorem's auxiliary cardinality conclusion.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P26
noncomputable section
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Support50.P26
attribute [local instance] Classical.propDecidable Classical.decEq
-- Exact primitives from pinned accepted modules, under the independent-paper override.
-- No coding theorem or other paper's channel model is reused.
open QAlgorithms.Papers.Independent.Information100.P22 (Op quantumMI)
open QAlgorithms.Papers.Independent.Information100.P27 (shannon)
open QAlgorithms.Papers.Independent.Claimed50.P08 (cqBlocks)
open QAlgorithms.Papers.Independent.Dependency50.P47 (Law)
variable {X B1 B2 W U V A B : Type}
variable [Fintype X] [Fintype B1] [Fintype B2] [Fintype W] [Fintype U] [Fintype V]
variable [Fintype A] [Fintype B]
variable [DecidableEq X] [DecidableEq B1] [DecidableEq B2] [DecidableEq W]
variable [DecidableEq U] [DecidableEq V] [DecidableEq A] [DecidableEq B]
/-- Theorem 1, PDF p.3, proved pp.4–7: operational inner inclusion for every finite law,
conjoined with the final sentence's equality of unrestricted and capped auxiliary unions. -/
theorem superposition_inner_bound (C : BroadcastChannel X B1 B2) :
(superUnion C none ⊆ {r | AverageJointAchievable C r}) ∧
superUnion C none = superUnion C (some (superCap X B1 B2)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P26
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any broadcast channel on finite nonempty types , with decidable equality where required, assigning trace-one positive semidefinite outputs . Write for output 's partial trace. For any finite probability law on , define , , and . Let , , where is applied by continuous functional calculus, and . Define as the union, over all and all such laws, of the pairs satisfying
The theorem asserts both that every has the following coding property and that is unchanged by restricting . The coding property requires , and, for every and , a positive integer such that for every there are positive integers , an encoding , and positive semidefinite decoding matrices on and on , each family summing to its identity, with
Here . Auxiliary laws may have zero entries and may use a one-element alphabet; the assertion concerns the union itself without taking a closure.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.