§IV: min-relative entropy lower bounds the quantum Chernoff distance
ProvedQAlgorithms.Papers.Independent.Support50.P21.chernoff_lower_boundAll systems are nonzero finite-dimensional complex Hilbert spaces, and logarithms have base two.
For density operators , define on , taking a zero power as the support projector. The minimum is attained, and the Chernoff distance obeys
The endpoint convention is the continuous support-limit extension; zero minimum gives . This asserts the paper's lower bound, without a separate operational exponent theorem.
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 p.6: only the lower bound on Chernoff distance, plus attainment of the
printed minimum. Support-power endpoints give the continuous extension. -/
theorem chernoff_lower_bound (rho sigma : Mat I)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma) :
dMin rho sigma ≤ chernoff rho sigma ∧
∃ s ∈ Set.Icc (0 : ℝ) 1,
IsLeast (chernoffCoefficient rho sigma '' Set.Icc (0 : ℝ) 1)
(chernoffCoefficient rho sigma s) := 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 . For a positive semidefinite matrix , let be its functional-calculus power that assigns to a positive eigenvalue and assigns to a zero eigenvalue, including when . Put
If denotes the orthogonal projection onto the range of , then the following extended-real inequality holds:
There also exists such that belongs to and is no greater than every member of that set. The endpoint powers use the specified zero-on-the-kernel convention; uniqueness of the minimizing is not asserted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.