Theorem 3: quantum Marton inner bound without a common message
OpenQAlgorithms.Papers.Independent.Support50.P26.marton_inner_boundLet be a finite classical–quantum broadcast channel, with nonempty input alphabet and nonzero finite output dimensions. Choose any finite nonempty auxiliary alphabets , any joint probability law , and any deterministic function . Compute the information quantities in bits from the actual state
Let consist of the nonnegative pairs obeying
Every pair in the unrestricted union of these regions is operationally achievable: for every , all sufficiently large positive block lengths admit a deterministic code with rates at least and average joint decoding error at most , using independent uniform messages and separate collective receiver POVMs. Furthermore,
This is a two-private-message inner bound with a correlation penalty, together with both cardinality conclusions; it is not a capacity equality.
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 3, PDF p.8, proved pp.8–14: Marton inner inclusion and both auxiliary
cardinality conclusions, expressed as equality of unions. Only two private messages occur. -/
theorem marton_inner_bound (C : BroadcastChannel X B1 B2) :
(martonUnion C none ⊆ {r | AverageJointAchievable C r}) ∧
martonUnion C none = martonUnion C (some (Fintype.card X)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P26
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every assigning density matrices on finite, nonempty output types to a finite, nonempty input type , with decidable equality where required, the following two assertions hold. Define by taking all nonempty finite auxiliary alphabets , all probability mass functions on , and all functions , and including the nonnegative real pairs satisfying
where
Here , , and is defined by continuous functional calculus with . First, every has this property: for every and , there is a positive integer such that for every integer there exist positive message counts , a deterministic encoding , and POVMs on and on , satisfying
Each POVM consists of positive semidefinite matrices summing to the identity. Second, is unchanged when both auxiliary alphabet sizes are required to be at most . The first assertion is an inclusion, while the second is an equality of sets.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.