The RealRootIsolate command returns a list of boxes. Each box isolates exactly one real root of the regular chain rc or semi-algebraic system  whose polynomial equations, non-negative polynomial inequalities, (strictly) positive polynomial inequalities and polynomial inequations are given respectively by F, N, P, and H. Moreover, it is guaranteed that all real solutions are found. The regular chain rc or semi-algebraic system  has to be zero-dimensional (see IsZeroDimensional). Furthermore, rc must be square-free (see Squarefree and the radical option of Triangularize).

Each box returned by the RealRootIsolate command is a Cartesian product of open intervals or singletons. The BoxValues command retrieves a detailed description of the box parameter and returns a list of elements of the form  (with ) or . In the former case, it means that  . In the latter case, it means that the value of  is .

The options 'abserr'=avalue and 'rerr'=rvalue can be used to specify the maximal size of the returned boxes. When one of these options is provided, avalue or rvalue should be a positive rational number. In the first case, all boxes returned by the RealRootIsolate will have a width smaller than or equal to avalue; in the second case, the ratio of the width and the absolute value of the encoded non-zero real algebraic number is smaller than or equal to rvalue, where the width of a box is defined as the maximum of the widths of the intervals of box.

The option 'constraints'=value can be used to constrain the range of the variables.  This option can be used in the calling sequence with a regular chain rc. value should be a list of equations of the form v=cons_v, where v is a variable name. Not all variables need to be constrained, and each variable should appear at most once in the list value. The RealRootIsolate will only return solutions which satisfy all constraints. The cons_v can have one of the following forms, depending on the desired constraint:  (meaning ),  (meaning  ),  (meaning  ),  (meaning  ),  (meaning  ).

You can specify the algorithm using the option 'method' = 'VincentCollinsAkritas' or 'Discoverer'. The first one is a generalization of the Vincent-Collins-Akritas algorithm which isolates real roots for univariate polynomials. The techniques are very close to the ones used by Renaud Rioboo in his ISSAC 1992 paper (see reference below). The other one implements the algorithm of the paper "Real Solution Isolation Using Interval Arithmetic" by B. Xia and T. Zhang. By default, the first one is used. However, the second one can often do better on large input data.

F. Boulier, C. Chen, F. Lemaire, M. Moreno Maza "Real root isolation of regular chains." ASCM'2009, Math-for-Industry, Lecture Note Series Vol. 22.

R. Rioboo "Computation of the real closure of an ordered field." ISSAC'92, Academic Press, San Francisco.

L. Yang, K. Hou, B. Xia "A complete algorithm for automated discovering of a class of inequality-type theorems." Sci. China Ser. F, Vol. 44 (2001): 33-49.

B. Xia, L. Yang "An Algorithm for Isolating the Real Solutions of Semi-algebraic Systems." J. Symb. Comput. , Vol. 34, Num. 5 (2002): 461-477.

B. Xia, T. Zhang "Real Solution Isolation Using Interval Arithmetic." Computers and Mathematics with Applications, Vol. 52, (2006): 853-860.