Uniform native access to explicitly indexed canonical matching vectors
OpenCatalyticTreeEval.Main.canonical_coordinate_accessThere are one finite binary machine and a positive constant , fixed before every prime list and parameter choice, that choose actual subset and square-free monomial indexings and print the coordinates of the fixed coefficient/evaluation construction. For and , the addressed workspace is
The input contains the primes, exponents, and with the mission encodings. The native printing predicate includes finite-table halting and the full trajectory workspace bound. This retains the computational content of Lemma B.1 rather than supplying an unrelated existential family.
Preamble
import Definitions.Def_CatalyticTreeEval_CanonicalCoordinates set_option autoImplicit false
Formal statement
namespace CatalyticTreeEval.Main
theorem canonical_coordinate_access :
∃ (M : Machine) (C : ℝ), 0 < C ∧
∀ (t : ℕ) (p e : Fin t → ℕ) (w H : ℕ) (hp : PrimeData p),
1 ≤ w → w ≤ H → w < ∏ i, p i ^ e i →
∃ I : CanonicalIndexing H w (delta p e),
VectorAccess M (primeCode p ++ natsCode ((List.finRange t).map e ++ [w,H]))
(canonicalCoefficientVectors p e hp w H I) (canonicalEvaluationVectors p e w H I)
(C * (1 + log₂ (H.choose w) + delta p e * log₂ H + log₂ (modulus p))) := by sorry
end CatalyticTreeEval.MainSource
Henzinger, Pyne and Ragavan, Catalytic Tree Evaluation from Matching Vectors, https://arxiv.org/html/2602.14320v3, Appendix B, Lemma B.1.