A negative Laurent coefficient forces total mass at least three
ProvedSmooth4Laurent.negative_mass_ge_threeLet W(q)=∑ wⱼqʲ be an integer Laurent polynomial with finite support. Suppose wⱼ+wⱼ₋₁≥0 and wⱼ+wⱼ₋₂≥0 for every integer j, equivalently (1+q)W and (1+q²)W are coefficientwise nonnegative. If any coefficient of W is negative, then the signed coefficient sum W(1) is at least3.
import Mathlib set_option autoImplicit false /-- The integer-coefficient, finite-support positivity threshold from Cycle9 §1. -/
theorem Smooth4Laurent.negative_mass_ge_three
(w : ℤ →₀ ℤ)
(hOne : ∀ j : ℤ, 0 ≤ w j + w (j - 1))
(hTwo : ∀ j : ℤ, 0 ≤ w j + w (j - 2))
(hNegative : ∃ j : ℤ, w j < 0) :
3 ≤ w.sum (fun _ a => a) := by
sorry
Read-back
What the Lean code literally says, in plain math · Codex independent blind auditor; exact model identifier unavailable
For every finitely supported function , if and for every integer , and there exists at least one integer with , then the sum of over its finite support is at least . The entries and the total sum are integers, all index subtractions are integer operations, and every positive, zero, and negative index is covered. The two pair-sum conditions allow equality, but the hypothesis on an individual entry is strictly negative, so a zero function or a function with only nonnegative entries does not satisfy all hypotheses.
Confirmed by the mission captain (proposal self-audit).