Suppose we want to decide whether the following semialgebraic set
is nonempty. This is the same as determining whether the following system of polynomial inequalities
is feasible. We now define , and
. Set
is depicted below
Note that . We depict this intersection below
Visual inspection of the plot of the intersection allows us to conclude that
in nonempty. Asserting that
is nonempty is the same as stating that the proposition
is true. We can determine the truth value of this proposition via quantifier elimination using the following REDUCE + REDLOG script:
% feasibility via quantifier elimination
load_package redlog;
rlset ofsf;
% define polynomial functions
g1 := x-y^2+1;
g2 := -x-y^2+1;
% define existential formula
phi := ex({x,y}, g1>=0 and g2>=0);
% perform quantifier elimination
rlqe phi;
end;
which produces the truth value true. This means that there exists a that satisfies the polynomial inequalities, i.e.,
is nonempty.
__________
Remark: the plots in this post were generated by Wolfram Alpha.
Tags: Decision Problems, Feasibility, Quantifier Elimination, Real Algebraic Geometry, REDLOG, REDUCE, Semialgebraic Geometry, Semialgebraic Sets
