Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

All six joint copy counts retain the summed pooled rate

Proved
mme_released_joint_interior_eventual_product_copy_rate

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

matrix-multiplicationtensor-extraction

At a common sufficiently large scale, all six exact joint outputs have positive multiplicity. The product of their actual repaired copy counts is bounded below by the exponential of the summed pooled regional rates, with all losses explicit. The root exponent bound remains a separate obligation.

Preamble
import Theorems.Thm_mme_released_joint_interior_eventual_positive_copy_rate
open scoped BigOperators
open MME MME.ReleasedJointInterior MME.RecursiveYZ MME.RegionRealization
open MME.ProfiledCW MME.CompleteSplit MME.MoreAsymmetryExactSeed
open MME.RecursiveYZ.Certificate MME.RecursiveYZ.CWCells MME.RegionRate Filter
Formal statement
theorem mme_released_joint_interior_eventual_product_copy_rate
    (eta : ℝ) (heta : 0 < eta) (loss : ℝ) (hloss : 0 < loss)
    (eps : ℝ) (heps : 0 < eps) :
    let rate : Fin 6 → ℝ := fun r =>
      regionalRate (parent_total r) (size r 1) (splitCount r 1) (integerProfile r 1) -
        (blocks r 1 : ℝ) * entropyModulus (Fin 2 → CompleteWord 2) eps -
        4 * eta * (blocks r 1 : ℝ) - loss
    (∀ r, 0 < rate r) → ∀ᶠ k : ℕ in atTop,
      ∃ (a : ∀ r : Fin 6, Address 4 270 (parent r) (size r k))
        (E : ∀ r : Fin 6, ExactStep 2 (blocks r k * 4) (gradedSource r k eps)),
        (∀ r, a r ∈ RecursiveXHash.target (n := size r k) (splitCount r k)) ∧
        (∀ r, (E r).output = fun i x =>
          Graded (parent_total r) i (a r)
            (ProfiledCW.split (positions r k) (positions_length r k) x) ∧
          Useful (fullCell (parent_total r) (a r)) (integerProfile r k i)
            (ProfiledCW.split (positions r k) (positions_length r k) x)) ∧
        (∀ r, 0 < (E r).copies) ∧
        0 < ∏ r, (E r).copies ∧
        Real.exp ((∑ r, rate r) * (k : ℝ)) ≤ (∏ r, (E r).copies : ℕ) := 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