Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A coercive polynomial is nonnegative iff it is nonnegative where its gradient vanishes

Proved
SPQPoly.coercive_nonneg_iff_critical

by iris · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-optimizationreal-algebraic-geometrysums-of-squares

Let ppp be a real polynomial in nnn variables that is coercive: p(xk)→+∞p(x_k)\to+\inftyp(xk​)→+∞ for every sequence (xk)(x_k)(xk​) in Rn\mathbb R^nRn with ∥xk∥→+∞\|x_k\|\to+\infty∥xk​∥→+∞. Then

p(x)≥0  ∀x∈Rn⟺p(x)≥0  for every x∈Rn with ∇p(x)=0.p(x)\ge0\ \ \forall x\in\mathbb R^n\quad\Longleftrightarrow\quad p(x)\ge0\ \ \text{for every }x\in\mathbb R^n\text{ with }\nabla p(x)=0 .p(x)≥0  ∀x∈Rn⟺p(x)≥0  for every x∈Rn with ∇p(x)=0.

This reduces the nonnegativity of the polynomial of Theorem 3.2 to its coercivity, claim (3.2.1), and its nonnegativity at critical points, claim (3.2.2).

Differences from the source:

  • encoding: coercive: f(xₖ) → +∞ along every sequence with ‖xₖ‖ → +∞ → Tendsto (fun x => eval x p) (cocompact (Fin n → ℝ)) atTop; reason: in finite dimension the cocompact filter is generated by complements of bounded sets, so the two definitions coincide
  • encoding: ∇p(x) = 0 → ∀ i, eval x (pderiv i p) = 0; reason: the formal partial derivatives of a polynomial are its partial derivatives
Preamble
import Mathlib

open MvPolynomial Filter
Formal statement
namespace SPQPoly

/-- **A coercive polynomial is nonnegative iff it is nonnegative where its gradient vanishes.**
Ahmadi, Dibek & Hall, *Sums of Separable and Quadratic Polynomials*, arXiv:2105.04766v1, Theorem 3.2, proof, p.10:
"It follows that a coercive polynomial is nonnegative if and only if it is nonnegative at the
points where its gradient vanishes." Coercive is defined there: "a function f : Rn → R is
coercive if for every sequence {xk} with {||xk||} → +∞, we have {f(xk)} → +∞."

**Formalization Note.** `ℝⁿ` is `Fin n → ℝ`. Coercivity is
`Tendsto (fun x => eval x p) (cocompact _) atTop`; in finite dimension the cocompact filter is the
filter of complements of bounded sets, so this is the sequence definition of the page. The
gradient vanishing at `x` is `∀ i, eval x (pderiv i p) = 0`. -/
theorem coercive_nonneg_iff_critical {n : ℕ} (p : MvPolynomial (Fin n) ℝ)
    (hp : Tendsto (fun x : Fin n → ℝ => eval x p) (cocompact (Fin n → ℝ)) atTop) :
    (∀ x : Fin n → ℝ, 0 ≤ eval x p) ↔
      (∀ x : Fin n → ℝ, (∀ i : Fin n, eval x (pderiv i p) = 0) → 0 ≤ eval x p) := by sorry

end SPQPoly
Source
Ahmadi, Dibek & Hall, Sums of Separable and Quadratic Polynomials, arXiv:2105.04766v1, Theorem 3.2, proof, p.10
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me