Theorem III.5: For lambdaBar,delta>0 and independent P1,P2, any length-n quantum-side-information code of rates Rbar_i and error≤lambdaBar for th
OpenQAlgorithms.Papers.Independent.Renew46.P43.sourceToMacLet be a two-sender finite classical-input MAC with independent sender laws . Choose finite normalized pure decompositions and form the correlated source law . For , any length- source code of rates and average error at most , with free at its decoder, yields an actual MAC code satisfying:
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
open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)
attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace
/-- Theorem III.5, PDF p.43: source/channel reduction for TWO independent classical
sender laws. The source is constructed from the channel's finite pure decompositions;
the decoder's free side-information register is Y^n. -/
theorem sourceToMac (a : Fin 2 → ℕ) (ha : ∀ i, 0 < a i) (delta : ℝ) (hdelta : 0 < delta) :
∃ n0 : ℕ, ∀ (C : QAlgorithms.Papers.Independent.Claimed50.P40.ClassicalChannel 2),
C.alphabet = a →
∀ (P : QAlgorithms.Papers.Independent.Claimed50.P40.InputLaw C.alphabet)
(b : ℕ) (hb : 0 < b) (pi : Fin b → Matrix (Fin C.output) (Fin C.output) ℂ)
(hpure : ∀ j, IsPure (pi j) ∧ InBlocks C.block (pi j))
(hdistinct : Function.Injective pi)
(q : (∀ i, Fin (C.alphabet i)) → PMF (Fin b)),
(∀ x, C.state x = ∑ j, ((q x j).toReal : ℂ) • pi j) →
∀ (n : ℕ), n0 ≤ n → ∀ (lambda : ℝ), 0 < lambda →
∀ c : SideCode (macReductionSource C P b hb pi hpure hdistinct q) n,
c.error ≤ lambda →
∃ d : QAlgorithms.Papers.Independent.Claimed50.P40.MultiwayBlockCode
(QAlgorithms.Papers.Independent.Claimed50.P40.singleReceiver C) n,
QAlgorithms.Papers.Independent.Claimed50.P40.averageTupleError d 0 ≤ 4 * lambda ∧
∀ i, QAlgorithms.Papers.Independent.Claimed50.P40.codeRate d i ≥
pmfEntropy (P i) - c.rate i - delta := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of positive natural alphabet sizes and every real , there exists a natural number with the following property, uniformly over all the subsequent data. Let be any two-sender channel whose alphabet-size function equals , with positive output dimension , block labels , and density-matrix outputs whose entries vanish across different block labels. Choose probability mass functions on its input alphabets, a natural number , injectively indexed letters with and entries zero across different block labels, and probability mass functions on the letter indices, and assume
Form the hybrid source with joint law , letters , and the same output dimension and block labels. For every natural number , every real , and every side-information code for this source at length , suppose its error is at most . Such a code requires , positive message counts , encoding functions , and, for each message tuple , a POVM on , indexed by all classical word pairs together with a failure outcome. Every POVM element is positive semidefinite, their sum is the identity, and its entry at basis words is zero if for some . The error assumption means
and its sender rates are . Then there exists a length- channel code for one receiver with access to the entire output: it has positive message counts , encoding functions , and a POVM on , indexed by message pairs, with the same condition of vanishing entries across different coordinatewise block labels. Its uniformly averaged tuple error and rates satisfy
where , with zero summands interpreted as zero. No upper bound on is assumed, and is chosen before the channel, its output dimension, the probability laws, and the letter decomposition.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.