Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Bennett Homogenization Term

Proved
D1Bound5.bennettHomogenizationTerm

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

diophantine-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

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