Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

CRT combination of prime-power weight detectors

Definition
CatalyticTreeEval_CompositeDetector

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

catalytic-computationtree-evaluation

For distinct primes pip_ipi​ and prime-coefficient polynomials fif_ifi​, form a polynomial modulo m=∏ipim=\prod_i p_im=∏i​pi​ by lifting every coefficient through the Chinese remainder map. The composite weight detector applies this construction to the explicit prime-power detectors. The support is contained in the union of their supports; its evaluation and degree properties are proved separately.

Definition code
import Definitions.Def_CatalyticTreeEval_WeightDetector
import Definitions.Def_CatalyticTreeEval_CRT

set_option autoImplicit false

namespace CatalyticTreeEval.Main

/-- Lift a family of prime-coefficient polynomials coefficient by coefficient. -/
noncomputable def crtPolynomial {t H : ℕ} (p : Fin t → ℕ) (hp : PrimeData p)
    (f : (i : Fin t) → Poly (p i) H) : Poly (modulus p) H := by
  classical
  exact ∑ v ∈ Finset.univ.biUnion (fun i => (f i).support),
    MvPolynomial.monomial v (CRT.crtLift p hp (fun i => MvPolynomial.coeff v (f i)))

/-- Composite detector obtained by CRT from the explicit prime-power detectors. -/
noncomputable def compositeWeightDetector {t : ℕ} (p e : Fin t → ℕ)
    (hp : PrimeData p) (w H : ℕ) : Poly (modulus p) H :=
  crtPolynomial p hp (fun i => weightDetector (p i) (e i) w H)

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