Bennett Cleared Residue remove node
ProvedD1Bound5.bennettClearedResidue_remove_nodediophantine-tuplesnumber-theory
Exact arbitrary-order node removal, including the parameter shift ν-k and the full column scaling. No determinant formula is assumed.
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 import Definitions.Def_D1Bound5_BennettClearedResidues_Definitions
Formal statement
section
open Finset
namespace D1Bound5
variable {F : Type*} [Field F] [CharZero F]
section Nodes
variable {I : Type*} [DecidableEq I]
theorem _root_.D1Bound5.bennettClearedResidue_remove_node (s : Finset I) (a : I → F)
(k : ℕ) (ν : F) (i j q : I) (hq : q ∈ s)
(hiq : i ≠ q) (hjq : j ≠ q) (ha : a j ≠ a q) :
(bennettClearedResidue s a k ν i j).eval (-a q) =
((a j - a q)⁻¹) ^ k *
(bennettClearedResidue (s.erase q) a k (ν - (k : F)) i j).eval (-a q) := by sorry
end Nodes
end D1Bound5
end
Source
D1Bound5/BennettClearedResidues.lean, lines 116-131, SHA-256 ec76df5d4e2c4d6b07d0919f3d7f1eca9b85a57c220d930e6ae87c93827d8f29. Project: https://github.com/tomislav-math/d1-bound5-lean