Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One common scale attains every positive released 112 entropy rate

Proved
mme_released_interior_112_simultaneous_physical_entropy_rate

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

matrix-multiplicationregional-extraction

For every positive rate allowance, all sufficiently large common replications give every positively weighted released 112 child its combined logarithmic entropy copy rate and exact matrix volumes, uniformly over all fields. All coordinate placements and zero outer parameters are included. Empty cells have a separate scalar extraction. The full matrix exponent bound remains a separate obligation.

Preamble
import Theorems.Thm_mme_released_interior_112_physical_six_entropy_rate
open MME MME.RecursiveYZ MME.ReleasedInterior MME.MoreAsymmetryExactSeed MME.CompleteSplit Filter
universe u
Formal statement
theorem mme_released_interior_112_simultaneous_physical_entropy_rate
    (delta : ℝ) (hdelta : 0 < delta) :
    ∀ᶠ k : ℕ in atTop, ∀ (owner : Fin 6) (s : Fin 45) (r : Fin 6)
      (c : Split s) (z : Fin 3),
      (∀ i : Fin 3, (c.val i).val = if i = z then 2 else 1) →
      (0 < (seed owner s).region.getD r.val 0 *
        (splitWeight owner s r c +
          splitWeight owner s r (complement (parent_total s r) c))) →
      let m := k * ((seed owner s).region.getD r.val 0 *
        (splitWeight owner s r c +
          splitWeight owner s r (complement (parent_total s r) c)) * denominator)
      let N := denominator * m
      let L := (2 * ((((seed owner s).children.find?
        (fun a => a.1 == r.val && a.2.1 == sourceShape owner c)).getD (0, [], 0)).2.2)) * m
      let G := (denominator - 2 * ((((seed owner s).children.find?
        (fun a => a.1 == r.val && a.2.1 == sourceShape owner c)).getD (0, [], 0)).2.2)) * m
      let p : ℝ :=
        (((((seed owner s).children.find?
          (fun a => a.1 == r.val && a.2.1 == sourceShape owner c)).getD
            (0, [], 0)).2.2) : ℝ) / denominator
      ∀ (K : Type u) [Field K], ∃ (copies : ℕ) (a b d : Fin copies → ℕ),
        0 < copies ∧
        TensorObj.Restrict (TensorObj.bigAdd (fun j => MMObj K (a j) (b j) (d j)))
          (sixSymmetrization
            (CWCells.unbroken K 5 2
              ((2 * k) * (splitCount owner s r c +
                splitCount owner s r (complement (parent_total s r) c))) (Equiv.refl _)
              (fun _ => Unit.unit) (fun _ i => (c.val i).val)
              (fun i _ w => (2 * k) * integerProfile owner s i ⟨r, c⟩ w))) ∧
        (∀ j, a j * b j * d j = 5 ^ (6 * (4 * G + 2 * L))) ∧
        ((4 * N : ℕ) : ℝ) *
          (Real.log 2 * (mme_modern_entropyBits ![p, p, 1 - 2 * p] + 2) - delta) ≤
            Real.log (copies : ℝ) := 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