Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Composite weight detector: degree and Boolean separation

Proved
CatalyticTreeEval.Main.composite_weight_detector_properties

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

catalytic-computationmatching-vectors

Let pip_ipi​ be distinct primes, eie_iei​ nonnegative integers, m=∏ipim=\prod_i p_im=∏i​pi​, and Δ=max⁡ipiei\Delta=\max_i p_i^{e_i}Δ=maxi​piei​​. For w<∏ipieiw<\prod_i p_i^{e_i}w<∏i​piei​​, the CRT combination of the explicit prime-power detectors is multilinear of degree at most Δ−1\Delta-1Δ−1. For Boolean xxx of weight at most www, its value is zero at weight www; at every smaller weight it is a nonzero canonical residue (each prime projection is zero or one).

wt⁡(x)=w⇒f(x)=0,wt⁡(x)<w⇒f(x)∈S∖{0}.\operatorname{wt}(x)=w\Rightarrow f(x)=0,\qquad \operatorname{wt}(x)<w\Rightarrow f(x)\in S\setminus\{0\}.wt(x)=w⇒f(x)=0,wt(x)<w⇒f(x)∈S∖{0}.

This establishes the algebraic part of Corollary B.6 for a fixed polynomial construction; its uniform sparse printer is a separate computational obligation.

Preamble
import Definitions.Def_CatalyticTreeEval_CompositeDetector

set_option autoImplicit false
Formal statement
namespace CatalyticTreeEval.Main

theorem composite_weight_detector_properties {t : ℕ} (p e : Fin t → ℕ)
    (hp : PrimeData p) (w H : ℕ) (hw : w < ∏ i, p i ^ e i) :
    Multilinear (compositeWeightDetector p e hp w H) ∧
    (compositeWeightDetector p e hp w H).totalDegree ≤ delta p e - 1 ∧
    (∀ x : Fin H → Bool, weight x ≤ w →
      (weight x = w → MvPolynomial.eval (boolPoint x) (compositeWeightDetector p e hp w H) = 0) ∧
      (weight x < w → MvPolynomial.eval (boolPoint x) (compositeWeightDetector p e hp w H) ∈
        canonical p (modulus p) ∧
        MvPolynomial.eval (boolPoint x) (compositeWeightDetector p e hp w H) ≠ 0)) := by sorry

end CatalyticTreeEval.Main
Source
Henzinger, Pyne and Ragavan, Catalytic Tree Evaluation from Matching Vectors, https://arxiv.org/html/2602.14320v3, Appendix B, Corollary B.6.

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