Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Bennett half Integer ne nat

Proved
D1Bound5.bennett_halfInteger_ne_nat

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

diophantine-tuplesnumber-theory

Every half-integer parameter in the Bennett node-removal induction differs from every natural number. This is the exact parity obstruction, transported through the characteristic-zero cast.

Preamble
import Lean.Elab.Tactic.Omega
import Mathlib.RingTheory.Binomial
import Mathlib.Tactic.LinearCombination

Formal statement
section
open Polynomial

namespace D1Bound5

variable {F : Type*} [Field F] [CharZero F]




theorem _root_.D1Bound5.bennett_halfInteger_ne_nat (k v j : ℕ) :
    (k : F) + (1 / 2 : F) - (v : F) * (k : F) ≠ (j : F) := by sorry



end D1Bound5
end
Source
D1Bound5/BennettChooseNonzero.lean, lines 28-38, SHA-256 242284e834a07d1f10f92c6ff0dc397a65048f9ca805d58c05766b00a9bc4ab5. 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