IV.14-permutation-coding: For each ordering pi, all sufficiently large n admit codes with r_pi(i)≤H(X_pi(i)|Y X_pi(1)…X_pi(i−1))+3delta, error≤lambdaBar and
OpenQAlgorithms.Papers.Independent.Renew46.P43.permutationSourceCodingLet a finite correlated classical/hybrid source have classical senders and free side information at the decoder. For any permutation and , all sufficiently large admit separate classical encoders and an actual retained-outcome square-root decoding instrument. One length threshold is uniform over source laws at fixed alphabet sizes, output dimension and tolerances.
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
/-- Valid permutation-corner construction inside the proof of IV.14, PDF p.55.
The false simultaneous upper bounds in printed IV.14 are not used. Smaller internal
error parameters ensure the final labelled-Y disturbance is at most lambda. -/
theorem permutationSourceCoding (s : ℕ) (a : Fin s → ℕ) (ha : ∀ i, 0 < a i)
(d : ℕ) (hd : 0 < d) (lambda delta : ℝ) (hlambda : 0 < lambda) (hdelta : 0 < delta) :
∃ n0 : ℕ, 0 < n0 ∧ ∀ (S : HybridSource s), S.alphabet = a → S.system.dim = d →
∀ (pi : Equiv.Perm (Fin s)) (n : ℕ), n0 ≤ n →
∃ c : SideCode S n, (∀ i, c.rate (pi i) ≤ S.corner pi (pi i) + 3 * delta) ∧
c.error ≤ lambda ∧ c.disturbance ≤ lambda := 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 , every family of positive natural alphabet sizes , every with , and every with , there exists such that the following holds for every hybrid source with exactly those alphabet sizes and quantum dimension . The source includes arbitrary basis block labels, distinct normalized pure states supported within those blocks, and joint probability masses on classical tuples and labels, summing to . For , define
where are classical tuples restricted to and entropy uses matrix functional calculus. For every permutation of the senders and every , there exists a side code with positive message counts , encoders of each sender’s classical word, and decoder POVMs indexed by classical word tuples and failure , whose effects have zero entries between quantum basis words differing in any block label, such that, writing ,
Moreover, for joint words , put , , , and ; then
where ranges over all decoder outcomes and . The threshold is chosen before the source and permutation. The case is included, with empty classical tuples and vacuous sender-rate inequalities.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.