On products of soluble groups of finite rank (Q1068939)

From MaRDI portal
Revision as of 11:49, 12 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On products of soluble groups of finite rank
scientific article

    Statements

    On products of soluble groups of finite rank (English)
    0 references
    0 references
    1985
    0 references
    A ''rank function'' f(G) is a mapping of the group G into the set of nonnegative integers such that for all subgroups H and K the following inequality holds: f(G)-f(H\(\cap K)\leq f(H)+f(K)\). It is shown that in a soluble-by-finite minimax group G the minimax length m(G) and for every prime p the \(p^{\infty}\)-rank \(r_ p(G)\) are rank functions. Also, the inequality for these functions is an equality if and only if the subset HK of G contains a subgroup of finite index in G. It follows that every soluble-by-finite minimax group factorized by two abelian-by-finite subgroups is metabelian-by-finite. The torsionfree rank \(r_ 0(G)\) in a soluble-by-finite minimax group G is not a ''rank function''. However every soluble-by-finite group G with finite abelian section rank which has two subgroups H and K such that HK contains a subgroup of finite index in G satisfies the rank equality \(r_ 0(G)+r_ 0(H\cap K)=r_ 0(H)+r_ 0(K)\). The proofs reduce to the case where H and K are complements of an abelian normal subgroup of G; essential parts of the proof depend on facts from algebraic number theory such as Dirichlet's unit theorem.
    0 references
    soluble-by-finite minimax group
    0 references
    minimax length
    0 references
    rank functions
    0 references
    subgroup of finite index
    0 references
    abelian-by-finite subgroups
    0 references
    metabelian-by-finite
    0 references
    torsionfree rank
    0 references
    abelian section rank
    0 references
    complements
    0 references

    Identifiers

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