Canonical coefficient and evaluation vectors form a matching family
ProvedCatalyticTreeEval.Main.canonical_indexing_matchingLet be distinct primes, , and let . For any actual injective subset and square-free monomial indexings, the coefficient vectors of the restricted CRT detector and the corresponding Boolean evaluation vectors form an -matching family, where is the canonical zero-or-one residue set. The label count is and the dimension is , with .
The inner product is detector evaluation at the intersection of the indexed subsets. This is the algebraic content of Lemma B.1 for explicitly indexed coordinate functions; uniform native access is separate.
Preamble
import Definitions.Def_CatalyticTreeEval_CanonicalCoordinates set_option autoImplicit false
Formal statement
namespace CatalyticTreeEval.Main
theorem canonical_indexing_matching {t : ℕ} (p e : Fin t → ℕ) (hp : PrimeData p)
(w H : ℕ) (hw : w < ∏ i, p i ^ e i) (I : CanonicalIndexing H w (delta p e)) :
SMatching (canonical p (modulus p))
(canonicalCoefficientVectors p e hp w H I) (canonicalEvaluationVectors p e w H I) := 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.