Shestakov-Umirbaev reductions and Nagata's conjecture on a polynomial automorphism (Q973688)

From MaRDI portal
Revision as of 19:39, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Shestakov-Umirbaev reductions and Nagata's conjecture on a polynomial automorphism
scientific article

    Statements

    Shestakov-Umirbaev reductions and Nagata's conjecture on a polynomial automorphism (English)
    0 references
    0 references
    2 June 2010
    0 references
    A long standing problem in the algebraic theory of polynomial automorphisms has been to decide whether the automorphism group of a polynomial ring in three variables over a field is generated by the so-called tame automorphisms. In 2003, \textit{I. P. Shestakov} and \textit{U. U. Umirbaev} [J. Am. Math. Soc. 17, No. 1, 181--196 (2004; Zbl 1044.17014); ibid. 17, No. 1, 197--227 (2004; Zbl 1056.14085)] proved that non-tame automorphisms exist and that the famous automorphism constructed by Nagata in 1972 is indeed non tame. In the paper under review, the author gives a reworked and clarified proof of this result. The strategy is essentially along the same lines as in the original article of Shestakov and Umirbaev. However two new ingredients introduced by the author enable to shorten and simplify substantially the proof: a generalized notion of (multi)-degree leads to important simplifications in technical arguments and a notion of ``weak Shestakov-Umirbaev reduction'' is defined, which helps to clarify the previous notions of reductions of types I-IV introduced by Shestakov and Umirbaev. In particular, it is shown that the hypothetical type IV reduction needed in Shestakov and Umirbaev argument in fact never occurs (the similar question for types II and III is still open). The paper is still quite long and technical but, in contrast with the original series of article by Shestakov and Umirbaev, it has the advantage to provide full, self-contained and detailed proofs of almost all intermediate lemmas. Also, the final criterion for non-tameness obtain by the author is much more flexible whence potentially applicable to a wider class of automorphisms.
    0 references
    polynomial automorphisms
    0 references
    tame generator problem
    0 references

    Identifiers