Polynomial restriction to a Boolean subset
DefinitionCatalyticTreeEval_SubsetPolynomialsFor a subset of the polynomial variables, define its Boolean characteristic point and the polynomial obtained by setting all variables outside the subset to zero. This is the restriction used for the canonical matching-vector construction.
Definition code
import Definitions.Def_CatalyticTreeEval_Main_Polynomials
set_option autoImplicit false
namespace CatalyticTreeEval.Main
def subsetPoint {H : ℕ} (T : Finset (Fin H)) : Fin H → Bool := fun i => decide (i ∈ T)
/-- Set all variables outside a chosen subset to zero. -/
noncomputable def restrictPolynomial {m H : ℕ} (T : Finset (Fin H))
(f : Poly m H) : Poly m H :=
MvPolynomial.rename (fun i : {j // j ∈ T} => i.val)
(MvPolynomial.killCompl (f := fun i : {j // j ∈ T} => i.val) Subtype.val_injective f)
end CatalyticTreeEval.Main
Source
Henzinger, Pyne and Ragavan, Catalytic Tree Evaluation from Matching Vectors, https://arxiv.org/html/2602.14320v3, Appendix B, Lemma B.1.