§5.6, quantum Sanov theorem
OpenQAlgorithms.Papers.Independent.Intakenext100.P45.quantumSanovLet be any family of densities on a fixed finite-dimensional space, and let be a density. There exists one sequence of orthogonal projections such that for every , and
Every sequence of binary effects with the same pointwise vanishing type-I errors has upper type-II rate at most this infimum. No uniform convergence or compactness assumption is imposed. For , the extended infimum is and the null constraint is vacuous.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P45
open QAlgorithms Filter
open scoped Matrix ComplexConjugate ComplexOrder ENNReal BigOperators Topology
open QAlgorithms.Papers.Independent.Information100.P07
(support positivePart positiveProjection IsProjection)
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Dependency50.P28 (logNonnegativeExtended relativeEntropy)
open QAlgorithms.Papers.Independent.Claimed50.P15 (positiveMatrixRpow)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- arXiv:0708.4282v1, PDF p.31: §5.6, quantum Sanov theorem. -/
theorem quantumSanov (Gamma : Set (Mat I)) (hGamma : ∀ rho ∈ Gamma, IsDensityMatrix rho)
(sigma : Mat I) (hsigma : IsDensityMatrix sigma) :
let D : EReal := sInf {v | ∃ rho ∈ Gamma, v=relativeEntropy rho sigma}
(∃ P : QuantumTests I, (∀ k, IsProjection (P k)) ∧
(∀ rho ∈ Gamma, Tendsto (quantumAlpha rho P) atTop (nhds 0)) ∧
HasRate (quantumBeta sigma P) D) ∧
(∀ P : QuantumTests I, (∀ k, IsEffect (P k)) →
(∀ rho ∈ Gamma, Tendsto (quantumAlpha rho P) atTop (nhds 0)) →
Filter.limsup (fun k => rateTerm (quantumBeta sigma P k) k) atTop ≤ D) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P45
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any finite index type with decidable equality, let be any set of complex matrices indexed by , assume every is positive semidefinite with trace , and let also be positive semidefinite with trace . Put , where is if , and otherwise is , with natural logarithms, matrix logarithms defined by continuous functional calculus, and scalar . For any sequence of matrices on , define
where tensor powers have entries given by products of the corresponding matrix entries. There exists such a sequence in which every is Hermitian and satisfies , for which for every individual , and
Moreover, every sequence with and for all , and with for every , satisfies
Here for and otherwise, and the limits and infimum take values in the extended real line. The convergence over is pointwise, with no uniformity condition. The set may be empty; then and its universally quantified conditions are vacuous. The hypothesis on excludes empty .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.