Tight relative entropy bound and explicit equality witnesses
OpenQAlgorithms.Papers.Independent.Support50.P15.theorem1Let be a finite dimension. States are positive semidefinite complex matrices of trace one. Write for entropy in nats, for Umegaki relative entropy (infinite on support failure), for binary entropy and for binary relative entropy. Define as the minimum of over satisfying . Then
For every equality is attainable. Every scalar minimizing pair gives the explicit commuting states , where ; these have exactly the prescribed difference and relative entropy . The infinite right endpoint is included. This identifies the sharp bound for quantum states and classical laws alike.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P15
noncomputable section
attribute [local instance] Classical.propDecidable
open scoped Matrix ComplexConjugate ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
namespace QAlgorithms.Papers.Independent.Support50.P15
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
/-- Theorem 1, PDF p.4; proof pp.17--20. Both directions and the computed commuting witnesses. -/
theorem theorem1 (d : ℕ) (hd : 2 ≤ d) :
(∀ a b : EntropyState d, tightBound d (difference a.val b.val) ≤ stateRelativeNats a b) ∧
(∀ delta ∈ Set.Icc (-Real.log d) (Real.log d),
∃ a b : EntropyState d, difference a.val b.val = delta ∧ stateRelativeNats a b = tightBound d delta) ∧
(∀ delta s r : ℝ, minimizingPair d delta s r →
∃ ha : IsDensityMatrix (family d s), ∃ hb : IsDensityMatrix (family d r),
family d s * family d r = family d r * family d s ∧
difference (family d s) (family d r) = delta ∧
stateRelativeNats ⟨family d s, ha⟩ ⟨family d r, hb⟩ = tightBound d delta) := by sorry
end QAlgorithms.Papers.Independent.Support50.P15
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , let states mean complex positive semidefinite matrices of trace , put for applied by continuous functional calculus, and define if , otherwise . All logarithms are natural, with . Set
where , with if , if and , and otherwise; an empty feasible set has infimum . The theorem asserts all of the following: every pair of states satisfies ; for each there exist states with and ; and for every real satisfying , , and , the diagonal matrices
are states, commute, have entropy difference , and satisfy . No uniqueness of the states or minimizing parameters is asserted here.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.