Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lower bound for the log of the unit-scale boundary factor

Proved
mme_released_boundary_unit_factor_log_lower

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

matrix-multiplication

This is a numerical lower bound for the logarithm of the unit-scale boundary dimension factor of the released global candidate.

Let D=1012D=10^{12}D=1012 be the released denominator, so that blocks(1)=D5=1060\mathrm{blocks}(1)=D^5=10^{60}blocks(1)=D5=1060. For each of the 144144144 boundary cells ccc (an owner o∈Fin 6o\in\mathrm{Fin}\,6o∈Fin6 together with a level-3 shape having a zero coordinate), let z(c,s)=z1(c,s)z(c,s)=z_1(c,s)z(c,s)=z1​(c,s), for words sss, be the released unit-scale histogram of the cell in the mode following its zero mode, and let Nc=∑sz(c,s)N_c=\sum_s z(c,s)Nc​=∑s​z(c,s). For a word sss let ones(s)\mathrm{ones}(s)ones(s) be the number of letters of sss equal to 111. The unit-scale boundary dimension factor is

B=∏c(Nc(z(c,s))s) 5∑sz(c,s) ones(s).B=\prod_{c}\binom{N_c}{(z(c,s))_s}\,5^{\sum_s z(c,s)\,\mathrm{ones}(s)}.B=c∏​((z(c,s))s​Nc​​)5∑s​z(c,s)ones(s).

Claim.

6 D5⋅0.450512205 ≤ log⁡B.6\,D^5\cdot 0.450512205\ \le\ \log B .6D5⋅0.450512205 ≤ logB.

Role. BBB is the dimension contributed by the level-3 zero cells, the boundary blocks closed by the exact-profile boundary end. It enters the refhashed construction at a chosen reference only through k2log⁡Bk^2\log Bk2logB. This lemma is the level-3 boundary part of the dimension certificate (WP7 in the mission plan): a single fixed numerical fact. A computation with the exact released integers and 80-digit log-gamma gives log⁡B/(6D5)=0.4505122058230850…\log B/(6D^5)=0.4505122058230850\ldotslogB/(6D5)=0.4505122058230850…, so the stated constant leaves a relative margin of about 1.8⋅10−91.8\cdot10^{-9}1.8⋅10−9, which is 4.9⋅10514.9\cdot10^{51}4.9⋅1051 in absolute terms. Stirling-type error terms are of order 10410^{4}104.

Formalization Note. BBB is the natural number ∏ c : Fin zCells, ((∑ s, zCountAt 1 c s)! / ∏ s, (zCountAt 1 c s)!) * 5 ^ (∑ s, zCountAt 1 c s * Boundary.ones s), cast to ℝ. The division is exact. zCountAt 1 c s is wordCounts, the global weight times the joint row counts, so every entry is an explicit integer of size at most 106010^{60}1060. A cell with two zero grades contributes a factor 111 whichever zero mode is chosen, and for a cell with one zero grade both nonzero modes give the same factor, so the value does not depend on the choose in zMode.

Preamble
import Definitions.Def_mme_released_global_two_part_split_data
import Definitions.Def_mme_graded_integer_regional_step_data
open BigOperators MME MME.ProfiledCW MME.GlobalCW MME.RecursiveYZ MME.CompleteSplit
  MME.ReleasedGlobal MME.RegionRealization MME.ReleasedRecursive.Asm
open scoped Classical
set_option autoImplicit false
Formal statement
theorem mme_released_boundary_unit_factor_log_lower :
    (6 * blocks 1 : ℝ) * ((450512205 : ℝ)/1000000000) ≤
      Real.log ((∏ c : Fin zCells,
        ((∑ s, zCountAt 1 c s).factorial / ∏ s, (zCountAt 1 c s).factorial) *
        5 ^ (∑ s, zCountAt 1 c s * Boundary.ones s) : ℕ) : ℝ) := by sorry
Source
Prove2Me mission 7e65274f (More Asymmetry Bound: omega < 2.37134); marwahaha's plan comment of 2026-09-24 (WP7 dimension certificate: level-3 zero cells); boundary factor B as in theorem 71693563-1700-4744-b3a2-7f624e7357ee and 8a1dbc6c-de97-4a8b-b66f-e831372553f2; released data of Alman-Duan-Vassilevska Williams-Xu-Xu-Zhou, arXiv 2404.16349v3.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me