∀-free metabelian groups (Q4338320)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1014593
Language Label Description Also known as
default for all languages
No label defined
    English
    ∀-free metabelian groups
    scientific article; zbMATH DE number 1014593

      Statements

      ∀-free metabelian groups (English)
      0 references
      0 references
      7 April 1999
      0 references
      free metabelian groups
      0 references
      elementary theories
      0 references
      universal theories
      0 references
      universal axioms
      0 references
      decidability
      0 references
      Let \(M_n\) be a free non-abelian metabelian group of rank \(n\). Since \(\text{Th}_\forall M_{n_1}=\text{Th}_\forall M_{n_2}\) for any pair \((n_1,n_2)\) one can speak of the \(\forall\)-theory of a non-abelian free metabelian group \(\text{Th}_\forall M\). A group \(G\) is said to be \(\forall\)-free metabelian if \(\text{Th}_\forall G=\text{Th}_\forall M\). The author proved [in J. Algebra 176, No. 2, 368-391 (1995; Zbl 0860.20024)] that a \(\forall\)-free metabelian group has a decidable universal theory. In this paper he gives an explicit description of \(\forall\)-free metabelian groups in different ways. A set of universal axioms is presented for \(\text{Th}_\forall M\). It is proved that a group \(G\) is \(\forall\)-free metabelian if and only if \(G\) satisfies the following conditions: (i) \(G\) is torsion-free metabelian; (ii) the Fitting subgroup \(\text{Fit }G\) is abelian and isolated; (iii) \(\text{Fit }G\) is torsion-free as a \(\mathbb{Z}(G/\text{Fit }G)\)-module. It is known from results by G. Baumslag, F. B. Cannonito and D. J. S. Robinson that these conditions are recognizable in the class of finitely generated metabelian groups. Thus one can decide whether a given finitely generated metabelian group is a \(\forall\)-free metabelian group or not.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references