III-capacity-region-properties: Operational multiway capacity region is closed and convex.
OpenQAlgorithms.Papers.Independent.Renew46.P43.multiwayRegionPropertiesFix a finite classical-input quantum multiway channel with separate deterministic encoders, independent uniform messages and commuting intrinsic receiver accesses. Achievability requires actual codes at every sufficiently large length for each positive rate slack and error tolerance; the error is wrong entire tuple at each receiver.
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Unnumbered capacity-region properties, PDF p.41. The imported model has fixed
finite classical alphabets and commuting intrinsic receiver accesses. -/
theorem multiwayRegionProperties {s r : ℕ}
{C : QAlgorithms.Papers.Independent.Claimed50.P40.ClassicalChannel s}
(N : QAlgorithms.Papers.Independent.Claimed50.P40.Network C r) :
IsClosed (QAlgorithms.Papers.Independent.Claimed50.P40.capacityRegion N) ∧
Convex ℝ (QAlgorithms.Papers.Independent.Claimed50.P40.capacityRegion N) := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be natural numbers, and suppose the following channel and network data are given. There are senders, each with a positive finite alphabet , a positive output dimension , a block label , and, for each input tuple , a positive semidefinite matrix of trace satisfying whenever . There are receivers; receiver has a positive dimension , block labels , and a complex-linear map that is unital, maps matrices supported within the -blocks to matrices supported within the -blocks, preserves adjoints and multiplication on those block-supported matrices, and is injective on them. For distinct receivers, the images of any two such block-supported matrices commute. A length- code consists of , positive message counts , encoders , and, for each receiver , positive semidefinite decoding matrices , indexed by complete message tuples , summing to the identity on ; their entries between words vanish whenever some coordinate has . For a matrix on this tensor power, define its lifted matrix by
where is the corresponding matrix unit, and define the output for message tuple by . The code’s receiver- error is , and sender ’s rate is . Let consist of precisely the coordinatewise nonnegative vectors such that, for every and , there exists such that every natural admits such a code with every receiver’s error at most and every sender’s rate at least . Then is closed in the usual topology of and convex over .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.