Semi-algebraic decision complexity, the real spectrum, and degree

AbstractSemi-algebraic decision complexity introduces a quantitative finiteness aspect into semi-algebraic geometry. In this paper we combine methods from abstract real algebraic geometry and complexity theory in order to show lower bounds on the arithmetical cost of semi-algebraic decision trees. In contrast to the topological combinatorial methods the approach is local and based on the relations computed along paths distinguished by certain well defined points in the real spectrum of the polynomial ring R[X1, …,Xn]. We describe the theme of semi-algebraic decision trees entirely from the point of view of the concept of the real spectrum which extracts the local “quintessence” of the behavior of decision trees. Together with the degree argument —introduced into complexity theory by Strassen [46] — we obtain bounds that apply to concrete natural problems, and their range of application complements the one of topologically based lower bounds. Various new applications to test problems around interpolation (solvability of overdetermined interpolation tasks) and Chinese remaindering are included.Having a lower bound on decision complexity of a semi-algebraic subset E ⊂ Rn a further question naturally arises: Is the set of inputs from Rn producing a long path in a decision tree “significant,” or is it only an unspecified exceptional set of possibly very low dimension? Unlike the topological combinatorial methods the real spectrum approach provides such information. For instance, if E is an irreducible algebraic set then the subset of points in E producing a short path has dimension strictly less than the dimension of E.We discuss complexity questions throughout from the variable and relative standpoint