Bennett Homogenization Term
ProvedD1Bound5.bennettHomogenizationTermdiophantine-tuplesnumber-theory
Exact homogenization of every monomial summand.
Preamble
import Lean.Elab.Tactic.Omega import Mathlib.Algebra.Polynomial.BigOperators import Mathlib.Algebra.Polynomial.Degree.Operations import Mathlib.RingTheory.PowerSeries.Binomial import Mathlib.Tactic.Ring
Formal statement
section
open Finset
namespace D1Bound5
variable {F : Type*} [Field F] [CharZero F]
theorem _root_.D1Bound5.bennettHomogenizationTerm (k h : ℕ) (hh : h ≤ k)
(a N : F) (hN : N ≠ 0) :
N ^ k * ((N⁻¹) ^ h * (1 + a * N⁻¹) ^ (k - h)) =
(N + a) ^ (k - h) := by sorry
section Nodes
variable {I : Type*} [DecidableEq I]
end Nodes
end D1Bound5
end
Source
D1Bound5/BennettResiduePolynomials.lean, lines 42-55, SHA-256 5264fd8f08d4a6fb748bab8f101f05ca183c3e4658b02954972b81e086f0144d. Project: https://github.com/tomislav-math/d1-bound5-lean