Results on undecidability of isomorphism of forms over polynomial rings (Q2496144): Difference between revisions

F.\, Grunewald and D.\, Segal proved in 1980s that simultaneous isomorphism of any set of polynomial forms over the domain \(\mathbb Z\) of integers is algorithmically decidable. They did this by finding a fundamental domain for the action of algebraic groups over \(\mathbb Z\) giving isomorphism of such forms. This solves the problem of decidability of isomorphism of finitely presented nilpotent groups, of rings which are finitely generated and a number of other problems. The authors consider isomorphism of forms over polynomial rings. In general, a fundamental domain does not exist. They show the undecidability assuming a hypothesis on units in certain quaternion rings. Assuming this, it follows that isomorphisms of modules and of affine algebraic varieties are undecidable in the general case.