Remark 5, (34): positive-map decoder converse
OpenQAlgorithms.Papers.Independent.Intakenext100.P20.positive_decoder_converseLet be an arbitrary discrete label set, let be normalized pure source states on a nonzero finite-dimensional complex space , and let sum to one. Write . Let be finite and nonzero, any visible encoder, and a positive, trace-preserving complex-linear decoder. For and every real ,
Complete positivity is not required for this factor-two spectral converse.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P20
noncomputable section
open scoped Matrix ENNReal ComplexOrder Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P20
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P47 (IsProbability)
open QAlgorithms.Papers.Independent.Information100.P53 (SpectralData)
open QAlgorithms.Papers.Independent.Gap48.P19 (shannonNats)
open QAlgorithms.Papers.Independent.Dependency50.P28 (classicalD)
attribute [local instance] Classical.propDecidable
/-- Remark 5, PDF p.6, (34), Appendix D p.11: positivity suffices when
both right-hand terms are multiplied by two; trace preservation is retained. -/
theorem positive_decoder_converse {L : Type*} {d m : ℕ} (S : DiscretePureSource L d)
(hm : 0 < m) (F : L → Matrix (Fin m) (Fin m) ℂ)
(hF : ∀ i, IsDensityMatrix (F i))
(D : Matrix (Fin m) (Fin m) ℂ →ₗ[ℂ] Matrix (Fin d) (Fin d) ℂ)
(hD : IsPositiveTracePreserving D) (lambda : ℝ) :
1 - averageLoss S.weight S.state (fun i => D (F i)) false ≤
2 * Real.exp lambda * m +
2 * (S.average * thresholdProjection S.average lambda true).trace.re := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P20
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any type, let be natural numbers, and let specify , nonnegative summable weights with , and density matrices for unit vectors , where density matrices are positive semidefinite and have trace . Assume , let be a density matrix for every , and let be a complex-linear map taking every positive semidefinite matrix to a positive semidefinite matrix and satisfying for every matrix . For every real , set and let be the functional-calculus projection of associated with the scalar condition . Then
No finiteness or countability assumption is imposed on , and the stated conditions on are positivity and trace preservation.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.