Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A cyclic matrix extraction squares its count and volume under full symmetrization

Proved
mme_cyclic_uniform_extraction_six_count

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

matrix-multiplicationregional-extraction

A positive cyclic matrix extraction with common matrix volume V and nonnegative copy lower bound B yields a six-fold extraction with positive copies, copy lower bound B squared and common volume V squared. The construction uses all pairs of original copies and their swapped matrices. The full matrix exponent bound remains a separate obligation.

Preamble
import Theorems.Thm_mme_finite_MM_extraction_swap_double
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
open MME
universe u
Formal statement
theorem mme_cyclic_uniform_extraction_six_count
    {K : Type u} [Field K] {T : TensorObj K 3} {k V : ℕ}
    (a b c : Fin k → ℕ) (hk : 0 < k)
    (hrestrict : TensorObj.Restrict
      (TensorObj.bigAdd (fun j => MMObj K (a j) (b j) (c j))) (cyclicSymmetrization T))
    (hvolume : ∀ j, a j * b j * c j = V)
    (B : ℝ) (hB : 0 ≤ B) (hcount : B ≤ (k : ℝ)) :
    ∃ (copies : ℕ) (a' b' c' : Fin copies → ℕ),
      0 < copies ∧
      TensorObj.Restrict
        (TensorObj.bigAdd (fun j => MMObj K (a' j) (b' j) (c' j))) (sixSymmetrization T) ∧
      B ^ 2 ≤ (copies : ℝ) ∧
      ∀ j, a' j * b' j * c' j = V ^ 2 := 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