<p>In previous work we have shown that any subalgebra <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(A \subseteq \mathbb {K}[x]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>A</mi> <mo>⊆</mo> <mi mathvariant="double-struck">K</mi> <mo stretchy="false">[</mo> <mi>x</mi> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation> of finite codimension <i>n</i> can be described by a finite set <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\text {Sp}(A)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>Sp</mtext> <mo stretchy="false">(</mo> <mi>A</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, called the subalgebra spectrum of <i>A</i>, together with <i>n</i> defining conditions. In this paper we show that a similar result applies to subalgebras of infinite codimension. We also develop new tools for the case of finite codimension. One of them is to introduce an ideal <i>I</i>(<i>A</i>) in <i>A</i> of finite codimension in <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\mathbb {K}[x]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">K</mi> <mo stretchy="false">[</mo> <mi>x</mi> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation>, such that <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(V(I(A))=\text {Sp}(A).\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>V</mi> <mo stretchy="false">(</mo> <mi>I</mi> <mo stretchy="false">(</mo> <mi>A</mi> <mo stretchy="false">)</mo> <mo stretchy="false">)</mo> <mo>=</mo> <mtext>Sp</mtext> <mo stretchy="false">(</mo> <mi>A</mi> <mo stretchy="false">)</mo> <mo>.</mo> </mrow> </math></EquationSource> </InlineEquation> We use <i>A</i>/<i>I</i>(<i>A</i>) to analyse how the structure of <i>A</i> relates to its defining conditions. A key problem is to find algorithms for obtaining a SAGBI basis given defining conditions and vice versa. We present an efficient solution to the first problem. By elimination of a linear system we obtain a linear basis of <i>A</i> and then reduce it into a minimal SAGBI basis. By solving the same linear system we can also obtain the normal form of any polynomial. Further, we suggest an efficient way to obtain <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\text {Sp}(A)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>Sp</mtext> <mo stretchy="false">(</mo> <mi>A</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> from generators of <i>A</i>, but note that finding the conditions is NP hard.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Subalgebras of the univariate polynomial algebra

  • Anna Torstensson

摘要

In previous work we have shown that any subalgebra \(A \subseteq \mathbb {K}[x]\) A K [ x ] of finite codimension n can be described by a finite set \(\text {Sp}(A)\) Sp ( A ) , called the subalgebra spectrum of A, together with n defining conditions. In this paper we show that a similar result applies to subalgebras of infinite codimension. We also develop new tools for the case of finite codimension. One of them is to introduce an ideal I(A) in A of finite codimension in \(\mathbb {K}[x]\) K [ x ] , such that \(V(I(A))=\text {Sp}(A).\) V ( I ( A ) ) = Sp ( A ) . We use A/I(A) to analyse how the structure of A relates to its defining conditions. A key problem is to find algorithms for obtaining a SAGBI basis given defining conditions and vice versa. We present an efficient solution to the first problem. By elimination of a linear system we obtain a linear basis of A and then reduce it into a minimal SAGBI basis. By solving the same linear system we can also obtain the normal form of any polynomial. Further, we suggest an efficient way to obtain \(\text {Sp}(A)\) Sp ( A ) from generators of A, but note that finding the conditions is NP hard.