<p>This paper studies the properness of polynomial selfmaps <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(F:\mathbb {R}^m \rightarrow \mathbb {R}^m\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>F</mi> <mo>:</mo> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>m</mi> </msup> <mo stretchy="false">→</mo> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>m</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> or <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(F:\mathbb {C}^m\rightarrow \mathbb {C}^m\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>F</mi> <mo>:</mo> <msup> <mrow> <mi mathvariant="double-struck">C</mi> </mrow> <mi>m</mi> </msup> <mo stretchy="false">→</mo> <msup> <mrow> <mi mathvariant="double-struck">C</mi> </mrow> <mi>m</mi> </msup> </mrow> </math></EquationSource> </InlineEquation>. By results of Druzkowski, this question is reduced to that of properness of maps of the following special form, which we call identity plus linear powers. For two vectors <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(x,y\in \mathbb {R}^m\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>x</mi> <mo>,</mo> <mi>y</mi> <mo>∈</mo> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>m</mi> </msup> </mrow> </math></EquationSource> </InlineEquation>, we use the notation <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(x *y =(x_1y_1,\ldots ,x_my_m)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>x</mi> <mrow /> <mo>∗</mo> <mi>y</mi> <mo>=</mo> <mo stretchy="false">(</mo> <msub> <mi>x</mi> <mn>1</mn> </msub> <msub> <mi>y</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>x</mi> <mi>m</mi> </msub> <msub> <mi>y</mi> <mi>m</mi> </msub> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, and if <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(x=y\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>x</mi> <mo>=</mo> <mi>y</mi> </mrow> </math></EquationSource> </InlineEquation> we also use the notation <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(x^2=x*x\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>x</mi> <mn>2</mn> </msup> <mo>=</mo> <mi>x</mi> <mrow /> <mo>∗</mo> <mi>x</mi> </mrow> </math></EquationSource> </InlineEquation> and by induction <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(x^k=x*(x^{k-1})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>x</mi> <mi>k</mi> </msup> <mo>=</mo> <mi>x</mi> <mrow /> <mo>∗</mo> <mrow> <mo stretchy="false">(</mo> <msup> <mi>x</mi> <mrow> <mi>k</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>. We use <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(\langle ,\,\rangle \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">⟨</mo> <mo>,</mo> <mspace width="0.166667em" /> <mo stretchy="false">⟩</mo> </mrow> </math></EquationSource> </InlineEquation> for the usual inner product on <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(\mathbb {R}^m\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>m</mi> </msup> </math></EquationSource> </InlineEquation>. For <i>A</i> an <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(m\times m\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>×</mo> <mi>m</mi> </mrow> </math></EquationSource> </InlineEquation> matrix with coefficients in <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(\mathbb {R}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">R</mi> </math></EquationSource> </InlineEquation>, we can assign a map <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(F_A(x)=x+(Ax)^3:~\mathbb {R}^m\rightarrow \mathbb {R}^m\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>F</mi> <mi>A</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mi>x</mi> <mo>+</mo> <msup> <mrow> <mo stretchy="false">(</mo> <mi>A</mi> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mn>3</mn> </msup> <mo>:</mo> <mspace width="3.33333pt" /> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>m</mi> </msup> <mo stretchy="false">→</mo> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>m</mi> </msup> </mrow> </math></EquationSource> </InlineEquation>. A matrix <i>A</i> is Druzkowski if and only if <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(\det (JF_A(x))=1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo movablelimits="true">det</mo> <mo stretchy="false">(</mo> <mi>J</mi> <msub> <mi>F</mi> <mi>A</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">)</mo> <mo>=</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> for all <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(x\in \mathbb {R}^m\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>x</mi> <mo>∈</mo> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>m</mi> </msup> </mrow> </math></EquationSource> </InlineEquation>. In this paper we research on the question of to what extent the above maps <InlineEquation ID="IEq15"> <EquationSource Format="TEX">\(F_A(x)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>F</mi> <mi>A</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> can be proper, and obtain various necessary conditions and sufficient conditions which suit very well the special form of the maps <InlineEquation ID="IEq16"> <EquationSource Format="TEX">\(F_A\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>F</mi> <mi>A</mi> </msub> </math></EquationSource> </InlineEquation>. A complete characterisation of the properness, in terms of the existence of non-zero solutions to a system of polynomial equations of degree at most 3, in the case where <i>A</i> has corank 1, is obtained. Extending this, we propose a new conjecture, and discuss some applications to the (real) Jacobian conjecture. We also consider the properness of more general maps <InlineEquation ID="IEq17"> <EquationSource Format="TEX">\(x\pm (Ax)^k\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>x</mi> <mo>±</mo> <msup> <mrow> <mo stretchy="false">(</mo> <mi>A</mi> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mi>k</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> or <InlineEquation ID="IEq18"> <EquationSource Format="TEX">\(x\pm A(x^k)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>x</mi> <mo>±</mo> <mi>A</mi> <mo stretchy="false">(</mo> <msup> <mi>x</mi> <mi>k</mi> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>. The advantage of our method, compared to existing methods such as Newton’s polyhedron, is that our criteria, which are tailored for the maps <InlineEquation ID="IEq19"> <EquationSource Format="TEX">\(F_A\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>F</mi> <mi>A</mi> </msub> </math></EquationSource> </InlineEquation>, are easy to check and applicable to parametrised families of matrices. Moreover, we can work on <InlineEquation ID="IEq20"> <EquationSource Format="TEX">\(\mathbb {R}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">R</mi> </math></EquationSource> </InlineEquation>, while other known results requiring working over algebraically closed fields such as <InlineEquation ID="IEq21"> <EquationSource Format="TEX">\(\mathbb {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">C</mi> </math></EquationSource> </InlineEquation>.</p>

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

On the Properness of Polynomial Selfmaps

  • Tuyen Trung Truong

摘要

This paper studies the properness of polynomial selfmaps \(F:\mathbb {R}^m \rightarrow \mathbb {R}^m\) F : R m R m or \(F:\mathbb {C}^m\rightarrow \mathbb {C}^m\) F : C m C m . By results of Druzkowski, this question is reduced to that of properness of maps of the following special form, which we call identity plus linear powers. For two vectors \(x,y\in \mathbb {R}^m\) x , y R m , we use the notation \(x *y =(x_1y_1,\ldots ,x_my_m)\) x y = ( x 1 y 1 , , x m y m ) , and if \(x=y\) x = y we also use the notation \(x^2=x*x\) x 2 = x x and by induction \(x^k=x*(x^{k-1})\) x k = x ( x k - 1 ) . We use \(\langle ,\,\rangle \) , for the usual inner product on \(\mathbb {R}^m\) R m . For A an \(m\times m\) m × m matrix with coefficients in \(\mathbb {R}\) R , we can assign a map \(F_A(x)=x+(Ax)^3:~\mathbb {R}^m\rightarrow \mathbb {R}^m\) F A ( x ) = x + ( A x ) 3 : R m R m . A matrix A is Druzkowski if and only if \(\det (JF_A(x))=1\) det ( J F A ( x ) ) = 1 for all \(x\in \mathbb {R}^m\) x R m . In this paper we research on the question of to what extent the above maps \(F_A(x)\) F A ( x ) can be proper, and obtain various necessary conditions and sufficient conditions which suit very well the special form of the maps \(F_A\) F A . A complete characterisation of the properness, in terms of the existence of non-zero solutions to a system of polynomial equations of degree at most 3, in the case where A has corank 1, is obtained. Extending this, we propose a new conjecture, and discuss some applications to the (real) Jacobian conjecture. We also consider the properness of more general maps \(x\pm (Ax)^k\) x ± ( A x ) k or \(x\pm A(x^k)\) x ± A ( x k ) . The advantage of our method, compared to existing methods such as Newton’s polyhedron, is that our criteria, which are tailored for the maps \(F_A\) F A , are easy to check and applicable to parametrised families of matrices. Moreover, we can work on \(\mathbb {R}\) R , while other known results requiring working over algebraically closed fields such as \(\mathbb {C}\) C .