Rational certificates for entropy minus homogeneous entropies
Provedmme_rational_entropy_difference_certificatematrix-multiplicationregional-extraction
A rational arithmetic inequality certifies a lower bound for a finite entropy minus a sum of homogeneous entropies. All mass vectors are nonnegative and zero compatibility classes are allowed. Numerical certificates must still be connected to the released parent and compatibility definitions. The full matrix exponent bound remains a separate obligation.
Preamble
import Theorems.Thm_mme_mass_entropy_dyadic_upper open scoped BigOperators open MME.RegionRate
Formal statement
theorem mme_rational_entropy_difference_certificate
{W C V : Type*} [Fintype W] [Fintype C] [Fintype V]
(p : W → ℚ) (hp : ∀ w, 0 ≤ p w)
(x : C → V → ℚ) (hx : ∀ c v, 0 ≤ x c v)
(kp : W → ℕ) (kx : C → V → ℕ) (b : ℚ) :
b ≤
(∑ w, p w * ((kp w : ℚ) * (693147180 / 1000000000) + 1 -
2 ^ kp w * p w)) -
∑ c, (∑ v, x c v) * ∑ v, (x c v / ∑ u, x c u) *
((kx c v : ℚ) * (693147181 / 1000000000) - 1 +
(2 ^ kx c v * (x c v / ∑ u, x c u))⁻¹) →
(b : ℝ) ≤ entropy (fun w => (p w : ℝ)) -
∑ c, massEntropy (fun v => (x c v : ℝ)) := by sorrySource
Kernel-checked regional count identities and exact extraction with empty regions.