Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Large-N numerical entropy package

Open
mme_entropy_regional_largeN_numerical_package

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

matrix-multiplicationmore-asymmetryregional-entropy

Large-level numerical package for the More Asymmetry regional entropy construction.

There exist a size N≥3N \geq 3N≥3, a level lowerlowerlower, a profile predicate PPP on NNN positions, a finite integer entropy step SSS at that level, a boundary end BBB matched to the step output predicate S.outputS.\mathrm{output}S.output, and a positive integer copiescopiescopies such that the entropy copy threshold is met, the boundary matrix dimensions are nontrivial, and the numerical surplus inequality holds:

7N<copies⋅[a(B)b(B)c(B)]τ,τ=3952233/5000000.7^N < copies \cdot [a(B)b(B)c(B)]^{\tau}, \quad \tau = 3952233/5000000.7N<copies⋅[a(B)b(B)c(B)]τ,τ=3952233/5000000.

Here copies⋅8r(S)≤entropyLower(S)copies \cdot 8^{r(S)} \le \mathrm{entropyLower}(S)copies⋅8r(S)≤entropyLower(S) with r(S)r(S)r(S) the repair exponent, so the step guarantees at least copiescopiescopies entropy copies, and a(B)b(B)c(B)≥1a(B)b(B)c(B) \ge 1a(B)b(B)c(B)≥1. This is the concrete numerical content of the Section 6 solution: genuine entropy copies at level N≥3N \ge 3N≥3 together with matching boundary data whose dimensions satisfy the surplus comparison. Feeding this package into the one-step recipe construction yields a finite entropy recipe witnessing surplus.

Formalization Note Lean states the threshold with the cast ((copies∗8r(S):N):R)≤S.entropyLower((copies * 8^{r(S)} : \mathbb{N}) : \mathbb{R}) \le S.\mathrm{entropyLower}((copies∗8r(S):N):R)≤S.entropyLower and the surplus inequality with τ=3952233/5000000\tau = 3952233/5000000τ=3952233/5000000 as a real exponent.

Preamble
import Definitions.Def_mme_entropy_regional_CW_recipe
open MME MME.ProfiledCW MME.RegionRealization
set_option autoImplicit false
Formal statement
theorem mme_entropy_regional_largeN_numerical_package : exists (N lower : Nat) (P : MME.ProfiledCW.Predicate N) (S : MME.RegionRealization.IntegerStep lower N P) (B : MME.ProfiledCW.BoundaryEnd lower N S.output) (copies : Nat), 3 <= N /\ 0 < copies /\ (((copies * 8 ^ S.repairExponent : Nat) : Real) <= S.entropyLower) /\ (1 <= B.a * B.b * B.c) /\ (((7 ^ N : Nat) : Real) < (copies : Real) * (((B.a * B.b * B.c : Nat) : Real) ^ ((3952233 : Real) / 5000000))) := by sorry
Source
Uniform entropy-based integer regional construction for the More Asymmetry matrix multiplication campaign, https://arxiv.org/html/2404.16349v2#S6 . Section 6 numerical solution and Table 1: the large-level existence obligation.

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