Regular semi-algebraic system explained

In computer algebra, a regular semi-algebraic system is a particular kind of triangular system of multivariate polynomials over a real closed field.

Introduction

Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. The notion of a regular semi-algebraic system is an adaptation of the concept of a regular chain focusing on solutions of the real analogue: semi-algebraic systems.

Any semi-algebraic system

S

can be decomposed into finitely many regular semi-algebraic systems

S1,\ldots,Se

such that a point (with real coordinates) is a solution of

S

if and only if it is a solution of one of the systems

S1,\ldots,Se

.[1]

Formal definition

Let

T

be a regular chain of

k[x1,\ldots,xn]

for some ordering of the variables

x=x1,\ldots,xn

and a real closed field

k

. Let

u=u1,\ldots,ud

and

y=y1,\ldots,yn-d

designate respectively the variables of

x

that are free and algebraic with respect to

T

. Let

P\subsetk[x]

be finite such that each polynomial in

P

is regular with respect to the saturated ideal of

T

. Define

P>:=\{p>0\midp\inP\}

. Let

l{Q}

be a quantifier-free formula of

k[x]

involving only the variables of

u

. We say that

R:=[l{Q},T,P>]

is a regular semi-algebraic system if the following three conditions hold.

l{Q}

defines a non-empty open semi-algebraic set

S

of

kd

,

[T,P]

specializes well at every point

u

of

S

,

u

of

S

, the specialized system

[T(u),P(u)>]

has at least one real zero.

The zero set of

R

, denoted by

Zk(R)

, is defined as the set of points

(u,y)\inkd x kn-d

such that

l{Q}(u)

is true and

t(u,y)=0,p(u,y)>0

, for all

t\inT

and all

p\inP

. Observe that

Zk(R)

has dimension

d

in the affine space

kn

.

See also

Notes and References

  1. Changbo Chen, James H. Davenport, John P. May, Marc Moreno-Maza, Bican Xia, Rong Xiao. Triangular decomposition of semi-algebraic systems. Proceedings of 2010 International Symposium on Symbolic and Algebraic Computation (ISSAC 2010), ACM Press, pp. 187–194, 2010.