Congruence preserving expansions of nilpotent algebras
Erhard Aichinger, G\'abor Horv\'ath

TL;DR
This paper characterizes certain nilpotent algebras of prime power order that have infinitely many polynomially inequivalent congruence preserving expansions within congruence modular varieties.
Contribution
It provides a characterization of nilpotent algebras with infinitely many polynomially inequivalent congruence preserving expansions.
Findings
Identifies conditions for infinite polynomially inequivalent expansions
Focuses on nilpotent algebras of prime power order
Operates within congruence modular varieties
Abstract
We characterize those nilpotent algebras of prime power order and finite type in congruence modular varieties that have infinitely many polynomially inequivalent congruence preserving expansions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Congruence preserving expansions of nilpotent algebras
Erhard Aichinger
Institut für Algebra, Johannes Kepler Universität Linz, Altenberger Strasse 69, 4040 Linz, Austria
and
Gábor Horváth
Institute of Mathematics, University of Debrecen, Pf. 400, Debrecen, 4002, Hungary
Abstract.
We characterize those nilpotent algebras of prime power order and finite type in congruence modular varieties that have infinitely many polynomially inequivalent congruence preserving expansions.
The first listed author was supported by the Austrian Science Fund (FWF): P24077 and P29931. The second listed author was supported by the János Bolyai Research Scholarship of the Hungarian Academy of Sciences, by the European Union’s Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 318202, by the Hungarian Scientific Research Fund (OTKA) grant no. K109185, and by the National Research, Development and Innovation Fund of Hungary, financed under the FK 124814 funding scheme.
1. The result
Associated with every algebraic structure , there are two clones which we will study in the present note: the clone of polynomial functions , and the clone of congruence preserving functions . We say that an algebra , defined on the same universe as , is a congruence preserving expansion of if . For expanded groups, such expansions with unary operations have been studied in [Pet10]. Considering algebras with the same clone of polynomial functions as equivalent, we say that has finitely many polynomially inequivalent congruence preserving expansions if the set is finite. One extreme case is : then is called affine complete [KP01], and clearly then has only one congruence preserving expansion. On the other side, if has only finitely many fundamental operations (i. e., it is of finite type) and is not finitely generated, then has infinitely many inequivalent congruence preserving expansions. For finite -groups , [ALM16] provides a complete characterization when is finitely generated. However, there are algebras for which is finitely generated, but still has infinitely many inequivalent congruence preserving expansions: the cyclic group with elements [Bul02] and the quaternion group with elements are examples of such a behaviour. Our characterization uses a condition on the congruence lattice that has been used in [AM13]: We say that a bounded lattice splits strongly if it is the union of two proper subintervals with nonempty intersection, which can be expressed by
[TABLE]
Note that it is claimed that and . We say that a finite algebra has few subpowers if there is a polynomial such that for each , the algebra has at most subalgebras. In [BIM*+*10], it is proved that such algebras are characterized by having an edge term and that they generate congruence modular varieties.
The following theorem is the main result of the present note.
Theorem 1**.**
Let be a finite algebra of finite type with few subpowers. Then the following are equivalent:
- (1)
* has infinitely many polynomially inequivalent congruence preserving expansions.* 2. (2)
The interval in the lattice of all clones on is infinite. 3. (3)
There exists a clone with that is not finitely generated.
If is furthermore isomorphic to a direct product of nilpotent algebras of prime power order, and if for all with , we have , then the three conditions (1)– (3) are equivalent to
- (4)
There is such that the congruence lattice of splits strongly. 2. (5)
The congruence lattice of splits strongly.
The condition on the congruence lattice in items (4) and (5) has also appeared in Theorem 1.1 of [AM13], which states that a finite modular lattice that splits strongly allows infinitely many different sequences satisfying the properties of higher commutator operations. Theorem 1 provides a description of those nilpotent groups that have infinitely many polynomially inequivalent expansions.
Corollary 2**.**
Let be a finite nilpotent group. Then has infinitely many polynomially inequivalent congruence preserving expansions if and only if the lattice of normal subgroups of splits strongly, i.e., the normal subgroup lattice of is the union of two proper subintervals that have at least one normal subgroup in common.
One can view the finiteness of the interval as a polynomial completeness property [KP01]. For finite abelian -groups, this property is described in the following corollary.
Corollary 3**.**
Let be a prime, let and let with . Then the abelian group has finitely many polynomially inequivalent congruence preserving expansions if and only if and or and .
We compare this to known completeness properties: with and is affine complete if and only if and [Nöb76]. By Corollary 3, has only finitely many polynomially inequivalent congruence preserving expansions if and only if it is affine complete or simple. Finally by [ALM16, Theorem 1.2], the clone of congruence preserving functions of is finitely generated if and only if is affine complete or cyclic.
The proofs of the results stated in this introduction will be given in Section 3. Before, Section 2 provides some auxiliary results about clones and direct products.
2. Direct products
We need some information on clones acting on direct products. The results contained in this section are for the most part known, or follow quite immediately from existing theory. In the sequel, a vector will sometimes by written as .
Definition 4**.**
Let be sets, let , and let and . Then we define the mapping by
[TABLE]
for , .
For a clone on the set , we let be its -ary part .
Definition 5**.**
Let be sets, let be a clone on , and let be a clone . We define the set , which consists of finitary functions on , by
[TABLE]
Lemma 6**.**
Let be sets, let be a clone on , and let be a clone .Then the set is a clone on .
Proof.
contains all projections. For and , straightforward calculations show . ∎
For a set of finitary functions on , the clone generated by is denoted by .
Lemma 7**.**
Let be sets, let be a clone on that is generated by , and let be a clone on that is generated by . Let
[TABLE]
Then the clone on that is generated by is equal to .
Proof.
We proceed as in the proof of Proposition 4.1 of [ALM16]. We define by and by . Adopting the viewpoint of [Mal66], we consider clones as function algebras: the idea of this approach is that a clone on is a subalgebra of equipped with the unary operations (rotation of the arguments), (swapping the first two arguments), (taking a minor), (adding an inessential argument), and one binary operation that composes two functions in a certain way. A detailed account of this point of view is given in [PK79, p. 38]. Using this approach, we observe that the mapping is an epimorphism from the algebra to the algebra . Since , . Now a basic property on the interaction of homomorphisms and subalgebra generation [BS81, Theorem II.6.6] yields . Similarly, . We are now ready to show
[TABLE]
The “”-inclusion follows from . For “”, we choose . Since , we find such that . Similarly, we find with . If we denote the binary projections by and , we see that the last element listed in the definition of is . Hence the composition lies in , which implies . ∎
Corollary 8**.**
Let be sets, let be a clone on , and let be a clone on . Then is finitely generated if and only if both and are finitely generated.
Proof.
The “if”-direction follows from Lemma 7. For the “only if”-direction, we observe that both function algebras and are homomorphic images of the algebra . ∎
The polynomial functions on the direct product of two algebras can in general not be determined directly from the polynomial functions on the factors (for finite groups, this phenomenon has been studied in [Sco69]). However, under the additional assumption that the algebras lie in a congruence permutable variety and that all congruences in the direct product are product congruences, a decomposition into the direct factors is possible. Let . A congruence of is a product congruence if there exist and such that
[TABLE]
A congruence of that is not a product congruence is a skew congruence. We say that is a skew-free direct product of and if has no skew congruences.
Lemma 9** ([KM10]).**
Let be an algebra with a Mal’cev term. Suppose that is a skew-free direct product of and . Then .
Proof.
This is essentially Corollary 2 from [KM10]; the claim can also be derived directly from Corollary 6.4 of [AM15]. ∎
Corollary 10**.**
Let be an algebra with a Mal’cev term. Suppose that is a skew-free direct product of and . Then the interval between and in the lattice of clones on is given by
[TABLE]
Proof.
For , let be a clone with . Then has the same congruence lattice as and is therefore a skew-free direct product of two algebras and . Now we let and and use Lemma 9 to obtain .
For , we first observe that is a skew-free direct product. This implies that every function in is a congruence preserving function on . Now we choose from the right hand side of (2.2). Then clearly , and therefore lies in the left hand side of (2.2). ∎
We will now investigate the splitting property of lattices that appears in items (4) and (5) of Theorem 1.
Lemma 11**.**
Let , and let be bounded lattices, and let . Then splits strongly if and only if at least one of the lattices splits strongly.
Proof.
For the “if”-direction, assume that splits strongly with witnesses . Then splits strongly with and as witnesses ( and at position ).
For the “only if”-direction, we assume that splits strongly with witnesses and . Since , there is such that . Hence (with at place ). By the splitting property, we have . Thus for , we have , and therefore, since , we have . Now we show that splits strongly with witnesses and : since , we have . Now take any with . Then , hence , and thus . ∎
A finite algebra is congruence uniform if for every congruence of , all its congruence classes have the same cardinality. For , we define
[TABLE]
and write (and also ) if and .
Lemma 12**.**
Let be a finite congruence uniform algebra in a congruence permutable variety, and let . Then we have:
- (1)
If , then every -class is the union of distinct -classes; put differently, for every we have . 2. (2)
If , then . 3. (3)
If , then .
Proof.
(1) Each -class contains elements, and each -class contains elements. Since every -class is a disjoint union of -classes, we find that every -class must then consist of exactly different -classes. Property (2) follows directly from (2.3). For proving (3), we first choose an . By item (1), it is sufficient to show that has the same number of elements as . To this end, we define by . The function is well-defined because . For injectivity, let with . Then , and thus . For surjectivity, we let . By congruence permutability, we have , and therefore there exists with and . Then . Therefore, is bijective, which establishes (3). ∎
Lemma 13**.**
Let be a finite congruence uniform algebra in a congruence permutable variety that is the direct product of two algebras and of coprime order. Then this product is skew-free.
Proof.
Let and be the projection kernels of such that and . By [BS81, Lemma IV.11.6], it is sufficient to prove that each congruence of satisfies
[TABLE]
We observe that . Since every congruence permutable variety is congruence modular, we can use the modular law to obtain . Therefore . Applying item (3) of Lemma 13, we obtain , which by item (2) of the same lemma divides . Hence, using (2) again, we have . Changing the roles of and , we obtain . Now since and are coprime, we obtain , which implies (2.4). ∎
3. Proof of the main results
Proof of Theorem 1.
The items (1) and (2) are equivalent by definition.
(2)(3): We assume that that the interval in the clone lattice is infinite. By [Aic10, Theorem 5.3], the set satisfies the descending chain condition, and therefore, there is which is minimal such that is infinite. We prove that is not finitely generated. Seeking a contradiction, assume that is finitely generated. We call a clone a subcover of if and there is no clone with . Then by [PK79, Chrakterisierungssatz 4.1.3(i)(iii)], has only finitely many subcovers , , and for each clone on with there is with . Let . Then . Hence one interval must be infinite, contradicting the minimality of .
(3)(2): Let be the maximal arity of the fundamental operations on , and let be a nonfinitely generated clone with . For , let Let be the subclone of generated by its -ary members. Then and . Since is not finitely generated, we have for all , and therefore the set is infinite.
Before proving the equivalence with (4) and (5), we additionally assume that is isomorphic to , and we also assume that for each , is nilpotent and is a prime power, and that for all with , we have . Since has few subpowers, generates a congruence modular variety [BIM*+*10, Theorem 4.2]. Thus all the algebras are nilpotent algebras in a congruence modular variety. Representing the congruence of as the join of the projection kernels and using the join distributivity of the binary commutator [FM87, Proposition 4.3] to compute the lower central series of , we see that then is nilpotent, too. Hence by Theorem 6.2 of [FM87], has a Mal’cev term, which we will denote by , and therefore generates a congruence permutable variety [Mal54]. By [FM87, Corollary 7.5] and its homomorphic images are all congruence uniform. Now Lemma 13 implies that for every , is a skew-free product with .
(3)(5): We proceed by contraposition. We assume that the congruence lattice does not split strongly and show that every clone in is finitely generated. We will need another notion of splitting: we say that a lattice splits if it is the union of two proper subintervals; this definition differs from “splits strongly” in that “splitting” does not claim that the subintervals intersect [AM13, p. 861]. Hence splits if
[TABLE]
Let be a clone with , and let be the corresponding congruence preserving expansion of . Since the lattice does not split strongly, [AM13, Corollary 3.4(2)] yields that is isomorphic to a direct product such that does not split, , and each is simple. We will now show that each of these direct factors has a finitely generated clone of polynomial functions. Let us first examine . The congruence lattice of does not split, hence by Propositions 3.7 and 3.8 of [ALM16], is finitely generated. Examining the factors , we let and observe that is a simple finite algebra with Mal’cev term. If is abelian, is polynomially equivalent to a module over a ring. Hence its clone of polynomial functions is generated by its binary members. If is nonabelian, then consists of all finitary operations on (this follows, e. g., from [HH82, Corollary 3.5]) and is therefore generated by its binary members by [Pos21, p. 180] (cf. [Sie45]). Since by [AM13, Corollary 3.4], the direct product has no skew congruences, we may use Lemma 9 times to obtain . Now Lemma 7 implies that is finitely generated, and thus also is finitely generated. Since , is finitely generated.
(5)(4): From Lemma 13, we obtain that for each , the direct product with and is skew-free. Hence we obtain that is isomorphic to the lattice . Now Lemma 11 yields that there is such that splits strongly.
(4)(3): Let be such that splits strongly. The first part of the proof will produce a nonfinitely generated clone between and . From , it will then be easy to produce a nonfinitely generated clone between and .
In order to produce such a clone , we let , and . Let be two congruences witnessing that splits strongly as in (1.1); we may choose them in such a way that is an atom of . Let with , and for every , let be defined by
[TABLE]
The function is congruence preserving; to this end, let and let be a congruence of such that for all , . If , then , and therefore . If , then by the splitting property, . Since , we obtain . Hence is indeed congruence preserving. Now we define . To this end, let be the expansion of with the operations , and let .
Our goal is to show that is not finitely generated. To this end, we first show that
[TABLE]
For this purpose, we show that is nilpotent, and that is central in .
For the first claim, we observe that is an expansion of with constant operations because all have their range contained in one single -class and are therefore constant modulo . This implies . Since is nilpotent, then so is .
For proving the centrality of , we use the relational description of centrality given in [AM07, Proposition 2.3 and Lemma 2.4], which goes back to Theorem 3.2(iii) of [Kis92]. From these results, we see that is central in if and only if all fundamental operations of preserve the relation
[TABLE]
where is the Mal’cev term of that we produced before proving the implication (3)(5). We will first show that all preserve . To this end, let and let , and for , set . We have to show . Since is congruence preserving, we have . The second property that we have to show is . We first observe that for all , we have and therefore, since , also . Thus . Hence and therefore
[TABLE]
Since for each , , and since is constant on -classes, we have . Therefore, preserves . In , the commutator is because is nilpotent and is a minimal congruence of . Therefore, the relational description of centrality implies that every fundamental operation of preserves . Hence every fundamental operation of preserves ; this implies that is central in . Since nilpotent and is central, is nilpotent, which concludes the proof of (3.2).
Now suppose that is finitely generated by some finite subset of . Then the algebra satisfies . Therefore, is nilpotent, of finite type and of prime power order. Hence, using [Kea99, Theorem 3.14(3)(4)], we obtain that there is a such that every commutator term of is of rank at most . However,
[TABLE]
lies in . Since for all , is a commutator term of . Let . Then , and therefore is not the projection to the last component, Hence is a nontrivial commutator term of rank in the sense of [Kea99]. This contradiction proves that is not finitely generated.
From this clone on , we will now produce a clone on . In order to do this, we let be the clone on . Since is a skew-free product, Lemma 9 implies . Since is skew-free, . Hence is a clone in the interval . Since is not finitely generated, Corollary 8 implies that is not finitely generated. ∎
Proof of Corollary 2.
Since a finite nilpotent group is the direct product of its Sylow-subgroups, the result is an instance of the equivalence (1)(5) from Theorem 1. ∎
Proof of Corollary 3.
From Theorem 1 of [BC05], we know that the subgroup lattice splits (as defined in (3.1)) iff or ( and ).
For the “if”-direction, let us assume that ( and ) or ( and ). In the case that and , the description above tells that does not split strongly. In the case and , is a two element chain, which does not split strongly, either. Hence the implication (1)(5) of Theorem 1 yields the result.
For the “only if”-direction, we assume that has finitely many polynomially inequivalent expansions. We use Theorem 1 and obtain that does not split strongly. In the case we obtain that is a chain with elements. Since does not split strongly, we then must have . We now consider the case . Seeking a contradiction, we assume . By [BC05], then splits. Lemma 2.1 from [AM13] describes lattices that do split, but not strongly. This lemma yields that is isomorphic to a direct product of two lattices such that does not split, and is a Boolean lattice. Since splits and does not split, we have . Also : if has one element, then is Boolean. But since , has a subgroup isomorphic to , and the subgroups of form a nondistributive lattice, contradicting that is Boolean. From the lattice isomorphism we obtain that is isomorphic to the direct product of its two non-trivial groups and and that is a skew-free product of and , meaning that for every subgroup of , we have
[TABLE]
Taking minimal subgroups of and of , we see that is isomorphic to , and therefore contains skew subgroups of that do not satisfy (3.3). This contradicts the fact that is a skew-free product of and . Hence the assumption leads to a contradiction, proving that . ∎
Acknowledgments
The authors thank C. Pech and N. Mudrinski for discussions on the topics of this paper.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Aic 10] E. Aichinger. Constantive Mal’cev clones on finite sets are finitely related. Proc. Amer. Math. Soc. , 138(10):3501–3507, 2010.
- 2[ALM 16] E. Aichinger, M. Lazić, and N. Mudrinski. Finite generation of congruence preserving functions. Monatsh. Math. , 181(1):35–62, 2016.
- 3[AM 07] E. Aichinger and P. Mayr. Polynomial clones on groups of order p q 𝑝 𝑞 pq . Acta Math. Hungar. , 114(3):267–285, 2007.
- 4[AM 13] E. Aichinger and N. Mudrinski. Sequences of commutator operations. Order , 30(3):859–867, 2013.
- 5[AM 15] E. Aichinger and P. Mayr. Independence of algebras with edge term. Internat. J. Algebra Comput. , 25(7):1145–1157, 2015.
- 6[BC 05] S. Breaz and G. Călugăreanu. Abelian groups whose subgroup lattice is the union of two intervals. J. Aust. Math. Soc. , 78(1):27–36, 2005.
- 7[BIM + 10] J. Berman, P. Idziak, P. Marković, R. Mc Kenzie, M. Valeriote, and R. Willard. Varieties with few subalgebras of powers. Transactions of the American Mathematical Society , 362(3):1445–1473, 2010.
- 8[BS 81] S. Burris and H. P. Sankappanavar. A course in universal algebra . Springer New York Heidelberg Berlin, 1981.
