This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

\citesort
\authorheadline

M. A. Khrystik

\support

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

M. A. Khrystik HSE University, Faculty of Computer Science, Moscow, 101000, Russia. [email protected] Moscow Center of Fundamental and Applied Mathematics, Moscow, 119991, Russia.
Abstract

Let 𝒜{\cal A} be an 𝔽{\mathbb{F}}-algebra and let SS\SS be its generating set. The length of SS\SS is the smallest number kk such that 𝒜{\cal A} equals the 𝔽{\mathbb{F}}-linear span of all products of length at most kk of elements from SS\SS. The length of 𝒜{\cal A}, denoted by l(𝒜)l({\cal A}), is defined to be the maximal length of its generating set. In this paper, it is shown that the l(𝒜)l({\cal A}) does not exceed the maximum of dim𝒜/2\dim{\cal A}/2 and m(𝒜)1m({\cal A})-1, where m(𝒜)m({\cal A}) is the largest degree of the minimal polynomial among all elements of the algebra 𝒜{\cal A}. For arbitrary odd nn, it is proven that the length of the group algebra of the dihedral group of order 2n2n equals nn.

:
primary 16S34; secondary 20C05, 20C30
keywords:
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 𝒜{\cal A}.

Let 𝒜{\cal A} be an algebra. Any product of a finite number of elements from a finite subset SS𝒜\SS\subset{\cal A} is called a word over the alphabet SS\SS. The length of a word equals the number of letters in this product that are different from 1𝒜1_{{\cal A}}. We consider 1𝒜1_{{\cal A}} to be an empty word of length 0.

If SS\SS is a generating system (or a generating set) of the algebra 𝒜{\cal A}, i.e., 𝒜{\cal A} is the minimal subalgebra of 𝒜{\cal A} containing SS\SS, then any element of the algebra 𝒜{\cal A} can be expressed as a linear combination of words over SS\SS. The minimal kk such that all elements of 𝒜{\cal A} can be expressed using words of length no more than kk is called the length of the generating system SS\SS. The length of the algebra 𝒜{\cal A} is defined as the maximum length among its generating systems and will be denoted by l(𝒜)l({\cal A}) (see definition 2.4). In defining the length of algebra 𝒜{\cal A}, we consider the set of all generating systems for 𝒜{\cal A}. 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 Mn(𝔽)M_{n}({\mathbb{F}}) over a field in Paz and still remains open.

Conjecture 1.1 (Paz ).

Let 𝔽{\mathbb{F}} be an arbitrary field. Then l(Mn(𝔽))=2n2.l(M_{n}({\mathbb{F}}))=2n-2.

A nontrivial upper bound on l(𝒜)l({\cal A}) in terms of dim𝒜\dim{\cal A} and m(𝒜)m({\cal A}) (the largest degree of the minimal polynomial among all elements of the algebra 𝒜{\cal A}) 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 S3S_{3}, Klein four-group K4K_{4}, and quaternion group Q8Q_{8}, 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 2k2^{k} 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, l(𝔽𝒟n)l({\mathbb{F}}\mathcal{D}_{n}) and m(𝔽𝒟n)m({\mathbb{F}}\mathcal{D}_{n}) are estimated.

2 Main Definitions and Notations

Denote by S\langle S\rangle the linear span (the set of all finite linear combinations with coefficients from 𝔽{\mathbb{F}}) of a subset SS of some vector space over 𝔽{\mathbb{F}}.

Let B={b1,,bm}B=\{b_{1},\ldots,b_{m}\} be a non-empty finite set (alphabet). Finite sequences of letters from BB are called words. Let BB^{*} denote the set of all words in the alphabet BB, FBF_{B} be the free semigroup over the alphabet BB, i.e. BB^{*} with the operation of concatenation.

Definition 2.1.

The length of the word bi1bitb_{i_{1}}\ldots b_{i_{t}}, where bijBb_{i_{j}}\in B, is equal to tt. We will consider 11 (the empty word) a word from the elements BB of length 0.

Let BiB^{i} denote the set of all words in the alphabet BB of length no greater than ii, i0i\geq 0. Then by B=iB^{=i} denote the set of all words in the alphabet BB of length equal to ii, i1i\geq 1.

Remark 2.2.

Products of elements from the generating set SS\SS can be considered as images of elements of the free semigroup FSSF_{\SS} under the natural homomorphism, and they can also be called words from the generators and use the natural notations SSi\SS^{i} and SS=i\SS^{=i}.

Denote by i(SS){\cal L}_{i}(\SS) the linear span of words from SSi\SS^{i}. Note that 0(SS)=1𝒜=𝔽{\cal L}_{0}(\SS)=\langle 1_{{\cal A}}\rangle={\mathbb{F}}. Let also (SS)=i=0i(SS){\cal L}(\SS)=\bigcup\limits_{i=0}^{\infty}{\cal L}_{i}(\SS) denotes the linear span of all words in the alphabet SS={a1,,ak}\SS=\{a_{1},\ldots,a_{k}\}.

Definition 2.3.

The length of a generating system SS\SS of algebra 𝒜{\cal A} is l(SS)=min{k+:k(SS)=𝒜}l(\SS)=\min\{k\in{\mathbb{Z}}_{+}:{\cal L}_{k}(\SS)={\cal A}\}.

Definition 2.4.

The length of an algebra 𝒜{\cal A} is l(𝒜)=max{l(SS):(SS)=𝒜}l({\cal A})=\max\{l(\SS):{\cal L}(\SS)={\cal A}\}.

Let 𝒜{\cal A} be an algebra, τ𝒜\tau\in{\cal A}. Denote the minimal polynomial of τ\tau by μτ(x)\mu_{\tau}(x). Then m(τ)=degμτ(x)m(\tau)=\deg\mu_{\tau}(x), m(𝒜)=maxτ𝒜m(τ)m({\cal A})=\max_{\tau\in{\cal A}}m(\tau).

Denote by 𝔽G{\mathbb{F}}G or 𝔽[G]{\mathbb{F}}[G] the group algebra of the group GG over the field 𝔽{\mathbb{F}}, Ei,jE_{i,j} for the matrix unit, 𝒟n\mathcal{D}_{n} for the dihedral group of order 2n2n, SnS_{n} for the symmetric group.

Definition 2.5.

We say that two words uu and vv of length ii from the generators are equivalent, if uαvi1(SS)u-\alpha v\in{\cal L}_{i-1}(\SS) for some nonzero α𝔽\alpha\in{\mathbb{F}}. We will use the notation uvu\sim v in this case.

Definition 2.6.

We say that a word uu of length ii from the generators reducible if ui1(SS)u\in{\cal L}_{i-1}(\SS). 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. uαui1(SS)u-\alpha u\in{\cal L}_{i-1}(\SS) with α=1.\alpha=1.

Symmetry. Let uαvi1(SS)u-\alpha v\in{\cal L}_{i-1}(\SS). Then, by multiplying the element uαvu-\alpha v by α1-\alpha^{-1}, we get vα1ui1(SS).v-\alpha^{-1}u\in{\cal L}_{i-1}(\SS).

Transitivity. Let uα1vi1(SS)u-\alpha_{1}v\in{\cal L}_{i-1}(\SS), vα2wi1(SS)v-\alpha_{2}w\in{\cal L}_{i-1}(\SS). Then, by adding the second element multiplied by α1\alpha_{1} to the first one, we obtain uα1α2wi1(SS).u-\alpha_{1}\alpha_{2}w\in{\cal L}_{i-1}(\SS).

Lemma 3.2.

Let uvu\sim v. Then uu is reducible if and only if vv is reducible.

Proof.

Straightforward.

Lemma 3.3.

Let the word uu be irreducible. Then any subword of uu is irreducible.

Proof.

Straightforward.

Lemma 3.4.

Let the word ww of length ii contain a subword uu of length jj, uvu\sim v. Then www\sim w^{\prime}, where ww^{\prime} is a word obtained from ww by replacing the subword uu with the subword vv.

Proof.

By condition, uαvj1(SS)u-\alpha v\in{\cal L}_{j-1}(\SS), w=w1uw2w=w_{1}uw_{2}, for some words w1w_{1}, w2w_{2}. Then, by multiplying the expression uαvu-\alpha v on the left by w1w_{1} and on the right by w2w_{2}, we get wαwi1(SS).w-\alpha w^{\prime}\in{\cal L}_{i-1}(\SS).

3.2 Estimating l(𝒜)l({\cal A}) Using dim𝒜\dim{\cal A} and m(𝒜)m({\cal A})

Theorem 3.5.

Let 𝒜{\cal A} be an associative finite-dimensional algebra with an identity. Then

l(𝒜)max{m(𝒜)1,dim𝒜2}.l({\cal A})\leq max\{m({\cal A})-1,\frac{\dim{\cal A}}{2}\}.
Proof.

Let l(𝒜)m(𝒜)l({\cal A})\geq m({\cal A}) (otherwise the statement is proven). Let SS\SS be a generating set of length l(𝒜)l({\cal A}) of the algebra 𝒜{\cal A} (in the case of other generating sets the length of the algebra will be no greater). Consider an irreducible word a1a2al(𝒜)a_{1}a_{2}\cdots a_{l({\cal A})} of length l(𝒜)l({\cal A}) in the alphabet SS\SS (such exists by definition of the length of the algebra). We will prove that k[1,l(𝒜)1]\forall k\in[1,l({\cal A})-1] it holds that dimk(SS)dimk1(SS)2.\dim{\cal L}_{k}(\SS)-\dim{\cal L}_{k-1}(\SS)\geq 2.

We will reason by contradiction. Suppose k[1,l(𝒜)1]\exists k\in[1,l({\cal A})-1] such that dimk(SS)dimk1(SS)=1\dim{\cal L}_{k}(\SS)-\dim{\cal L}_{k-1}(\SS)=1 (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 a1a2al(𝒜)a_{1}a_{2}\cdots a_{l({\cal A})} is irreducible. Therefore, its subword a1a2aka_{1}a_{2}\cdots a_{k} is irreducible by Lemma 3.3. By assumption a2a3ak+1a1a2aka_{2}a_{3}\cdots a_{k+1}\sim a_{1}a_{2}\cdots a_{k} (here we use the fact that kk is no greater than l(𝒜)1l({\cal A})-1). Indeed, if this were not the case, we would get dimk(SS)dimk1(SS)2\dim{\cal L}_{k}(\SS)-\dim{\cal L}_{k-1}(\SS)\geq 2, since the dimension would increase by at least 2 due to these two words. Thus, a1a2al(𝒜)a2a3akak+1ak+1ak+2al(𝒜)a_{1}a_{2}\cdots a_{l({\cal A})}\sim a_{2}a_{3}\cdots a_{k}a_{k+1}a_{k+1}a_{k+2}\cdots a_{l({\cal A})} by Lemma 3.4. Therefore, the word a2a3akak+1ak+1ak+2al(𝒜)a_{2}a_{3}\cdots a_{k}a_{k+1}a_{k+1}a_{k+2}\cdots a_{l({\cal A})} is irreducible.

Second step. Now consider the irreducible word a2a3akak+1ak+1ak+2al(𝒜)a_{2}a_{3}\cdots a_{k}a_{k+1}a_{k+1}a_{k+2}\cdots a_{l({\cal A})} of length l(𝒜)l({\cal A}) obtained in the previous step. By reasoning similarly (considering subwords of length kk starting from the first and second letters), we will get rid of the letter a2a_{2} similarly to how we got rid of the letter a1a_{1} in the first step. We obtain that the word a3a4akak+1ak+1ak+1ak+2al(𝒜)a_{3}a_{4}\cdots a_{k}a_{k+1}a_{k+1}a_{k+1}a_{k+2}\cdots a_{l({\cal A})} is irreducible.

After conducting kk steps of this reasoning, we obtain that the word ak+1ak+1ak+2al(𝒜)a_{k+1}\cdots a_{k+1}a_{k+2}\cdots a_{l({\cal A})} of length l(𝒜)l({\cal A}) is irreducible. Now we can proceed to the last step and obtain a contradiction.

(k+1)(k+1)-st step. The word ak+1k+1ak+2al(𝒜)a_{k+1}^{k+1}a_{k+2}\cdots a_{l({\cal A})} is irreducible. Therefore, its subword ak+1ka_{k+1}^{k} is irreducible. By assumption, all words of length kk are expressed through the word ak+1ka_{k+1}^{k} and words of shorter length. Thus, a1a2al(𝒜)ak+1l(𝒜)a_{1}a_{2}\cdots a_{l({\cal A})}\sim a_{k+1}^{l({\cal A})}. Therefore, the word ak+1l(𝒜)a_{k+1}^{l({\cal A})} is irreducible and l(𝒜)<m(𝒜)l({\cal A})<m({\cal A}). Contradiction.

We return to the proof of the main statement. Represent the dimension of the algebra in the following form dim𝒜=diml(𝒜)(SS)=(diml(𝒜)(SS)diml(𝒜)1(SS))+(diml(𝒜)1(SS)diml(𝒜)2(SS))++(dim1(SS)dim0(SS))+dim0(SS)\dim{\cal A}=\dim{\cal L}_{l({\cal A})}(\SS)=(\dim{\cal L}_{l({\cal A})}(\SS)-\dim{\cal L}_{l({\cal A})-1}(\SS))+(\dim{\cal L}_{l({\cal A})-1}(\SS)-\dim{\cal L}_{l({\cal A})-2}(\SS))+\cdots+(\dim{\cal L}_{1}(\SS)-\dim{\cal L}_{0}(\SS))+\dim{\cal L}_{0}(\SS). 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, dim𝒜1+2(l(𝒜)1)+1\dim{\cal A}\geq 1+2(l({\cal A})-1)+1. Therefore, l(𝒜)dim𝒜2l({\cal A})\leq\frac{\dim{\cal A}}{2}. Thus, l(𝒜)max{m(𝒜)1,dim𝒜2}.l({\cal A})\leq max\{m({\cal A})-1,\frac{\dim{\cal A}}{2}\}.

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 𝒜\mathcal{A} be an 𝔽{\mathbb{F}}-algebra, dim𝒜m(𝒜)+4\dim\mathcal{A}\leq m(\mathcal{A})+4, m(𝒜)3m({\mathcal{A}})\geq 3. Then l(𝒜)m(𝒜)l(\mathcal{A})\leq m(\mathcal{A}).

Since m(𝒜)1m({\cal A})-1 is unequivocally less than m(𝒜)m({\cal A}), we see that the new estimate will be worse than the estimate from Lemma 3.6 only if dim𝒜2m(𝒜)+1\dfrac{\dim{\cal A}}{2}\geq m({\cal A})+1 (that is, if dim𝒜2m(𝒜)+2\dim{\cal A}\geq 2m({\cal A})+2). Also, by the condition of Lemma 3.6 it must be fulfilled that dim𝒜m(𝒜)+4\dim\mathcal{A}\leq m(\mathcal{A})+4. From the last two inequalities, it follows that m(𝒜)2m({\cal A})\leq 2. But in the condition of Lemma 3.6 it is also required that m(𝒜)3m({\mathcal{A}})\geq 3. 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 𝒜{\cal A} be any algebra. Then l(𝒜)<f(dim𝒜,m(𝒜))l({\cal A})<f(\dim{\cal A},m({\cal A})), where

f(d,m)=m2dm1+14+m22.f(d,m)=m\sqrt{\frac{2d}{m-1}+\frac{1}{4}}+\frac{m}{2}-2.

Since dim𝒜m(𝒜)1\dim{\cal A}\geq m({\cal A})-1, we have m2dm1+14+m22m94+m22=2m2.m\sqrt{\dfrac{2d}{m-1}+\dfrac{1}{4}}+\dfrac{m}{2}-2\geq m\sqrt{\dfrac{9}{4}}+\dfrac{m}{2}-2=2m-2. Since m(𝒜)1m({\cal A})-1 is less than 2m(𝒜)22m({\cal A})-2, we see that the new estimate will be worse than Pappacena’s estimate only if dim𝒜2>2m(𝒜)2\dfrac{\dim{\cal A}}{2}>2m({\cal A})-2 (that is, if dim𝒜>4(m(𝒜)1)\dim{\cal A}>4(m({\cal A})-1)). 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 m(𝒜)1m({\cal A})-1. 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 dim𝒜4(m(𝒜)1)\dim{\cal A}\leq 4(m({\cal A})-1). Let us show that by the following example.

Example 3.8.

Let 𝒜=M3(𝔽){\cal A}=M_{3}(\mathbb{F}). Then dim𝒜=9\dim{\cal A}=9, m(𝒜)=3m({\cal A})=3. Theorem 3.7 gives an estimate l(𝒜)8l({\cal A})\leq 8. Theorem 3.5 gives an estimate l(𝒜)4l({\cal A})\leq 4, which corresponds to the value l(M3(𝔽))l(M_{3}(\mathbb{F})) in Paz’s conjecture.

4 Calculating l(𝔽𝒟nl({\mathbb{F}}{\cal D}_{n})

4.1 Bicirculant Algebra

Let us consider two matrices. The circulant An=En,1+E1,2++En1,nA_{n}=E_{n,1}+E_{1,2}+\cdots+E_{n-1,n} and the anti-circulant Bn=E1,n++En,1B_{n}=E_{1,n}+\cdots+E_{n,1}.

An=(01000010000000011000),Bn=(00010010000001001000).A_{n}=\begin{pmatrix}0&1&0&\ldots&0\\ 0&0&1&\ldots&0\\ 0&0&0&\ldots&0\\ \vdots&\vdots&\vdots&\ddots&\vdots\\ 0&0&0&\ldots&1\\ 1&0&0&\ldots&0\end{pmatrix},\quad B_{n}=\begin{pmatrix}0&0&\ldots&0&1\\ 0&0&\ldots&1&0\\ \vdots&\vdots&\ddots&\vdots&\vdots\\ 0&0&\ldots&0&0\\ 0&1&\ldots&0&0\\ 1&0&\ldots&0&0\end{pmatrix}.

Let us define the algebra generated by these two matrices.

Definition 4.1.

The algebra of bicirculants of order n over the field 𝔽{\mathbb{F}} is 𝒞n(𝔽)=({An,Bn}){\cal C}_{n}({\mathbb{F}})={\cal L}(\{A_{n},B_{n}\}).

Let us study the structure of this algebra.

Lemma 4.2.

Ann=EA_{n}^{n}=E, Bn2=EB_{n}^{2}=E, AnBn=BnAnn1A_{n}B_{n}=B_{n}A_{n}^{n-1}.

Proof.

The equalities are checked directly by multiplying matrices. ∎

Lemma 4.3.

dim𝒞n(𝔽)={2n2,for evenn;2n1,for oddn.\dim{\cal C}_{n}({\mathbb{F}})=\begin{cases}2n-2,\ \mbox{for even}\;n;\\ 2n-1,\ \mbox{for odd}\;n.\end{cases}

Proof.

Due to Lemma 4.2 we may consider that 𝒞n(𝔽)=𝒞n(𝔽)+𝒞n′′(𝔽){\cal C}_{n}({\mathbb{F}})={\cal C}_{n}^{\prime}({\mathbb{F}})+{\cal C}_{n}^{\prime\prime}({\mathbb{F}}), where 𝒞n(𝔽)=E,An,An2,,Ann1{\cal C}_{n}^{\prime}({\mathbb{F}})=\langle E,A_{n},A_{n}^{2},\dots,A_{n}^{n-1}\rangle, 𝒞n′′(𝔽)=Bn,BnAn,BnAn2,,BnAnn1{\cal C}_{n}^{\prime\prime}({\mathbb{F}})=\langle B_{n},B_{n}A_{n},B_{n}A_{n}^{2},\dots,B_{n}A_{n}^{n-1}\rangle. Note that 𝒞n(𝔽){\cal C}_{n}^{\prime}({\mathbb{F}}) is nothing else but the space of circulants, and 𝒞n′′(𝔽){\cal C}_{n}^{\prime\prime}({\mathbb{F}}) is the space of anti-circulants, each of which has a dimension of nn.

The basis of the intersection of the spaces 𝒞n(𝔽){\cal C}_{n}^{\prime}({\mathbb{F}}) and 𝒞n′′(𝔽){\cal C}_{n}^{\prime\prime}({\mathbb{F}}) 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

(10100101101010100101)and (01011010010101011010).\begin{pmatrix}1&0&1&\ldots&0\\ 0&1&0&\ldots&1\\ 1&0&1&\ldots&0\\ \vdots&\vdots&\vdots&\ddots&\vdots\\ 1&0&1&\ldots&0\\ 0&1&0&\ldots&1\end{pmatrix}\ \mbox{and }\begin{pmatrix}0&1&0&\ldots&1\\ 1&0&1&\ldots&0\\ 0&1&0&\ldots&1\\ \vdots&\vdots&\vdots&\ddots&\vdots\\ 0&1&0&\ldots&1\\ 1&0&1&\ldots&0\end{pmatrix}.

Thus, the statement of the lemma follows from the formula for the dimension of the sum of subspaces. ∎

Theorem 4.4.

l(𝒞n(𝔽))=n1.l({\cal C}_{n}({\mathbb{F}}))=n-1.

Proof.

Let us first prove the lower bound l(𝒞n(𝔽))n1.l({\cal C}_{n}({\mathbb{F}}))\geq n-1. Consider a generating set SS={u,v}\SS=\{u,v\}, where u=Bn,v=AnBnu=B_{n},v=A_{n}B_{n}. This is indeed a generating set, as 𝒞n(𝔽)=({An,Bn})=({vu,u})({u,v})=({Bn,AnBn})({An,Bn})=𝒞n(𝔽){\cal C}_{n}({\mathbb{F}})={\cal L}(\{A_{n},B_{n}\})={\cal L}(\{vu,u\})\subseteq{\cal L}(\{u,v\})={\cal L}(\{B_{n},A_{n}B_{n}\})\subseteq{\cal L}(\{A_{n},B_{n}\})={\cal C}_{n}({\mathbb{F}}). At the same time, u2=v2=Eu^{2}=v^{2}=E, meaning that there are no more than two irreducible words of each length (of the form uvuvuvuv\dots and vuvuvuvu\dots). Thus, dimn2(SS)=(dimn2(SS)dimn3(SS))+(dimn3(SS)dimn4(SS))++(dim1(SS)dim0(SS))+dim0(SS)2(n2)+1<dim𝒞n(𝔽)\dim{\cal L}_{n-2}(\SS)=(\dim{\cal L}_{n-2}(\SS)-\dim{\cal L}_{n-3}(\SS))+(\dim{\cal L}_{n-3}(\SS)-\dim{\cal L}_{n-4}(\SS))+\cdots+(\dim{\cal L}_{1}(\SS)-\dim{\cal L}_{0}(\SS))+\dim{\cal L}_{0}(\SS)\leq 2(n-2)+1<\dim{\cal C}_{n}({\mathbb{F}}), from which it follows that the length of the algebra is at least n1n-1.

The upper bound l(𝒞n(𝔽))n1l({\cal C}_{n}({\mathbb{F}}))\leq n-1 follows from Theorem 3.5. Indeed, by the Cayley-Hamilton theorem, m(𝒞n(𝔽))nm({\cal C}_{n}({\mathbb{F}}))\leq n. By Lemma 4.3, dim𝒞n(𝔽)2n1\dim{\cal C}_{n}({\mathbb{F}})\leq 2n-1. Applying Theorem 3.5, we obtain the inequality l(𝒞n(𝔽))max{n1,2n12}l({\cal C}_{n}({\mathbb{F}}))\leq max\{n-1,\frac{2n-1}{2}\}. This completes the proof.

4.2 Bicirculant Representation of 𝔽𝒟n{\mathbb{F}}{\cal D}_{n}

Let us number the vertices of a regular nn-gon. Let d𝒟nd\in{\cal D}_{n} map the vertex ii to the vertex σ(i)\sigma(i) i\forall i, where σSn\sigma\in S_{n}. Then we can consider a group homomorphism, defining its values on elements of 𝒟n{\cal D}_{n} by the rule f(d)=σf(d)=\sigma, and then extend it to an algebra homomorphism f:𝔽𝒟n𝔽Snf:{\mathbb{F}}{\cal D}_{n}\rightarrow{\mathbb{F}}S_{n} by linearity.

Let us now consider a group homomorphism g:SnMn({0,1})g:S_{n}\rightarrow M_{n}(\{0,1\}), which maps a permutation from SnS_{n} into the corresponding permutation matrix. We extend it to an algebra homomorphism g:𝔽SnMn(𝔽)g:{\mathbb{F}}S_{n}\rightarrow M_{n}({\mathbb{F}}) by linearity.

Note that the composition gfg\circ f defines a linear representation of the algebra 𝔽𝒟n{\mathbb{F}}{\cal D}_{n}. This representation is called the bicirculant representation in this paper. Let us study some properties of this composition.

Lemma 4.5.

Imgf=𝒞n(𝔽){\rm Im}\,g\circ f={\cal C}_{n}({\mathbb{F}}).

Proof.

Let aa be the rotation by an angle 2πn\frac{2\pi}{n}, bb be the symmetry about the axis passing through the vertex [n2]+1\left[\dfrac{n}{2}\right]+1. Then 𝔽𝒟n=e,a,a2,,an1,b,ba,,ban1{\mathbb{F}}{\cal D}_{n}=\langle e,a,a^{2},\dots,a^{n-1},b,ba,\dots,ba^{n-1}\rangle.

It is easy to notice that gf(a)=Ang\circ f(a)=A_{n}, gf(b)=Bng\circ f(b)=B_{n}. Since gfg\circ f is a homomorphism, gf(biaj)=BniAnjg\circ f(b^{i}a^{j})=B_{n}^{i}A_{n}^{j}, from which the statement of the lemma follows. ∎

Lemma 4.6.

kergf=e+a++an1bbaban1\ker g\circ f=\langle e+a+\cdots+a^{n-1}-b-ba-\cdots-ba^{n-1}\rangle, for odd n. kergf=e+a2++an2bba2ban2,a+a3++an1baba3ban1\ker g\circ f=\langle e+a^{2}+\cdots+a^{n-2}-b-ba^{2}-\cdots-ba^{n-2},a+a^{3}+\cdots+a^{n-1}-ba-ba^{3}-\cdots-ba^{n-1}\rangle, for even n.

Proof.

The dimension of the kernel is established using Lemmas 4.3 and 4.5. The fact that the specified elements lie in the kernel and are linearly independent (in the case of even nn) is checked directly. ∎

4.3 Length of 𝔽𝒟n{\mathbb{F}}{\cal D}_{n}

First, let us present known results about the length of 𝔽𝒟n{\mathbb{F}}{\cal D}_{n}.

Lemma 4.7 ((KhMar20, , Lemma 2.1)).

Let 𝒟n{\cal D}_{n} be the dihedral group of order 2n2n, n3n\geq 3, 𝔽{\mathbb{F}} be an arbitrary field. Then l(𝔽𝒟n)nl({\mathbb{F}}{\cal D}_{n})\geq n.

Theorem 4.8 ((KhMar20, , Theorem 1.15)).

Let 𝔽{\mathbb{F}} be a field such that char𝔽{\rm char}\,{\mathbb{F}} does not divide 2n2n. Then l(𝔽𝒟n)=nl({\mathbb{F}}{\cal D}_{n})=n, for n3n\geq 3.

Theorem 4.9 ((KhMar20POMI, , Theorem 4.10)).

Let char𝔽=2{\rm char}\,{\mathbb{F}}=2, k2k\geq 2. Then l(𝔽𝒟2k)=2kl({\mathbb{F}}{\cal D}_{2^{k}})=2^{k}.

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 n3n\geq 3.

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 φ:𝒜\varphi:\cal A\rightarrow\cal B. Then

l(𝒜)l()+dim𝒜dim.l(\mathcal{A})\leq l(\mathcal{B})+\dim\mathcal{A}-\dim\cal B.
Proof.

Consider an arbitrary generating set SS={a1,,ak}\SS=\{a_{1},\dots,a_{k}\} of the algebra 𝒜{\cal A}.

Since the homomorphism φ\varphi is surjective, we see that the set SS={c1=φ(a1),,ck=φ(ak)}\SS_{\mathcal{B}}=\{c_{1}=\varphi(a_{1}),\dots,c_{k}=\varphi(a_{k})\} is a generating set of the algebra \mathcal{B}. Therefore, diml()(SS)=dim\dim{\cal L}_{l(\mathcal{B})}(\SS_{{\cal B}})=\dim{\cal B}. On the other hand, l()(SS)=l()(φ(SS))=φ(l()(SS)){\cal L}_{l({\cal B})}(\SS_{{\cal B}})={\cal L}_{l({\cal B})}(\varphi(\SS))=\varphi({\cal L}_{l({\cal B})}(\SS)). Therefore, diml()(SS)dimφ(l()(SS))=diml()(SS)=dim\dim{\cal L}_{l({\cal B})}(\SS)\geq\dim\varphi({\cal L}_{l({\cal B})}(\SS))=\dim{\cal L}_{l({\cal B})}(\SS_{{\cal B}})=\dim{\cal B}.

Since the dimensions i(SS){\cal L}_{i}(\SS) must increase with ii until stabilization, we have diml()+dim𝒜dim(SS)dim+(dim𝒜dim)=dim𝒜\dim{\cal L}_{l({\cal B})+\dim{\cal A}-\dim{\cal B}}(\SS)\geq\dim{\cal B}+(\dim{\cal A}-\dim{\cal B})=\dim{\cal A}. At the same time, the minimal ii such that dimi(SS)=dim𝒜\dim{\cal L}_{i}(\SS)=\dim{\cal A}, by definition, is l(SS)l(\SS). Due to the arbitrariness of SS\SS, we obtain l(𝒜)l()+dim𝒜diml(\mathcal{A})\leq l(\mathcal{B})+\dim\mathcal{A}-\dim\cal B.

Theorem 4.11.

Let 𝒟n{\cal D}_{n} be the dihedral group of order 2n2n, n3n\geq 3, 𝔽{\mathbb{F}} be an arbitrary field. Then
l(𝔽𝒟n)={n,for oddn;norn+1,for evenn.l({\mathbb{F}}{\cal D}_{n})=\begin{cases}n,\ \mbox{for odd}\;n;\\ n\ \mbox{or}\;n+1,\ \mbox{for even}\;n.\end{cases}

Proof.

The lower bound is given by Lemma 4.7. Let us prove the upper bound.

From Theorem 4.4 it follows that l(𝒞n(𝔽))=n1l({\cal C}_{n}({\mathbb{F}}))=n-1. From Lemma 4.3 it follows that dim𝒞n(𝔽)=2n1\dim{\cal C}_{n}({\mathbb{F}})=2n-1 for odd nn, dim𝒞n(𝔽)=2n2\dim{\cal C}_{n}({\mathbb{F}})=2n-2 for even nn. Consider the homomorphism of algebras gf:𝔽𝒟n𝒞n(𝔽)g\circ f:{\mathbb{F}}\mathcal{D}_{n}\rightarrow{\cal C}_{n}({\mathbb{F}}), described in Section 4.2. Since by Lemma 4.5 the homomorphism gfg\circ f is surjective, we can apply Lemma 4.10 and get the upper bound l(𝔽𝒟n)l(𝒞n(𝔽))+dim𝔽𝒟ndim𝒞n(𝔽)l({\mathbb{F}}\mathcal{D}_{n})\leq l({\cal C}_{n}({\mathbb{F}}))+\dim{\mathbb{F}}\mathcal{D}_{n}-\dim{\cal C}_{n}({\mathbb{F}}). Then application of Theorem 4.4, Lemma 4.3 and the fact that dim𝔽𝒟n=2n\dim{\mathbb{F}}\mathcal{D}_{n}=2n completes the proof.

Remark 4.12.

Despite the fact that among the possible values of l(𝔽𝒟n)l({\mathbb{F}}{\cal D}_{n}) there is n+1n+1, 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 nn, 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 m(𝔽𝒟n)m({\mathbb{F}}{\cal D}_{n})

Using the bicirculant representation, we get an estimate of m(𝔽𝒟n)m({\mathbb{F}}{\cal D}_{n}).

Theorem 4.13.

Let 𝒟n{\cal D}_{n} be the dihedral group of order 2n2n, n3n\geq 3, 𝔽{\mathbb{F}} be an arbitrary field. Then
m(𝔽𝒟n){n+1,for oddn;n+2,for evenn.m({\mathbb{F}}{\cal D}_{n})\leq\begin{cases}n+1,\ \mbox{for odd}\;n;\\ n+2,\ \mbox{for even}\;n.\end{cases}

Proof.

Let τ𝔽𝒟n\tau\in{\mathbb{F}}{\cal D}_{n}, gf:𝔽𝒟n𝒞n(𝔽)g\circ f:{\mathbb{F}}\mathcal{D}_{n}\rightarrow{\cal C}_{n}({\mathbb{F}}) be the homomorphism of algebras described in Section 4.2, aa be the rotation by an angle 2πn\frac{2\pi}{n}, bb be the symmetry.

Let gf(τ)=TMn(𝔽)g\circ f(\tau)=T\in M_{n}({\mathbb{F}}). Then by the Cayley-Hamilton theorem m(T)=degμT(x)nm(T)=\deg\mu_{T}(x)\leq n. Since gf(μT(τ))=μT(T)=0g\circ f(\mu_{T}(\tau))=\mu_{T}(T)=0, we get μT(τ)kergf\mu_{T}(\tau)\in\ker g\circ f. Next, consider two cases separately.

First case. Let nn be odd. Then from Lemma 4.6 it follows that kergf\ker g\circ f is one-dimensional. On the other hand, the kernel of a homomorphism of algebras is an ideal, which means μT(τ)\mu_{T}(\tau) and μT(τ)τ\mu_{T}(\tau)\tau are linearly dependent. Thus, m(𝔽𝒟n)n+1m({\mathbb{F}}{\cal D}_{n})\leq n+1.

Second case. Let nn be even. Then from Lemma 4.6 it follows that kergf\ker g\circ f is two-dimensional. On the other hand, the kernel of a homomorphism of algebras is an ideal, which means μT(τ)\mu_{T}(\tau), μT(τ)τ\mu_{T}(\tau)\tau, and μT(τ)τ2\mu_{T}(\tau)\tau^{2} are linearly dependent. Thus, m(𝔽𝒟n)n+2m({\mathbb{F}}{\cal D}_{n})\leq n+2.

Remark 4.14.

The main conjecture regarding the lengths of group algebras in the case of dihedral groups is that l(𝔽𝒟n)=nl({\mathbb{F}}{\cal D}_{n})=n for all n3n\geq 3 over an arbitrary field. Due to Theorem 3.5, to prove the conjecture, it is sufficient to obtain an estimate m(𝔽𝒟n)n+1m({\mathbb{F}}{\cal D}_{n})\leq n+1. However, using an estimate from Theorem 4.13, we get the same result as presented in Theorem 4.11. Nevertheless, estimating m(𝔽𝒟n)m({\mathbb{F}}{\cal D}_{n}) 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 2k2^{k}. — 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 𝐐8{\mathbf{Q}_{8}}. — 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.