Skip to main content
QUICK REVIEW

[论文解读] Finite determinacy of matrices and ideals in arbitrary characteristic

Gert–Martin Greuel, Thuy Huong Pham|arXiv (Cornell University)|Aug 8, 2017
Advanced Topics in Algebra被引用 7
一句话总结

本文证明了在任意特征的形式幂级数环上,1列矩阵的有限确定性等价于其Fitting理想具有最大高度。研究证明,当且仅当一个正维理想是孤立的完全交奇点时,它才是有限接触确定的,给出了显式的、下半连续的确定性界,并解决了正特征下1列矩阵领域的一个关键开放问题。

ABSTRACT

Let M be the ring of m x n matrices A with entries in R=K[[x1,...,xs]], the ring of formal power series over an arbitrary field K. We call A finitely determined if any matrix B, with entries of A-B in ^k for some k, is left-right equivalent to A, i.e. B is contained in the G-orbit of A, where G is the group of automorphisms of R combined with the multiplication of invertible matrices from the left and from the right. Finite determinacy is an important property, which implies that A is left-right equivalent to a matrix with polynomial entries. It has been intensively studied for one power series over the complex and real numbers in connection with the classification of singularities. In positive characteristic the problem is more subtle since the tangent image may differ from the tangent space to the orbit, as was shown in one of our previous papers. There we show that finite codimension of the tangent image is sufficient for finite determinacy. The question whether it is also necessary remains open for matrices of arbitrary size in positive characteristic. In this paper we answer this question positively for 1-column matrices. For this we prove that the Fitting ideals of a finitely determined matrix have maximal height. 1-column matrices are of particular interest, since left-right equivalence of matrices corresponds to contact equivalence of the ideals in R generated by their entries. Here two ideals I and J are contact equivalent if the K-algebras R/I and R/J are isomorphic. Our main result on matrices implies that a positive dimensional ideal is finitely contact-determined if and only if it is an isolated complete intersection singularity. In addition we give explicitly computable and semicontinuous determinacy bounds. We discuss also several open problems which are of independent interest.

研究动机与目标

  • 为解决在正特征下,1列矩阵的有限确定性是否需要切空间像具有有限余维这一开放问题。
  • 以孤立的完全交奇点为条件,建立理想有限接触确定性的刻画。
  • 为任意特征下的1列矩阵和理想推导出显式、下半连续的确定性界。
  • 阐明Fitting理想在有限确定性中的作用,表明有限确定矩阵的Fitting理想必须具有最大高度。
  • 解决在正特征下,矩阵与理想在左右等价关系下的分类基础问题。

提出的方法

  • 分析在 R = K[[x1,...,xs]] 上,1列矩阵在左右等价关系下的群作用,其中 K 为任意域。
  • 通过研究轨道的切空间像来研究有限确定性,重点关注其在切空间中的余维。
  • 应用Fitting理想的理论,刻画有限确定性所需的高度条件。
  • 建立矩阵有限确定性与理想接触等价之间的对应关系,将问题简化为理想分类问题。
  • 基于矩阵之间差值的零点阶数,推导出下半连续的确定性界。
  • 利用1列矩阵的左右等价与理想接触等价之间的等价性,实现在矩阵与理想设定之间的结果传递。

实验结果

研究问题

  • RQ1在正特征下,1列矩阵的有限确定性是否需要其切空间像具有有限余维?
  • RQ2在任意特征下,矩阵的Fitting理想需满足何种精确代数条件,才能使其为有限确定?
  • RQ3在 R = K[[x1,...,xs]] 中,什么条件下理想是有限接触确定的?这与奇点类型有何关联?
  • RQ4能否为任意特征下的1列矩阵计算出显式、下半连续的确定性界?
  • RQ5在左右等价关系下,1列矩阵的分类与在接触等价关系下理想分类之间有何关系?

主要发现

  • 在 R = K[[x1,...,xs]] 上,1列矩阵是有限确定的,当且仅当其Fitting理想具有最大高度。
  • 1列矩阵的有限确定性意味着它与一个具有多项式系数的矩阵左右等价。
  • 在 R 中,正维理想是有限接触确定的,当且仅当它是孤立的完全交奇点。
  • 本文为任意特征下的1列矩阵提供了显式可计算且下半连续的确定性界。
  • 本研究解决了在任意域上,1列矩阵的有限确定性是否需要切空间像具有有限余维这一开放问题。
  • 1列矩阵的左右等价与理想接触等价之间的等价性,使得有限确定性结果可在矩阵与理想设定之间相互传递。

更好的研究,从现在开始

从阅读论文到最终审阅,大幅缩短您的研究时间。

无需绑定信用卡

本解读由 AI 生成,并经人工编辑审核。