Minimal inner-\(\Sigma\)-\(\Omega\)-groups and their applications. (Q763669): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1007/s11425-011-4252-3 / rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S11425-011-4252-3 / rank | |||
Normal rank |
Revision as of 09:08, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimal inner-\(\Sigma\)-\(\Omega\)-groups and their applications. |
scientific article |
Statements
Minimal inner-\(\Sigma\)-\(\Omega\)-groups and their applications. (English)
0 references
29 March 2012
0 references
Let \(\Omega\) be a functor assigning to every group \(G\) a family \(\Omega(G)\) of subgroups of \(G\) such that if \(\varphi\colon G_1\to G_2\) is an isomorphism of groups, then \(H\in\Omega(G_1)\) if and only if \(\varphi(H)\in\Omega(G_2)\), and let \(\mho\) be a functor assigning to every group \(G\) a family \(\mho(G)\) of quotients \(G/N\) of \(G\) such that \(G_1/N\in\mho(G_1)\) if and only if \(G_2/\varphi(N)\in\Omega(G_2)\). Let \(\Sigma\) be an abstract group theoretical property (equivalently, a class of groups). Groups which are not \(\Sigma\)-groups but every element of \(\Omega(G)\) is a \(\Sigma\)-group and for every proper subgroup \(H\) of \(G\), the condition that every element of \(\Omega(H)\) has the property \(\Sigma\) implies that \(H\) has also the property \(\Sigma\) are called `inner-\(\Sigma\)-\(\Omega\)-groups'. Dually, groups which are not \(\Sigma\)-groups but every element of \(\mho(G)\) are \(\Sigma\)-groups and for every proper quotient \(\overline G\) of \(G\), the condition that every element of \(\Omega(\overline G)\) has the property \(\Sigma\) implies that \(\overline G\) has the property \(\Sigma\) are called `outer-\(\Sigma\)-\(\mho\)-groups'. It is clear that the knowledge of these inner-\(\Sigma\)-\(\Omega\)-groups and outer-\(\Sigma\)-\(\mho\)-groups will give some information about what makes a group satisfy the property \(\Sigma\) and are useful in arguments by induction on the order of the group in the scope of finite groups. Some properties of these groups are studied in Section~2 of the paper. In Section~3, the authors study what can be said about a group in which the subgroups generated by two conjugate elements satisfy a property \(\Sigma\). If \(\Sigma\) is the property of being nilpotent, a sufficient condition for nilpotency is given (Theorem~3.1). As a consequence, a group \(G\) is nilpotent if and only if for every cyclic subgroup \(H\) of \(G\) with prime power order, \(\langle H,H^g\rangle\) is nilpotent for all \(g\in G\) (Corollary~3.1). For the property \(\Sigma\) of being supersoluble, some sufficient conditions for supersolubility are given in terms of the subgroups of the form \(\langle H,H^g\rangle\) for \(H\) cyclic and \(g\in G\) (Theorem~3.3). Moreover, if for every cyclic subgroup \(H\) of \(G\), \(\langle H,H^g\rangle'\) is a cyclic subgroup for all \(g\in G\), \(G\) is supersoluble (Theorem~3.4). When \(\Sigma\) is the property of being soluble, they obtain that a group \(G\) is soluble if and only if for every cyclic subgroup \(H\) of \(G\), \(\langle H,H^g\rangle\) is soluble for all \(g\in G\) (Theorem~3.6). This result was also proved by \textit{N. Gordeev, F. Grunewald, B. Kunyavski} and \textit{E. Plotkin}, [J. Algebra 323, No. 10, 2888-2904 (2010; Zbl 1201.20008)]. They have proved this result under a different approach with the help of the classification of finite simple groups. Finally, the authors show that a group \(G\) is \(p\)-closed for \(p\in\{2,3,5\}\) if and only if for every cyclic subgroup \(H\) of \(G\), \(\langle H,H^g\rangle\) is \(p\)-closed for all \(g\in G\) (Theorems~3.7--3.9).
0 references
nilpotent subgroups
0 references
supersolvable subgroups
0 references
pairs of conjugate subgroups
0 references
supersolubility
0 references
nilpotency
0 references
cyclic subgroups
0 references
minimal inner-\(\Sigma\)-\(\Omega\)-groups
0 references