Theorem II.4: For fixed d,0<tau,lambda<1 there exist Kprime,delta>0 uniformly over n,Wi,Pi and measurable A of product mass≥tau: an (n,lambda) c
OpenQAlgorithms.Papers.Independent.Renew46.P43.maximalCodesFix 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.4, PDF pp.24-25: uniform constants before the channel, laws, event
and length. Both the codebook restriction and decoder trace estimate are conclusions. -/
theorem maximalCodes (d : ℕ) (hd : 0 < d) (tau lambda : ℝ)
(htau : 0 < tau) (htausmall : tau < 1) (hlambda : 0 < lambda) (hlambdasmall : lambda < 1) :
∃ K delta : ℝ, 0 < delta ∧ ∀ (n : ℕ), 0 < n →
∀ (W : ℕ → StateChannel (fullAlgebra d hd))
(P : ∀ i : Fin n, ProbabilityMeasure (W i.val).carrier)
(event : Set (∀ i : Fin n, (W i.val).carrier)), MeasurableSet event →
ENNReal.ofReal tau ≤ (Measure.pi (fun i => (P i : Measure (W i.val).carrier))) event →
MaximalCodeConclusion P event K delta lambda false := 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 and real numbers and , there exist real numbers , with and no stated sign requirement on , having the following property uniformly over all positive integers , all sequences of nonempty measurable sets of density matrices, all probability measures on for , and all measurable sets : if the product measure assigns measure at least , then there exists a code with messages, states , and positive semidefinite decoding matrices summing to the identity, such that every encoded tuple lies in and
A density matrix means a positive semidefinite matrix of trace . For density matrices, is if , and otherwise is the nonnegative part of , using functional calculus with ; its value for other arguments is , and real conversion sends to . In addition, there are spectral representations , where the weights are nonnegative and sum to and the vectors form an orthonormal basis for each , such that for every , with
All block labels here are constant, so the code's block-vanishing condition imposes no restriction. No idempotence requirement is asserted for the decoding matrices.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.