弱多项式完备性不蕴含几乎多项式完备性
Weak Polynomial Completeness Does Not Imply Almost Polynomial Completeness
- National University of Singapore（新加坡国立大学）
机构由 AI 辅助整理，请以论文原文为准。
中文总结 AI 辅助
通过构造满足 \\(\Int(D)\subseteq\Int(A)\\) 但 \\(\Int(D^2)\nsubseteq\Int(A^2)\\) 的扩环，证明弱多项式完备性不蕴含几乎多项式完备性。
中文摘要 AI 辅助
我们通过构造一个明确的扩环 \\(D\subseteq A\\)，使得 \\(\Int(D)\subseteq\Int(A)\\) 但 \\(\Int(D^2)\nsubseteq\Int(A^2)\\)，从而证明弱多项式完备性不蕴含几乎多项式完备性。
英文摘要
We show that weak polynomial completeness does not imply almost polynomial completeness by constructing an explicit extension of domains \(D\subseteq A\) such that \(\Int(D)\subseteq\Int(A)\) but \(\Int(D^2)\nsubseteq\Int(A^2)\).
