Quantum Neyman–Pearson lemma with nonnegative spectral ties
ProvedQAlgorithms.Papers.Independent.Gap48.P41.quantum_Neyman_PearsonLet be a nonempty finite orthonormal basis, and let be positive semidefinite complex matrices of trace one with . For a positive integer , an arbitrary effect accepts the null state . Write and . All logarithms are natural, with in rates. Write , using support-restricted spectral logarithms inside the trace.
For , set and let be its nonnegative spectral projection. It is an effect, and every effect satisfies
This is the paper's variational testing lemma, including its zero-eigenvalue acceptance convention.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P41
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P41
open scoped Matrix ComplexOrder BigOperators
open Filter QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Information100.P07 (positiveProjection)
open QAlgorithms.Papers.Independent.Dependency50.P28
(tr SupportLE relativeEntropy scalarPower classicalD typeI accept TestSequence
scaled logNonnegativeExtended)
open QAlgorithms.Papers.Independent.Claimed50.P15 (legendre)
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I : Type} [Fintype I] [DecidableEq I]
/-- PDF p.3, Lemma 1, (5): the nonnegative-spectrum test is an effect and maximizes
Tr[(rho^n-exp(n lambda)sigma^n) A] over ALL effects, with the source's zero ties. -/
theorem quantum_Neyman_Pearson [Nonempty I]
(rho sigma : Mat I) (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(hsupp : SupportLE rho sigma) (n : ℕ) (hn : 0 < n) (lambda : ℝ)
(A : Mat (Fin n → I)) (hA : IsEffect A) :
IsEffect (nonnegativeProjection (blockDifference rho sigma n lambda)) ∧
tr (blockDifference rho sigma n lambda * A) ≤
tr (blockDifference rho sigma n lambda *
nonnegativeProjection (blockDifference rho sigma n lambda)) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P41
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any nonempty finite index type with decidable equality. Let be complex matrices indexed by , each positive semidefinite with trace , and suppose . For every positive natural number , real number , and matrix indexed by functions satisfying and , define
where , uses real continuous functional calculus, and is the orthogonal projection onto . Then and , and
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.