Scaled boundary profiles attain their entropy and CW-letter volume rate
Provedmme_boundary_scaled_volume_rateregional-extractiontensor-complexity
For any positive-length boundary profile B and any positive tolerance delta, eventually every replication k and every boundary profile C whose counts are k times those of B satisfy log(C.dim) >= k times the base histogram entropy contribution plus the base CW-letter contribution minus delta. The threshold is uniform over C. The proof absorbs the multinomial logarithmic loss into the arbitrary linear tolerance.
Preamble
import Theorems.Thm_mme_dwz_multinomial_entropy_polynomial_lower import Theorems.Thm_mme_log_sqrt_loss_eventually_le_linear import Definitions.Def_mme_recursive_yz_boundary_data open scoped BigOperators open Filter MME.CompleteSplit MME.RecursiveYZ.Boundary set_option autoImplicit false universe u
Formal statement
theorem mme_boundary_scaled_volume_rate {ell L : ℕ}
(B : Profile ell L) (hL : 0 < L) (delta : ℝ) (hdelta : 0 < delta) :
∀ᶠ k : ℕ in atTop, ∀ C : Profile ell (L * k),
(∀ s, C.count s = B.count s * k) →
(k : ℝ) * ((L : ℝ) * Real.log 2 *
mme_modern_entropyBits (fun s ↦ (B.count s : ℝ) / (L : ℝ)) +
((∑ s, B.count s * ones s : ℕ) : ℝ) * Real.log 5 - delta) ≤
Real.log (C.dim : ℝ) := by sorrySource
Multinomial entropy lower bound and exact boundary matrix dimension.