Theorem II.7: For fixed d, every 0<lambda<1,epsilon>0 admit n0 uniformly for all nonstationary channels: n≥n0 implies log2 N(n,lambda)≤sum_i C(W
OpenQAlgorithms.Papers.Independent.Renew46.P43.nonstationaryStrongConverseFix 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.7, PDF pp.26-28: one threshold for every channel sequence, after
fixing output dimension and the two tolerances. -/
theorem nonstationaryStrongConverse (d : ℕ) (hd : 0 < d)
(lambda epsilon : ℝ) (hlambda : 0 < lambda) (hsmall : lambda < 1) (hepsilon : 0 < epsilon) :
∃ n0 : ℕ, 0 < n0 ∧ ∀ n : ℕ, n0 ≤ n →
∀ W : ℕ → StateChannel (fullAlgebra d hd),
Real.logb 2 (nonstationaryN W n lambda) ≤
(∑ i : Fin n, (W i.val).capacity) + n * epsilon := 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 positive integer , real , and real , there exists a positive integer such that, for every and every sequence of nonempty measurable sets of density matrices, one has
Here a density matrix is positive semidefinite with trace , and there are no additional block restrictions: the underlying block label is constant. The integer is the supremum in of positive message counts for length- codes assigning a state to each message and coordinate, with positive semidefinite decoding matrices summing to the identity and satisfying
The natural-number supremum is for an empty or unbounded set, and . Each is the real supremum over all probability measures on of the real conversion of , where . For density matrices, is when , and otherwise is the nonnegative part of , using functional calculus with ; it is defined as for other arguments. Real conversion sends to . The same works for every sequence .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.