Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?
Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur Graph Search.
Concept
Torsion group
Résumé
In group theory, a branch of mathematics, a torsion group or a periodic group is a group in which every element has finite order. The exponent of such a group, if it exists, is the least common multiple of the orders of the elements.
For example, it follows from Lagrange's theorem that every finite group is periodic and it has an exponent dividing its order.
Examples of infinite periodic groups include the additive group of the ring of polynomials over a finite field, and the quotient group of the rationals by the integers, as well as their direct summands, the Prüfer groups. Another example is the direct sum of all dihedral groups. None of these examples has a finite generating set. Explicit examples of finitely generated infinite periodic groups were constructed by Golod, based on joint work with Shafarevich, see Golod–Shafarevich theorem, and by Aleshin and Grigorchuk using automata. These groups have infinite exponent; examples with finite exponent are given for instance by Tarski monster groups constructed by Olshanskii.
Burnside's problem
Burnside's problem is a classical question which deals with the relationship between periodic groups and finite groups, when only finitely-generated groups are considered: Does specifying an exponent force finiteness? The existence of infinite, finitely generated periodic groups as in the previous paragraph shows that the answer is "no" for an arbitrary exponent. Though much more is known about which exponents can occur for infinite finitely generated groups there are still some for which the problem is open.
For some classes of groups, for instance linear groups, the answer to Burnside's problem restricted to the class is positive.
One of the interesting properties of periodic groups is that the definition cannot be formalized in terms of first-order logic. This is because doing so would require an axiom of the form
which contains an infinite disjunction and is therefore inadmissible: First order logic permits quantifiers over one type and cannot capture properties or subsets of that type.
Source officielle
À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.