Factorization criterion for local solvability of locally finite groups with minimal condition for primary subgroups (Q1076153)

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 3953083
Language Label Description Also known as
default for all languages
No label defined
    English
    Factorization criterion for local solvability of locally finite groups with minimal condition for primary subgroups
    scientific article; zbMATH DE number 3953083

      Statements

      Factorization criterion for local solvability of locally finite groups with minimal condition for primary subgroups (English)
      0 references
      0 references
      1985
      0 references
      Theorem 1 of this paper states that if \(G\) is a locally finite group that contains a finite Sylow (i.e. maximal) \(p\)-subgroup for each prime \(p\), then \(G\) is locally soluble if and only if each Sylow \(p\)-subgroup is complemented. The proof is a straightforward deduction from the finite case. Theorem 2 draws the same conclusion for locally finite groups whose maximal \(p\)-subgroups satisfy the minimal condition on subgroups (i.e. are Chernikov groups). The proof uses Theorem 1, and also the fact that a locally finite group in which each maximal \(p\)-subgroup is Chernikov, has a locally soluble subgroup of finite index. It would be interesting to have a proof not depending on this deep fact.
      0 references
      0 references
      Sylow p-subgroup
      0 references
      complemented
      0 references
      locally finite groups
      0 references
      maximal p-subgroups
      0 references
      minimal condition on subgroups
      0 references
      Chernikov groups
      0 references
      locally soluble subgroup of finite index
      0 references
      0 references
      0 references

      Identifiers

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