Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Explicit subset and monomial indexing for canonical matching vectors

Definition
CatalyticTreeEval_CanonicalCoordinates

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

A canonical indexing supplies injective enumerations of the w-subsets and all square-free monomials below the degree cutoff. Coefficient vectors come from restricting the fixed CRT weight detector to an enumerated subset; evaluation vectors evaluate the same enumerated monomials at subset characteristic points. Matching, exact cardinalities and efficient native access are subsequent obligations.

Definition code
import Definitions.Def_CatalyticTreeEval_CompositeDetector
import Definitions.Def_CatalyticTreeEval_SubsetPolynomials
import Definitions.Def_CatalyticTreeEval_MultilinearCoordinates

set_option autoImplicit false

namespace CatalyticTreeEval.Main

/-- The two explicit finite indexings needed by the canonical construction. -/
structure CanonicalIndexing (H w δ : ℕ) where
  subset : Fin (H.choose w) → Finset (Fin H)
  monomial : Fin (binomialDimension H δ) → Monomial H
  subset_card : ∀ i, (subset i).card = w
  subset_injective : Function.Injective subset
  monomial_injective : Function.Injective monomial
  monomial_cover : ∀ v : Monomial H, (∀ i, v i ≤ 1) →
    v.sum (fun _ e => e) < δ → ∃ j, monomial j = v

noncomputable def canonicalCoefficientVectors {t : ℕ} (p e : Fin t → ℕ)
    (hp : PrimeData p) (w H : ℕ) (I : CanonicalIndexing H w (delta p e)) :
    Fin (H.choose w) → Vec (modulus p) (binomialDimension H (delta p e)) :=
  fun i j => MvPolynomial.coeff (I.monomial j)
    (restrictPolynomial (I.subset i) (compositeWeightDetector p e hp w H))

noncomputable def canonicalEvaluationVectors {t : ℕ} (p e : Fin t → ℕ)
    (w H : ℕ) (I : CanonicalIndexing H w (delta p e)) :
    Fin (H.choose w) → Vec (modulus p) (binomialDimension H (delta p e)) :=
  fun i j => monomialValue (boolPoint (subsetPoint (I.subset i))) (I.monomial j)

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