Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 5.1 — f=p0+p1f1+⋯+p12…sf1⋯fsf=p_0+p_1f_1+\dots+p_{12\dots s}f_1\cdots f_sf=p0​+p1​f1​+⋯+p12…s​f1​⋯fs​ with SOS pTp_TpT​

Proved
SemialgebraicSDP.Psatz.cone_squarefree_form

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

conep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1positivstellensatzsum-of-squares

Let f1,…,fs∈R[x1,…,xn]f_1,\dots,f_s\in\mathbb R[x_1,\dots,x_n]f1​,…,fs​∈R[x1​,…,xn​]. A polynomial fff belongs to the cone P({f1,…,fs})P(\{f_1,\dots,f_s\})P({f1​,…,fs​}) if and only if it can be written with one sum-of-squares multiplier per squarefree product of the fjf_jfj​:

f=∑T⊆{1,…,s}pT∏j∈Tfj=p0+p1f1+⋯+psfs+p12f1f2+⋯+p12…sf1⋯fs,f=\sum_{T\subseteq\{1,\dots,s\}} p_T\prod_{j\in T}f_j = p_0+p_1f_1+\dots+p_sf_s+p_{12}f_1f_2+\dots+p_{12\dots s}f_1\cdots f_s,f=T⊆{1,…,s}∑​pT​j∈T∏​fj​=p0​+p1​f1​+⋯+ps​fs​+p12​f1​f2​+⋯+p12…s​f1​⋯fs​,

with every pTp_TpT​ a sum of squares (the empty product being 111).

This is the parameterization of the cone part of a Positivstellensatz certificate used to set up the SDP in the proof of Theorem 5.1: it reduces the search over the cone to finitely many sum-of-squares unknowns.

Preamble
import Mathlib
import Definitions.Def_SemialgebraicSDP_Psatz_Cone
Formal statement
namespace SemialgebraicSDP.Psatz

open MvPolynomial

theorem cone_squarefree_form {n s : ℕ} (f : Fin s → MvPolynomial (Fin n) ℝ)
    (x : MvPolynomial (Fin n) ℝ) :
    x ∈ cone (Set.range f) ↔
      ∃ p : Finset (Fin s) → MvPolynomial (Fin n) ℝ,
        (∀ T, IsSumSq (p T)) ∧ x = ∑ T : Finset (Fin s), p T * ∏ j ∈ T, f j := by sorry

end SemialgebraicSDP.Psatz
Source
Parrilo, Semidefinite programming relaxations for semialgebraic problems, Math. Program. Ser. B 96 (2003) 293–320, p. 306, proof of Theorem 5.1, display 'f = p₀ + p₁f₁ + ⋯'
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