Explicit polynomial bound for the regional hash prefactor
Provedmme_regional_scale_factor_polynomial_replicationregional-extractiontensor-complexity
With fixed repair scale and profile types, the hash-scale prefactor at replicated parent sizes is at most (k+1)^degree times its original value. The degree is the maximum of the two explicit ambient and compatibility polynomial degrees.
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_polynomial_replication
{half R : ℕ} {parent : Fin R → Fin 3 → ℕ}
(n : Fin R → ℕ) (d ell k : ℕ) :
let degree := max (Fintype.card (Cell half R parent) + R * (half + 1))
(R * (half + 1) + R * (half + 1) *
Fintype.card (Fin 2 → CompleteSplit.CompleteWord ell))
scaleFactor (half := half) (parent := parent) (fun r => k * n r) d ell ≤
((k : ℝ) + 1) ^ degree *
scaleFactor (half := half) (parent := parent) n d ell := by sorrySource
Polynomial growth of the explicit prefactor in regional hash-scale entropy estimates, under uniform replication.