A proof of the equivalence of the Dixmier, Jacobian and Poisson conjectures (Q2479930): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 02:46, 3 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A proof of the equivalence of the Dixmier, Jacobian and Poisson conjectures |
scientific article |
Statements
A proof of the equivalence of the Dixmier, Jacobian and Poisson conjectures (English)
0 references
3 April 2008
0 references
The authors give a self-contained proof of the stable equivalence of the Dixmier conjecture and the Jacobian conjecture which is inspired by the paper [\textit{A. Belov-Kanel, M. Kontsevich}, Mosc. Math. J. 7, No. 2, 209--218 (2007; Zbl 1128.16014)]. This result was first obtained by \textit{Y. Tsuchimoto} [Osaka J. Math. 42, No. 2, 435--452 (2005; Zbl 1105.16024)]. In fact, they prove that a third conjecture, which they name the Poisson conjecture, is stably equivalent to both conjectures. Define \(P_n(\mathbb{C})\) as the polynomial ring \(\mathbb{C}^{[2n]}\) endowed with the canonical Poisson bracket \(\{,\}\) defined by \[ \{f,g\}=\sum_{i=1}^n(\frac{\partial f}{\partial x_i}\frac{\partial g}{\partial x_{i+n}}-\frac{\partial f}{\partial x_{i+n}}\frac{\partial g}{\partial x_{i}}) . \] By \(A_n(\mathbb{C})\) we denote the \(n\)-th Weyl algebra with \(2n\) generators \(y_1,\ldots,y_{2n}\) where [\(y_i,y_{i+n}]=1\) for all \(1\leq i\leq n\) and \([y_i,y_j]=0\) otherwise. Poisson conjecture (\(PC(n)\)). Every endomorphism of \(P_n(\mathbb{C})\) preserving \(\{,\}\) is an automorphism. Dixmier conjecture (\(DC(n)\)). Every endomorphism of \(A_n(\mathbb{C})\) is an automorphism. Jacobian conjecture (\(JC(n)\)). Every \(\mathbb{C}\)-endomorphism \(F\) of \(\mathbb{C}^{[n]}\) with \(\det(\text{Jac}(F))=1\) is an automorphism, where \(\text{Jac}(F)\) is the Jacobian of \(F\). Well-known is that \(DC(n)\Rightarrow JC(n)\). Tsuchimoto showed \(JC(2n)\Rightarrow DC(n)\). In the paper under review the authors show that \(JC(2n)\Rightarrow PC(n)\) and \(PC(n)\Rightarrow DC(n)\). They do this over more general coefficient rings than \(\mathbb{C}\).
0 references
Jacobian Conjecture
0 references
Dixmier Conjecture
0 references
Poisson Conjecture
0 references
reduction mod p techniques
0 references