Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7.5, p. 318 — if PiP_iPi​ is a sum of squares, so is Pi+1P_{i+1}Pi+1​

Proved
SemialgebraicSDP.Copositive.formPr_sos_succ

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

copositive-matricesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sum-of-squares

Let MMM be a real symmetric n×nn \times nn×n matrix with associated forms 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), r=0,1,2,…r = 0, 1, 2, \dotsr=0,1,2,…, where P(z)=∑i,jmijzi2zj2P(z) = \sum_{i,j} m_{ij} z_i^2 z_j^2P(z)=∑i,j​mij​zi2​zj2​. For every i≥0i \ge 0i≥0,

Pi is a sum of squares  ⟹  Pi+1 is a sum of squares.P_i \text{ is a sum of squares} \implies P_{i+1} \text{ is a sum of squares}.Pi​ is a sum of squares⟹Pi+1​ is a sum of squares.

This makes the sum-of-squares tests on P0,P1,P2,…P_0, P_1, P_2, \dotsP0​,P1​,P2​,… a hierarchy of increasingly powerful sufficient conditions for copositivity of MMM.

Formalization Note "Sum of squares" is Mathlib's IsSumSq in MvPolynomial (Fin n) ℝ.

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

/-- §7.5, p. 318: if `P_i` is a sum of squares, then `P_{i+1}` is also a sum of squares. -/
theorem formPr_sos_succ {n : ℕ} (M : Matrix (Fin n) (Fin n) ℝ) (hM : M.IsSymm) (i : ℕ)
    (h : IsSumSq (formPr M i)) : IsSumSq (formPr M (i + 1)) := 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 ("if P_i is a sum of squares, then P_{i+1} is also a sum of squares")
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