§I/§IV: min-relative entropy as zero-type-I testing exponent
ProvedQAlgorithms.Papers.Independent.Support50.P21.zeroTypeI_optimal_testAll systems are nonzero finite-dimensional complex Hilbert spaces, and logarithms have base two.
For density operators , let be the support projector of . This is an effect with zero type-I error . For every effect with ,
Thus the minimum type-II error is achieved by the support test, with no factor one half. Orthogonal states give zero type-II error and infinite divergence. This is the zero-type-I operational interpretation.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P21
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P21
open QAlgorithms QAlgorithms.Entanglement Filter
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
-- Use the accepted declarations directly; no paper-local aliases hide dimension binders.
open QAlgorithms.Papers.Independent.Claimed50.P33
(FiniteState IsAverageLocalMonotone IsAdaptiveLOCCMonotone)
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Dependency50.P35 (tr elog maxRelative)
open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)
open QAlgorithms.Papers.Independent.Information100.P07 (support)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
section Statements
variable [Nonempty I] [Nonempty J]
/-- PDF pp.2,6: optimal type-II error with ZERO type-I error, with an achieving
support-projector test. There is no equal-prior factor 1/2 in the type-II error. -/
theorem zeroTypeI_optimal_test (rho sigma : Mat I)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma) :
IsEffect (support rho) ∧ tr ((1 - support rho) * rho) = 0 ∧
(∀ P : Mat I, IsEffect P → tr ((1 - P) * rho) = 0 →
tr (support rho * sigma) ≤ tr (P * sigma)) ∧
dMin rho sigma = -elog (tr (support rho * sigma)) := by sorry
end Statements
end QAlgorithms.Papers.Independent.Support50.P21
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite index type with decidable equality, and let be positive semidefinite complex matrices on with trace . Write for the orthogonal projection onto the range of , and . Then and are positive semidefinite,
and, for every complex matrix on such that and are positive semidefinite and ,
Furthermore, the quantity called equals , where for and otherwise. In particular, this quantity is when . The competing need only be an effect, not a projection.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.