Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Explicit canonical-sumset decoder: full algebraic correctness

Proved
CatalyticTreeEval.Main.canonical_decoder_properties

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

catalytic-computationmatching-vectors

Let p1,…,ptp_1,\ldots,p_tp1​,…,pt​ be distinct odd primes and m=∏ipim=\prod_i p_im=∏i​pi​. The explicit decoder indexed by base-3 vectors has exactly 3t3^t3t terms. This theorem proves its cancellation and normalization, identifies the canonical sumset with residues whose projections all lie in {0,1,2}\{0,1,2\}{0,1,2}, and proves that the original canonical set is noncancelling. The decoder is the fixed construction in Def_CatalyticTreeEval_DecoderCRT; uniform native term access is a separate child.

Preamble
import Definitions.Def_CatalyticTreeEval_DecoderCRT

set_option autoImplicit false
Formal statement
namespace CatalyticTreeEval.Main

theorem canonical_decoder_properties {t : ℕ} (p : Fin t → ℕ) (hp : OddPrimeData p) :
    (∀ z : ZMod (modulus p), z ∈ sumset (canonical p (modulus p)) ↔
      ∀ i, z.val % p i = 0 ∨ z.val % p i = 1 ∨ z.val % p i = 2) ∧
    IsDecoder (sumset (canonical p (modulus p)))
      (DecoderConstruction.canonicalDecoder p hp.1) ∧
    Noncancelling (canonical p (modulus p)) := by sorry

end CatalyticTreeEval.Main
Source
Henzinger, Pyne and Ragavan, Catalytic Tree Evaluation from Matching Vectors, https://arxiv.org/html/2602.14320v3, Section 3.4, Lemma 3.19.

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