Dyadic upper bounds for cross entropy
Provedmme_cross_entropy_dyadic_uppermatrix-multiplicationregional-extraction
Positive comparison weights and nonnegative finite weights admit an explicit upper bound for cross entropy from dyadic logarithm estimates. The full matrix exponent bound remains a separate obligation.
Preamble
import Theorems.Thm_mme_dyadic_neg_log_bounds import Mathlib.Algebra.Order.BigOperators.Group.Finset open scoped BigOperators
Formal statement
theorem mme_cross_entropy_dyadic_upper {W : Type*} [Fintype W]
(p q : W → ℝ) (hp : ∀ w, 0 ≤ p w) (hq : ∀ w, 0 < q w) (k : W → ℕ) :
-(∑ w, p w * Real.log (q w)) ≤
∑ w, p w * ((k w : ℝ) * (693147181 / 1000000000 : ℝ) - 1 +
(2 ^ k w * q w)⁻¹) := by sorrySource
Kernel-checked regional count identities and exact extraction with empty regions.