Uniform native access using computable balanced parameters
OpenCatalyticTreeEval.Main.balanced_coordinate_accessA single native binary machine, fixed before the prime list, obtains the balanced exponents from the encoded primes, and and provides access to the explicit canonical coordinate vectors. For its addressed workspace is bounded by
The chosen coordinate indexings are actual enumerations satisfying the canonical indexing interface. This is the remaining uniform computational construction for Theorem 3.10.
Preamble
import Definitions.Def_CatalyticTreeEval_BalancedParameters import Definitions.Def_CatalyticTreeEval_CanonicalCoordinates set_option autoImplicit false
Formal statement
namespace CatalyticTreeEval.Main
theorem balanced_coordinate_access :
∃ (M : Machine) (C : ℝ), 0 < C ∧
∀ (t : ℕ) (p : Fin t → ℕ) (w H : ℕ) (hp : PrimeData p),
1 ≤ w → w ≤ H →
∃ I : CanonicalIndexing H w (delta p (balancedExponents p w)),
VectorAccess M (primeCode p ++ natsCode [w,H])
(canonicalCoefficientVectors p (balancedExponents p w) hp w H I)
(canonicalEvaluationVectors p (balancedExponents p w) w H I)
(C * (1 + log₂ (H.choose w) +
((modulus p * w : ℕ) : ℝ) ^ (1 / (t : ℝ)) * log₂ (H + 1) + log₂ (modulus p))) := by sorry
end CatalyticTreeEval.MainSource
Henzinger, Pyne and Ragavan, Catalytic Tree Evaluation from Matching Vectors, https://arxiv.org/html/2602.14320v3, Theorem 3.10.