Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Released interior profiles satisfy scaled regional extraction constraints

Proved
mme_released_interior_scaled_integer_profile_constraints_exact

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

exact-arithmeticmatrix-multiplicationregional-extraction

Every interior recipe, for all six owners and every positive integer replication, yields explicit regional split counts and child profiles in the actual global coordinate order. A physical reference realizes the split counts. Region sizes sum to the released denominator-fourth-power scale. Child profiles have the correct complementary-cell mass, grade support and all three boundary reversals. Split counts share the scaled denominator-square divisor; nonempty regions satisfy the corresponding size lower bound. Empty regions are allowed. Parent-window inclusion and entropy-rate bounds are not asserted.

Preamble
import Definitions.Def_mme_released_interior_integer_profiles
import Definitions.Def_mme_recursive_x_hash_families
import Mathlib.Data.Fintype.EquivFin
import Mathlib.Data.Fintype.Sigma
import Definitions.Def_mme_recursive_region_parent_profiles
import Definitions.Def_mme_released_global_profile_data
import Definitions.Def_mme_more_asymmetry_released_exact_profile_seed
import Mathlib.Data.List.Sort
open BigOperators MME MME.ReleasedInterior MME.RecursiveYZ MME.MoreAsymmetryExactSeed MME.CompleteSplit
Formal statement
theorem mme_released_interior_scaled_integer_profile_constraints_exact
    (owner : Fin 6) (s : Fin 45) (hi : (seed owner s).boundary = [])
    (k : ℕ) (hk : 0 < k) :
    let n := fun r => k * regionalSize owner s r
    let m := fun r c => k * splitCount owner s r c
    let mu := fun i c w => k * integerProfile owner s i c w
    ∃ reference : Address 4 6 (parent s) n,
      reference ∈ RecursiveXHash.target m ∧
      (∑ r : Fin 6, n r) = k * denominator ^ 4 ∧
      (∀ i c, ∑ w, mu i c w =
        m c.1 c.2 + m c.1 (complement (parent_total s c.1) c.2)) ∧
      (∀ i c w, 0 < mu i c w → ∑ h, (w h).val = (c.2.val i).val) ∧
      BoundaryProfiles mu ∧
      0 < k * denominator ^ 2 ∧
      (∀ r, n r ≠ 0 → k * denominator ^ 2 ≤ n r) ∧
      (∀ r c, k * denominator ^ 2 ∣ m r c) := by sorry
Source
Released exact profile seed, square-child distributions, exact histogram realization and integer scaling.

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