Cleared Pole Numerator top coeff
ProvedD1Bound5.clearedPoleNumerator_top_coeffdiophantine-tuplesnumber-theory
At degree one below the denominator degree, only the cleared simple pole has a nonzero coefficient. This calculation does not require distinct nodes.
Preamble
import Lean.Elab.Tactic.Omega import Mathlib.Algebra.Polynomial.BigOperators import Mathlib.Algebra.Polynomial.RingDivision import Definitions.Def_D1Bound5_BennettResidueCoefficient_Definitions
Formal statement
section
open Finset Polynomial
namespace D1Bound5
section CommRing
variable {R ι : Type*} [CommRing R] [Nontrivial R]
variable [Fintype ι] [DecidableEq ι]
theorem _root_.D1Bound5.clearedPoleNumerator_top_coeff (a : ι → R) (e : ι → ℕ)
(i : ι) (j : Fin (e i + 1)) :
(clearedPoleNumerator a e i j).coeff ((∑ l, (e l + 1)) - 1) =
if j = Fin.last (e i) then 1 else 0 := by sorry
end CommRing
end D1Bound5
end
Source
D1Bound5/BennettResidueCoefficient.lean, lines 46-71, SHA-256 8c207032d119b0629e3cee3a36cfe0f7dd94d73784c8b28b8cba78efa262f829. Project: https://github.com/tomislav-math/d1-bound5-lean