eq54
OpenQAlgorithms.Papers.Independent.Support50.P15.eq54Let be normalized classical probability laws on symbols, , and , using natural logarithms. Define the Chernoff information by , including one-sided endpoint limits and . Then
If Conjecture 12 holds in this dimension, then also . Zero masses and disjoint supports are included without assuming a finite common-divergence Hellinger witness. This is the classical commuting entropy-difference bound, not a claim for noncommuting quantum states.
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)
/-- Eq. (54), PDF p.16: classical commuting states only, including singular endpoints.
No finite common-divergence Hellinger witness is assumed. -/
theorem eq54 {d : ℕ} (hd : 2 ≤ d) (p q : Fin d → ℝ) (hp : isLaw p) (hq : isLaw q) :
(redundancyBound d |shannonEntropyNats p - shannonEntropyNats q| : EReal) ≤ chernoff p q ∧
(asymmetryConjecture d →
tightBound d (-|shannonEntropyNats p - shannonEntropyNats q| / 2) ≤ chernoff p q) := 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 and let be probability vectors on , so every entry is nonnegative and each vector sums to ; zero entries are allowed. Use natural logarithms and define , with , and . Put
where the powers are real powers. Let and . Define , , and
where , with when , when , and otherwise; an empty infimum is . Then in the extended reals. Furthermore, if for every , then .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.