Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Canonical coefficient and evaluation vectors form a matching family

Proved
CatalyticTreeEval.Main.canonical_indexing_matching

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

Let pip_ipi​ be distinct primes, m=∏ipim=\prod_i p_im=∏i​pi​, and let w<∏ipieiw<\prod_i p_i^{e_i}w<∏i​piei​​. 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 SSS-matching family, where SSS is the canonical zero-or-one residue set. The label count is (Hw)\binom Hw(wH​) and the dimension is ∑j<Δ(Hj)\sum_{j<\Delta}\binom Hj∑j<Δ​(jH​), with Δ=max⁡ipiei\Delta=\max_i p_i^{e_i}Δ=maxi​piei​​.

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