Proposition 5: proposition 5
ProvedQAlgorithms.Papers.Independent.Bridge50.P50.proposition_5Let be the density operators on a nonzero, finite-dimensional complex Hilbert space of dimension . Logarithms are in bits, is support-aware Umegaki relative entropy, and is relative entropy variance in bits squared. Let be a channel from an arbitrary nonempty set, with no countability or topology assumption on , and fix . Let optimize finite nonempty uniform-message codes with average decoding error at most and an arbitrary collective POVM. Put , for and otherwise, and let be the standard normal quantile. For every , using the actual image in the testing radius,
The testing radius optimizes the comparison state before taking the supremum over channel outputs. This is a one-shot converse for arbitrary input alphabets.
import Definitions.Def_QAlgorithms_Papers_Independent_Bridge50_P50
noncomputable section
open scoped Topology BigOperators ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open MeasureTheory Filter Set
namespace QAlgorithms.Papers.Independent.Bridge50.P50
attribute [local instance] Classical.propDecidable Classical.decEq
-- Exact accepted primitives; these names do not create local declarations.
open QAlgorithms.Papers.Independent.Information100.P63 (Mat logTwo testingBeta normalCDF normalQuantile)
open QAlgorithms.Papers.Independent.Information100.P08 (Ensemble ensembleAverage)
open QAlgorithms.Papers.Independent.Information100.P69 (entropy)
open QAlgorithms.Papers.Independent.Dependency50.P35 (Dominates)
open QAlgorithms.Papers.Independent.Dependency50.P36 (pairInformationVariance)
open QAlgorithms (vnEntropy traceDistance minEigenvalue)
attribute [local instance] QAlgorithms.Papers.Independent.Bridge50.P50.matrixBorelMeasurable
attribute [local instance] QAlgorithms.Papers.Independent.Bridge50.P50.matrixBorelSpace
/-- Proposition 5, PDF p.9, (28): actual image, normalized divergence and full penalty. -/
theorem proposition_5 {X I : Type*} [Nonempty X] [Fintype I] [DecidableEq I] [Nonempty I]
(W : X → Mat I) (hW : ∀ x, QAlgorithms.IsDensityMatrix (W x))
(e mu : ℝ) (he : 0 < e ∧ e < 1) (hmu : 0 < mu ∧ mu < 1-e) :
ENNReal.ofReal (logTwo (cqOptimalMessages W e)) ≤ testingRadius (Set.range W) (e+mu) +
ENNReal.ofReal (logTwo ((e+mu)/(mu*(1-e-mu)))) := by sorry
end QAlgorithms.Papers.Independent.Bridge50.P50
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any nonempty type and a finite nonempty type with decidable equality. Let assign a positive semidefinite matrix of trace to every , and let and . Write . Let be the natural-number supremum of all for which there are an encoder , with , and positive semidefinite decoding matrices summing to the identity, such that ; repeated encoder values are permitted, and this natural-number supremum is if the defining set is empty or unbounded. For matrices , define as the real infimum of over matrices with , , and , and define when this infimum is , and otherwise . Define , with values in . Then
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.