Four coprime high-power evaluations force bounded coefficients to vanish
ProvedPolynomial.coeff_eq_zero_of_coprime_evals_dvdmazur-n25
Let , let , and let satisfy , , and . Assume for every , and assume for . Then
This is the arithmetic reconstruction lemma behind the four-base coefficient certificate.
Preamble
import Mathlib set_option autoImplicit false open Polynomial
Formal statement
theorem Polynomial.coeff_eq_zero_of_coprime_evals_dvd
(p : ℤ[X]) (N : ℕ) (b₀ b₁ b₂ b₃ : ℤ)
(hb₀ : 0 < b₀) (hb₁ : 0 < b₁) (hb₂ : 0 < b₂) (hb₃ : 0 < b₃)
(hcop₀₁ : IsCoprime b₀ b₁)
(hcop₂ : IsCoprime (b₀ * b₁) b₂)
(hcop₃ : IsCoprime (b₀ * b₁ * b₂) b₃)
(hbound : ∀ i : ℕ, i < N → |p.coeff i| < b₀ * b₁ * b₂ * b₃)
(heval₀ : b₀ ^ N ∣ p.eval b₀) (heval₁ : b₁ ^ N ∣ p.eval b₁)
(heval₂ : b₂ ^ N ∣ p.eval b₂) (heval₃ : b₃ ^ N ∣ p.eval b₃) :
∀ i : ℕ, i < N → p.coeff i = 0 := 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.