Balanced prime powers satisfy the product and dimension bounds
ProvedCatalyticTreeEval.Main.balanced_parameter_boundsFor distinct primes and positive , the computable integer-root/logarithm exponent choice has product of prime powers greater than . With and the number of primes, its maximum prime power is at most . Consequently its binomial dimension is at most the cutoff dimension used in Theorem 3.10.
These numerical bounds justify the explicit balanced parameters independently of their native computation.
Preamble
import Definitions.Def_CatalyticTreeEval_BalancedParameters set_option autoImplicit false
Formal statement
namespace CatalyticTreeEval.Main
theorem balanced_parameter_bounds {t : ℕ} (p : Fin t → ℕ) (hp : PrimeData p)
(w H : ℕ) (hw : 0 < w) :
w < ∏ i, p i ^ balancedExponents p w i ∧
delta p (balancedExponents p w) ≤ ⌊((modulus p * w : ℕ) : ℝ) ^ (1 / (t : ℝ))⌋₊ ∧
binomialDimension H (delta p (balancedExponents p w)) ≤
binomialDimension H (⌊((modulus p * w : ℕ) : ℝ) ^ (1 / (t : ℝ))⌋₊ + 1) := by sorry
end CatalyticTreeEval.MainSource
Henzinger, Pyne and Ragavan, Catalytic Tree Evaluation from Matching Vectors, https://arxiv.org/html/2602.14320v3, Theorem 3.10.