Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.6, 2 ⇒ 1 — a certificate f+g2+h=0f+g^2+h=0f+g2+h=0 shows that (4.4) is empty

Proved
SemialgebraicSDP.Psatz.theorem_4_6_sufficiency

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

infeasibility-certificatep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1positivstellensatzreal-algebraic-geometry

Let (fj)j=1,…,s(f_j)_{j=1,\dots,s}(fj​)j=1,…,s​, (gk)k=1,…,t(g_k)_{k=1,\dots,t}(gk​)k=1,…,t​, (hℓ)ℓ=1,…,u(h_\ell)_{\ell=1,\dots,u}(hℓ​)ℓ=1,…,u​ be finite families of polynomials in R[x1,…,xn]\mathbb R[x_1,\dots,x_n]R[x1​,…,xn​], each possibly empty. Let PPP be the cone generated by the fjf_jfj​, MMM the multiplicative monoid generated by the gkg_kgk​, and III the ideal generated by the hℓh_\ellhℓ​. If there exist f∈Pf\in Pf∈P, g∈Mg\in Mg∈M, h∈Ih\in Ih∈I with

f+g2+h=0,f+g^2+h=0,f+g2+h=0,

then the set

{x∈Rn  |  fj(x)≥0, j=1,…,s; gk(x)≠0, k=1,…,t; hℓ(x)=0, ℓ=1,…,u}(4.4)\left\{x\in\mathbb R^n \;\middle|\; f_j(x)\ge 0,\ j=1,\dots,s;\ g_k(x)\ne 0,\ k=1,\dots,t;\ h_\ell(x)=0,\ \ell=1,\dots,u\right\}\qquad(4.4){x∈Rn∣fj​(x)≥0, j=1,…,s; gk​(x)=0, k=1,…,t; hℓ​(x)=0, ℓ=1,…,u}(4.4)

is empty.

This is the direction of the Positivstellensatz proved in the paper: an algebraic identity of this form is a certificate of infeasibility of the real polynomial system.

Formalization Note This item formalizes only the implication 2 ⇒ 1 of Theorem 4.6; the converse is a separate item.

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

open MvPolynomial

theorem theorem_4_6_sufficiency {n s t u : ℕ} (f : Fin s → MvPolynomial (Fin n) ℝ)
    (g : Fin t → MvPolynomial (Fin n) ℝ) (h : Fin u → MvPolynomial (Fin n) ℝ)
    (hcert : ∃ F ∈ cone (Set.range f), ∃ G ∈ Submonoid.closure (Set.range g),
      ∃ H ∈ Ideal.span (Set.range h), F + G ^ 2 + H = 0) :
    psatzSet f g h = ∅ := by sorry

end SemialgebraicSDP.Psatz
Source
Parrilo, Semidefinite programming relaxations for semialgebraic problems, Math. Program. Ser. B 96 (2003) 293–320, p. 305, Theorem 4.6 (2 ⇒ 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