Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Whole-cell permutations retain complete boundary rates

Proved
mme_released_global_boundary_permuted_six_weight_rate

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

matrix-multiplicationtensor-extraction

Every mode permutation of a normalized boundary cell preserves its sixfold matrix extraction, exact marginal certificate, and complete replication-scaled entropy and dimension rate with explicit loss. The root exponent bound remains a separate obligation.

Preamble
import Theorems.Thm_mme_released_global_boundary_normalized_six_weight_rate
import Theorems.Thm_mme_sixSymmetrization_mode_permutation_iso
open BigOperators MME MME.ReleasedGlobal MME.MoreAsymmetryExactSeed
  MME.RecursiveYZ MME.CompleteSplit MME.TensorObj MME.RecursiveYZ.Boundary MME.RecursiveYZ.CWCells Filter
universe u
Formal statement
theorem mme_released_global_boundary_permuted_six_weight_rate
    (sigma : Equiv.Perm (Fin 3)) (owner : Fin 6) (c : Cell 8 1 (fun _ _ ↦ 8))
    (hmass : 0 < coarseCounts owner c.2) (z : Fin 3) (hz : (c.2.val z).val = 0)
    (delta : ℝ) (hdelta : 0 < delta) :
    ∃ B : Boundary.Profile 3
        (coarseCounts owner c.2),
      (∀ i w, wordCounts owner i c.2 w = B.mu z i w) ∧
      ∀ᶠ k : ℕ in atTop, ∃ M : ℕ, 0 < M ∧
        (∀ (eps : ℝ), 0 ≤ eps → ∀ (K : Type u) [Field K],
          let L := k * coarseCounts owner c.2
          Restrict (MMObj K M M M) (sixSymmetrization (permObj sigma
      ((source K 5 3 L).basisAllAllowedSubtensor (basis K 5 3 L) (fun i x =>
        (∀ r, CWCells.grade (label 5 3 L (Equiv.refl _) x r) = (c.2.val i).val) ∧
        if L = 0 then ∀ w, |(profile owner).2 i c w| ≤ eps else
        ∀ w, |(count (fun _ : Fin L => Unit.unit)
          (label 5 3 L (Equiv.refl _) x) Unit.unit w : ℝ) / (L : ℝ) -
          ((blocks k : ℝ) / (L : ℝ)) * (profile owner).2 i c w| ≤
          ((blocks k : ℝ) / (L : ℝ)) * eps))))) ∧
        ∀ tau : ℝ, 0 ≤ tau →
          Real.exp (6 * tau * ((k : ℝ) *
            (((coarseCounts owner c.2 : ℕ) : ℝ) *
              Real.log 2 * mme_modern_entropyBits
                (fun w ↦ (B.count w : ℝ) /
                  ((coarseCounts owner c.2 : ℕ) : ℝ)) +
              ((∑ w, B.count w * ones w : ℕ) : ℝ) * Real.log 5 - delta))) ≤
            ((M * M * M : ℕ) : ℝ) ^ tau := 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