Regional hash prefactor has zero asymptotic logarithmic rate
Provedmme_regional_scale_factor_log_div_tendsto_zeroregional-extractiontensor-complexity
For fixed repair scale and profile types, the logarithm of the regional hash prefactor divided by the integer replication factor tends to zero. The proof controls the complete prefactor, including its ambient and compatibility terms.
Preamble
import Definitions.Def_mme_regional_entropy_copy_bound import Mathlib.Tactic.GCongr import Mathlib.Tactic.Ring import Mathlib.Tactic.Linarith import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Topology.Instances.Real.Lemmas open BigOperators MME MME.RegionRate MME.RecursiveYZ open scoped Classical open Filter set_option autoImplicit false universe u
Formal statement
theorem mme_regional_scale_factor_log_div_tendsto_zero
{half R : ℕ} {parent : Fin R → Fin 3 → ℕ}
(n : Fin R → ℕ) (d ell : ℕ) :
Tendsto (fun k : ℕ =>
Real.log (scaleFactor (half := half) (parent := parent)
(fun r => k * n r) d ell) / (k : ℝ)) atTop (nhds 0) := by sorrySource
Polynomial growth of the explicit prefactor in regional hash-scale entropy estimates, under uniform replication.