Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Boundary child products attain their summed weight rate

Proved
mme_released_interior_boundary_product_weight_rate

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

matrix-multiplicationregional-extraction

At a common even replication threshold, every finite family of boundary children in any released interior recipe admits one positive square-matrix extraction with the sum of its entropy and letter-weight rates. Empty and repeated cells are allowed. The full matrix exponent bound remains a separate obligation.

Preamble
import Theorems.Thm_mme_released_interior_boundary_simultaneous_six_weight_rate
import Theorems.Thm_mme_six_square_product_weight
import Mathlib.Tactic.Choose
open BigOperators MME MME.TensorObj MME.CompleteSplit MME.RecursiveYZ
  MME.RecursiveYZ.Boundary MME.ReleasedInterior Filter
universe u
Formal statement
theorem mme_released_interior_boundary_product_weight_rate
    (delta : ℝ) (hdelta : 0 < delta) :
    ∀ᶠ k : ℕ in atTop, ∀ (owner : Fin 6) (s : Fin 45),
      (seed owner s).boundary = [] →
      ∀ (n : ℕ) (c : Fin n → Cell 4 6 (parent s)) (z : Fin n → Fin 3),
      (∀ r, ((c r).2.val (z r)).val = 0) →
    ∃ B : ∀ r, Boundary.Profile 2
        (splitCount owner s (c r).1 (c r).2 +
          splitCount owner s (c r).1 (complement (parent_total s (c r).1) (c r).2)),
      (∀ r i w, integerProfile owner s i (c r) w = (B r).mu (z r) i w) ∧
      ∃ M : ℕ, 0 < M ∧
        (∀ (K : Type u) [Field K],
          TensorObj.Restrict (MMObj K M M M)
            (sixSymmetrization (TensorObj.kronFin n (fun r ↦ CWCells.unbroken K 5 2
              ((2 * k) * (splitCount owner s (c r).1 (c r).2 +
                splitCount owner s (c r).1 (complement (parent_total s (c r).1) (c r).2)))
              (Equiv.refl _) (fun _ => Unit.unit)
              (fun _ i => ((c r).2.val i).val)
              (fun i _ w => (2 * k) * integerProfile owner s i (c r) w))))) ∧
        ∀ tau : ℝ, 0 ≤ tau →
          Real.exp (∑ r, 6 * tau * (((2 * k : ℕ) : ℝ) *
            (((splitCount owner s (c r).1 (c r).2 +
                splitCount owner s (c r).1 (complement (parent_total s (c r).1) (c r).2) : ℕ) : ℝ) *
              Real.log 2 * mme_modern_entropyBits
                (fun w ↦ ((B r).count w : ℝ) /
                  ((splitCount owner s (c r).1 (c r).2 +
                    splitCount owner s (c r).1 (complement (parent_total s (c r).1) (c r).2) : ℕ) : ℝ)) +
              ((∑ w, (B r).count w * ones w : ℕ) : ℝ) * Real.log 5 - delta))) ≤
            ((M * M * M : ℕ) : ℝ) ^ tau := 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