Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact reference counts realize the child product inside the intact tensor

Proved
mme_recursive_yz_reference_child_product_restrict

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

regional-extractiontensor-complexity

For any exact recursive reference address and any enumeration of its cells, the product of the physical child tensors restricts from the intact reference tensor. Each child has size equal to its split count plus the complementary split count. The proof establishes the exact fiber cardinalities and applies the checked physical-cell grouping restriction. No matrix extraction or tensor-value assumption is required.

Preamble
import Theorems.Thm_mme_recursive_yz_actual_cell_product_restriction
import Definitions.Def_mme_recursive_x_hash_families
import Definitions.Def_mme_recursive_yz_physical_words
open BigOperators MME MME.RecursiveYZ MME.RecursiveYZ.CWCells
open MME.CompleteSplit MME.TensorObj
set_option autoImplicit false
universe u
Formal statement
theorem mme_recursive_yz_reference_child_product_restrict
    {K : Type u} [Field K] {half R : ℕ} {parent : Fin R → Fin 3 → ℕ}
    {n : Fin R → ℕ}
    (htotal : ∀ r, parent r 0 + parent r 1 + parent r 2 = 2 * half)
    (m : ∀ r, RecursiveThinSplit.Split half (parent r) → ℕ)
    (reference : Address half R parent n)
    (href : reference ∈ RecursiveXHash.target m)
    (ell L parts : ℕ) (positions : Fin L ≃ Position n)
    (d : Fin parts ≃ Cell half R parent)
    (mu : Fin 3 → Cell half R parent → CompleteWord ell → ℕ) :
    Restrict (kronFin parts (fun j ↦
      unbroken K 5 ell
        (m (d j).1 (d j).2 + m (d j).1 (complement (htotal (d j).1) (d j).2))
        (Equiv.refl _) (fun _ ↦ Unit.unit) (fun _ i ↦ ((d j).2.val i).val)
        (fun i _ ↦ mu i (d j))))
      (unbroken K 5 ell L positions (fullCell htotal reference)
        (fun cell i ↦ (cell.2.val i).val) mu) := by sorry
Source
Exact physical-cell grouping and released tensor extractions.

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