Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7.5, p. 318 — the case r=1r = 1r=1 is the sixth order form P1(z)=∑i,j,kmijzi2zj2zk2P_1(z) = \sum_{i,j,k} m_{ij} z_i^2 z_j^2 z_k^2P1​(z)=∑i,j,k​mij​zi2​zj2​zk2​

Proved
SemialgebraicSDP.Copositive.formPr_one_eq_formP1

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

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

Let M=(mij)M = (m_{ij})M=(mij​) be a real symmetric n×nn \times nn×n matrix and P(z)=∑i,jmijzi2zj2P(z) = \sum_{i,j} m_{ij} z_i^2 z_j^2P(z)=∑i,j​mij​zi2​zj2​. The member r=1r = 1r=1 of the family 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) is the sixth order form displayed on p. 318:

(∑k=1nzk2)P(z)=∑i,j,kmijzi2zj2zk2.\Bigl(\sum_{k=1}^n z_k^2\Bigr) P(z) = \sum_{i,j,k} m_{ij} z_i^2 z_j^2 z_k^2 .(k=1∑n​zk2​)P(z)=i,j,k∑​mij​zi2​zj2​zk2​.

This identifies the form whose nonnegativity Theorem 7.7 certifies with the first level of the hierarchy PrP_rPr​.

Formalization Note Both sides are elements of MvPolynomial (Fin n) ℝ, and the identity is an equality of polynomials.

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

/-- §7.5, p. 318: the case `r = 1` of `P_r` is the sixth order form
`P₁(z) = ∑_{i,j,k} mᵢⱼ zᵢ² zⱼ² z_k²`. -/
theorem formPr_one_eq_formP1 {n : ℕ} (M : Matrix (Fin n) (Fin n) ℝ) (hM : M.IsSymm) :
    formPr M 1 = formP1 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, display defining P_1(z) (case r = 1)
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