Lemma 10
ProvedQAlgorithms.Papers.Independent.Support50.P21.relativeEntropy_sandwichAll systems are nonzero finite-dimensional complex Hilbert spaces, and logarithms have base two.
Let be density operators. Write when , and otherwise. Then
This compares the two new divergences with support-aware Umegaki relative entropy.
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]
/-- Lemma 10, PDF p.5, (27): support-aware relative entropy in bits. -/
theorem relativeEntropy_sandwich (rho sigma : Mat I)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma) :
dMin rho sigma ≤ unnormalizedRelativeBits rho sigma ∧
unnormalizedRelativeBits rho sigma ≤ maxRelative 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
For any finite index type with decidable equality, let be positive semidefinite complex matrices indexed by , each with complex trace one. Let be the orthogonal projection onto the range of , write , define for and otherwise, and set
Here the matrix logarithms use continuous functional calculus with the total real logarithm, whose value at zero is zero, and the infimum defining is extended-real-valued with empty infimum . Then
No support inclusion is imposed as a hypothesis; its failure selects the branch of .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.