Theorem II.2: For 0<lambda<1, |log2 N(n,lambda)/n−sum_i C(Wi)/n|→0; C(Wi)=sup_P[H(PWi)−H(Wi|P)].
OpenQAlgorithms.Papers.Independent.Renew46.P43.nonstationaryCodingFix a nonzero finite output system of dimension . The nonstationary channels are nonempty measurable state sets; optimizes over ALL probability laws on that set. A code has temporal product codewords, a collective block POVM with optional failure, positive length and a nonempty finite message set. optimizes actual codes under maximum error, with . In the maximal-code statements, , the laws are arbitrary, and the measurable event has product mass at least ; constants are chosen before the channel, laws, event and length. In the converse and the threshold is uniform over channel sequences. The hybrid version uses intrinsic output trace and algebra-valued decoding.
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 II.2, PDF p.24: absolute difference between operational rate and the
mean single-use capacities tends to zero for every fixed error in (0,1). -/
theorem nonstationaryCoding (d : ℕ) (hd : 0 < d) (W : ℕ → StateChannel (fullAlgebra d hd))
(lambda : ℝ) (hlambda : 0 < lambda) (hsmall : lambda < 1) :
Tendsto (fun n : ℕ => |Real.logb 2 (nonstationaryN W (n+1) lambda) / (n+1 : ℝ) -
(∑ i : Fin (n+1), (W i.val).capacity) / (n+1 : ℝ)|) atTop (nhds 0) := 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 natural number , every sequence of nonempty measurable sets of positive semidefinite, trace-one complex matrices, and every real number , the following limit holds:
Here all block labels are , so the block restrictions impose no additional zero-entry conditions. For a positive length , is the natural-number supremum of positive message counts for which one can choose matrices , , and positive semidefinite decoding matrices summing to the identity on the word space, such that ; the tensor product has entries , and the natural-number supremum is for an empty or unbounded set. The quantity is the real supremum, over all probability measures on the set , of
The first integral is an extended nonnegative integral, the matrix average is a Bochner integral, and conversion to a real number sends to . The extended quantity is if either matrix fails to be positive semidefinite with trace ; otherwise it is when , and when it equals
with these matrix functions defined by continuous functional calculus and the real logarithm taking value at . The logarithm in the rate is likewise the total real base-two logarithm, whose value at is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.