Zoran Skoda Zbl-Sela

Review

DE079020725 Zentralblatt review by Zoran Škoda (to replace the abstract at https://zbmath.org/?q=an:07902072)

  • Zlil Sela, Noncommutative algebraic geometry. I: Monomial equations with a single variable, Model Theory 3, No. 3, 733–800 (2024)

Classification: 14A22 16S10 03C68 20F65

Keywords: varieties; systems of equations; associative algebra; Makanin-Razborov diagram

Review

Classical algebraic geometry studies loci of solutions of systems of polynomial equations. Those varieties carry rings of functions, structure sheaves and categories of quasicoherent modules; later generalizations of these structures, and loci replaced by making sense of ‘spectra’ of noncommutative rings or Grothendieck categories (or derived versions), are what is usually meant by noncommutative algebraic geometry. This article returns to solution sets, but in a free associative algebra; thus the setup will be unfamiliar to most contemporary noncommutative geometers. Cohn and Bergman attempted related questions, yet the failure of unique factorization blocked a structure theory. The methods in this article instead follow the theory of equations over free and hyperbolic groups studied from late 1970-s onwards (Makanin, Razborov, Rips, Sela, Bestvina, Feighn, Reinfeldt, Weidmann and others) and the closely related theory of equations over free semigroups. This is already a rich subject with connections to other questions in geometric group theory and also providing the positive solution to Tarski’s problem on the elementary theory of a free group.

The paper treats monomial systems: each equation equates two monomials in the unknowns, with coefficients from the free algebra, which may stand anywhere in a word. Thus a 1xa 2xa 3a_1xa_2xa_3 has degree two in the unknown xx. Throughout, the free algebra is taken over the field F 2\mathbf{F}_2, as a simplifying convention, so that it is the monoid algebra of a finitely generated free monoid.

There is a simple translation trick that if a finite system of homogeneous equations of the form u α(a 1,…,a n,x 1,…,x m)=v α(a 1,…,a n,x 1,…,x m)u_\alpha(a_1,\ldots,a_n,x_1,\ldots,x_m) = v_\alpha(a_1,\ldots,a_n,x_1,\ldots,x_m) is given where a 1,…,a na_1,\ldots,a_n are constants and x 1,…,x mx_1,\ldots,x_m unknowns and α\alpha enumerates equations, then every solution of this system provides an evaluation homomorphism from the free semigroup generated by the unknowns and the constants modulo the equations to the free semigroup generated by the generators of the free algebra. Homomorphisms of that type were studied in the context of equations over free semigroups. Instrumental in their description is a semigroup version of a Makanin–Razborov diagram whose construction in turn uses modular automorphism groups of the limit groups of its nodes. Analogously, in the free algebra case, convergent sequences of homomorphisms from a finitely presented algebra into the free algebra of rank kk present the so called limit algebras are associated to such sequences. They can be embedded into a division algebra using the embeddings of free algebras into division algebras described by Mal’cev, Neumann, Amitsur and Cohn (sometimes called free fields). A certain subgroup of the group of automorphisms of the division algebra constructed in this way is the modular automorphism group mentioned above; in the surface case it contains generalized Dehn twists inspired by Bergman’s centralizer theorem. These groups are not developed here.

The article deduces a Makanin–Razborov diagram for all homogeneous solutions (Theorem 1.1) and the descending chain condition for the corresponding solution sets (Corollary 1.2).

Section 3 gives a combinatorial proof of special cases of Bergman’s centralizer theorem in the free associative algebra. If the top-degree part of uu is a monomial with no proper root, the centralizer of uu is the polynomial algebra it generates (Theorem 3.1); if that part is a proper power of such a monomial, the centralizer is the algebra generated by the root (Theorem 3.3). The argument compares codegrees and does not use limit algebras. The same technique is applied to monomial equations in one variable, assuming that the top homogeneous parts of the coefficients are monomials without periodicity. The solutions of ux=xvux=xv are the polynomial multiples wp(v)wp(v) of a unique minimal solution, of degree at most deg(u)(k deg(u)+2)\deg(u)\,(k^{\deg(u)}+2) (Lemmas 4.1 and 4.2); if the top monomial has roots, one needs a bounded sum of such terms (Lemma 4.3). A sufficiently long solution of u 1xu 2=v 1xv 2u_1xu_2=v_1xv_2 forces a factorization after which the solution set coincides with that of an equation sx=xtsx = xt (Theorem 4.4). For a general (arbitrary degree, nonhomogeneous) one-variable monomial equation, under further restrictions on the period, every solution of an associated equation sx=xtsx = xt is a solution, and every sufficiently long solution arises in this way (Theorem 4.7). The proofs are combinatorial and long. Equations in several variables, and quadratic parts, are left to future articles.

Created on November 19, 2026 at 19:57:22. See the history of this page for a list of all contributions to it.