Browkin–Brzeziński Lemma 1 (polynomial identity)
OpenNConjecture.bb94_lemma_1Browkin–Brzeziński's Lemma 1 (p. 933), the algebraic engine of their proof of Theorem 1: "For every , there exists a polynomial of degree with positive coefficients such that
" Writing with and expanding gives the equivalent polynomial identity (no denominators, since ):
The polynomial exists because , whose factors have positive coefficients.
Formalization Note. The statement uses the cleared-denominator form, which is a polynomial identity in equivalent to (3) of the source. f.natDegree = k and ∀ j ≤ k, 0 < f.coeff j encode "degree with positive coefficients".
import Mathlib
namespace NConjecture
theorem bb94_lemma_1 (k : ℕ) :
∃ f : Polynomial ℤ, f.natDegree = k ∧ (∀ j ≤ k, 0 < f.coeff j) ∧
(∑ i ∈ Finset.range (2 * k + 1), (Polynomial.X : Polynomial ℤ) ^ i) =
∑ j ∈ Finset.range (k + 1),
Polynomial.C (f.coeff j) * Polynomial.X ^ (k - j) * (Polynomial.X - 1) ^ (2 * j) := by sorry
end NConjectureRead-back
What the Lean code literally says, in plain math · GLM (Z.ai), blind code-only pass — NOT an independent sub-agent
bb94_lemma_1 (k : ℕ). For every natural number there exists a polynomial with integer coefficients such that all three hold: (1) the natural degree of equals ; (2) for every , the coefficient of in is strictly positive (as an integer); (3) the polynomial identity
holds in , where is the indeterminate and integer coefficients are embedded as constant polynomials. The subtraction is natural-number subtraction, but the range ensures . Coefficients of for are and are not constrained by (2). For the identity reads with the constant polynomial .