Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A fixed small tolerance preserves released 116 rate at least 3N/20

Proved
mme_released_116_small_tolerance_rate_lower

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

regional-extractiontensor-complexity

There exists a positive tolerance eps0 such that every nonnegative eps <= eps0 leaves regionalRate minus N times the entropy modulus at least 3N/20. This uses the exact certified rate >= N/5 and uniform entropy continuity with modulus bound 1/20.

Preamble
import Theorems.Thm_mme_regional_entropy_uniform_modulus
import Theorems.Thm_mme_regional_mass_entropy_algebra
import Theorems.Thm_mme_released_116_regional_split_mass
import Definitions.Def_mme_regional_split_entropy_data
import Theorems.Thm_mme_released_116_integer_profile_support
import Definitions.Def_mme_recursive_thin_split_data
import Mathlib.Order.ConditionallyCompleteLattice.Basic
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Linarith
open BigOperators MME MME.RegionRate MME.RecursiveThinSplit
open BigOperators MME.RegionRate
open MME.RecursiveYZ
open scoped Classical
open MME
open BigOperators MME MME.RecursiveThinSplit
open BigOperators MME MME.RegionRate
set_option autoImplicit false
universe u
Formal statement
theorem mme_released_116_small_tolerance_rate_lower :
    ∃ eps₀ : ℝ, 0 < eps₀ ∧ ∀ eps : ℝ, 0 ≤ eps → eps ≤ eps₀ →
      (3 / 20 : ℝ) * ((∑ r : Fin 6, Released116.regionalSize r : ℕ) : ℝ) ≤
        regionalRate Released116.parent_total Released116.regionalSize
          Released116.splitCount Released116.integerProfile -
        ((∑ r : Fin 6, Released116.regionalSize r : ℕ) : ℝ) *
          entropyModulus (Fin 2 → CompleteSplit.CompleteWord 2) eps := by sorry
Source
Certified entropy bounds for the released 116 integer profile: exact rational parent mixtures, retained-grade support bounds on the actual compatibility partition, and zero split penalty.

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