Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Polynomial restriction to a Boolean subset

Definition
CatalyticTreeEval_SubsetPolynomials

by sragavan · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

For 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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me