Minimal generation of basic semi-algebraic sets over an arbitrary ordered field

[For the entire collection see Zbl 0756.00007.] One of the most striking results in real algebraic geometry obtained the last decade after the introduction of new algebraic tools (real spectra, quadratic forms over semilocal rings, etc.) is the Bröcker-Scheiderer theorem that every system of strict (resp. non-strict) polynomial inequalities in \(d\) indeterminates defined over a real closed field is always equivalent to another system of \(d\) (resp. \(d(d+1)/2)\) inequalities. In fact, these and similar results concerning the size of systems of inequalities hold on any real variety of dimension \(d\). In the paper under review, the authors obtain such size bounds for systems defined over a real closed field by polynomials with coefficients in a fixed ordered subfield. Namely, the bound \(d\) (resp. \(d(d+1)/2)\) in the above statement has to be enlarged to \(d+\overline m\;\) (resp. \(d(d+1)/2+(d+1)\overline m)\), where \(\overline m\) depends only on the canonical real valuation of the fixed ordered subfield. For instance, if only rational numbers are allowed, the system \(t^ 2>2\), \(t>0\) is not equivalent to one single inequality (of course, \(\overline m(\mathbb{Q})=1)\). It is also shown that the bounds are sharp in general examples. The proofs use ideas developed by Bröcker, Mahé, Marshall and Scheiderer in previous papers, to adapt the arguments of the absolute case to this relative setting.

Recommendations

Cited in

(7)

This page was built for publication: Minimal generation of basic semi-algebraic sets over an arbitrary ordered field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037363)