Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Parent and child matrix extractions compose with exact sixth-power multiplicity

Proved
mme_six_repeated_matrix_family_weight

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

regional-extractiontensor-complexity

If p copies of Y restrict from X, and a q-term matrix family restricts from the six-fold symmetrization of Y with weight at least exp(rate), then a flattened p^6q-term matrix family restricts from the six-fold symmetrization of X with weight at least p^6exp(rate). All matrix dimensions are retained from the child family. The theorem is valid over every field, for every real tau and rate, including zero multiplicities; it assumes the parent and child restrictions explicitly.

Preamble
import Definitions.Def_mme_mmobj_mul
import Definitions.Def_mme_rank_bridge
import Definitions.Def_mme_cyclicSymmetrization_public_perm
import Definitions.Def_mme_six_symmetrized_tau_value
import Theorems.Thm_mme_sixSymmetrization_restrict
import Theorems.Thm_mme_bigAdd_mono_restrict
open MME BigOperators
set_option autoImplicit false
universe u
Formal statement
theorem mme_six_repeated_matrix_family_weight
    {K : Type u} [Field K] {p q : ℕ} {X Y : TensorObj K 3}
    (a b c : Fin q → ℕ) (tau rate : ℝ)
    (hparent : TensorObj.Restrict
      (TensorObj.bigAdd (fun _ : Fin p => Y)) X)
    (hchild : TensorObj.Restrict
      (TensorObj.bigAdd (fun j => MMObj K (a j) (b j) (c j)))
      (sixSymmetrization Y))
    (hweight : Real.exp rate ≤ ∑ j, ((a j * b j * c j : ℕ) : ℝ) ^ tau) :
    TensorObj.Restrict
      (TensorObj.bigAdd (fun r : Fin (p ^ 6 * q) =>
        let j := (finProdFinEquiv.symm r).2
        MMObj K (a j) (b j) (c j))) (sixSymmetrization X) ∧
    (p : ℝ) ^ 6 * Real.exp rate ≤
      ∑ r : Fin (p ^ 6 * q),
        let j := (finProdFinEquiv.symm r).2
        ((a j * b j * c j : ℕ) : ℝ) ^ tau := by sorry
Source
Exact tensor direct-sum multiplicity under six-symmetrization and restriction composition.

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