Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Bennett Cleared Residue diagonal at node

Proved
D1Bound5.bennettClearedResidue_diagonal_at_node

by tp · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

diophantine-tuplesnumber-theory

The surviving diagonal entry at the removed node, with its exact generalized binomial coefficient and every directed node difference.

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_diagonal_at_node
    (s : Finset I) (a : I → F) (k : ℕ) (ν : F) (i : I) :
    (bennettClearedResidue s a k ν i i).eval (-a i) =
      Ring.choose ((k : F) + ν) k *
        ∏ l ∈ s.erase i, ((a i - a l)⁻¹) ^ k := by sorry

end Nodes

end D1Bound5
end
Source
D1Bound5/BennettClearedResidues.lean, lines 153-185, SHA-256 ec76df5d4e2c4d6b07d0919f3d7f1eca9b85a57c220d930e6ae87c93827d8f29. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me