betaFeedback

WorksMathematics

MM-subgroups and normal-subgroup lattices of finite groups

Abstract

Let GG be a group. A normal subgroup EE is an MM-subgroup if E∩N1∩N2≠1E\cap N_1\cap N_2\neq1 whenever N1∩N2N_1\cap N_2, E∩N1E\cap N_1, and E∩N2E\cap N_2 are non-trivial for normal subgroups N1,N2N_1,N_2. We characterise these subgroups as the essential or relatively uniform normal subgroups. For finite GG, an MM-subgroup is either trivial, contains exactly one minimal normal subgroup, or contains the socle. Consequently, every normal subgroup is an MM-subgroup precisely when the socle has GG-chief length at most two. We obtain an explicit MM-closure operation and describe the minimal normal subgroups of finite direct products. For crown-based powers, we use the known comparability of normal subgroups with the socle to describe the normal lattice in terms of Boolean or subspace lattices and the quotient above the socle. We then determine when the MM-lattice retains the normal lattice, classify normal quotients and their automorphism orbits, and characterise quotient maps compatible with MM-closure. Finally, we compute the maximal length of chains of MM-subgroups in terms of the chief length and socle length of GG.

Introduction

For a finite group GG, the normal subgroups form a finite modular lattice N(G)\mathcal{N}(G) whose atoms are the minimal normal subgroups of GG. Their product is the socle Soc⁡(G)\operatorname{Soc}(G), which is also the least essential normal subgroup: it meets every non-trivial normal subgroup, and every essential normal subgroup contains it. Thus the socle provides a natural point of departure for studying intersection properties in N(G)\mathcal{N}(G). In this paper we identify a class of normal subgroups defined by such a property and show that, for finite groups, its structure is governed by the socle and by the geometry of minimal normal subgroups.

A normal subgroup E⊴GE\trianglelefteq G is called an M\mathcal{M}-subgroup if, for all normal subgroups N1,N2⊴GN_1,N_2\trianglelefteq G,

N1∩N2≠1,E∩N1≠1,E∩N2≠1⟹E∩N1∩N2≠1.\begin{gathered} N_1\cap N_2\ne1,\qquad E\cap N_1\ne1,\qquad E\cap N_2\ne1\\ \Longrightarrow E\cap N_1\cap N_2\ne1. \end{gathered}

As we prove in Proposition 3.3, this condition is equivalent to the analogous implication for any finite family of normal subgroups. We write NM(G)\mathcal{N}^{\mathcal{M}}(G) for the collection of M\mathcal{M}-subgroups and call GG M\mathcal{M}-full when

2020 Mathematics Subject Classification. Primary 20D30; Secondary 20D15, 20C20, 20E22, 06C05.

Key words and phrases. M\mathcal{M}-subgroup, μ\mu-element, essential subgroup, minimal normal subgroup, socle length, M\mathcal{M}-depth, direct product, crown-based power, normal-subgroup lattice. NM(G)=N(G)\mathcal{N}^{\mathcal{M}}(G)=\mathcal{N}(G). Our principal questions are to characterise these subgroups, determine when GG is M\mathcal{M}-full, and describe the resulting lattice for direct products and crown-based powers.

The intersection condition is motivated by the theory of M\mathcal{M}-ideals in Banach spaces, initiated by Alfsen and Effros [1] (see also [14]), and its later analogues for ring ideals and quantales. In particular, [3] introduced ring M\mathcal{M}-ideals, while [6] studied μ\mu-elements of quantales. The dichotomy between essentiality and a relative uniformity condition in these settings motivates the group case. Our arguments use the modular normal-subgroup lattice directly, rather than applying the quantale results.

Let us now discuss our main results. We first show, for arbitrary groups, that a normal subgroup is an M\mathcal{M}-subgroup if and only if it is essential or relatively uniform (Theorem 3.4); the latter means that any two non-trivial normal subgroups contained in it meet non-trivially. For finite groups, this becomes a classification in terms of minimal normal subgroups. Write MinNorm⁡(G)\operatorname{MinNorm}(G) for their set and put supp⁡(N)={A∈MinNorm⁡(G):A≤N}\operatorname{supp}(N)=\{A\in\operatorname{MinNorm}(G): A\leq N\} for N⊴GN\unlhd G.

Theorem A. Let GG be finite and let E⊴GE\unlhd G. Then EE is an M\mathcal{M}-subgroup if and only if

E=1,∣supp⁡(E)∣=1,orSoc⁡(G)≤E.E=1,\qquad|\operatorname{supp}(E)|=1,\qquad\text{or}\qquad\operatorname{Soc}(G)\leq E.

The M\mathcal{M}-subgroups are closed under intersections. Moreover, the least M\mathcal{M}-subgroup containing a normal subgroup NN is

cl⁡M(N)={N,∣supp⁡(N)∣≤1,NSoc⁡(G),∣supp⁡(N)∣≥2.\operatorname{cl}_{\mathcal{M}}(N)= \begin{cases} N, & |\operatorname{supp}(N)|\leq1,\\ N\operatorname{Soc}(G), & |\operatorname{supp}(N)|\geq2. \end{cases}

Consequently they form a lattice whose join is E∨MF=cl⁡M(EF)E\vee_{\mathcal{M}}F=\operatorname{cl}_{\mathcal{M}}(EF).

The classification extends to normally atomic groups (Theorem 3.7). In the finite case it also provides an explicit closure operator on N(G)\mathcal{N}(G), and hence a lattice structure on NM(G)\mathcal{N}^{\mathcal{M}}(G) (Proposition 3.11 and Corollary 3.13). In particular, the normal subgroups excluded from NM(G)\mathcal{N}^{\mathcal{M}}(G) are precisely those containing more than one, but not all, of the minimal normal subgroups of GG.

Let σ(G)\sigma(G) denote the length of the interval [1,Soc⁡(G)]N(G)[1,\operatorname{Soc}(G)]_{\mathcal{N}(G)}; equivalently, it is the number of factors in a decomposition of the socle into a direct product of minimal normal subgroups. The criterion for M\mathcal{M}-fullness is then numerical.

Theorem B. Let GG be a non-trivial finite group and put S=Soc⁡(G)S=\operatorname{Soc}(G). The following are equivalent:

  1. every normal subgroup of GG is an M\mathcal{M}-subgroup;

  2. σ(G)≤2\sigma(G)\leq2;

  3. one of the following holds: (a) GG has one minimal normal subgroup; (b) GG has exactly two minimal normal subgroups; (c) for some prime pp and some irreducible FpG\mathbb{F}_pG-module AA, one has S≅A⊕AS\cong A\oplus A as GG-modules.

In alternative (c), if D=End⁡FpG(A)D=\operatorname{End}_{\mathbb{F}_pG}(A), then MinNorm⁡(G)\operatorname{MinNorm}(G) is naturally the projective line P1(D)\mathbb{P}^{1}(D) and has ∣D∣+1|D|+1 elements.

Thus the relevant invariant is the length of the socle, not the number of its minimal normal subgroups. For example, Cp×CpC_p\times C_p has p+1p+1 minimal normal subgroups, but its socle has length two, so it is M\mathcal{M}-full. More generally, the abelian isotypic components of the socle give rise to finite projective geometries (Proposition 4.4). The classification also has a lattice-theoretic formulation: for arbitrary GG, M\mathcal{M}-fullness is equivalent to the normal-subgroup lattice having uniform (Goldie) dimension at most two (Theorem 4.11).

Direct products and crown-based powers make these results concrete. The minimal normal subgroups of a direct product need not come from the factors: central elementary abelian subgroups also produce diagonal minimal normal subgroups. A crown-based power, introduced by Dalla Volta and Lucchini [8], is an important construction in the structure and generation theory of finite groups; in particular, certain quotients G/RG(B)G/R_G(B) attached to non-Frattini chief factors are crown-based powers [10, 19]. Burness, Garonzi and Lucchini [4, Section 5] use crown theory to bound the intersection number of a finite group, which is defined using intersections of maximal subgroups. Our intersection condition, by contrast, concerns normal subgroups. We describe the atoms of the corresponding normal-subgroup lattices and determine M\mathcal{M}-fullness.

Theorem C. Let G=G1×⋯×GtG=G_1\times\cdots\times G_t be finite. For each prime pp, set

Vi,p={z∈Z(Gi):zp=1},Vp=∏i=1tVi,p.V_{i,p}=\{z\in Z(G_i):z^p=1\},\qquad V_p=\prod_{i=1}^{t}V_{i,p}.

The minimal normal subgroups of GG are precisely the coordinate copies of the noncentral minimal normal subgroups of the factors, together with the one-dimensional Fp\mathbb{F}_p-subspaces of the spaces VpV_p. If t≥2t\geq2 and all factors are non-trivial, then GG is M\mathcal{M}-full exactly when t=2t=2 and both factors are monolithic.

If LL is a finite monolithic primitive group with socle AA and LkL_k is its crown-based power, then Soc⁡(Lk)=Ak\operatorname{Soc}(L_k)=A^k. If AA is non-abelian, the atoms are the kk coordinate copies of AA. If AA is abelian, then AA is an irreducible Fp[L/A]\mathbb{F}_p[L/A]-module for a prime pp; with D=End⁡Fp[L/A](A)D=\operatorname{End}_{\mathbb{F}_p[L/A]}(A), the atoms are parametrized by Pk−1(D)\mathbb{P}^{k-1}(D). In either case every normal subgroup of LkL_k is an M\mathcal{M}-subgroup exactly when k≤2k\leq2.

The comparability of every normal subgroup of a crown-based power LkL_k with its socle V=AkV=A^k is known by a lemma of Lucchini, Moscatiello and Spiga [18, Lemma 2.2]. Using this result, we identify the lower interval of N(Lk)\mathcal{N}(L_k) with a Boolean lattice or a subspace lattice and the upper interval with $\mathcal{N}(L/A) ({xref}Theorem 6.1). Our subsequent results concern the information retained by $\mathcal{N}^{\mathcal{M}}(L_k)$: we give a rigidity criterion comparing normal-subgroup lattices and $\mathcal{M}$-lattices ({xref}Theorem 6.5), classify the quotients by arbitrary normal subgroups contained in $V$ together with their automorphism orbits ({xref}Theorem 6.6), and determine precisely which quotient maps preserve $\mathcal{M}$-closure ({xref}Proposition 6.7). The description also gives enumeration formulas ({xref}Corollary 6.2) and applies to crowns associated with arbitrary finite groups ({xref}Corollary 6.10`).

Finally, the omission of normal subgroups from NM(G)\mathcal{N}^{\mathcal{M}}(G) can be measured by a chain-length invariant. Define the M\mathcal{M}-depth md⁡(G)\operatorname{md}(G) to be the maximum length of a chain from 11 to GG in NM(G)\mathcal{N}^{\mathcal{M}}(G), and let ℓn(G)\ell_n(G) be the chief length of GG.

Theorem D. Let GG be a non-trivial finite group. If GG has one minimal normal subgroup, then

md⁡(G)=ℓn(G).\operatorname{md}(G)=\ell_n(G).

If GG has at least two minimal normal subgroups, then

md⁡(G)=ℓn(G)−σ(G)+2.\operatorname{md}(G)=\ell_n(G)-\sigma(G)+2.

In particular, if G1,…,GtG_1,\ldots,G_t are non-trivial finite groups and t≥2t\geq2, then

md⁡(G1×⋯×Gt)=∑i=1t(ℓn(Gi)−σ(Gi))+2.\operatorname{md}(G_1\times\cdots\times G_t)=\sum_{i=1}^{t}\bigl(\ell_n(G_i)-\sigma(G_i)\bigr)+2.

In fact, every maximal chain of M\mathcal{M}-subgroups has the same length. When GG has at least two minimal normal subgroups, such a chain follows a chief series below a normal subgroup containing a unique minimal normal subgroup, crosses the socle in one step, and continues along a chief series above the socle (Corollary 8.3). Consequently, md⁡(G)=ℓn(G)\operatorname{md}(G)=\ell_n(G) holds precisely for M\mathcal{M}-full finite groups (Corollary 8.4). We also compute the depth for several standard families, including finite abelian and nilpotent groups, dihedral groups, and crown-based powers.

The organization of the paper is as follows. In § 2, we fix notation. In § 3, we prove the basic dichotomy and the classification of M\mathcal{M}-subgroups. The purpose of Section 4 is to treat M\mathcal{M}-fullness and its relation to the socle, whereas in § 5 and § 6 we address direct products and crown-based powers. In § 7, we specialise the results to finite abelian groups, and finally, in § 8, we study M\mathcal{M}-depth.

Definitions and notation

Groups are arbitrary unless finiteness is stated explicitly. We begin with the lattice of normal subgroups and the standard lattice-theoretic vocabulary that we use for it.

Definition 2.1. For a group GG, write

N(G)={N≤G:N⊴G}\mathcal{N}(G)=\{N\leq G:N\trianglelefteq G\}

for the poset of normal subgroups ordered by inclusion, and write Sub⁡(G)\operatorname{Sub}(G) for the poset of all subgroups. The least element of N(G)\mathcal{N}(G) is the trivial subgroup 11 and the greatest element is GG. For H,K⊴GH,K\trianglelefteq G, their meet is H∩KH\cap K and their join is the subgroup product HK={hk:h∈H, k∈K}HK=\{hk:h\in H,\ k\in K\}. For H≤KH\leq K in a poset PP, the interval [H,K]P[H,K]_P is {X∈P:H≤X≤K}\{X\in P:H\leq X\leq K\}, and the principal filter generated by HH is [H,G]P[H,G]_P when GG is the greatest element. An atom of a poset with least element is a minimal element strictly larger than the least one. A lattice is modular if

x∨(y∧z)=(x∨y)∧z(x≤z).x\vee(y\wedge z)=(x\vee y)\wedge z \qquad(x\leq z).

A meet-subsemilattice is a subset closed under finite nonempty meets. The length of a finite chain X0<X1<⋯<XrX_0<X_1<\cdots<X_r is rr; the length of a finite interval is the maximum length of a chain joining its endpoints.

The group-theoretic notation is standard [15, 20]; we record the conventions that matter for computations, notably the order of factors in commutators.

Definition 2.2. For subgroups A,B≤GA,B\leq G, our commutator convention is [a,b]=aba−1b−1[a,b]=aba^{-1}b^{-1}, and [A,B][A,B] denotes the subgroup generated by these commutators. We write Z(G)Z(G) for the centre of GG and CnC_n for the cyclic group of order nn. As usual, an elementary abelian pp-group is regarded as a vector space over Fp\mathbb{F}_p. All other elementary group-theoretic terminology is standard.

The atoms of N(G)\mathcal{N}(G) are the minimal normal subgroups, and they are the central objects of this paper. The following notions are classical for finite groups [15, 20]; we state them for arbitrary groups, since some of our results hold in that generality.

Definition 2.3. A minimal normal subgroup of GG is a non-trivial normal subgroup minimal under inclusion. Thus the minimal normal subgroups are exactly the atoms of N(G)\mathcal{N}(G). Write MinNorm⁡(G)\operatorname{MinNorm}(G) for their set and define the socle

Soc⁡(G)=⟨A:A∈MinNorm⁡(G)⟩.\operatorname{Soc}(G)=\langle A:A\in\operatorname{MinNorm}(G)\rangle.

For N⊴GN\trianglelefteq G, define its atom support by

supp⁡(N)={A∈MinNorm⁡(G):A≤N}.\operatorname{supp}(N)=\{A\in\operatorname{MinNorm}(G):A\leq N\}.

The group GG is normally atomic if every non-trivial normal subgroup contains a minimal normal subgroup. It is monolithic if it has a unique minimal normal subgroup.

References

  1. [1]Alfsen, E. M. Alfsen and E. G. Effros, Structure in real Banach spaces. I, II, Ann. of Math. (2) 96 (1972), 98–128, 129–173.DOI
  2. [2]G. Birkhoff, Lattice Theory, 3rd ed., American Mathematical Society Colloquium Publications, vol. 25, American Mathematical Society, Providence, RI, 1967.
  3. [3]D. P. Blecher and A. Goswami, M-ideals: from Banach spaces to rings, J. Pure Appl. Algebra 230 (2026), 108389.DOI
  4. [4]T. C. Burness, M. Garonzi, and A. Lucchini, Finite groups, minimal bases and the intersection number, Trans. London Math. Soc. 9 (2022), no. 1, 20–55.arxiv.org/abs/2009.10137
  5. [5]S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, Graduate Texts in Mathematics, vol. 78, Springer-Verlag, New York, 1981.
  6. [6]E. Caviglia, A. Goswami, and L. Mesiti, μ-elements: an extension of essential elements, Algebra Universalis 87 (2026), Article 8.DOI
  7. [7]F. Dalla Volta and A. Lucchini, Minimal number of generators and composition length of socle in finite groups, Q. J. Math. 47 (1996), 157–163.DOI
  8. [8]F. Dalla Volta and A. Lucchini, Finite groups that need more generators than any proper quotient, J. Aust. Math. Soc. Ser. A 64 (1998), 82–91.DOI
  9. [9]B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, 2nd ed., Cambridge University Press, Cambridge, 2002.DOI
  10. [10]E. Detomi and A. Lucchini, Crowns and factorization of the probabilistic zeta function of a finite group, J. Algebra 265 (2003), no. 2, 651–668.DOI
  11. [11]J. D. Dixon and B. Mortimer, Permutation Groups, Graduate Texts in Mathematics, vol. 163, Springer-Verlag, New York, 1996.
  12. [12]W. Gäschütz, Praefrattinigruppen, Arch. Math. (Basel) 13 (1962), 418–426.DOI
  13. [13]P. Grzeszczuk and E. R. Puczyłowski, On Goldie and dual Goldie dimensions, J. Pure Appl. Algebra 31 (1984), no. 1–3, 47–54.DOI
  14. [14]P. Harmand, D. Werner, and W. Werner, M-ideals in Banach Spaces and Banach Algebras, Lecture Notes in Mathematics, vol. 1547, Springer-Verlag, Berlin, 1993.DOI
  15. [15]I. M. Isaacs, Finite Group Theory, Graduate Studies in Mathematics, vol. 92, American Mathematical Society, Providence, RI, 2008.DOI
  16. [16]I. M. Isaacs, Algebra: a graduate course, reprint of the 1994 original, Graduate Studies in Mathematics, vol. 100, Amer. Math. Soc., Providence, RI, 2009.
  17. [17]S. Koner and B. Mitra, Essential subgroups and essential extensions, J. Algebra Appl. (2026), published online.arxiv.org/abs/2407.19309
  18. [18]A. Lucchini, M. Moscatiello, and P. Spiga, A polynomial bound for the number of maximal systems of imprimitivity of a finite transitive permutation group, Forum Math. 32 (2020), no. 3, 713–721.arxiv.org/abs/1907.08477
  19. [19]A. Lucchini, Prefrattini subgroups and crowns, Arch. Math. (Basel) 121 (2023), 469–483.DOI
  20. [20]D. J. S. Robinson, A Course in the Theory of Groups, 2nd ed., Graduate Texts in Mathematics, vol. 80, Springer-Verlag, New York, 1996.

Paper details

vlnc:W_gv6qfq5u
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents