Remark II.5: In II.4 all decoding effects Dm can be required to be projectors.
OpenQAlgorithms.Papers.Independent.Renew46.P43.maximalProjectiveCodesFix 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.5, PDF p.26: all II.4 conclusions with projective decoding effects.
The complementary failure effect completes the measurement. -/
theorem maximalProjectiveCodes (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 true := 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 restriction on , having the following property uniformly over all the subsequent choices. Let be an integer, and for each nonnegative integer , let be a nonempty measurable set of positive semidefinite complex matrices of trace . For each , choose a probability measure on . Let be measurable and satisfy . Then there exist a positive integer , matrices for and , and a POVM on , meaning that all these matrices are positive semidefinite and their sum is the identity, such that every tuple belongs to , every successful decoding operator satisfies , and
Here the matrix of a tensor product has entries , and
The first integral is the matrix-valued Bochner integral, the second is the nonnegative extended integral, and the superscript “real” denotes conversion from to , which sends to . Precisely, if either argument fails to be positive semidefinite with trace ; otherwise it is when , and when it is
where matrix functions use continuous functional calculus. In addition, for every message and position , there exist nonnegative weights , , summing to , and a unitary matrix with columns , such that . For these choices, define
Then for every message . The entropy matrix function also uses continuous functional calculus. The block restrictions appearing in the code definition impose no additional entrywise conditions here, because the specified system assigns the same block label to every coordinate. The conclusion concerns every positive block length, including .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.