Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Any actual parent partition retains its complete child-table rate

Proved
mme_released_interior_parent_table_rate_bound

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

matrix-multiplicationtensor-extraction

The actual boundary and 112 child rates retain the complete table sum under an arbitrary extraction partition. The normalized loss is at most 540 times delta. The root exponent bound remains a separate obligation.

Preamble
import Theorems.Thm_mme_boundary_table_weight_rate_bound
import Theorems.Thm_mme_112_table_weight_rate_bound
import Theorems.Thm_mme_released_interior_child_partition_loss_bound
import Theorems.Thm_mme_released_interior_cell_child_parameter_bound
import Theorems.Thm_mme_released_interior_child_mass_bounds
open scoped BigOperators
open MME MME.RegionRate MME.ReleasedInterior MME.MoreAsymmetryExactSeed
open MME.RecursiveYZ MME.CompleteSplit MME.RecursiveYZ.Boundary
Formal statement
theorem mme_released_interior_parent_table_rate_bound
    (owner : Fin 6) (s : Fin 45) (k : ℕ)
    (tau delta bound : ℝ) (htau : tau ≤ 1) (hdelta : 0 ≤ delta)
    (q : Cell 4 6 (parent s) → ℝ) (hsum : bound ≤ ∑ c, q c)
    (hboundary : ∀ c z, (c.2.val z).val = 0 →
        (denominator : ℝ) ^ 4 * q c ≤ 6 * tau *
          (massEntropy (fun w ↦ (integerProfile owner s (z + 1) c w : ℝ)) +
            (∑ w, (integerProfile owner s (z + 1) c w : ℝ) * (ones w : ℝ)) * Real.log 5))
    (hinterior : ∀ c z, (∀ i : Fin 3, (c.2.val i).val = if i = z then 2 else 1) →
        let p : ℝ := ((((seed owner s).children.find?
          (fun a => a.1 == c.1.val && a.2.1 == sourceShape owner c.2)).getD (0, [], 0)).2.2 : ℝ) / denominator
        q c ≤ (((seed owner s).region.getD c.1.val 0 : ℝ) / denominator *
          ((splitWeight owner s c.1 c.2 + splitWeight owner s c.1
            (complement (parent_total s c.1) c.2) : ℕ) : ℝ) / denominator / 2) *
          (4 * (entropy ![p, p, 1 - 2 * p] + 2 * Real.log 2) +
            24 * (1 - p) * tau * Real.log 5))
    (nB nI : ℕ) (e : (Fin nB ⊕ Fin nI) ≃ Cell 4 6 (parent s))
    (zB : Fin nB → Fin 3) (zI : Fin nI → Fin 3)
    (hzB : ∀ j, ((e (.inl j)).2.val (zB j)).val = 0)
    (hzI : ∀ j i, ((e (.inr j)).2.val i).val = if i = zI j then 2 else 1)
    (B : ∀ r, Boundary.Profile 2
      (splitCount owner s (e (.inl r)).1 (e (.inl r)).2 +
        splitCount owner s (e (.inl r)).1
          (complement (parent_total s (e (.inl r)).1) (e (.inl r)).2)))
    (hmu : ∀ r i w, integerProfile owner s i (e (.inl r)) w = (B r).mu (zB r) i w) :
    ((2 * k : ℕ) : ℝ) * (denominator : ℝ) ^ 4 * (bound - 540 * delta) ≤
      ((∑ r, 6 * tau * (((2 * k : ℕ) : ℝ) *
            (((splitCount owner s (e (.inl r)).1 (e (.inl r)).2 +
                splitCount owner s (e (.inl r)).1 (complement (parent_total s (e (.inl r)).1) (e (.inl r)).2) : ℕ) : ℝ) *
              Real.log 2 * mme_modern_entropyBits
                (fun w ↦ ((B r).count w : ℝ) /
                  ((splitCount owner s (e (.inl r)).1 (e (.inl r)).2 +
                    splitCount owner s (e (.inl r)).1 (complement (parent_total s (e (.inl r)).1) (e (.inl r)).2) : ℕ) : ℝ)) +
              ((∑ w, (B r).count w * ones w : ℕ) : ℝ) * Real.log 5 - delta))) + (∑ t,
      let m := k * ((seed owner s).region.getD (e (.inr t)).1.val 0 *
        (splitWeight owner s (e (.inr t)).1 (e (.inr t)).2 +
          splitWeight owner s (e (.inr t)).1 (complement (parent_total s (e (.inr t)).1) (e (.inr t)).2)) * denominator)
      let N := denominator * m
      let L := (2 * ((((seed owner s).children.find?
        (fun a => a.1 == (e (.inr t)).1.val && a.2.1 == sourceShape owner (e (.inr t)).2)).getD (0, [], 0)).2.2)) * m
      let G := (denominator - 2 * ((((seed owner s).children.find?
        (fun a => a.1 == (e (.inr t)).1.val && a.2.1 == sourceShape owner (e (.inr t)).2)).getD (0, [], 0)).2.2)) * m
      let p : ℝ :=
        (((((seed owner s).children.find?
          (fun a => a.1 == (e (.inr t)).1.val && a.2.1 == sourceShape owner (e (.inr t)).2)).getD
            (0, [], 0)).2.2) : ℝ) / denominator
      ((4 * N : ℕ) : ℝ) *
        (Real.log 2 * (mme_modern_entropyBits ![p, p, 1 - 2 * p] + 2) - delta) +
        ((6 * (4 * G + 2 * L) : ℕ) : ℝ) * tau * Real.log 5 )) := by sorry
Source
Checked tensor restrictions and released global histogram extraction.

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