Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Independent permuted extractions retain their full copy rate

Proved
mme_permuted_product_extraction_six_matrix_weight_rate

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

matrix-multiplicationtensor-extraction

Independent repeated tensor restrictions combine with a matrix family after whole-factor mode permutations. The resulting sixfold matrix weight retains six times the sum of logarithmic copy bounds plus the complete child rate, with positive multiplicity. The root exponent bound remains a separate obligation.

Preamble
import Theorems.Thm_mme_repeated_extraction_six_matrix_weight_rate
import Theorems.Thm_mme_kronFin_repeated_isomorphic
import Theorems.Thm_mme_kronFin_mono_restrict
import Definitions.Def_mme_rank_bridge
open MME MME.TensorObj
open scoped BigOperators
universe u
Formal statement
theorem mme_permuted_product_extraction_six_matrix_weight_rate
    {K : Type u} [Field K] {n q : ℕ}
    (X Y : Fin n → TensorObj K 3) (copies : Fin n → ℕ)
    (sigma : Fin n → Equiv.Perm (Fin 3)) (parentRate : Fin n → ℝ)
    (a b c : Fin q → ℕ) (hq : 0 < q) (tau rate : ℝ)
    (hparent : ∀ r, Restrict (bigAdd (fun _ : Fin (copies r) => Y r)) (X r))
    (hcopies : ∀ r, Real.exp (parentRate r) ≤ (copies r : ℝ))
    (hchild : Restrict (bigAdd (fun j => MMObj K (a j) (b j) (c j)))
      (sixSymmetrization (kronFin n (fun r => permObj (sigma r) (Y r)))))
    (hweight : Real.exp rate ≤ ∑ j, ((a j * b j * c j : ℕ) : ℝ) ^ tau) :
    ∃ (m : ℕ) (a' b' c' : Fin m → ℕ), 0 < m ∧
      Restrict (bigAdd (fun j => MMObj K (a' j) (b' j) (c' j)))
        (sixSymmetrization (kronFin n (fun r => permObj (sigma r) (X r)))) ∧
      Real.exp (6 * (∑ r, parentRate r) + rate) ≤
        ∑ j, ((a' j * b' j * c' j : ℕ) : ℝ) ^ 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