A finite product determines every sufficiently low truncation
ProvedN25.etaResidueSeries25_trunc_prefixmazur-n25
Let and let satisfy . The truncation of the residue power series through degree equals the same truncation of the first two-factor blocks:
This is the finite-prefix principle used by the coefficient certificates.
Preamble
import Definitions.Def_N25_UnitSeries set_option autoImplicit false open scoped BigOperators open N25
Formal statement
theorem N25.etaResidueSeries25_trunc_prefix (g N t : ℕ)
(hg : 0 < g) (hg25 : g < 25) (hNt : N ≤ 25 * t) :
PowerSeries.trunc N (etaResidueSeries25 g) =
PowerSeries.trunc N
(∏ m ∈ Finset.range t,
((1 - PowerSeries.X ^ (25 * m + g)) *
(1 - PowerSeries.X ^ (25 * (m + 1) - g)) : PowerSeries ℤ)) := 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.