M. A. Khrystik
This research was supported by Russian Science Foundation, grant 20-11-20203, https://rscf.ru/en/project/20-11-20203/
An Upper Bound on the Length of an Algebra and Its Application to the Group Algebra of the Dihedral Group
Abstract
Let be an -algebra and let be its generating set. The length of is the smallest number such that equals the -linear span of all products of length at most of elements from . The length of , denoted by , is defined to be the maximal length of its generating set. In this paper, it is shown that the does not exceed the maximum of and , where is the largest degree of the minimal polynomial among all elements of the algebra . For arbitrary odd , it is proven that the length of the group algebra of the dihedral group of order equals .
:
primary 16S34; secondary 20C05, 20C30keywords:
Finite-dimensional algebras, length of an algebra, group algebras, dihedral group, representations of dihedral groups.1 Introduction
All algebras considered in this paper are associative finite-dimensional algebras with an identity over a field. First, we recall the notion of the length of the algebra .
Let be an algebra. Any product of a finite number of elements from a finite subset is called a word over the alphabet . The length of a word equals the number of letters in this product that are different from . We consider to be an empty word of length 0.
If is a generating system (or a generating set) of the algebra , i.e., is the minimal subalgebra of containing , then any element of the algebra can be expressed as a linear combination of words over . The minimal such that all elements of can be expressed using words of length no more than is called the length of the generating system . The length of the algebra is defined as the maximum length among its generating systems and will be denoted by (see definition 2.4). In defining the length of algebra , we consider the set of all generating systems for . This explains the difficulty of calculating the length even for classical algebras.
The general problem of calculating the length was first formulated by A. Paz in 1984 for the full matrix algebra over a field in Paz and still remains open.
Conjecture 1.1 (Paz ).
Let be an arbitrary field. Then
A nontrivial upper bound on in terms of and (the largest degree of the minimal polynomial among all elements of the algebra ) was obtained in Pap by C. Pappacena. The study of upper bounds on length in these terms will be continued in this paper.
Calculating the length in general is a rather difficult task. The main algebraic properties of the length function were studied by O.V. Markova in the work OVM .
The question of calculating the lengths of group algebras is of particular interest. Due to their matrix representations, solving this question is closely linked to solving Paz’s problem. For group algebras of small-order groups it is possible to calculate the length precisely over arbitrary fields. For the permutation group , Klein four-group , and quaternion group , the lengths were found by A.E. Guterman and O.V. Markova in GutM18 ; GutM19 .
Systematic study of the general problem of finding the lengths of group algebras of finite abelian groups was dedicated to the joint works of the author with A.E. Guterman and O.V. Markova GMK1 ; GutKhM20p2 . The works of O.V. Markova Mar20 and the author Kh23 continued the study of the lengths of group algebras of finite abelian groups in the modular case.
Studying all non-abelian groups appears to be too difficult due to the diversity of their structure. Therefore, it is proposed to study the length function separately for families of classic non-abelian groups. Thus, in the joint work of the author with O.V. Markova KhMar20 , the study of the lengths of group algebras of dihedral groups began, and the length was calculated in the semisimple case. This series of groups in the semisimple case is a natural next step after the abelian case. Indeed, for group algebras of abelian groups in the decomposition into a direct sum of matrix algebras all terms are one-dimensional, whereas the sizes of the matrix algebras in the decomposition into a direct sum of group algebras of dihedral groups do not exceed two. The work KhMar20POMI continued the study of the lengths of group algebras of dihedral groups of order and calculated their length in the modular case. This paper will consider the length of the group algebra of the dihedral group over an arbitrary field.
In Section 2, the main definitions and notations of the considered theory are introduced.
In Section 3, the upper bound on the length is proven.
In Section 4, the concept of bicirculant algebra is introduced and studied, in particular, its length is calculated. A bicirculant representation of the group algebra of the dihedral group is constructed and its properties are studied. Using the bicirculant representation, and are estimated.
2 Main Definitions and Notations
Denote by the linear span (the set of all finite linear combinations with coefficients from ) of a subset of some vector space over .
Let be a non-empty finite set (alphabet). Finite sequences of letters from are called words. Let denote the set of all words in the alphabet , be the free semigroup over the alphabet , i.e. with the operation of concatenation.
Definition 2.1.
The length of the word , where , is equal to . We will consider (the empty word) a word from the elements of length .
Let denote the set of all words in the alphabet of length no greater than , . Then by denote the set of all words in the alphabet of length equal to , .
Remark 2.2.
Products of elements from the generating set can be considered as images of elements of the free semigroup under the natural homomorphism, and they can also be called words from the generators and use the natural notations and .
Denote by the linear span of words from . Note that . Let also denotes the linear span of all words in the alphabet .
Definition 2.3.
The length of a generating system of algebra is .
Definition 2.4.
The length of an algebra is .
Let be an algebra, . Denote the minimal polynomial of by . Then , .
Denote by or the group algebra of the group over the field , for the matrix unit, for the dihedral group of order , for the symmetric group.
Definition 2.5.
We say that two words and of length from the generators are equivalent, if for some nonzero . We will use the notation in this case.
Definition 2.6.
We say that a word of length from the generators reducible if . Otherwise, we will call the word irreducible.
3 General Bound on Length
3.1 Equivalence of Words
Before proceeding to prove the main statement of the section let us note some properties of the introduced concept of word equivalence as it is significantly used in the proof of this statement.
Lemma 3.1.
Equivalence of words is an equivalence relation on the set of words.
Proof.
Reflexivity. with
Symmetry. Let . Then, by multiplying the element by , we get
Transitivity. Let , . Then, by adding the second element multiplied by to the first one, we obtain
∎
Lemma 3.2.
Let . Then is reducible if and only if is reducible.
Proof.
Straightforward.
∎
Lemma 3.3.
Let the word be irreducible. Then any subword of is irreducible.
Proof.
Straightforward.
∎
Lemma 3.4.
Let the word of length contain a subword of length , . Then , where is a word obtained from by replacing the subword with the subword .
Proof.
By condition, , , for some words , . Then, by multiplying the expression on the left by and on the right by , we get ∎
3.2 Estimating Using and
Theorem 3.5.
Let be an associative finite-dimensional algebra with an identity. Then
Proof.
Let (otherwise the statement is proven). Let be a generating set of length of the algebra (in the case of other generating sets the length of the algebra will be no greater). Consider an irreducible word of length in the alphabet (such exists by definition of the length of the algebra). We will prove that it holds that
We will reason by contradiction. Suppose such that (this difference cannot be zero by definition of the length of the algebra). We will break the reasoning into steps and lead it to a contradiction.
First step. The word is irreducible. Therefore, its subword is irreducible by Lemma 3.3. By assumption (here we use the fact that is no greater than ). Indeed, if this were not the case, we would get , since the dimension would increase by at least 2 due to these two words. Thus, by Lemma 3.4. Therefore, the word is irreducible.
Second step. Now consider the irreducible word of length obtained in the previous step. By reasoning similarly (considering subwords of length starting from the first and second letters), we will get rid of the letter similarly to how we got rid of the letter in the first step. We obtain that the word is irreducible.
After conducting steps of this reasoning, we obtain that the word of length is irreducible. Now we can proceed to the last step and obtain a contradiction.
-st step. The word is irreducible. Therefore, its subword is irreducible. By assumption, all words of length are expressed through the word and words of shorter length. Thus, . Therefore, the word is irreducible and . Contradiction.
We return to the proof of the main statement. Represent the dimension of the algebra in the following form . The first term of this sum is not less than 1, the last one equals 1, and all the others are not less than 2. Thus, . Therefore, . Thus,
∎
3.3 Comparison with Other Estimates
In conclusion of this section we will compare the obtained bound with other similar bounds.
Let us compare the obtained bound with the following bound presented in the joint work of the author with O.V. Markova.
Lemma 3.6 ((KhMar20POMI, , Lemma 2.10)).
Let be an -algebra, , . Then .
Since is unequivocally less than , we see that the new estimate will be worse than the estimate from Lemma 3.6 only if (that is, if ). Also, by the condition of Lemma 3.6 it must be fulfilled that . From the last two inequalities, it follows that . But in the condition of Lemma 3.6 it is also required that . Therefore, the new bound is better in any case.
Next we will compare with the following Pappacena’s estimate.
Theorem 3.7 ((Pap, , Theorem 3.1)).
Let be any algebra. Then , where
Since , we have Since is less than , we see that the new estimate will be worse than Pappacena’s estimate only if (that is, if ). That is, the new bound can be worse than Pappacena’s bound only if the dimension of the algebra is 4 times greater than the expression . In particular, the new estimate is unequivocally better when considering group algebras of dihedral groups, which will be discussed in the next section. However, Theorem 3.5 may give a more accurate estimate than Theorem 3.7 even if . Let us show that by the following example.
4 Calculating )
4.1 Bicirculant Algebra
Let us consider two matrices. The circulant and the anti-circulant .
Let us define the algebra generated by these two matrices.
Definition 4.1.
The algebra of bicirculants of order n over the field is .
Let us study the structure of this algebra.
Lemma 4.2.
, , .
Proof.
The equalities are checked directly by multiplying matrices. ∎
Lemma 4.3.
Proof.
Due to Lemma 4.2 we may consider that , where , . Note that is nothing else but the space of circulants, and is the space of anti-circulants, each of which has a dimension of .
The basis of the intersection of the spaces and in the odd case is the matrix in which each element equals 1, and in the even case, the basis will be the following two matrices
Thus, the statement of the lemma follows from the formula for the dimension of the sum of subspaces. ∎
Theorem 4.4.
Proof.
Let us first prove the lower bound Consider a generating set , where . This is indeed a generating set, as . At the same time, , meaning that there are no more than two irreducible words of each length (of the form and ). Thus, , from which it follows that the length of the algebra is at least .
The upper bound follows from Theorem 3.5. Indeed, by the Cayley-Hamilton theorem, . By Lemma 4.3, . Applying Theorem 3.5, we obtain the inequality . This completes the proof.
∎
4.2 Bicirculant Representation of
Let us number the vertices of a regular -gon. Let map the vertex to the vertex , where . Then we can consider a group homomorphism, defining its values on elements of by the rule , and then extend it to an algebra homomorphism by linearity.
Let us now consider a group homomorphism , which maps a permutation from into the corresponding permutation matrix. We extend it to an algebra homomorphism by linearity.
Note that the composition defines a linear representation of the algebra . This representation is called the bicirculant representation in this paper. Let us study some properties of this composition.
Lemma 4.5.
.
Proof.
Let be the rotation by an angle , be the symmetry about the axis passing through the vertex . Then .
It is easy to notice that , . Since is a homomorphism, , from which the statement of the lemma follows. ∎
Lemma 4.6.
, for odd n. , for even n.
4.3 Length of
First, let us present known results about the length of .
Lemma 4.7 ((KhMar20, , Lemma 2.1)).
Let be the dihedral group of order , , be an arbitrary field. Then .
Theorem 4.8 ((KhMar20, , Theorem 1.15)).
Let be a field such that does not divide . Then , for .
Theorem 4.9 ((KhMar20POMI, , Theorem 4.10)).
Let , . Then .
In this paper, we will try to generalize the last two theorems, namely, to eliminate the condition on the field.
Hereinafter in the work, it is assumed that .
Let us prove the main result of the section.
In the proof of the following lemma the author uses the idea of proving Lemma 3.11 from GutM18 .
Lemma 4.10.
Let there exist a surjective homomorphism of algebras . Then
Proof.
Consider an arbitrary generating set of the algebra .
Since the homomorphism is surjective, we see that the set is a generating set of the algebra . Therefore, . On the other hand, . Therefore, .
Since the dimensions must increase with until stabilization, we have . At the same time, the minimal such that , by definition, is . Due to the arbitrariness of , we obtain .
∎
Theorem 4.11.
Let be the dihedral group of order , , be an arbitrary field. Then
Proof.
The lower bound is given by Lemma 4.7. Let us prove the upper bound.
From Theorem 4.4 it follows that . From Lemma 4.3 it follows that for odd , for even . Consider the homomorphism of algebras , described in Section 4.2. Since by Lemma 4.5 the homomorphism is surjective, we can apply Lemma 4.10 and get the upper bound . Then application of Theorem 4.4, Lemma 4.3 and the fact that completes the proof.
∎
Remark 4.12.
Despite the fact that among the possible values of there is , no real examples of algebras with this length have been found (and are not expected given Theorem 4.8). The developed technique allows finding the exact value only for odd , however, the obtained result is a noticeable advancement in the study of the lengths of group algebras of dihedral groups, demonstrating the usefulness of the bound proven in Theorem 3.5 and the bicirculant representation.
4.4 Bound for
Using the bicirculant representation, we get an estimate of .
Theorem 4.13.
Let be the dihedral group of order , , be an arbitrary field. Then
Proof.
Let , be the homomorphism of algebras described in Section 4.2, be the rotation by an angle , be the symmetry.
Let . Then by the Cayley-Hamilton theorem . Since , we get . Next, consider two cases separately.
First case. Let be odd. Then from Lemma 4.6 it follows that is one-dimensional. On the other hand, the kernel of a homomorphism of algebras is an ideal, which means and are linearly dependent. Thus, .
Second case. Let be even. Then from Lemma 4.6 it follows that is two-dimensional. On the other hand, the kernel of a homomorphism of algebras is an ideal, which means , , and are linearly dependent. Thus, .
∎
Remark 4.14.
The main conjecture regarding the lengths of group algebras in the case of dihedral groups is that for all over an arbitrary field. Due to Theorem 3.5, to prove the conjecture, it is sufficient to obtain an estimate . However, using an estimate from Theorem 4.13, we get the same result as presented in Theorem 4.11. Nevertheless, estimating allows us to demonstrate another application of the Theorem 3.5 and the bicirculant representation, and the study of numerical characteristics of algebras is of interest in itself.
References
- (1) A. E. Guterman, O. V. Markova, The length of group algebras of small-order groups. — Zap. Nauchn. Sem. POMI, 472 (2018), 76–87; English transl. in J. Math. Sci. 240:6 (2019), 754–761.
- (2) O. V. Markova, An example of length computation for a group algebra of a noncyclic abelian group in the modular case. — Fundam. Prikl. Mat., 23:2 (2020), 217–229; English transl. in J. Math. Sci. 262:5 (2022) 740–748.
- (3) M.A. Khrystik, Length of the group algebra of the direct product of a cyclic group and a cyclic p-group in the modular case. — Zap. Nauchn. Semin. POMI, 524(2023), 166–176.
- (4) O. V. Markova, The length function and matrix algebras. — Fundam. Prikl. Mat., 17:6 (2012), 65–173; English transl. in J. Math. Sci. 193:5 (2013) 687–768.
- (5) M. A. Khrystik, O. V. Markova The length of the group algebra of the dihedral group of order . — Zap. Nauchn. Sem. POMI, 496(2020), 169–181; English transl. in J. Math. Sci. (N. Y.), 255:3 (2021), 324–331.
- (6) A. E. Guterman, M. A. Khrystik, O. V. Markova, On the lengths of group algebras of finite abelian groups in the modular case. — J. Algebra its Appl., 21:6 (2022), 2250117–2250130.
- (7) A. E. Guterman, O. V. Markova, The length of the group algebra of the group . — New Trends in Algebra and Combinatorics. Proceedings of the 3rd International Congress in Algebra and Combinatorics (Ed. by K.P. Shum, E. Zelmanov, P. Kolesnikov, A. Wong), World Sci., Singapore, (2019), 106–134.
- (8) A. E. Guterman, O. V. Markova, M. A. Khrystik, On the lengths of group algebras of finite abelian groups in the semi-simple case. — J. Algebra its Appl., 21:7 (2022), 2250140–2250153.
- (9) M. A. Khrystik, O. V. Markova, On the length of the group algebra of the dihedral group in the semi-simple case. — Commun Algebra, 50:5 (2022), 2223–2232.
- (10) C. J. Pappacena, An upper bound for the length of a finite-dimensional algebra. — J. Algebra, 197 (1997), 535–545.
- (11) A. Paz, An application of the Cayley–Hamilton theorem to matrix polynomials in several variables. — Linear Multilinear Algebra, 15 (1984), 161–170.