Three-term local decoder: normalization and cancellation
ProvedCatalyticTreeEval.DecoderConstruction.local_kernelLet R be a commutative ring in which 1 and 2 are nonzero. The three integer-valued local kernels with shifts 0, 1 and 2 sum to one at zero. For every mask z in R, the sum of the kernels at z+c, and also at z+2c, is zero. These identities provide the per-prime normalization and cancellation used in the tensor-product canonical decoder. Cancellation takes place over the integers before reduction modulo the final modulus.
Preamble
import Definitions.Def_CatalyticTreeEval_DecoderConstruction open CatalyticTreeEval.DecoderConstruction set_option autoImplicit false
Formal statement
theorem CatalyticTreeEval.DecoderConstruction.local_kernel {R : Type} [CommRing R] [DecidableEq R]
(h1 : (1 : R) ≠ 0) (h2 : (2 : R) ≠ 0) :
(∑ c : Fin 3, localTerm c (0 : R) = 1) ∧
(∀ z : R, ∑ c : Fin 3, localTerm c (z + (c.val : R)) = 0) ∧
(∀ z : R, ∑ c : Fin 3, localTerm c (z + 2 * (c.val : R)) = 0) := by sorrySource
Henzinger, Pyne and Ragavan, Catalytic Tree Evaluation from Matching Vectors, https://arxiv.org/html/2602.14320v3, Lemma 3.19, local kernels in its proof.