Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The full pooled extraction gives normalized matrix weights in CW powers

Proved
mme_released_joint_complete_CW_normalized_matrix_weight_rate

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

matrix-multiplicationtensor-extraction

The complete pooled parent, interior-child, and complementary-boundary rates combine with actual outer hashing and transfer to CW powers. Every rate certificate and loss is retained, and source multiplicity factors out exactly. Positive regional surplus remains a hypothesis; final numerical surplus remains to be certified. The root exponent bound remains a separate obligation.

Preamble
import Theorems.Thm_mme_released_joint_outer_windows_matrix_weight_rate
import Theorems.Thm_mme_released_joint_outer_CW_normalized_matrix_weight_rate
open MME MME.RecursiveYZ MME.MoreAsymmetryExactSeed MME.CompleteSplit Filter
open MME.ReleasedJointInterior MME.RecursiveYZ.Boundary MME.RegionRate
open MME.TensorObj
open scoped BigOperators
universe u
Formal statement
theorem mme_released_joint_complete_CW_normalized_matrix_weight_rate
    {K : Type u} [Field K]
    (delta : ℝ) (hdelta : 0 < delta)
    (boundaryLoss : ℝ) (hboundaryLoss : 0 < boundaryLoss)
    (eta : ℝ) (heta : 0 < eta) (loss : ℝ) (hloss : 0 < loss)
    (rho : Fin 6 → ℝ) (hrho : ∀ owner, 0 ≤ rho owner)
    (hgap : ∀ owner, rho owner < (ReleasedGlobal.profile owner).rate (fun _ ↦ 1)) :
    ∃ eps0 : ℝ, 0 < eps0 ∧ ∀ eps : ℝ, 0 < eps → eps ≤ eps0 →
    let parentRate : Fin 6 → ℝ := fun r =>
      regionalRate (parent_total r) (size r 1) (splitCount r 1) (integerProfile r 1) -
        (blocks r 1 : ℝ) * entropyModulus (Fin 2 → CompleteWord 2) eps -
        4 * eta * (blocks r 1 : ℝ) - loss
    (∀ r, 0 < parentRate r) →
    ∃ boundaryRate : Fin 270 → ℝ,
      (∀ j, (0 < weight j ∨ ReleasedGlobal.coarseCounts (component j).1 (ReleasedGlobal.shapeEquiv (component j).2) = 0) → boundaryRate j = 0) ∧
      (∀ j, ¬ 0 < weight j → 0 < ReleasedGlobal.coarseCounts (component j).1 (ReleasedGlobal.shapeEquiv (component j).2) →
        ∃ (z : Fin 3) (B : Boundary.Profile 3 (ReleasedGlobal.coarseCounts (component j).1 (ReleasedGlobal.shapeEquiv (component j).2))),
          ((ReleasedGlobal.shapeEquiv (component j).2).val z).val = 0 ∧
          (∀ i w, ReleasedGlobal.wordCounts (component j).1 i (ReleasedGlobal.shapeEquiv (component j).2) w = B.mu z i w) ∧
          boundaryRate j = (ReleasedGlobal.coarseCounts (component j).1 (ReleasedGlobal.shapeEquiv (component j).2) : ℝ) * Real.log 2 *
            mme_modern_entropyBits (fun w => (B.count w : ℝ) /
              (ReleasedGlobal.coarseCounts (component j).1 (ReleasedGlobal.shapeEquiv (component j).2) : ℝ)) +
            ((∑ w, B.count w * ones w : ℕ) : ℝ) * Real.log 5 - boundaryLoss) ∧
    ∀ᶠ n : ℕ in atTop, ∀ (tau : ℝ), 0 ≤ tau →
    ∃ rate : Fin 270 → ℝ,
      (∀ j, weight j = 0 → rate j = 0) ∧
      (∀ j, 0 < weight j →
      ∃ (nB nI : ℕ) (e : (Fin nB ⊕ Fin nI) ≃ Cell 4 6 (ReleasedInterior.parent (component j).2))
        (zB : Fin nB → Fin 3) (zI : Fin nI → Fin 3),
        (∀ j, ((e (.inl j)).2.val (zB j)).val = 0) ∧
        (∀ j i, ((e (.inr j)).2.val i).val = if i = zI j then 2 else 1) ∧
    ∃ B : ∀ r, Boundary.Profile 2
        (ReleasedInterior.splitCount (component j).1 (component j).2 (e (.inl r)).1 (e (.inl r)).2 +
          ReleasedInterior.splitCount (component j).1 (component j).2 (e (.inl r)).1 (complement (ReleasedInterior.parent_total (component j).2 (e (.inl r)).1) (e (.inl r)).2)),
      (∀ r i w, ReleasedInterior.integerProfile (component j).1 (component j).2 i (e (.inl r)) w = (B r).mu (zB r) i w) ∧
      rate j = (∑ r, 6 * tau * (((2 * ((2 * n ^ 2) * weight j) : ℕ) : ℝ) *
            (((ReleasedInterior.splitCount (component j).1 (component j).2 (e (.inl r)).1 (e (.inl r)).2 +
                ReleasedInterior.splitCount (component j).1 (component j).2 (e (.inl r)).1 (complement (ReleasedInterior.parent_total (component j).2 (e (.inl r)).1) (e (.inl r)).2) : ℕ) : ℝ) *
              Real.log 2 * mme_modern_entropyBits
                (fun w ↦ ((B r).count w : ℝ) /
                  ((ReleasedInterior.splitCount (component j).1 (component j).2 (e (.inl r)).1 (e (.inl r)).2 +
                    ReleasedInterior.splitCount (component j).1 (component j).2 (e (.inl r)).1 (complement (ReleasedInterior.parent_total (component j).2 (e (.inl r)).1) (e (.inl r)).2) : ℕ) : ℝ)) +
              ((∑ w, (B r).count w * ones w : ℕ) : ℝ) * Real.log 5 - delta))) + (∑ t,
      let m := ((2 * n ^ 2) * weight j) * ((ReleasedInterior.seed (component j).1 (component j).2).region.getD (e (.inr t)).1.val 0 *
        (ReleasedInterior.splitWeight (component j).1 (component j).2 (e (.inr t)).1 (e (.inr t)).2 +
          ReleasedInterior.splitWeight (component j).1 (component j).2 (e (.inr t)).1 (complement (ReleasedInterior.parent_total (component j).2 (e (.inr t)).1) (e (.inr t)).2)) * denominator)
      let N := denominator * m
      let L := (2 * ((((ReleasedInterior.seed (component j).1 (component j).2).children.find?
        (fun a => a.1 == (e (.inr t)).1.val && a.2.1 == ReleasedInterior.sourceShape (component j).1 (e (.inr t)).2)).getD (0, [], 0)).2.2)) * m
      let G := (denominator - 2 * ((((ReleasedInterior.seed (component j).1 (component j).2).children.find?
        (fun a => a.1 == (e (.inr t)).1.val && a.2.1 == ReleasedInterior.sourceShape (component j).1 (e (.inr t)).2)).getD (0, [], 0)).2.2)) * m
      let p : ℝ :=
        (((((ReleasedInterior.seed (component j).1 (component j).2).children.find?
          (fun a => a.1 == (e (.inr t)).1.val && a.2.1 == ReleasedInterior.sourceShape (component j).1 (e (.inr t)).2)).getD
            (0, [], 0)).2.2) : ℝ) / denominator
      ((4 * N : ℕ) : ℝ) *
        (Real.log 2 * (mme_modern_entropyBits ![p, p, 1 - 2 * p] + 2) - delta) +
        ((6 * (4 * G + 2 * L) : ℕ) : ℝ) * tau * Real.log 5 )) ∧
    ∃ (inputs : Fin 6 → ℕ) (copies : ℕ) (rows cols inner : Fin copies → ℕ),
      (∀ owner, 1 ≤ inputs owner) ∧
      (∀ owner, inputs owner ≤ (ReleasedGlobal.blocks ((2 * n) ^ 2) + 1) ^ 10935) ∧
      0 < copies ∧
      Restrict (bigAdd (fun j => MMObj K (rows j) (cols j) (inner j)))
        (bigAdd (fun _ : Fin (∏ owner, inputs owner ^ 6) =>
          (CWObj K 5).kronPow (144 * ReleasedGlobal.blocks ((2 * n) ^ 2)))) ∧
      ((∏ owner, inputs owner ^ 6 : ℕ) : ℝ) *
        Real.exp (6 * (∑ owner, rho owner * (ReleasedGlobal.blocks ((2 * n) ^ 2) : ℝ)) +
          ((6 * ((∑ r, parentRate r) * ((2 * n) ^ 2 : ℕ)) + ∑ j, rate j) +
            ∑ j, 6 * tau * (((2 * n) ^ 2 : ℕ) * boundaryRate j))) ≤
          ∑ j, (((rows j * cols j * inner 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