eq53 entropy constraint
OpenQAlgorithms.Papers.Independent.Support50.P15.eq53EntropyConstraintLet , be a normalized density matrix, and . Let range over normalized states in the same dimension, and take the infimum in the extended real order. Then
At the strict constraint set is empty and its distance is . The statement includes classical laws as diagonal matrices and does not assert the cited source-coding error-exponent identification. It gives the entropy-constraint consequence of the sharp divergence bound.
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)
/-- Entropy-constraint application following (53), PDF p.16, including the empty endpoint. -/
theorem eq53EntropyConstraint {d : ℕ} (hd : 2 ≤ d) (a : EntropyState d) (r : ℝ)
(hr : entropy a.val < r) (hrd : r ≤ Real.log d) :
tightBound d (r - entropy a.val) ≤ entropyConstraintDistance r a ∧
(r = Real.log d → entropyConstraintDistance r a = ⊤) := by sorry
end QAlgorithms.Papers.Independent.Support50.P15
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a natural number, let be a complex positive semidefinite matrix of trace , and let be real with , where , using spectral functional calculus and . For density matrices , define if , and otherwise , with in the functional calculus. Define
For , put and
where , and equals if , if , and otherwise. All these infima are in the extended reals, with empty infimum . The assertion is , together with the implication . The entropy constraint defining is strict; at it admits no density matrix. No full-rank assumption is made on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.