Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7.5, p. 318 — if Pr(z)P_r(z)Pr​(z) is nonnegative, then so is P(z)P(z)P(z)

Proved
SemialgebraicSDP.Copositive.formP_nonneg_of_formPr_nonneg

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

copositive-matricesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polynomials

Let MMM be a real symmetric n×nn \times nn×n matrix, P(z)=∑i,jmijzi2zj2P(z) = \sum_{i,j} m_{ij} z_i^2 z_j^2P(z)=∑i,j​mij​zi2​zj2​ and Pr(z)=(∑i=1nzi2)rP(z)P_r(z) = (\sum_{i=1}^n z_i^2)^r P(z)Pr​(z)=(∑i=1n​zi2​)rP(z) for some r≥0r \ge 0r≥0. If Pr(z)≥0P_r(z) \ge 0Pr​(z)≥0 for every z∈Rnz \in \mathbb R^nz∈Rn, then

P(z)≥0for every z∈Rn.P(z) \ge 0 \quad \text{for every } z \in \mathbb R^n .P(z)≥0for every z∈Rn.

Together with the equivalence between copositivity of MMM and nonnegativity of PPP, this shows that a certificate of nonnegativity for any PrP_rPr​ certifies that MMM is copositive.

Formalization Note Nonnegativity of a polynomial means nonnegativity of its evaluation at every point of Rn\mathbb R^nRn.

Preamble
import Mathlib
import Definitions.Def_SemialgebraicSDP_Copositive_Forms
Formal statement
namespace SemialgebraicSDP.Copositive

open MvPolynomial

/-- §7.5, p. 318: if `P_r(z)` is nonnegative, then so is `P(z)`. -/
theorem formP_nonneg_of_formPr_nonneg {n : ℕ} (M : Matrix (Fin n) (Fin n) ℝ) (hM : M.IsSymm)
    (r : ℕ) (h : ∀ z : Fin n → ℝ, 0 ≤ eval z (formPr M r)) :
    ∀ z : Fin n → ℝ, 0 ≤ eval z (formP M) := by sorry

end SemialgebraicSDP.Copositive
Source
Parrilo, Semidefinite programming relaxations for semialgebraic problems, Math. Program. Ser. B 96 (2003) 293–320, p. 318, §7.5 ("Additionally, if P_r(z) is nonnegative, then so is P(z).")
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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