Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rational certificates bound actual parent entropy minus compatibility

Proved
mme_rational_parent_compatibility_certificate

by Robertboy18 · Sep 23, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

matrix-multiplicationregional-extraction

An explicit rational inequality on the parent counts and full partition counts certifies a lower bound for entropy of parentMixture minus the normalized homogeneous entropies of the original partCount partition. Zero masses are allowed. The full matrix exponent bound remains a separate obligation.

Preamble
import Theorems.Thm_mme_rational_entropy_difference_certificate
import Definitions.Def_mme_regional_split_entropy_data
import Theorems.Thm_mme_partition_mass_entropy_full_sum
open scoped BigOperators
open MME MME.RegionRate MME.RegionRealization MME.RecursiveYZ
Formal statement
theorem mme_rational_parent_compatibility_certificate
    {half R : ℕ} {W : Type*} [Fintype W]
    {parent : Fin R → Fin 3 → ℕ}
    (htotal : ∀ r, parent r 0 + parent r 1 + parent r 2 = 2 * half)
    (n : Fin R → ℕ) (m : ∀ r, RecursiveThinSplit.Split half (parent r) → ℕ)
    (mu : Cell half R parent → W → ℕ) (i : Fin 2) (r : Fin R)
    (kp : (Fin 2 → W) → ℕ)
    (kx : (RecursiveThinSplit.Split half (parent r) ⊕ Fin (half + 1)) → W → ℕ) (b : ℚ) :
    let p : (Fin 2 → W) → ℚ := fun w =>
      (∑ c, (m r c : ℚ) * ((mu ⟨r, c⟩ (w 0) : ℚ) / ∑ v, (mu ⟨r, c⟩ v : ℚ)) *
        ((mu ⟨r, complement (htotal r) c⟩ (w 1) : ℚ) /
          ∑ v, (mu ⟨r, complement (htotal r) c⟩ v : ℚ))) / n r
    let x := fun (t : RecursiveThinSplit.Split half (parent r) ⊕ Fin (half + 1)) w =>
      ((match t with
        | Sum.inl c => if (if i = 0 then (c.val 2).val = 0 else
            (c.val 0).val = 0 ∨ (c.val 1).val = 0) then mu ⟨r, c⟩ w else 0
        | Sum.inr j => ∑ c, if ¬ (if i = 0 then (c.val 2).val = 0 else
            (c.val 0).val = 0 ∨ (c.val 1).val = 0) ∧ c.val (yzMode i) = j
            then mu ⟨r, c⟩ w else 0 : ℕ) : ℚ) / n r
    b ≤
      (∑ w, p w * ((kp w : ℚ) * (693147180 / 1000000000) + 1 -
        2 ^ kp w * p w)) -
      ∑ t, (∑ v, x t v) * ∑ v, (x t v / ∑ u, x t u) *
        ((kx t v : ℚ) * (693147181 / 1000000000) - 1 +
          (2 ^ kx t v * (x t v / ∑ u, x t u))⁻¹) →
    (b : ℝ) ≤ entropy (parentMixture htotal n m mu r) -
      ∑ t, massEntropy (fun w =>
        (partCount (fun c => yzBoundary i ⟨r, c⟩) (fun c => c.val (yzMode i))
          (fun c w => mu ⟨r, c⟩ w) t w : ℝ) / n r) := by sorry
Source
Kernel-checked regional count identities and exact extraction with empty regions.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me