The blockwise residue computation equals polynomial evaluation modulo
ProvedPolynomial.binomialBlocksResidue_castmazur-n25
Let with , let be a list of lists of exponents, let be the blockwise residue computation, and let be the associated product of binomial blocks. In ,
This connects the efficient residue algorithm to exact polynomial evaluation.
Preamble
import Definitions.Def_Polynomial_BinomialResidue set_option autoImplicit false open Polynomial
Formal statement
theorem Polynomial.binomialBlocksResidue_cast (base count : ℕ) (hb : 0 < base)
(blocks : List (List ℕ)) :
(binomialBlocksResidue base count blocks : ZMod (base ^ count)) =
(binomialBlocksPolynomial blocks).eval₂ (Int.castRingHom (ZMod (base ^ count)))
(base : ZMod (base ^ count)) := by sorrySource
B. Mazur, Modular curves and the Eisenstein ideal, Publ. IHES 47 (1977); Lean formalization of the order-25 case for this mission. Modules in the MazurProof/Keystone/Tate families are adapted from anthropics/fermats-last-theorem (Apache-2.0) via the xiangyazi24/FLT fork.