A short proof for the open quadrant problem (Q321277): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A rational function decomposition algorithm by near-separated polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the one dimensional polynomial and regular images of \(\mathbb R^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial images of \(\mathbb{R}^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial and regular images of \(\mathbb R^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complements of Convex Polyhedra as Polynomial and Regular Images of ℝn / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complements of 3-dimensional convex polyhedra as polynomial images of ℝ<sup>3</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the set of points at infinity of a polynomial image of \(\mathbb R^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex polyhedra as regular images of ℝ<sup> <i>n</i> </sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate polynomial decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial decomposition algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex polygons and their complements as images of regular and polynomial maps of \(\mathbb R^2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of multiplications necessary to compute certain functions / rank
 
Normal rank

Latest revision as of 18:07, 12 July 2024

scientific article
Language Label Description Also known as
English
A short proof for the open quadrant problem
scientific article

    Statements

    A short proof for the open quadrant problem (English)
    0 references
    0 references
    0 references
    13 October 2016
    0 references
    It was proved in [\textit{J. F. Fernando} and \textit{J. M. Gamboa}, J. Pure Appl. Algebra 179, No. 3, 241--254 (2003; Zbl 1042.14035)] that given linearly independent linear forms \(\ell_1,\dots,\ell_r\) on \(\mathbb R^n\) there exists a polynomial map \(f:\mathbb R^n\to\mathbb R^n\) whose image is the open semialgebraic set \[ \{x\in\mathbb R^n:\ell_1(x)>0,\dots, \ell_r(x)>0\}. \] As a particular case, which is the key to prove the general one, the authors constructed a polynomial map \(f:\mathbb R^2\to\mathbb R^2\) whose image is the open quadrant \(\mathbb Q:=\{x>0,\, y>0\}\subset\mathbb R^2\). The checking of the inclusion \(\mathbb Q\subset f(\mathbb R^2)\) makes use of Sturm's algorithm to show that some univariate polynomials have a real root in certain intervals. This required computer assistance using MAPLE, and it becomes a tedious task to verify that all computations are indeed correct. Thus, it was a challenge to find a more transparent proof avoiding the use of computers. The authors of the article under review have succeeded using a classical strategy: divide and conquer. They consider first the polynomial map \[ F:\mathbb R^2\to\mathbb R^2,\, (x,y)\mapsto((xy-1)^2+x^2,(xy-1)^2+y^2) \] and easily prove the inclusions \[ {\mathcal A}:=\{xy-1\geq0\}\subset F(\mathbb R^2)\subset\mathbb Q. \] They introduce next the subset \(\mathbb B={\mathcal A}\cup\{0<x\leq y\}\) and proved that the polynomial map \[ G:\mathbb R^2\to\mathbb R^2,\, (x,y)\mapsto(x,y(xy-2)^2+x(xy-1)^2) \] satisfies the inclusions \[ \mathbb B\subset G({\mathcal A})\subset G(\mathbb Q)\subset\mathbb Q. \] Finally they consider the polynomial map \[ H:\mathbb R^2\to\mathbb R^2,\, (x,y)\mapsto\Big(x(xy-2)^2+\frac{xy^2}{2},y\Big) \] that satisfies the equalities \(H(\mathbb B)=H(\mathbb Q)=\mathbb Q\). From the above results it follows straightforwardly the equality \(\varphi(\mathbb R^2)=\mathbb Q\), where \(\varphi:=H\circ G\circ F\). Despite the maps \(F\), \(G\) and \(H\) have few monomials and small degree it is worthwhile mentioning that the total degree of \(\varphi\) equals \(72\), whereas the total degree of the map introduced by Fernando and the reviewer is \(56\). It seems natural to ask which is the minimum total degree for the set of polynomial maps \(\mathbb R^2\to\mathbb R^2\) whose image is the open quadrant \(\mathbb Q\) and what is the sparsest polynomial map \(\mathbb R^2\to\mathbb R^2\) whose image is \(\mathbb Q\). In the recent paper [\textit{J. F. Fernando} et al., in: A mathematical tribute to Professor José María Montesinos Amilibia on the occasion of his seventieth birthday. Madrid: Universidad Complutense de Madrid, Facultad de Ciencias Matemáticas, Departamento de Geometría y Topología. 337--350 (2016; Zbl 1348.14135)] it is proved that \(\mathbb Q\) is the image of the polynomial map \[ \mathbb R^2\to\mathbb R^2,\, (x,y)\mapsto((x^2y^4+x^4y^2-y^2-1)^2+x^6y^4,(x^6y^2+x^2y^2-x^2-1)^2+x^6y^4), \] whose total degree is \(28\). It seems plausible that the searched minimum total degree is \(16\), but a proof of this fact is not available nowadays.
    0 references
    0 references
    open quadrant
    0 references
    polynomial maps and images
    0 references
    non-scalar complexity
    0 references
    minimum total degree
    0 references
    0 references
    0 references