Zero-half mass-entropy certificate, region 4
Provedmme_released_level2_zero_half_region4_mass_entropy_certificateThis is the region- part of the refzero-half mass-entropy certificate of the released recursion. It is a single fixed numerical inequality.
Setting. Let and . A zero cell of region is a level-3 cell whose half-grade triple has a zero coordinate. Let , where is the first zero coordinate of . Let (RecStage.mu3) for the nine complete level-2 words , and let be the number of letters of equal to . The mass entropy of masses with total is .
Claim.
where the sum runs over the zero cells of region .
Why it should hold. There are zero cells. For each one, , where is the cell mass (a multiple of ) and is the list of childW weights, which sums to . So , where is the Shannon entropy.
- Each is bounded above by the certified rational series of refthe rational log series certificate, with terms and a dyadic shift.
- The refrational entropy bounds turn these into a rational lower bound for .
- is bounded below by the same series.
The resulting exact rational lower bound for the sum exceeds . The true value (80-digit logarithms) is larger than by a relative margin of .
import Definitions.Def_mme_released_recursive_stage_data import Definitions.Def_mme_graded_integer_regional_step_data import Definitions.Def_mme_regional_entropy_rate_data open BigOperators MME MME.RecursiveYZ set_option autoImplicit false
theorem mme_released_level2_zero_half_region4_mass_entropy_certificate :
((2101764658211037000000000000000000000000000000000000000000000 : ℕ) : ℝ) ≤
∑ c : {c : Cell (2 * 2 ^ (2 - 1)) 88 (RecStage.parent3 4) // ∃ j, (c.2.val j).val = 0},
(MME.RegionRate.massEntropy (fun w ↦ (RecStage.mu3 4
(if (c.1.2.val 0).val = 0 then 1 else if (c.1.2.val 1).val = 0 then 2 else 0)
c.1 w : ℝ)) +
((∑ w, RecStage.mu3 4
(if (c.1.2.val 0).val = 0 then 1 else if (c.1.2.val 1).val = 0 then 2 else 0)
c.1 w * Boundary.ones w : ℕ) : ℝ) * Real.log 5) := by
sorry