Remark II.3: II.2 also holds with the output system replaced by an arbitrary finite *-subalgebra A.
OpenQAlgorithms.Papers.Independent.Renew46.P43.hybridNonstationaryCodingFix 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
/-- Remark II.3, PDF p.24: the full nonstationary theorem also holds for a finite
intrinsic output algebra. Measurements and state restriction use that algebra's trace. -/
theorem hybridNonstationaryCoding (A : IntrinsicSystem) (W : ℕ → StateChannel A)
(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
Let consist of a positive integer dimension and a block label . For every sequence of nonempty measurable sets of complex matrices, each of whose members is positive semidefinite, has trace , and satisfies whenever , and every real , the following limit holds. Define , where is applied by continuous functional calculus. For density matrices define if , and otherwise define it as the nonnegative part of , with the logarithms interpreted by functional calculus and ; its defined value is if either argument is not a density matrix. For a probability measure on , put , and set
where the integral is nonnegative and extended real, and conversion to a real number sends to . A length- code has messages, assigns each message states for , and has positive semidefinite decoding matrices summing to the identity; every decoding matrix has entry zero between words whenever for some coordinate . Its error is
Let be the supremum in of message counts of such codes with error at most . This natural-number supremum is for an empty or unbounded set, and the real logarithm convention gives . The assertion is
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.