无界凸多面体作为欧几里得空间的多项式像
Unbounded convex polyhedra as polynomial images of Euclidean spaces
AI总结:
本文构造性刻画可作为 $\mathbb{R}^n$ 多项式像的无界 $n$ 维凸多面体及其内部,判别依据是回收锥维数及是否存在 $n-1$ 维有界面。
摘要:
在先前的工作中,我们证明了每个 $n$ 维凸多面体 $\mathcal{K}\subset\mathbb{R}^n$ 及其相对内部都是 $\mathbb{R}^n$ 的正则像。由于非常数多项式映射的像是无界半代数集,因此在前述命题中不可能用多项式映射替换正则映射。在本工作中,我们以构造性方式确定了所有作为 $\mathbb{R}^n$ 的多项式像的无界 $n$ 维凸多面体 $\mathcal{K}\subset\mathbb{R}^n$。我们还分析了其中哪些多面体的内部 $\operatorname{Int}(\mathcal{K})$ 是 $\mathbb{R}^n$ 的多项式像。一个判别对象是 $\mathcal{K}$ 的回收锥 $\vec{\mathcal{C}}(\mathcal{K})$。具体而言,$\mathcal{K}$ 是 $\mathbb{R}^n$ 的多项式像,当且仅当 $\vec{\mathcal{C}}(\mathcal{K})$ 的维数为 $n$。此外,$\operatorname{Int}(\mathcal{K})$ 是 $\mathbb{R}^n$ 的多项式像,当且仅当 $\vec{\mathcal{C}}(\mathcal{K})$ 的维数为 $n$,且 $\mathcal{K}$ 没有维数为 $n-1$ 的有界面。一个关键结果是改进了 Pecker 的不等式消去法,该方法将半代数集表示为代数集的投影。经验性探索表明,以某个具体凸多面体为多项式像的多项式映射“很少”,而那些能够以可负担的方式证明其像确实对应于给定凸多面体的映射则更少。这种“大海捞针”式的搜索在某种程度上解释了我们构造性证明中所涉及的技术性。
英文摘要:
In a previous work we proved that each $n$-dimensional convex polyhedron ${\mathcal K}subset{\mathbb R}^n$ and its relative interior are regular images of ${\mathbb R}^n$. As the image of a non-constant polynomial map is an unbounded semialgebraic set, it is not possible to substitute regular maps by polynomial maps in the previous statement. In this work we determine constructively all unbounded $n$-dimensional convex polyhedra ${\mathcal K}\subset{\mathbb R}^n$ that are polynomial images of ${\mathbb R}^n$. We also analyze for which of them the interior ${\rm Int}({\mathcal K})$ is a polynomial image of ${\mathbb R}^n$. A discriminating object is the recession cone $\vec{\mathcal C}({\mathcal K})$ of ${\mathcal K}$. Namely, \em ${\mathcal K}$ is a polynomial image of ${\mathbb R}^n$ if and only if $\vec{\mathcal C}({\mathcal K})$ has dimension $n$\em. In addition, \em ${\rm Int}({\mathcal K})$ is a polynomial image of ${\mathbb R}^n$ if and only if $\vec{\mathcal C}({\mathcal K})$ has dimension $n$ and ${\mathcal K}$ has no bounded faces of dimension $n-1$\em. A key result is an improvement of Pecker's elimination of inequalities to represent semialgebraic sets as projections of algebraic sets. Empirical approaches suggest us that there are `few' polynomial maps that have a concrete convex polyhedron as a polynomial image and that there are even fewer for which it is affordable to show that their images actually correspond to our given convex polyhedron. This search of a `needle in the haystack' justifies somehow the technicalities involved in our constructive proofs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。