Consider the system of polynomial equations and inequalities [1]
whose solution set is the following semialgebraic set
Parrilo showed in [1] that this system is infeasible, i.e., set is empty, using the Positivstellensatz [2]. Alternatively, one could use quantifier elimination to conclude infeasibility.
Consider the following proposition
.
If this proposition is true, then the system is feasible and is nonempty. If the proposition is false, then the system is infeasible and
is empty. We can determine the truth value of the proposition using REDUCE + REDLOG to perform quantifier elimination:
% feasibility via quantifier elimination
load_package redlog;
rlset ofsf;
% define polynomial functions
f1 := x1^2+x2^2-1;
g1 := 3*x2-x1^3-2;
g2 := x1-8*x2^3;
% define existential formula
phi := ex({x1,x2}, f1=0 and g1>=0 and g2>=0);
% perform quantifier elimination
rlqe phi;
end;
The output of this script is the following:
The proposition is false and, thus, the system is infeasible.
__________
References
[1] Pablo Parrilo, Sum of Squares Programs and Polynomial Inequalities.
[2] Jacek Bochnak, Michel Coste, Marie-Françoise Roy, Real Algebraic Geometry, Springer, 1998.
Tags: Decision Problems, Feasibility, Quantifier Elimination, Real Algebraic Geometry, REDLOG, REDUCE, Semialgebraic Geometry, Semialgebraic Sets
