Skip to Content
MathematicsMathematics
  • Article
  • Open Access

28 October 2026

17 Pages

The Category of Formations of Finite Groups and Topology

and
Department of Mathematics, Physics and Data Science, Universidad del Norte, Km 5 via a Puerto Colombia, Barranquilla 081007, Colombia
*
Author to whom correspondence should be addressed.
This article belongs to the Section A: Algebra and Logic

Abstract

We study classes of finite groups and their closure operators from a categorical and topological point of view. We show that the Gaschütz product, which is associative and unital on formations, is a bifunctor on the category of subgroup-closed formations, making the latter a monoidal category, and that the closure operators on the universe of finite groups form a complete lattice CL whose joins can be described through closed classes. We then use the correspondences of Kuratowski and Alexandrov between additive closure operators and topologies. The operators s , s n and Q induce pairwise distinct Alexandrov topologies which are all contractible, because the trivial group is a least element of each of the associated preorders; by contrast, E Φ and E p induce disconnected spaces with contractible components. Finally, neither the formation operator Q ∨ R 0 nor the Fitting class operator s n ∨ N 0 is finitely additive, so neither of them is the closure operator of a topology on the universe of finite groups; in both cases, the obstruction comes from the synthesis operator, R 0 , respectively, N 0 .

1. Introduction

The theory of formations provides a natural framework for analyzing classes of finite groups, especially in studying soluble groups. Formations capture closure under quotients and subdirect products, and their local definitions connect to deep structural results such as the Gaschütz-Lubeseder-Schmid theorem. Many of these constructions exhibit a functorial or structural character, suggesting that categorical methods can offer a deeper understanding of their behavior (see the classical references [1,2,3,4]).
Closure operators such as s (subgroups), Q (quotients), s n (subnormal subgroups), R 0 (subdirect products) and N 0 (joins of subnormal subgroups) are the basic tools for generating and comparing such classes: formations are the classes closed under Q and R 0 , and Fitting classes those closed under s n and N 0 . The question addressed in this paper is which of these operators are closure operators of a topology on the universe S of isomorphism types of finite groups and what the resulting spaces look like. By Kuratowski’s theorem, this happens exactly when the operator is finitely additive; if it is additive on arbitrary families, the topology is of Alexandrov type and is determined by a preorder on S (Theorem 1).
Our results are as follows. In Section 3, we show that the Gaschütz product, which is associative and unital on all formations, is a bifunctor on the category FOR s of subgroup-closed formations, which is therefore a monoidal category (Theorem 2). In Section 4, we prove that closure operators form a complete lattice CL and describe its joins through closed classes (Propositions 2 and 3); this allows us to treat the formation operator Q ∨ R 0 and the Fitting class operator s n ∨ N 0 uniformly. In Section 5, we show that s , s n and Q induce pairwise distinct Alexandrov topologies on S which are all contractible, the reason being that the trivial group is a least element of each of the associated preorders (Lemma 4 and Theorem 3); by contrast, E Φ and E p give disconnected spaces (Proposition 6). Finally, neither Q ∨ R 0 nor s n ∨ N 0 is finitely additive, so neither of them is the closure operator of a topology on S (Proposition 7 and Corollary 1); in both cases, the obstruction comes from the synthesis operator, R 0 , respectively, N 0 .

2. Preliminaries

In this section, we collect the main notions from category theory, classes of groups, formations and closure operators that will be used throughout this paper. Standard definitions (categories, functors, natural transformations) are omitted or only briefly recalled, as the intended readership is already familiar with them. Instead, we emphasize the specific categorical and algebraic concepts that are central to our framework.
Categories. A posetal category is a category in which every hom-set contains at most one morphism. Such a structure corresponds to a preordered set, where X ≤ Y if a morphism X → Y exists. In our context, where objects are isomorphism classes of groups, this preorder is in fact a partial order. The existence of morphisms in both directions, X → Y and Y → X , implies X ⊆ Y and Y ⊆ X , which in turn implies X = Y . This satisfies anti-symmetry, ensuring the underlying structure is a poset. Limits in a posetal category correspond to infima, and colimits to suprema.
A monoidal category ( C , ⊗ , I ) is a category C equipped with a bifunctor ⊗ : C × C → C , a distinguished object I and natural isomorphisms (associator, left and right unitors) satisfying the standard coherence conditions. We will apply these structures in Section 3 when studying the category of formations.
Classes of groups. A class of groups X is a collection of groups closed under isomorphism. In line with standard conventions in the theory of formations, we will assume throughout this paper that any non-empty class of groups contains the trivial group { 1 } . Examples include:
(1)
A : the class of all abelian groups.
(2)
S : the class of all soluble groups.
(3)
U : the class of all supersoluble groups.
(4)
E : the class of all finite groups.
(5)
G : the class of all groups.
Notation for small classes. In accordance with this convention, for groups G 1 , … , G k , we write { 1 , G 1 , … , G k } for the class of all groups isomorphic to 1 or to some G i . Such classes (for instance, { 1 , C p } ) are used below only as test objects for closure operators; they are classes in the above sense but in general not formations (e.g., { 1 , C p } is Q -closed but not R 0 -closed, since C p × C p ∉ { 1 , C p } ).
Remark 1.
Although G is included above for motivational purposes, it is a proper class, not a set, and most of the machinery we invoke below (in particular the theory of the X -residual, Lemma 1 and the Gaschütz–Lubeseder–Schmid theorem) is developed in [1] exclusively for finite groups. To keep the categorical and topological constructions on firm set-theoretic footing, we fix, for the remainder of this paper, S = E as the ambient universe unless explicitly stated otherwise. All categories ( CG , FOR , CL ), closure operators, and topological spaces considered below are understood relative to E . We retain G only as an informal point of reference in the introduction and conclusion. Since classes are closed under isomorphism, a class of finite groups is determined by the set of isomorphism types it contains. We therefore identify, throughout, the universe S with the countable set of isomorphism types of finite groups, classes of finite groups with subsets of S and closure operators (defined below) with maps P ( S ) → P ( S ) . For the topological statements (Theorem 1 and Section 5), closure operators must be defined on all subsets of S , including those not containing 1 (e.g., singletons { H } ); all operators listed below are given by formulas that make sense, and define closure operators, on arbitrary subsets, and the convention 1 ∈ X is only needed where residuals are involved (Section 3).
Closure operations. A map C : P ( G ) → P ( G ) that sends a class of groups X to a class of groups C X is an operation if it satisfies:
(1)
C ∅ = ∅ .
(2)
X ⊆ C X (extensivity).
(3)
If X ⊆ Y , then C X ⊆ C Y (monotonicity).
  • An operation C is a closure operator if it is also:
(4)
C ( C X ) = C X for all classes X (idempotency).
  • A class X is C -closed if C X = X . Closure operators are classical tools in both topology and algebra. Their study from a categorical point of view goes back to works such as [5,6], and more recent developments include closure operators in posetal categories [7].
Standard closure operators in group theory include:
Id X = X s X = ( G ∣ G is isomorphic to a subgroup of some H ∈ X ) Q X = ( G ∣ ∃ H ∈ X and ∃ φ : H ⟶ G an epimorphism ) R 0 X = ( G ∣ ∃ N 1 , … , N r ⊴ G with G / N j ∈ X and ⋂ j = 1 r N j = 1 ) N 0 X = ( G ∣ ∃ K 1 , … , K r ⊴ ⊴ G with K i ∈ X and G = ⟨ K 1 , … , K r ⟩ ) s n X = ( G ∣ G is isomorphic to a subnormal subgroup of some K ∈ X ) E Φ X = ( G ∣ ∃ N ⊴ G with N ≤ Φ ( G ) and G / N ∈ X ) D 0 X = ( G ∣ G = ∏ j = 1 r H j ( direct   product )   with   each H j ∈ X ) E p X = ( G ∣ ∃ K ⊴ G with K ≤ O p ( G ) such   that G / K ∈ X ) .
In words: s X , Q X and s n X consist of the subgroups, the epimorphic images and the subnormal subgroups of X -groups, respectively. R 0 X is the class of finite subdirect products of X -groups: since ⋂ j N j = 1 , the natural homomorphism G → ∏ j G / N j is injective, and its image projects onto each factor G / N j ∈ X . D 0 X is the class of finite direct products of X -groups. N 0 X is the class of groups generated by finitely many subnormal X -subgroups; when the K i are normal in G, the subgroup they generate is the normal product K 1 K 2 … K r , and this is the only situation that occurs in our counterexamples. E Φ X is the class of Frattini extensions of X -groups, i.e., groups having a quotient in X by a normal subgroup contained in the Frattini subgroup. Finally, since a normal subgroup K of G satisfies K ≤ O p ( G ) if and only if K is a p-group, E p X is the class of p-group-by- X groups, i.e., extensions of a normal p-subgroup by an X -group.
All these operators are closure operators. For s , Q , s n , R 0 , D 0 , N 0 and E Φ see Chapter II, Section 1 in [1]. For E Φ and E p , extensivity and monotonicity are clear (take N = 1 , resp. K = 1 ). For idempotency of E Φ , recall that if N ⊴ G and N ≤ Φ ( G ) , then Φ ( G / N ) = Φ ( G ) / N , because every maximal subgroup of G contains N and the maximal subgroups of G / N are exactly the M / N with M maximal in G; hence, if G / N ∈ E Φ X via M / N ≤ Φ ( G / N ) , then M ≤ Φ ( G ) and G / M ∈ X , so G ∈ E Φ X . For E p , if K is a normal p-subgroup of G and L / K is a normal p-subgroup of G / K with G / L ∈ X , then L ⊴ G and | L | = | K | | L / K | is a power of p, so G ∈ E p X .
For example, if X = { 1 , C 2 } , then:
(1)
s X contains all subgroups of C 2 , namely C 2 and 1.
(2)
Q X contains all quotients of C 2 , again C 2 and 1.
(3)
s n X = s X , since all subgroups of C 2 are normal.
Formations of groups. A non-empty class F of finite groups is called a formation:
(1)
If G ∈ F and N ⊴ G , then G / N ∈ F ( F is Q -closed or it is closed under quotients).
(2)
If N 1 , N 2 ⊴ G with N 1 ∩ N 2 = 1 and G / N i ∈ F for i = 1 , 2 , then G ∈ F ( F is R 0 -closed or it is closed under subdirect products).
Typical examples are abelian, nilpotent and soluble groups, as well as p-groups or soluble groups of restricted derived length.
A formation F is locally defined if there exists a function assigning to each prime p a formation f ( p ) such that G ∈ F iff for every chief factor H / K of G which is a p-group, one has G / C G ( H / K ) ∈ f ( p ) . The Gaschütz–Lubeseder–Schmid theorem asserts that a formation is saturated, that is, if G / Φ ( G ) ∈ F , then G ∈ F if and only if it is locally defined. See Chapter IV in [1].
Fitting classes. A class F of finite groups is a Fitting class if it is s n -closed and N 0 -closed; equivalently, F is closed under normal subgroups and under products of normal F -subgroups (Chapter IX in [1]). Typical examples are the classes of nilpotent groups, of p-groups and of soluble groups.
Additivity, Kuratowski and Alexandrov topologies. Recall from Remark 1 that classes are identified with subsets of S , so a closure operator is a map P ( S ) → P ( S ) .
Definition 1.
A closure operator C is finitely additive if C ( X ∪ Y ) = C X ∪ C Y for all classes X , Y , and completely additive if
C ⋃ i ∈ I X i = ⋃ i ∈ I C ( X i )
for every family { X i } i ∈ I of classes, I an arbitrary index set. Completely additive operators are finitely additive. Unless stated otherwise, additive means completely additive.
Remark 2.
For any closure operator C , any family { X i } i ∈ I and each j ∈ I , the inclusion X j ⊆ ⋃ i X i gives C ( X j ) ⊆ C ( ⋃ i X i ) by monotonicity; hence ⋃ i C ( X i ) ⊆ C ( ⋃ i X i ) always holds, and (finite or complete) additivity amounts to the reverse inclusion. In Section 5, every positive result is a statement of complete additivity, and every negative result is a failure of finite additivity, so the distinction between the two notions never leaves a gap in our conclusions.
The link with topology is given by the following classical facts, see [8] for part (1) and [9,10] for part (2).
Theorem 1
(Kuratowski; Alexandrov). Let T be a set.
(1) 
The assignment τ ↦ cl τ is a bijection between topologies on T and finitely additive closure operators on P ( T ) (maps satisfying C ∅ = ∅ , extensivity, idempotency and finite additivity). The closed sets of τ are exactly the cl τ -closed sets.
(2) 
Under this bijection, τ is an Alexandrov topology (arbitrary intersections of open sets are open, equivalently arbitrary unions of closed sets are closed) if and only if cl τ is completely additive. In this case, defining the specialization preorder by x ⪯ y if and only if x ∈ cl τ { y } , one has
cl τ ( X ) = { x ∈ T ∣ x ⪯ y for some y ∈ X } ,
the closed sets are the down-sets and the open sets are the up-sets of ⪯; conversely, every preorder on T arises in this way from exactly one Alexandrov topology.
In particular, a closure operator that is not finitely additive is not the closure operator of any topology on S , while a finitely additive one determines a topology that need not be of Alexandrov type. We return to these notions in Section 5, where the operators s , Q and s n play a central role.

3. The Category of Group Classes and the Gaschütz Product on Formations

In this section, we establish the categorical framework that underpins our topological analysis. By formalizing the universe of group classes as a category, CG , we gain access to the precise language of limits, colimits and universal properties, which will be essential for interpreting our results. We then focus on the subcategory of formations, FOR , and demonstrate that it possesses a rich algebraic structure via the Gaschütz product ∘: associative and unital at the level of objects on all of FOR (Proposition 1 and Remark 4) and genuinely monoidal—with ∘ acting as a bifunctor—on the subcategory FOR s of subgroup-closed formations (Theorem 2). We make this distinction precise below.
Definition 2.
The category of group classes, denoted CG , is the posetal category whose objects are all classes of groups X and where a unique morphism X → Y exists if and only if X ⊆ Y .
  • The categorical structure of CG directly reflects the well-known properties of the underlying complete lattice of group classes. We summarize them here as they form the foundational setting for our analysis.
Remark 3.
As a posetal category whose order is given by class inclusion, CG is both complete and cocomplete. Arbitrary intersections serve as limits (infima) and arbitrary unions serve as colimits (suprema). The class E of all finite groups (the whole universe S , see Remark 1) is the terminal object. Following the convention established in Section 2, the trivial class { 1 } is the initial object among non-empty classes. Finally, when equipped with intersection as its product, CG becomes a cartesian monoidal category with unit object E .
In addition to intersection, one may also define a product of classes, motivated by extension theory.
Definition 3.
Let X and Y be classes of groups, we define a product as follows:
X Y = { G ∈ G ∣ ∃ N ⊴ G with N ∈ X and G / N ∈ Y } .
Groups in X Y are called X -by- Y groups. For example, if X is the class of abelian groups and Y the class of nilpotent groups, then X Y consists of the abelian-by-nilpotent groups, that is, groups having an abelian normal subgroup with nilpotent quotient.
The product X Y is natural, but it is poorly suited to our purposes for two reasons.
(a) It is not associative. One always has X ( Y Z ) ⊆ ( X Y ) Z : if N ⊴ G with N ∈ X , and M / N ⊴ G / N with M / N ∈ Y and G / M ∈ Z , then M ⊴ G , M ∈ X Y and G / M ∈ Z . The reverse inclusion fails in general, because an X -subgroup that is normal in M need not be normal in G. For instance, let X = Y = { 1 , C 2 } and Z = { 1 , C 3 } . The Klein four-group V 4 ⊴ A 4 lies in X Y and A 4 / V 4 ≅ C 3 ∈ Z , so A 4 ∈ ( X Y ) Z . On the other hand, the normal subgroups of A 4 are 1, V 4 and A 4 , so the only normal subgroup of A 4 in X is 1, and A 4 ∉ Y Z since A 4 has no normal subgroup of order at most 2 with quotient of order at most 3. Hence, A 4 ∉ X ( Y Z ) . Associativity does hold under additional closure conditions, e.g., if X is N 0 -closed and Y is Q -closed, see, for example, Chapter II, Lemma 1.10 in [1].
(b) It does not interact well with residuals. For formations X and Y , the class X Y is Q -closed but need not be R 0 -closed, i.e., need not be a formation (Chapter IV, Section 1 in [1]), and there is no general formula for the X Y -residual of a group in terms of the X - and Y -residuals.
The Gaschütz product ∘ introduced below repairs both defects: X ∘ F is a formation whenever X and F are, it satisfies the residual formula G X ∘ F = ( G F ) X , from which associativity follows, and it coincides with X F whenever X is s n -closed (Proposition 1); for example, N ∘ N = N N (Example 1).
The category FOR of formations. We now restrict attention to formations of finite groups.
Definition 4.
The category FOR is the full subcategory of CG whose objects are formations.
The simple product X Y does not, in general, preserve the property of being a formation. W. Gaschütz introduced a modified product that does.
Lemma 1.
Let X be an R 0 -closed class and G a finite group. Then, the set
S = { N ⊴ G ∣ G / N ∈ X } ,
partially ordered by inclusion, has a unique minimal element, denoted by G X and called the X -residual of G. It is a characteristic subgroup of G, and if X is a formation and ε : G ↠ ε ( G ) is an epimorphism, then ε ( G ) X = ε ( G X ) .
Proof. 
(Chapter II, Lemma 2.4 in [1]). □
Definition 5.
Let X be a class of groups and F a formation. The Gaschütz product of X with F is denoted and defined by
X ∘ F = { H ∈ E ∣ H F ∈ X } .
Proposition 1.
Let X be a class of groups and let F and H be formations. Then:
(1) 
X ∘ F ⊆ X F ; if X ≠ ∅ , then F ⊆ X ∘ F ; and if X is s n -closed, then X ∘ F = X F .
(2) 
If X is a formation, then X ∘ F is a formation.
(3) 
If X is a formation, then G X ∘ F = ( G F ) X for every G ∈ E .
(4) 
( X ∘ H ) ∘ F = X ∘ ( H ∘ F ) .
(5) 
{ 1 } ∘ F = F and X ∘ { 1 } = X .
In particular, ∘ is an associative operation on formations with two-sided unit { 1 } .
Proof. 
These facts are known, cf. Chapter IV, Section 1 in [1], in particular Theorem 1.8; we include short proofs in order to make the hypotheses explicit. Throughout, we use Lemma 1.
(1) If H ∈ X ∘ F , then H F ⊴ H , H F ∈ X and H / H F ∈ F , so H ∈ X F . If H ∈ F , then H F = 1 ∈ X (recall that non-empty classes contain 1). Finally, let X be s n -closed and H ∈ X F , say N ⊴ H , N ∈ X , H / N ∈ F . Then, H F ≤ N by minimality of the residual, and H F ⊴ N because H F ⊴ H ; hence H F ∈ s n X = X .
(2) Let H ∈ X ∘ F and N ⊴ H . Then, ( H / N ) F = H F N / N ≅ H F / ( H F ∩ N ) ∈ Q X = X , so X ∘ F is Q -closed. Now, let N 1 , N 2 ⊴ H with N 1 ∩ N 2 = 1 and H / N i ∈ X ∘ F . As before, H F / ( H F ∩ N i ) ≅ ( H / N i ) F ∈ X for i = 1 , 2 , and ( H F ∩ N 1 ) ∩ ( H F ∩ N 2 ) = 1 ; since X is R 0 -closed, H F ∈ X .
(3) Put R = ( G F ) X , which is characteristic in G F ⊴ G , hence normal in G. Since R ≤ G F , we have ( G / R ) F = G F / R ∈ X , so G / R ∈ X ∘ F and G X ∘ F ≤ R (the residual exists by (2)). Conversely, put N = G X ∘ F . Then, ( G / N ) F = G F N / N ≅ G F / ( G F ∩ N ) ∈ X , so R ≤ G F ∩ N ≤ N .
(4) Note that H ∘ F is a formation by (2). For every H ∈ E , using (3) for the formation H ,
H ∈ ( X ∘ H ) ∘ F ⇔ H F ∈ X ∘ H ⇔ ( H F ) H ∈ X ⇔ H H ∘ F ∈ X ⇔ H ∈ X ∘ ( H ∘ F ) .
(5) H F = 1 if and only if H ∈ F , and H { 1 } = H . □
Remark 4.
By Proposition 1(2),(4),(5), the formations form a monoid under ∘ with unit { 1 } . This is a statement about objects only. A monoidal structure on the (posetal) category FOR requires in addition that ∘ be a bifunctor, which in a posetal category means that ∘ is monotone in each variable; once this holds, the associator and unitors are identities and all coherence diagrams commute trivially. Monotonicity in the first variable holds on all of FOR (if X 1 ⊆ X 2 then clearly X 1 ∘ F ⊆ X 2 ∘ F ). In the second variable, F 1 ⊆ F 2 only gives H F 2 ≤ H F 1 , and passing from H F 1 ∈ X to H F 2 ∈ X requires X to be closed under (normal) subgroups. This is the new categorical content of Theorem 2 below: on subgroup-closed formations, ∘ is a genuine bifunctor and FOR s is closed under it.
Definition 6.
Let FOR s denote the full subcategory of FOR whose objects are formations F that are s -closed, i.e., closed under arbitrary subgroups.
Theorem 2.
( FOR s , ∘ , { 1 } ) is a monoidal category: it is a full subcategory of FOR , closed under ∘, on which the Gaschütz product ∘ is a genuine bifunctor.
Proof. 
Let X , F , F 1 , F 2 ∈ FOR s . Then:
  • (1) Monotonicity in the first variable. If X 1 ⊆ X 2 , then, for any group H, H F ∈ X 1 ⊆ X 2 , so X 1 ∘ F ⊆ X 2 ∘ F .
  • (2) Monotonicity in the second variable. Suppose F 1 ⊆ F 2 and H ∈ X ∘ F 1 , i.e., H F 1 ∈ X . Since F 1 ⊆ F 2 , the residuals satisfy H F 2 ⊆ H F 1 . As X is s -closed and H F 2 is a subgroup of H F 1 ∈ X , we get H F 2 ∈ X , that is, H ∈ X ∘ F 2 . Hence, X ∘ F 1 ⊆ X ∘ F 2 .
  • (3) Closure of FOR s under ∘. Let H ∈ X ∘ F and let K ≤ H be an arbitrary subgroup. Since H / H F ∈ F and F is s -closed, it follows
    K / ( K ∩ H F ) ≅ K H F / H F ≤ H / H F ∈ F .
    Then, K / ( K ∩ H F ) ∈ F . We have then K ∩ H F ⊴ K with quotient in F , so by minimality of the residual,
    K F ≤ K ∩ H F ≤ H F .
    Since X is s -closed and H F ∈ X , it follows that K F ∈ X , that is, K ∈ X ∘ F . Hence, X ∘ F is s -closed, so X ∘ F ∈ FOR s .
  • (4) Associativity and the unit laws hold by Proposition 1(4), (5) and { 1 } ∈ FOR s . Since FOR s is posetal, the associator and unitors are identities and all coherence diagrams commute trivially, so ( FOR s , ∘ , { 1 } ) is a (strict) monoidal category. □
Example 1.
The formation N of nilpotent groups is s -closed, so N ∈ FOR s . By Proposition 1(1), N ∘ N = N N = : N 2 is the class of groups G having a nilpotent normal subgroup with nilpotent quotient; since such a subgroup lies in the Fitting subgroup F ( G ) , this is the class of groups with G / F ( G ) nilpotent, i.e., of Fitting length at most 2. By Theorem 2, N 2 ∈ FOR s ; in particular N 2 is subgroup-closed.
Let us verify the computations for S 4 and A 4 . The normal subgroups of S 4 are 1, V 4 , A 4 and S 4 , with quotients S 4 , S 3 , C 2 and 1; only the last two are nilpotent, so S 4 N = A 4 . Since A 4 is not nilpotent (its Sylow 3-subgroups are not normal), S 4 ∉ N 2 ; indeed F ( S 4 ) = V 4 , F ( S 4 / V 4 ) = F ( S 3 ) ≅ C 3 , and S 4 has Fitting length 3. On the other hand, the normal subgroups of A 4 are 1, V 4 and A 4 , and A 4 / V 4 ≅ C 3 is nilpotent whereas A 4 is not, so A 4 N = V 4 ∈ N and A 4 ∈ N 2 .
This illustrates both parts of Theorem 2. Subgroup-closure of N 2 (part (3)) shows that no group containing a subgroup isomorphic to S 4 belongs to N 2 . Monotonicity in the second variable (part (2)) applied to A ⊆ N gives N ∘ A ⊆ N ∘ N ; accordingly, S 4 ∉ N ∘ A , since S 4 A = S 4 ′ = A 4 ∉ N , whereas A 4 ∈ N ∘ A , since A 4 ′ = V 4 ∈ N .
As a further example, since A is s -closed, A ∘ N = A N is the formation of abelian-by-nilpotent groups, and it belongs to FOR s by Theorem 2. Viewing FOR s as a monoidal category opens the possibility of importing categorical techniques, such as internal hom-objects or monoidal functors, into the theory of formations; we return to this in Section 6.
This concludes our formalization of the universe of group classes. However, to analyze these classes, we must understand the tools that act upon them. In the following section, we shift our perspective from the objects to the operations themselves. We will formalize the collection of closure operators as a category, CL , and establish its structure as a complete lattice. This is not merely a categorical exercise; it provides the essential machinery, namely, the well-definedness of the join operation, that will be crucial for constructing and comparing the operators for Formations and Fitting classes in our subsequent topological analysis.

4. A Categorical Perspective on Closure Operators

At this point, we move from studying individual closure operators to examining them collectively as a category. By treating them as objects of a category, we can apply categorical reasoning to study their algebraic structure, relationships and universal properties.
The category CL of closure operators. Fix the universe S = E , see Remark 1.
Definition 7.
The category of closure operators, denoted CL , is defined as follows:
(1) 
Objects: closure operators C : P ( S ) → P ( S ) .
(2) 
Morphisms: for C 1 , C 2 ∈ Obj ( CL ) , there exists a unique morphism C 1 → C 2 if and only if C 1 ( X ) ⊆ C 2 ( X ) for all classes X ⊆ S . We denote this by C 1 ⪯ C 2 .
Thus, CL is a posetal category, and its morphisms reflect the relative strength of closure operators.
Proposition 2.
The category CL forms a complete lattice:
(1) 
The identity operator Id is the least element.
(2) 
The constant operator C ⊤ (which maps ∅ ↦ ∅ and any non-empty class to S) is the greatest element.
(3) 
Arbitrary meets of closure operators exist. For a non-empty family { C i } i ∈ I they are computed pointwise:
⋀ i ∈ I C i ( X ) : = ⋂ i ∈ I C i ( X ) .
The meet of the empty family is, by definition, the greatest element C ⊤ . (The pointwise formula cannot be used for I = ∅ : it would send every class, including ∅, to S , which violates the condition C ∅ = ∅ .) Arbitrary joins also exist but are not in general computed as the pointwise union. Defining U ( X ) : = ⋃ i ∈ I C i ( X ) , the operation U satisfies extensivity and monotonicity but need not be idempotent. The join ⋁ i ∈ I C i is instead the smallest closure operator dominating U:
⋁ i ∈ I C i : = ⋀ D ∈ CL ∣ D ≥ C i for all i ∈ I ,
whose existence follows from the pointwise meet construction above, applied to the (non-empty, since C ⊤ is an upper bound) set of closure operators dominating every C i .
Proof. 
For any closure operator C , extensivity implies Id ( X ) ⊆ C ( X ) and therefore Id ≤ C for any operator C . Consequently, the identity operator Id is the least element of the lattice.
The codomain of C is a subset of group classes in S . This implies that C ( X ) ⊆ C ⊤ ( X ) for all non-empty classes X . The condition also holds for ∅. Thus, C ≤ C ⊤ for any operator C . Consequently, the constant operator C ⊤ is the greatest element of the lattice.
Let { C i } be a non-empty family of closure operators (for the empty family, the meet is C ⊤ by definition). We define their meet C meet , pointwise as C meet ( X ) = ⋂ C i ( X ) . We must verify that C meet is a closure operator:
(1)
Extensivity: X ⊆ C i ( X ) for all i, so X ⊆ ⋂ C i ( X ) = C meet ( X ) .
(2)
Monotonicity: If X ⊆ Y , then C i ( X ) ⊆ C i ( Y ) for all i. Therefore, ⋂ C i ( X ) ⊆ ⋂ C i ( Y ) , which implies C meet ( X ) ⊆ C meet ( Y ) .
(3)
Idempotency: C meet ( C meet ( X ) ) = ⋂ i C i ( ⋂ j C j ( X ) ) . Since ⋂ j C j ( X ) ⊆ C i ( X ) for all i, by monotonicity, C i ( ⋂ j C j ( X ) ) ⊆ C i ( C i ( X ) ) = C i ( X ) . Therefore, ⋂ i C i ( ⋂ j C j ( X ) ) ⊆ ⋂ i C i ( X ) = C meet ( X ) . The reverse inclusion follows from extensivity. Thus, C meet is idempotent.
The join, C join = ⋁ i C i , is defined as in the statement: the meet of the set D = { D ∈ CL : D ≥ C i ∀ i } of upper bounds of { C i } . This set is non-empty (it contains C ⊤ ), so by the pointwise-meet part of this proposition, C join = ⋀ D is a well-defined closure operator. By construction C i ≤ C join for all i, and C join is the smallest such operator, since any D ∈ D satisfies C join ≤ D . Note that C join need not equal the pointwise union U defined above: U itself may fail to be idempotent, so U ≤ C join can be strict.
Since CL has a least element and a greatest element and admits all arbitrary meets and joins, it forms a complete lattice. □
The following description of joins is what makes the classical constructions of formations and Fitting classes precise inside CL .
Proposition 3.
Let { C i } i ∈ I be a non-empty family of closure operators and C = ⋁ i ∈ I C i . Then:
(1) 
a class Y is C -closed if and only if it is C i -closed for every i ∈ I ;
(2) 
for every class X ,
C X = ⋂ { Y ∣ X ⊆ Y and C i Y = Y for all i ∈ I } ;
(3) 
consequently, if P is a class with X ⊆ P and C i P = P for all i ∈ I , then C X ⊆ P .
Proof. 
Let Y be the family of classes that are C i -closed for every i. It contains ∅ and S , and it is closed under arbitrary intersections: if Y k ∈ Y for all k, then C i ( ⋂ k Y k ) ⊆ ⋂ k C i Y k = ⋂ k Y k by monotonicity, and the reverse inclusion is extensivity. Define D X = ⋂ { Y ∈ Y ∣ X ⊆ Y } . Then, D ∅ = ∅ , D is extensive and monotone, and D X ∈ Y , whence D D X = D X ; so D ∈ CL . For Y ∈ Y with X ⊆ Y , we have C i X ⊆ C i Y = Y , hence C i ⪯ D for all i. If E ∈ CL satisfies C i ⪯ E for all i, then C i ( E X ) ⊆ E E X = E X , so E X ∈ Y contains X and D X ⊆ E X . Thus, D is the least upper bound of the C i , i.e., D = C , which proves (2). If Y ∈ Y , then C Y = D Y = Y ; conversely, if C Y = Y then C i Y ⊆ C Y = Y for all i. This proves (1), and (3) follows from (2). □
Remark 5.
We write v : = Q ∨ R 0 and Fit : = s n ∨ N 0 (joins in CL ). By Proposition 3, a non-empty class is v -closed if and only if it is a formation, and v X is the formation generated by X , i.e., the smallest formation containing X ; likewise, the non-empty Fit -closed classes are exactly the Fitting classes, and Fit X is the Fitting class generated by X . Note that these joins are not computed as pointwise unions such as Q X ∪ R 0 X , which are in general not idempotent. Proposition 3(3) is the preservation principle we shall use in Section 5: to show that v X or Fit X is contained in a class P , it suffices to check that P contains X and is closed under each constituent operator.
The categorical treatment of closure operators is well developed, see, for instance, [11,12], where closure spaces and dual operators are studied in broad generality. Our approach adapts these ideas to the setting of group classes.
On composition of closure operators. Given two closure operators C 1 , C 2 , their functional composition C 2 ∘ C 1 need not be idempotent and thus may fail to be a closure operator. Some composites are closure operators. For instance, s Q ⪯ Q s , since a subgroup K / N of a quotient H / N is a quotient of the subgroup K; consequently, Q s Q s ⪯ Q Q s s = Q s , so Q s , the operator of taking sections, is idempotent (a section of a section is a section) and is a closure operator. Others are not. Consider D 0 s and X = { 1 , S 3 } . Then, D 0 s X is the class of direct products of copies of C 2 , C 3 and S 3 , and it contains S 3 × S 3 . The subgroup D = { ( a , b ) ∈ S 3 × S 3 ∣ sgn a = sgn b } has order 18 and trivial centre: an element of Z ( D ) commutes with ( σ , 1 ) and ( 1 , σ ) , where σ is a 3-cycle, so both its coordinates lie in A 3 , and it commutes with ( τ , τ ) , τ a transposition, so both coordinates are trivial. The only groups of order 18 in D 0 s X are C 2 × C 3 × C 3 and S 3 × C 3 , both with non-trivial centre. Hence, D ∈ s D 0 s X ⊆ ( D 0 s ) 2 X but D ∉ D 0 s X . So D 0 s is not idempotent, and it is not a closure operator. Since D ∈ s D 0 X , the same example shows D 0 s ≠ s D 0 .
In practice, group theorists often consider the closure generated by a family of operations, i.e., the smallest closure operator containing all of them.
This approach overcomes the limitations of composition and still allows one to combine closure properties effectively. (e.g., formations are defined as classes closed under Q and R 0 ).
Figure 1 displays some inclusions between closure operations and their composites, ordered pointwise by ⪯ as in CL ; the relations shown are classical and follow from (Chapter II, Lemmas 1.17 and 1.18 in [1]). Composites of closure operators are operations in the sense above but need not be idempotent (for instance, D 0 s is not, whereas Q s is; see the preceding paragraph), so the diagram lives in the poset of operations, of which CL is a subposet; this is precisely why joins, rather than composites, are used to combine operators. The figure is included for orientation. Of the relations it displays, only the following are used later: Id ⪯ C for every C (Proposition 2), s n ⪯ s (comparison of topologies in Section 5) and the position of Q , R 0 , s n and N 0 as the constituents of v and Fit (Section 5.2). The remaining relations, e.g., R 0 Q ⪯ Q R 0 , D 0 s ⪯ s D 0 and Q E Φ ⪯ E Φ Q , illustrate that composites of closure operators can be comparable without being equal (for D 0 s ≺ s D 0 , this is shown in the preceding paragraph), the “local algebraic friction” discussed in Section 5.1.
Figure 1. Hasse diagram of some inclusions among closure operations and their composites, ordered pointwise by ⪯ (see Chapter II, Lemmas 1.17 and 1.18 in [1]).
Adjunctions arising from closure operators. A closure operator naturally determines a reflection of the category of group classes into the subcategory of closed classes. This categorical perspective clarifies its universal property.
Proposition 4.
Let C be a closure operator on S . Define the functor
A C : CG ⟶ CCG , X ↦ C X ,
where CCG denotes the full subcategory of CG consisting of C -closed classes. Then, A C is left adjoint to the inclusion functor i : CCG ↪ CG .
Proof sketch.
For any class of groups X and any C -closed class Y , we have C ( X ) ⊆ Y if and only if X ⊆ Y . This bijective correspondence of morphisms is precisely the adjunction A C ⊣ i . □
Proposition 5.
Let C be a closure operator and CCG the full subcategory of CG consisting of the C -closed classes. Then, C is finitely additive if and only if CCG is closed under binary unions computed in CG , equivalently, if and only if the inclusion functor i : CCG ↪ CG preserves binary coproducts; and C is completely additive if and only if i preserves all coproducts. In both cases, this is a strictly stronger property than the automatic preservation of colimits by the left adjoint A C .
Proof. 
In CCG , the coproduct of a family { Y k } of C -closed classes is C ( ⋃ k Y k ) , so i preserves it if and only if ⋃ k Y k is C -closed. If C is (finitely, resp. completely) additive and the Y k are C -closed, then C ( ⋃ k Y k ) = ⋃ k C Y k = ⋃ k Y k . Conversely, suppose that CCG is closed under the corresponding unions, and let { X k } be arbitrary classes. By extensivity, ⋃ k X k ⊆ ⋃ k C X k , and the latter class is C -closed by hypothesis. By monotonicity and idempotency,
C ⋃ k X k ⊆ C ⋃ k C X k = ⋃ k C X k .
The reverse inclusion always holds (Remark 2). □
Remark 6.
Proposition 5 gives the precise categorical content behind additivity: it is not an automatic consequence of A C being a left adjoint (Proposition 4 holds for every closure operator, additive or not) but the strictly stronger, non-automatic condition that the inclusion i also preserves the corresponding colimits. Lemma 3 below verifies complete additivity for Id , s , Q , s n , E Φ , E p , while for C ∈ { R 0 , N 0 , D 0 } the same lemma yields two C -closed classes whose union is not C -closed. Note that the test classes X = { 1 , C p } and Y = { 1 , C q } used there are not themselves C -closed; the closed classes are their closures C X and C Y . Indeed, C X consists of p-groups and C Y of q-groups, so C p × C q ∉ C X ∪ C Y , whereas C p × C q ∈ C ( X ∪ Y ) ⊆ C ( C X ∪ C Y ) . Hence, C X ∪ C Y is not C -closed.
Example 2.
For the operator s , the associated adjunction says the smallest subgroup-closed class containing X is s X , and for Q , the adjunction asserts the smallest quotient-closed class containing X is Q X .
These adjunctions exemplify how closure operators act as reflections, projecting arbitrary classes into the subcategory of closed classes. From this perspective, closure operators reveal their universal role within group theory in a clear and elegant way.
Having established that the category of closure operators CL forms a complete lattice, and having clarified their universal role as reflections, we are now fully equipped for our main investigation. The completeness of CL guarantees that we can meaningfully combine operators using the join (∨), Proposition 3 describes these joins through closed classes and Proposition 5 identifies the categorical meaning of additivity. We now turn to the topological structures that these operators induce on the universe of groups.

5. Global Topological Invariance Versus Local Algebraic Difference

We now determine which of the closure operators of Section 2 are closure operators of topologies on S = E (Theorem 1), and we study the resulting spaces. We begin with a simple lemma that will provide all our counterexamples.
Lemma 2.
Let p be a prime and let S p denote the class of all finite p-groups (including 1). Then, S p is s -, Q -, s n -, D 0 -, R 0 - and N 0 -closed. In particular, S p is both a formation and a Fitting class.
Proof. 
Closure under s , s n , Q and D 0 is clear from orders. If N 1 , … , N r ⊴ G with ⋂ j N j = 1 and each G / N j a p-group, then G embeds in the p-group ∏ j G / N j , so S p is R 0 -closed. For N 0 , we first show that every subnormal p-subgroup K of a group G is contained in O p ( G ) , by induction on the length n of a chain K = K 0 ⊴ K 1 ⊴ … ⊴ K n = G . If n = 0 , then G = K is a p-group and O p ( G ) = G . If n ≥ 1 , the induction hypothesis applied to K ⊴ ⊴ K n − 1 gives K ≤ O p ( K n − 1 ) ; since O p ( K n − 1 ) is characteristic in K n − 1 ⊴ G , it is a normal p-subgroup of G, so K ≤ O p ( K n − 1 ) ≤ O p ( G ) . Now, if G = ⟨ K 1 , … , K r ⟩ with each K i a subnormal p-subgroup, then G ≤ O p ( G ) , so G is a p-group. □
Lemma 3.
The closure operators Id , s , Q , s n , E Φ and E p are completely additive. By contrast, R 0 , N 0 and D 0 are not even finitely additive.
Proof. 
Positive part. Each of the six operators has the form
C X = { G ∈ S ∣ G R H for some H ∈ X }
for a suitable relation R on S , namely: for Id , G R H if G ≅ H ; for s (resp. s n ), if G is isomorphic to a subgroup (resp. a subnormal subgroup) of H; for Q , if G is an epimorphic image of H; for E Φ , if H ≅ G / N for some N ⊴ G with N ≤ Φ ( G ) ; and for E p , if H ≅ G / K for some normal p-subgroup K of G. For any operator of the form (2) and any family { X i } i ∈ I ,
G ∈ C ⋃ i X i ⇔ ∃ i 0 ∈ I ∃ H ∈ X i 0 such that G R H ⇔ G ∈ ⋃ i C X i .
The essential point is that membership of G in C X is witnessed by a single group of X . For instance, if G ∈ E Φ ( ⋃ i X i ) , there is N ⊴ G with N ≤ Φ ( G ) and G / N ∈ ⋃ i X i ; then, G / N ∈ X i 0 for some i 0 , and the same N shows G ∈ E Φ X i 0 . The argument for E p is identical, with a normal p-subgroup K in place of N.
Negative part. Let p ≠ q be primes and consider the classes X = { 1 , C p } and Y = { 1 , C q } ; they contain the trivial group, in accordance with our convention, and no further closure property is required of them in Definition 1. Let G = C p × C q , A = C p × 1 and B = 1 × C q . Then, A , B ⊴ G , A ∩ B = 1 , G = A × B , G / A ≅ C q ∈ Y and G / B ≅ C p ∈ X . Hence:
(a)
G ∈ R 0 ( X ∪ Y ) , taking N 1 = A and N 2 = B in the definition of R 0 ;
(b)
G ∈ N 0 ( X ∪ Y ) , since A ≅ C p ∈ X and B ≅ C q ∈ Y are normal, hence subnormal, subgroups of G and G = ⟨ A , B ⟩ = A B ;
(c)
G ∈ D 0 ( X ∪ Y ) , since G = A × B .
  • On the other hand, let C ∈ { R 0 , N 0 , D 0 } . Since X ⊆ S p and S p is C -closed (Lemma 2), monotonicity gives C X ⊆ C S p = S p , and similarly C Y ⊆ S q . As | G | = p q , G is neither a p-group nor a q-group, so G ∉ C X ∪ C Y . Hence, C ( X ∪ Y ) ≠ C X ∪ C Y . □
Remark 7.
The argument above uses only that C X consists of p-groups. One has R 0 X = D 0 X = the class of elementary abelian p-groups, but N 0 X is larger in general: it consists of the p-groups generated by elements of order p, and for p = 2 it contains, for instance, the dihedral group of order 8, which is generated by two (subnormal) subgroups of order 2.
The Alexandrov topologies on the universe of groups. By Lemma 3 and Theorem 1, each completely additive operator C ∈ { s , s n , Q , E Φ , E p } determines an Alexandrov topology τ C on S , whose closed sets are the C -closed classes and whose specialization preorder is given by G ⪯ C H if and only if G ∈ C ( { H } ) , where { H } denotes the singleton subset of S (see Remark 1); equivalently, G R H for the relation R of (2). Explicitly:
(1)
for s , G ⪯ H if and only if G is isomorphic to a subgroup of H;
(2)
for s n , G ⪯ H if and only if G is isomorphic to a subnormal subgroup of H;
(3)
for Q , G ⪯ H if and only if G is an epimorphic image of H;
(4)
for E Φ , G ⪯ H if and only if G is a Frattini extension of H, i.e., H ≅ G / N with N ⊴ G , N ≤ Φ ( G ) ;
(5)
for E p , G ⪯ H if and only if H ≅ G / K for some normal p-subgroup K of G.
  • In all cases, the open sets are the up-sets of ⪯. In cases (1)–(3), the trivial group is the least element of ⪯; this is not so in cases (4) and (5), where the only group G with 1 ⪯ G or G ⪯ 1 for E Φ is G = 1 , and for E p one has G ⪯ 1 exactly when G is a p-group.
Additive closure operators naturally induce Alexandrov topologies, a connection that has found applications beyond group theory, for example, in algebraic geometry and logic [13,14].
Contractibility. The following elementary lemma isolates the property responsible for contractibility. We prove it directly, without appealing to results specific to finite spaces such as McCord’s theorem Proposition 1.2.4 in [15] or [16], since S is countably infinite.
Lemma 4.
Let T be a set with an Alexandrov topology whose specialization preorder ⪯ has a least element or a greatest element. Then, T is contractible; in particular, it is path-connected and all its homotopy groups are trivial.
Proof. 
Recall that the open sets of T are the up-sets of ⪯, and give [ 0 , 1 ] its usual topology and T × [ 0 , 1 ] the product topology.
Suppose first that m is a least element. Define H : T × [ 0 , 1 ] → T by H ( x , t ) = x for t ∈ [ 0 , 1 ) and H ( x , 1 ) = m . Let U ⊆ T be open. If m ∈ U , then U = T , because U is an up-set and m ⪯ x for all x; hence, H − 1 ( U ) = T × [ 0 , 1 ] . If m ∉ U , then H − 1 ( U ) = U × [ 0 , 1 ) . Here [ 0 , 1 ) is open in [ 0 , 1 ] for the subspace topology, since [ 0 , 1 ) = [ 0 , 1 ] ∩ ( − 1 , 1 ) ; therefore, U × [ 0 , 1 ) is open in T × [ 0 , 1 ] .
Suppose now that M is a greatest element. Define H ( x , 0 ) = x and H ( x , t ) = M for t ∈ ( 0 , 1 ] . Let U ⊆ T be open. If U = ∅ , then H − 1 ( U ) = ∅ . Otherwise, M ∈ U , since U is an up-set and
H − 1 ( U ) = ( U × { 0 } ) ∪ ( T × ( 0 , 1 ] ) = ( U × [ 0 , 1 ] ) ∪ ( T × ( 0 , 1 ] ) ,
which is open, as ( 0 , 1 ] = [ 0 , 1 ] ∩ ( 0 , 2 ) is open in [ 0 , 1 ] .
In both cases, H is continuous, H ( · , 0 ) = id T and H ( · , 1 ) is constant, so T is contractible. □
Theorem 3.
The spaces ( S , τ s ) , ( S , τ s n ) and ( S , τ Q ) are contractible. Consequently, they are path-connected, all their homotopy groups π n vanish for n ≥ 1 and the three spaces are homotopy equivalent.
Proof. 
In each case, the trivial group is a least element of the specialization preorder, so Lemma 4 applies. □
Path-connectedness can also be seen directly: for G 1 , G 2 ∈ S , one has G 1 , G 2 ⪯ G 1 × G 2 in each of the three preorders, and comparable points x ⪯ y are joined by the path γ ( 0 ) = x , γ ( t ) = y for t ∈ ( 0 , 1 ] .
Comparison of topologies. Although homotopy equivalent, the three topologies are pairwise distinct. Since s n X ⊆ s X for every class X , every s -closed class is s n -closed (if s X = X , then X ⊆ s n X ⊆ s X = X ). The converse fails: the subnormal subgroups of S 3 are 1, C 3 and S 3 , so { 1 , C 3 , S 3 } is s n -closed but not s -closed. Hence, τ s n , having strictly more closed sets, is strictly finer than τ s . On the other hand, τ Q is incomparable with both: s { 1 , Q 8 } = { 1 , C 2 , C 4 , Q 8 } is s -closed (hence s n -closed) but not Q -closed, since Q 8 / Z ( Q 8 ) ≅ C 2 × C 2 ; and Q { 1 , S 3 } = { 1 , C 2 , S 3 } is Q -closed but neither s -closed nor s n -closed, since it does not contain C 3 .
The operators E Φ and E p . The hypothesis of Lemma 4 cannot be dropped: the following proposition shows that the two remaining completely additive operators of Lemma 3 induce spaces that are not even connected.
Proposition 6.
Let C ∈ { E Φ , E p } and let ρ ( G ) = G / Φ ( G ) if C = E Φ , and ρ ( G ) = G / O p ( G ) if C = E p . Let R C ⊆ S be the set of groups A with Φ ( A ) = 1 , respectively O p ( A ) = 1 . Then, ( S , τ C ) is the topological disjoint union of the clopen subspaces
S A = { G ∈ S ∣ ρ ( G ) ≅ A } , A ∈ R C ,
each of which is contractible. Since R C is infinite, ( S , τ C ) is homotopy equivalent to a countably infinite discrete space; in particular, it is neither connected nor contractible.
Proof. 
(i) ρ is constant along ⪯ C . For E Φ , let N ⊴ G with N ≤ Φ ( G ) . As recalled in Section 2, Φ ( G / N ) = Φ ( G ) / N , hence ρ ( G / N ) ≅ ( G / N ) / ( Φ ( G ) / N ) ≅ ρ ( G ) . For E p , let K be a normal p-subgroup of G. Then, O p ( G ) / K is a normal p-subgroup of G / K , so O p ( G ) / K ≤ O p ( G / K ) ; conversely, the preimage L of O p ( G / K ) is normal in G and | L | = | K | | O p ( G / K ) | is a power of p, so L ≤ O p ( G ) . Thus, O p ( G / K ) = O p ( G ) / K and ρ ( G / K ) ≅ ρ ( G ) . In both cases, G ⪯ C H implies ρ ( G ) ≅ ρ ( H ) .
(ii) Each G lies below ρ ( G ) , and ρ ( G ) ∈ R C . Taking N = Φ ( G ) , resp. K = O p ( G ) , gives G ⪯ C ρ ( G ) , and by (i), Φ ( G / Φ ( G ) ) = 1 , resp. O p ( G / O p ( G ) ) = 1 .
By (ii), S is the disjoint union of the sets S A , A ∈ R C . By (i), each S A is both an up-set and a down-set of ⪯ C , hence open and closed. The subspace topology on the open set S A is the Alexandrov topology of the restricted preorder, in which A is a greatest element by (ii); so S A is contractible by Lemma 4. A disjoint union of clopen contractible subspaces is homotopy equivalent to the discrete space on its set of components. Finally, R C is infinite, since it contains C r for every prime r (with r ≠ p in the case of E p ). □

5.1. What the Homotopical Results Do and Do Not Say

Lemma 4 provides a precise criterion behind Theorem 3. Call a completely additive closure operator C on S anchored if its specialization preorder ⪯ C has a least or a greatest element. Then:
(1)
if C is anchored, ( S , τ C ) is contractible (Lemma 4);
(2)
s , s n and Q are anchored at the trivial group, so their spaces are contractible (Theorem 3);
(3)
E Φ and E p are completely additive but not anchored, and their spaces are disconnected, although each component is anchored and contractible (Proposition 6).
  • Algebraically, the anchor for s , s n and Q is the trivial group, which is a subgroup, a subnormal subgroup and a quotient of every group; for E Φ and E p the relevant invariants G / Φ ( G ) and G / O p ( G ) cannot be changed by the corresponding extensions, which splits the space into components.
These results should be read with care. Contractibility is a statement about homotopy type only. The topologies τ s , τ s n and τ Q are pairwise distinct, and the well-known non-commutativity of the operators (for instance, D 0 s ≠ s D 0 , see Section 4, and more generally the relations in Figure 1), which we informally call local algebraic friction, is not reflected in their common homotopy type, simply because the homotopy type of an anchored Alexandrov space is trivial regardless of the rest of its specialization preorder. In other words, the local differences between these operators are invisible to the homotopy type rather than resolved by it; they are detected by finer data, such as the topologies themselves or the specialization preorders.

5.2. Formations and Fitting Classes: A Shared Topological Opacity

We now apply the framework to the formation operator v = Q ∨ R 0 and the Fitting class operator Fit = s n ∨ N 0 (Section 4). Each is the join of a completely additive “restriction” operator ( Q , resp. s n ) and a non-additive “synthesis” operator ( R 0 , resp. N 0 ).
Proposition 7.
Neither v nor Fit is finitely additive.
Proof. 
Let p ≠ q be primes, X = { 1 , C p } , Y = { 1 , C q } and G = C p × C q , as in the proof of Lemma 3. By Lemma 2, S p is a formation and a Fitting class containing X , so v X ⊆ S p and Fit X ⊆ S p by Proposition 3(3); similarly, v Y , Fit Y ⊆ S q . Since G is neither a p-group nor a q-group, G ∉ v X ∪ v Y and G ∉ Fit X ∪ Fit Y . On the other hand, by Lemma 3(a),(b) and since R 0 ⪯ v and N 0 ⪯ Fit ,
G ∈ R 0 ( X ∪ Y ) ⊆ v ( X ∪ Y ) and G ∈ N 0 ( X ∪ Y ) ⊆ Fit ( X ∪ Y ) .
Hence, v ( X ∪ Y ) ≠ v X ∪ v Y and Fit ( X ∪ Y ) ≠ Fit X ∪ Fit Y . □
Corollary 1.
There is no topology τ on S whose Kuratowski closure operator coincides with v , i.e., such that cl τ ( X ) = v ( X ) for every class X ⊆ S ; and the same holds for Fit . In particular, Lemma 4 and Theorem 3 do not apply to v or Fit .
Proof. 
The closure operator of any topology is finitely additive (Theorem 1(1)); apply Proposition 7. □
Corollary 1 is a statement about representability by a topology in the sense of Kuratowski, and nothing more. It does not exclude other topological or categorical representations of v and Fit . For instance, by Proposition 3, the v -closed classes (the formations together with ∅) and the Fit -closed classes are closed under arbitrary intersections, so ( S , v ) and ( S , Fit ) are closure spaces in the sense of Čech [17], and they can be studied with the general theory of closure operators and closure spaces [6,12].
Thus, formations and Fitting classes behave alike in this respect, which we refer to as a shared topological opacity: in both cases, the restriction operator ( Q , resp. s n ) is completely additive, and the failure of additivity of the join is witnessed by the synthesis operator ( R 0 , resp. N 0 ), which is dominated by the join and whose counterexample survives in it because the classes of p-groups and of q-groups are closed under the join. We do not claim a general theorem to the effect that a join with a non-additive operator is always non-additive; the statement above concerns these two operators.

6. Conclusions

By combining categorical and topological tools, this paper has developed a framework for the study of group classes, formations and closure operators. The category of group classes CG is complete and cocomplete; the Gaschütz product is associative and unital on formations, and it is a bifunctor, hence a (strict, posetal) monoidal structure, on the category FOR s of subgroup-closed formations. Closure operators form a complete lattice CL whose joins are described by closed classes, which yields a uniform treatment of the formation and Fitting class operators.
On the topological side, s , s n and Q are completely additive and induce Alexandrov topologies on the universe of finite groups which are pairwise distinct but all contractible, because the trivial group is a least element of each specialization preorder; E Φ and E p are completely additive as well, but their spaces are disconnected, with contractible components. Finally, the formation operator Q ∨ R 0 and the Fitting class operator s n ∨ N 0 are not finitely additive, so neither is the closure operator of a topology on the universe of finite groups; in both cases, the obstruction is located in the synthesis operator, R 0 , respectively, N 0 .
These results illustrate how categorical and topological methods can provide a common language for algebraic constructions in finite group theory, continuing a tradition that goes back to the categorical foundations laid out in [3,4].

Future Directions

Several natural questions emerge from this work. First, the operators v and Fit , although not topological, define closure spaces; it would be interesting to know whether invariants of closure spaces, or of the complete lattices of formations and of Fitting classes, distinguish these two dual structures. Second, since FOR s is monoidal, one may ask whether it is closed, i.e., whether − ∘ F admits a right adjoint, and whether monads or algebra structures can be developed within it. Third, although the spaces induced by s , s n and Q are contractible, finer invariants, such as the homology of specific subposets (for example, the non-trivial groups, or the groups of a given formation), may still capture structural features that are invisible from the global viewpoint.

Author Contributions

Investigation, I.G.G. and L.A.M.C.; writing—original draft preparation, I.G.G. and L.A.M.C.; writing—review and editing, I.G.G. and L.A.M.C. All authors have read and agreed to the published version of the manuscript.

Funding

On behalf of all authors, the corresponding author states that we did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Doerk, K.; Hawkes, T. Finite Soluble Groups; Walter de Gruyter: Berlin, Germany, 1992. [Google Scholar]
  2. Ballester-Bolinches, A.; Ezquerro, L.M. Classes of Finite Groups; Springer: Berlin/Heidelberg, Germany, 2006. [Google Scholar]
  3. Lane, S.M. Categories for the Working Mathematician. In Graduate Texts in Mathematics, 2nd ed.; Springer: Berlin/Heidelberg, Germany, 1998. [Google Scholar]
  4. Borceux, F. Handbook of Categorical Algebra, Vol. 1–3; Cambridge University Press: Cambridge, UK, 1994. [Google Scholar]
  5. Castellini, M. Categorical Closure Operators. In Birkhäuser, Progress in Mathematics; De Gruyter Brill: Basel, Switzerland, 2003; Volume 274. [Google Scholar]
  6. Dikranjan, D.; Tholen, W. Categorical Structure of Closure Operators: With Applications to Topology, Algebra and Discrete Mathematics; Springer: Berlin/Heidelberg, Germany, 2010. [Google Scholar]
  7. Abdalla, M.; Janelidze, G. An Order-Theoretic Perspective on Categorical Closure Operators. Quaest. Math. 2018, 41, 529–539. [Google Scholar] [CrossRef] [Scilit]
  8. Kuratowski, K. Sur l’Opération A de l’Analysis Situs; Fundamenta Mathematicae: Warszawa, Poland, 1922. [Google Scholar]
  9. Alexandroff, P. Diskrete Räume. Mat. Sb. (N.S.) 1937, 2, 501–519. [Google Scholar]
  10. Arenas, F.G. Alexandroff spaces. Acta Math. Univ. Comen. (N.S.) 1999, 68, 17–25. [Google Scholar]
  11. Dikranjan, D.; Tholen, W. Dual Closure Operators and Their Applications. 2014. Available online: https://tholen.mathstats.yorku.ca/files/2021/01/Dclop-20June2014.pdf (accessed on 20 October 2026).
  12. Janelidze, G.; Sobral, M. Topics in the categorical algebra of closure spaces. Cah. Topol. Géom. Différ. Categ. 2025, LXVI, 19–35. [Google Scholar]
  13. Kimura, K. Compactness of the Alexandrov topology of maximal Cohen–Macaulay modules. arXiv 2024, arXiv:2401.04987. [Google Scholar]
  14. Lambert, B. A Topos-Theoretic Semantics of Intuitionistic Modal Logic via Alexandrov Topologies. arXiv 2024, arXiv:2410.13078. [Google Scholar]
  15. McCord, M.C. Singular homology groups and homotopy groups of finite topological spaces. Duke Math. J. 1966, 33, 465–474. [Google Scholar] [CrossRef] [Scilit]
  16. Barmak, J. Algebraic Topology of Finite Topological Spaces and Applications; Springer: Berlin/Heidelberg, Germany, 2011. [Google Scholar]
  17. Čech, E. Topological Spaces; Frolík, Z., Katětov, M., Revised Eds.; Academia: Prague, Czech Republic; John Wiley & Sons: Hoboken, NJ, USA, 1966. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.