Stability of the centers of the symplectic groups rings $\matbb{Z}[Sp_{2n}(q)]$
Safak Ozden

TL;DR
This paper studies the structure constants of the center of the group algebra of symplectic groups over finite fields, showing their independence from the group size and analyzing centralizer growth under embeddings.
Contribution
It proves the independence of structure constants from group size for the filtered algebra associated with symplectic groups and determines the growth of centralizers under embeddings.
Findings
Structure constants are independent of n.
Centralizer index formula under embeddings.
Growth of centralizers in symplectic groups.
Abstract
We investigate the structure constants of the center of the group algebra over a finite field. The reflection length on the group induces a filtration on the algebras . We prove that the structure constants of the associated filtered algebra are independent of . As a technical tool in the proof, we determine the growth of the centralizers under the embedding and we show that the index of the centralizer of in the centralizer of is equal to for some and which are uniquely determined by the conjugacy class of in
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.
Taxonomy
TopicsFinite Group Theory Research ยท Advanced Algebra and Geometry ยท Coding theory and cryptography
Stability of the center of the symplectic group rings over finite fields
ลafak รzden111Address: Weigandufer 7, 12045, Berlin. email: [email protected].
Abstract.
We investigate the structure constants of the center of the group algebra over the finite field with elements. The reflection length on the group induces a filtration on the algebras . We prove that the structure constants of the associated filtered algebra are independent of . As a technical tool in the proof, we determine the growth of the centralizers under the embedding and we show that the index of in is equal to for some and which are uniquely determined by the conjugacy classes of and in
ลafak รzden222Address: Weigandufer 7, 12045, Berlin. email: [email protected].
Contents
-
2.1 Center of the group rings and uniformly saturated families of groups
-
3 The uniformly saturated family and the work of Wan and Wang
-
3.5 Reflection length, modified type and the main theorems of Wan and Wang
1. Introduction
Let be a family of finite groups and let denote the center of the group algebra for . The set of conjugacy classes of is denoted by . For , the class sum is denoted by . The class sums , , form a basis for . We introduce the term saturated family to refer to the families for which non-conjugate elements of remain non-conjugate in . Assume that the family is saturated. The embedding induces an injection . Let be the union of . For each , the intersection is either empty or an element of , and every element of can be represented as such an intersection. Given three elements , , in there is an such that for all , each of , , are nonempty. So, for fixed and , the product can be written as
[TABLE]
where , in which is uniquely determined as . For a fixed , the collection of , where runs over , are called the structure constants of the algebra . We will call the functions the structure functions of the family. If is an valued function on which is constant on conjugacy classes then induces a function on as well. In this case, if the function is also sub-additive, in the sense that , and if is invariant under the embedding then the algebra induces a filtered algebra with the same basis elements, where the multiplication is defined as
[TABLE]
When the structure functions defined via Eq.(1) of the filtered algebra of a family are independent of , following Wan and Wang [20], we will say that the family satisfies the stability property.
For , let denote the symmetric group of the set . Farahat and Higman considered the family in [6] and proved that with respect to the filtration induced by reflection length, the structure constants of the induced filtered algebra structure on are independent of . They used this result to answer the question of determining whether two representations of belong to the same -block. In [21], as a generalization of the case considered by Farahat and Higman, Wang proved that the families given by the wreath product , where is a finite group, satisfy the stability property. In the case studied by Wang, when the group is a finite subgroup of , the associated graded algebra of is isomorphic to the cohomology ring of Hilbert scheme of -points on the minimal resolution of . Recently, in [20], Wan and Wang considered the family and proved that this family also satisfies the stability property with respect to the filtration induced by reflection length. The result of Wan and Wang was also obtained by P.-L. Mรฉliot in [13].
In this paper we study the family of symplectic groups over the finite field with elements. We introduce the set of modified symplectic partition valued functions and prove that these functions parameterize the conjugacy classes of and that the family is saturated. We consider the filtration induced from the reflection length in . The set of reflections generate and for , the minimum value of where can be written as a product of many reflections is called the reflection length of and denoted by . It is constant on conjugacy classes, sub-additive function and stable under the embedding . Therefore, for a stabilized symplectic partition valued function , one can talk about . With this setting, the main result is following.
Theorem** (Stability property).**
[Theorem 4.30] Let , be three stabilized symplectic partition valued functions and assume that . Then is a non-negative integer independent of .
We observe that all the stability properties proved so far rely on two fundamental facts: A certain action admits finitely many orbits and certain splitting of the centralizers. More precisely, in each case one first proves that a pair can be mapped to by simultaneous conjugation, where is a fixed integer completely determined by the conjugacy classes of and . To prove such a result, one needs to find a so-called normal form, a formulation introduced in [20]. We will refer to the existence of normal forms as normal form theorems. Secondly, one shows that the centralizer of "splits" in the centralizer of in for , which we will call the growth of centralizers.
In the case of symplectic groups, finding a normal form can be derived from the case of general linear groups. However, the investigation of the growth of centralizers in the case of symplectic group is more complicated than the case of general linear groups, as it consists of non-linear equations. To overcome this obstacle, we first introduce a concept called primitive symplectic centralizer, and using suitable rational forms we investigate the elements in the centralizers of a unipotent element and then invoke the concept of primitive symplectic centralizer to reduce the question of centralizer growth to a linear question. Once the degree 2 problem is reduced to a linear problem the problem becomes much more manageable. The simplified versions of these results (Proposition 5.38 and Proposition 5.41) are packed into the following:
Theorem** (Growth of centralizers).**
Let and be the dimension of the fixed space of , c.f. Eq, (25). Assume that there is no identity block in the Jordan form of . Then for the following equalities hold:
[TABLE]
If , where denotes the reflection length, then
[TABLE]
It is worth to mention a generalized approach to the center of the integral group rings. Namely, in terms of Gelโfand pairs. Recall that a pair of finite groups is called a Gelโfand pair, if the convolution algebra
[TABLE]
of the -valued functions on that are invariant on the -double cosets of is commutative. Let be a finite group. If one considers the pair where then there is a -algebra isomorphism
[TABLE]
For details on this isomorphism, see [5, Proposition 1.5.22]. For an extensive study on Gelโfand pairs related to symmetric groups see [4]. Relying on this observation, one can generalize the concepts discussed earlier.
First notice that, the analogous basis elements in this case are given by the characteristic functions on -double cosets of . More precisely, if denotes the set of -double cosets of , the elements
[TABLE]
is an element of and the set constitute a basis for . This means, if are fixed, then for all , there exists unique such that
[TABLE]
Consider a sequence of groups and a family of subgroups . Let (resp. ) be the direct limit of โs (resp. โs). Then . Let (resp. ) be the Hecke algebra corresponding to (resp. ). Each double coset of in extends to a unique double coset in . If every distinct double cosets in remains distinct in , then we say that the family is saturated.
Let (resp ) denote the set of double cosets of (resp. ) in (resp. ) and . If -double cosets of is -saturated than . For , one can then define for in a similar way and introduce the structural functions satisfying
[TABLE]
In this setting, study of the structure constants of saturated families of pairs makes sense. The saturated family and its structure constants are investigated in the papers [1], [3] and [17]. It turns out that, this family also satisfy the stability property, i.e. the structural functions corresponding to the top coefficients with respect to a suitable filtration are independent of . For a detailed study of the pair see [4].
Finally, we recall the Frobenious formula which justifies the attention on the structure constants of the center of the integral group rings. The proof of the following theorem can be found in the appendix of [11]:
Theorem** (Frobenious formula).**
Let be three conjugacy classes of a finite group and let be the conjugacy which consists of elements where . Then
[TABLE]
where the sum taken over irreducible characters of .
For an analogue of the Frobenious formula in the setting of Gelโfand pairs, see [18]
Acknowladgements. I would like to express my deepest gratitude to Professor Weiqiang Wang. He has shown great generosity with both his time and expertise throughout the project. I also thank Professor Jinkui Wan for her invaluable comments and feedback that I have benefited a lot while finalizing the work. My special thanks are to Professors Brian Conrad, Karl Hofmann and Kazim Bรผyรผkboduk for their great support.
2. Notations and preliminaries
In this chapter, we first introduce the notion of saturated family of groups and then present a systematic way of calculating structure constants in the center. In the subsequent sections, we introduce a ring, so called Farahat-Higman ring and summarize the work of Farahat and Higman.
2.1. Center of the group rings and uniformly saturated families of groups
Let be a group. Two elements are said to be conjugate or similar, if there exists such that . The similarity relation is an equivalence relation and it is denoted by . The conjugacy class of an element is denoted by and the set of conjugacy classes of is denoted by . If and representing the conjugacy class of , then we say that type of is . The center of the group algebra is denoted by . If , then the class sum
[TABLE]
is an element of . As ranges over , the elements form a basis of and the non-negative integers defined via the equation
[TABLE]
are called the structure constants of . For the fiber of in is denoted by and defined by
[TABLE]
Lemma 2.1**.**
Let and . Then
[TABLE]
In particular, .
Proof.
The first equality follows from the definition of the structure constants and the basis elements . In fact, the coefficient is equal to the coefficient of in the expansion of the product
[TABLE]
and it is equal to the number couples which satisfy . Therefore equals to the number of elements in , which proves the first equality. The second equality follows from the first one and the set theoretic equality
[TABLE]
for . โ
Let be an ascending chain of finite groups and let be the union of , for . If and , then the image of in is denoted by . The family is said to be saturated if for all and for all .
[TABLE]
In other words, the family is said to be saturated if for all , two non-conjugate elements in remains non-conjugate in . For a fixed saturated family , the algebra is simply denoted by henceforth.
Lemma 2.2**.**
Let be a saturated family of finite groups. The association defines an injection for all , thus defines a direct system. Moreover
[TABLE]
Proof.
The fact that follows directly from (10). As each conjugacy class of is uniquely determined by an element and each such element is contained in for some the natural map
[TABLE]
is onto. As this map is induced by the limit of injective maps, it is also injective. Hence it is bijective. โ
Now we introduce some abstract notation which will have concrete meanings in each case that will be covered in the later sections. Fix a saturated family . If then the image of in is denoted by . The element is called the modification of , and elements of are called a modified types. Let be a fixed modified type. The intersection , if non-empty, determines a conjugacy class in . The minimal integer for which is called the level of . If then the equality
[TABLE]
is a tautological consequence of the definitions. Let be a modified type. The element , where is the level of , is called the completion of and denoted by . For , the induced element is denoted by and called the -th completion. It is clear that is equal to the image of in and they are both equal to . The corresponding basis element (cf. Eq.(6)) of determined by is denoted by instead of .
Let be three modified types and let Then for all , all the three intersections , , are non-empty and determine elements of . This means, one can form the multiplication in for all and consider the coefficient of . We will call the resulting functions
[TABLE]
the structural functions of .
Remark 2.3**.**
Using Lemma 2.1, we know that
[TABLE]
where . But for . From this, it follows that the structural functions are monotone increasing.
Now we present a certain way of calculating the structural constants, which was introduced by Farahat and Higman in [6] in the context of symmetric groups. Let be a fixed group. acts on with the two-fold simultaneous conjugation: For and we set .
Remark 2.4**.**
Notice that is equal to , which means the fiber is closed under two-fold conjugation, where , and stand for conjugacy classes. In fact, let , i.e. the conjugacy class of is . Then and , thus .
A saturated family of groups will be called finitely saturated if for all the fiber set admits finitely many orbits with respect to the two-fold simultaneous action. We write for . If is an orbit of then indicates the set . A finitely saturated family will be called uniformly saturated if there exists such that for all , the set is a single orbit of simultaneous conjugation action of on .
Next, let be a uniformly saturated family of finite groups and be three stable conjugacy classes in . Assume that is the totality of orbits in , which is finite as the family is uniformly saturated. Set so that for any the intersections and are non-empty and hence they determine elements of . For all the intersection of the fiber with is equal to the disjoint union of and hence it follows that
[TABLE]
Combining Lemma 2.1 and Eq.(14) one can deduce that
[TABLE]
Next we deal with the summands in Eq.(15). Let . As and , the product is an element of . So is equal to the conjugacy class of in , whose size is given by the usual formula:
[TABLE]
where denotes the centralizer of in . On the other hand, the size of is determined by the formula where denotes the stabilizer of of the simultaneous conjugation action of on . But it is clear that the stabilizer of is equal to the intersection . Combining all these, we find that and hence Eq.(15) becomes
[TABLE]
Let us summarize the findings.
Proposition 2.5**.**
Let be a uniformly saturated family of groups. For each triple , , of modified types in , there exists an and a finitely many elements such that
- (1)
for . 2. (2)
For every the structural function satisfies the relation below.
[TABLE]
Each summand on the right hand side of the above equation will be referred as the growth of the centralizer. 3. (3)
By the finiteness of the summation above, the growth of the structural function is determined by the growth of the centralizers
[TABLE]
In particular, if all the functions occurring in Eq.(17) are polynomials in , then the structural function is also a polynomial in .
2.2. Farahat-Higman ring
In this section, we will consider a uniformly saturated family of groups which admits a certain conjugation invariant sub-additive function. More precisely, let be a uniformly saturated family of groups and assume that possesses a length function with the following properties:
- (1)
is stable under the embedding . That is, if and then
[TABLE]
Hence, possesses a length function so that for all . 2. (2)
, and hence , is constant on the conjugacy classes. 3. (3)
, and hence , is sub-additive. That is,
[TABLE]
We will call such a family a filtered uniformly saturated family. Notice that, since is constant on the conjugacy classes, one can transfer the length function to by setting where and is arbitrary. Following [6] we introduce the following algebra defined as follows: Let be filtered uniformly saturated family and assume that the functions are polynomials of for all . Let be the subring of polynomials which maps integers to integers and consider , the free polynomial algebra over the ring with the indeterminates , where the multiplication is defined as
[TABLE]
Notice that the sum is actually a finite sum, and thus, meaningful. This is an associative and commutative ring and the evaluation map induces a surjection from onto . Now using the filtration, we define the induced filtered ring, called the Farahat-Higman ring of the uniformly saturated family and denote it by by setting:
[TABLE]
Following Wan and Wang, we say that the family satisfies the stability property if the structure constants of the Farahat Higman ring are independent of , i.e. .
2.3. An example: The uniformly saturated family
This section summarizes the work [6] of Farahat-Higman. The notation introduced below will be used later in the cases of the families and .
We introduce the relevant notation.
- (1)
A partition is a non-increasing sequence of non-negative integers where almost all -s are zero. 2. (2)
The integers are called the parts of and the number of non-zero โs is called the length of and denoted by and we write and omit the zeros in the tail. 3. (3)
Let be a partition. If then can be denoted as . 4. (4)
The weight of a partition is defined to be the integer , which is well-defined as the sum is in fact over a finite set. 5. (5)
If then one says is a partition of and writes . The set of partitions of is denoted by and the set of all partitions is denoted by which is the union of . 6. (6)
For , the partition is the unique partition whose non-zero parts are and weight is . There is a unique partition of [math], the empty partition . 7. (7)
For two partitions , their sum is defined to be the unique partition whose parts consists of parts of and . 8. (8)
For a partition , the completion is the partition . The weight of the completion of is clearly equal to . 9. (9)
For an integer the -th completion is the partition , where . 10. (10)
If for all , then one defines as the partition whose parts are . For a partition with length , the partition is called the modification of .
If is the empty partition we still talk of the modification, completion and -th completion of . The first two are again the empty partition and the -th completion of the empty partition is clearly equal to . Later we will introduce the notion of partition valued functions, and analogous concepts to weight, completion and modification will be introduced.
Example 2.6**.**
Consider , a partition of . The length of is . The modification of is , which is a partition of . The completion of is . The -th completions of and are both equal to .
Let be a subset of and be a permutation of . The support of is defined to be the subset of . The group of permutations of with finite support is denoted by . For , let indicates the set . When , we will follow the usual notation and simply write instead of . It is well-known that the conjugacy class of an element is completely determined by the cycle type of , which determines a unique partition of . The reflection length of is the minimal number of transpositions whose product is equal to . As transpositions generate symmetric group, this definition of reflection length makes sense.
The symmetric group embeds in in a natural way. The conjugacy classes of are in 1-1 correspondence with . The family is clear saturated. The union of , , is denoted by , it is the group of permutations of whose supports are finite.
Lemma 2.7**.**
[6] The family is a saturated family of groups and the bijections induce the commutative diagram below.
[TABLE]
In particular, the conjugacy classes of are in 1-1 correspondence with the set of all partitions.
From the lemma it also follows that the abstract definitions of the concepts of modification, completion and -th completion introduced earlier are consistent with the concrete definitions given in this section.
Lemma 2.8**.**
The reflection length is constant on conjugacy classes and it is sub-additive. It is also stable under the embedding for . Moreover, the reflection length of is equal to the .
Example 2.9**.**
Consider the permutation . As an element of and , the conjugacy class of corresponds to the partitions and respectively. As an element of the conjugacy class of corresponds to the partition . The completion of is whose weight is . The level of is also which is equal to . The reflection length of is and it is equal to .
The following lemma is the normal form theorem in the context of symmetric groups whose proof is evident.
Lemma 2.10**.**
Let and assume that \big{|}[g]\cup[h]\big{|}=m\leq n. Then there is an element in so that .
Proposition 2.11** ([6]).**
(Farahat-Higman) The family is a uniformly saturated family of groups.
Proof.
Let be three modified types in and consider . For , the number is bounded by . Hence every orbit has a representative in the finite group , thus there is at most finitely many orbits. (Compare with Lemma 3.22.) โ
Remark 2.12** (Growth of centralizers).**
If are two elements of then
[TABLE]
and hence
[TABLE]
Proposition 2.13** ([6]).**
(Farahat-Higman) For all , the structural functions for some polynomial for large .
Proof.
It is clear that, the index of the two groups occurring in Eq.(22) and Eq.(21) is a polynomial in . In fact, if then
[TABLE]
Since the family is uniformly saturated the result follows from Remark 2.5/3. โ
Notice that, in the above proof, the degree of the polynomial is equal to , which is zero only if . The next lemma establishes a criteria to guarantee the equality.
Lemma 2.14**.**
[6] Let . If then .
Proposition 2.15**.**
[6] For and
[TABLE]
The weight of is equal to the reflection length of . Hence, if then for all . If the equality holds, then the polynomial is constant.
Corollary 2.16**.**
[6] The uniformly saturated family satisfies the stability property.
3. The uniformly saturated family and the work of Wan and Wang
In this chapter, we summarize the work Stability of the centers of group algebras of of Wan and Wang, [20]. In the first section, following [12] and [9] we review the general theory of and parameterize the conjugacy classes in general linear groups over a finite field. In the second section, we closely follow [20] and construct the uniformly saturated family . In the following sections, we present the main theorems of Wan and Wang without proofs. Some of the theorems are divided into smaller pieces because some parts will be used in the symplectic case. Some general facts concerning the centralizers of block matrices will also be discussed in as they are used in the proofs of Wan and Wang and as well as in our study concerning symplectic group rings.
3.1. Notation and preliminaries
Let be a prime and be a power of . The finite field with is denoted by . The set of monic irreducible polynomials is denoted by . For an abstract finite dimensional vector space and the residual and fixed space of are defined as
[TABLE]
An element in is called a reflection if , equivalently, codimension of is by the equality . The reflection length of is the minimum number such that there exists a sequence of reflections of reflections such that .
Next we introduce the relevant combinatorial objects. These definitions will be used in symplectic group case as well.
Definition 3.1**.**
- (1)
A partition valued function on is a function from to the set of partitions such that for almost all , the image is the empty partition. The image will be sometimes denoted by depending on the convenience. 2. (2)
The weight of a partition valued function is defined as follows:
[TABLE]
which makes sense as the weight of the empty partition is by definition equal to zero. The set of partition valued functions on of weight is denoted by . The set of all partition valued functions is denoted by . 3. (3)
The sum of two partition valued functions and is defined as the function sending to . 4. (4)
([20]) The unipotent part and non-unipotent part of are defined as follows. The partition valued function induced by the partition valued function as follows:
[TABLE]
The non-unipotent part of is defined as follows:
[TABLE]
It is clear that, for a partition valued function the equality below holds:
[TABLE] 5. (5)
A partition valued function is called a unipotent function if it is equal to its unipotent part.
Example 3.2**.**
Let be a non-square. Define by setting
[TABLE]
and for , set . By definition we get
[TABLE]
The unipotent part is equal to the function which assigns to and assigns the empty partition to for all . The non-unipotent part of is the partition valued function that assigns to and to for all .
The following concepts are introduced in [20] as variants of modification, completion and -th completion. Recall that the modification, completion and -th completion of the empty partition were formally defined.
Definition 3.3** (Wan-Wang).**
Let be a partition valued function of weight . The modification is the partition valued function defined as the unique partition valued functions satisfying
[TABLE]
for all . The completion of is the partition valued function defined as the unique partition valued functions satisfying
[TABLE]
for all . For , define the -completion to be the unique partition valued function that satisfies
[TABLE]
where and for all .
Notice that all the operations sending to , or to or to affects only the unipotent part of .
Example 3.4**.**
Let us observe the effects of the operations just introduced on the partition valued function of Example 3.2, which was defined as
[TABLE]
and for , set where is a non-square. Then
[TABLE]
for all . The following equalities follow from the definitions.
[TABLE]
for all . The weight of is . Clearly, .
3.2. Conjugacy classes in general linear groups
Let . For , the association defines an -action on in the following way. Define an -module structure on by setting and extending it linearly.
Remark 3.5**.**
The most important property of this module is that it characterizes the conjugacy class of the defining element of the -module. Let be two -automorphism of and assume that the elements and are conjugate: for some , which implies
[TABLE]
As a result defines an -module isomorphism from to . Let us rewrite the last inequality in a more suggestive form:
[TABLE]
which reads as and are isomorphic representation spaces of . Conversely, if is such a module isomorphism, then it is clearly a linear isomorphism which satisfies . As a result we have
[TABLE]
for all . The Eq.(35) can be stated in terms of representations. The elements and are conjugate if and only if there is an -equivariant isomorphism between and . This interpretation will allow us to show that an equation of type
[TABLE]
admits only the trivial solution when and are non-isomorphic simple modules. Of course, this is just a special case of Schurโs lemma.
Let , be a fixed linear endomorphism of . Since is a PID and is a finite dimensional module, the elementary divisor theory applies and admits a decomposition into primary cyclic modules where a primary cyclic module is by definition in the following form:
[TABLE]
It is well known that the decomposition into primary cyclic modules is unique on the isomorphism class of up to permuting the orders of the summands ([9, Chapter 3]). Let
[TABLE]
be a decomposition of into primary cyclic modules and for . For define
[TABLE]
the number of copies of in the decomposition of into primary cyclic modules. As there are only finitely many such summands, for almost all , in fact, for one has . Thus, the decomposition Eq.(37) determines a partition attached to , as a result one obtains a partition valued function which sends to the partition , which is defined as above. With this notation the above decomposition can be written as
[TABLE]
where
[TABLE]
The weight which follows from the fact that together with Eq.(38). Conversely, it can be shown that for each such function , the corresponding -module is realized by an element of . In fact, for a given polynomial and , write , and introduce the companion matrix of by setting
[TABLE]
It is well-known that the module defined by is isomorphic to
[TABLE]
So, if and if denotes the block diagonal matrix then the block diagonal matrix
[TABLE]
is an element of the conjugacy class in that induces the partition valued function . This finishes the characterization of the conjugacy classes of . Let us summarize.
Proposition 3.6**.**
The association defines a surjection . Two endomorphisms define the same partition valued function if and only if they are conjugate in . In particular, induces a bijection
[TABLE]
The basis elements of thus can be indexed by the elements of .
Remark 3.7**.**
Consider two primary cyclic modules , with distinct irreducible monic polynomials . Then -modules and and by Schurโs lemma there is no intertwining operator between them.
The use of suitable representatives is particularly important in calculations done in [20] as well as in the symplectic group case which will be investigated later. The main importance of choosing a suitable form is that it enables one to compute the functions defined in the form , cf. (17), via proving a result similar to the one presented in Remark 2.12, Eq.(21). We recall the basic result in the least explicit form, yet it will be enough for our purposes.
Lemma 3.8**.**
[9, Chapter 3/10] Let and be the minimal polynomial of , where for . Then there is a basis of such that the matrix of with respect to is in block diagonal form where minimal polynomial of is .
The blocks โs admits further decomposition into a block diagonal form, where minimal polynomial of each block of is a power of . The explicit blocks can be given depending on the minimal polynomial.
Remark 3.9** (Centralizers of block diagonal matrices and Schurโs lemma).**
Let be an invertible block diagonal matrix , where is an square matrix and let be an matrix. The block structure of can be used to write as a block matrix , where is an matrix. The matrix commutes with if and only if the equation below holds:
[TABLE]
which can be written in detail:
[TABLE]
So, commutes with if and only if
[TABLE]
. Now assume that, each is of the form where and are distinct irreducible polynomials for . Writing Eq.(44) as , we see that defines an intertwining operator between and . Such an operator must be zero if according to the Remark 3.7. As a consequence, we obtain the following direct sum decomposition of the centralizer of :
[TABLE]
Remark 3.10**.**
There are other rational forms that represent conjugacy classes. The following one will be useful in the context of symplectic groups. For , the matrix
[TABLE]
is an element of . Its minimal polynomial is equal to and as an -module, is isomorphic to . Thus, the induced partition valued function assigns the partition to and the empty partition to . The fixed space of is generated by , in particular, dimension of the fixed space of is .
3.3. Uniformly saturated family .
In this section, following [20] we construct the uniformly saturated family .
Definition 3.11**.**
[20] For consider the embedding defined by the rule
[TABLE]
and identify with its image in . Denote
[TABLE]
which implies . For the injection is defined by setting .
[TABLE]
The group is defined to be the union of .
We collect numerous results of Wan and Wang in the following lemma.
Lemma 3.12**.**
[20]The following hold:
- (1)
The family is a saturated family. 2. (2)
The map induces a bijection between the conjugacy classes of and , the set of all partition valued functions. The partition is called the modified type of . 3. (3)
Let be a partition valued function. Then contains an element whose modified type is if and only if . 4. (4)
Let be a partition valued function such that and let be an element whose stable type is . If then
[TABLE]
Proof.
All of the statements follows from the characterizations of conjugacy classes with partition valued functions and the definitions. โ
Example 3.13**.**
Let us reconsider the Example 3.4. Recall that the partition valued function was defined by setting
[TABLE]
and for , set where . We already observed that . Let . More precisely
[TABLE]
for all . The completion of differs from only on the image of . Applying Definition 3.3 we have . The weight of is . As a result, for all , there is an element in whose modified type is equal to . Let be an element whose modified type is equal to . Then, the partition valued function defined by is equal to . If we denote the matrix of in again by then
[TABLE]
For a modified type , let be the intersection , which is non-empty if and only if and let
[TABLE]
The sum is an element of , the center of the integral group algebra , as pointed earlier in the general setting of Eq.(6). Notice that, if then the above sum is over the empty set and hence equal to [math].
Lemma 3.14**.**
[20, Lemma 2.3] The set forms the class sum -basis for the center , for each .
3.4. The growth of the centralizers
We have seen in Section 2.1, Proposition 2.5, that in order to determine the structural functions one needs to study the growth of the centralizer of a fixed element as the groups enlarge. So, one needs a variant of Eq.(21).
Remark 3.15**.**
Recall that if which has no fixed points and then
[TABLE]
where, as before, is the image of under the natural identification of in .
Remark 3.16**.**
Let and be its non-modified type. Then . This can be seen directly from the fact that only the companion matrices belonging to contributes to the -eigenspace and for each block, the contribution to the dimension is incremented by (cf. Remark 60).
Let , . Assume that whose type is . For the matrix , the following is the variant of Eq.(52). Let .
Proposition 3.17**.**
[20, Proposition 2.5] Let . Then, the centralizer of is given by
[TABLE]
In particular, and are invertible and hence
[TABLE]
Proof.
The second equality directly follows from the first equality and Remark 3.16. Conditions on and follows from the equality
[TABLE]
The proof of the invertibility of and can be found in [20]. There, the authors in fact prove that
[TABLE]
whenever is in the centralizer of . โ
3.5. Reflection length, modified type and the main theorems of Wan and Wang
The following Lemma is due to [8]. It is the analogue of Lemma 2.14 and used in [20] to prove a similar result to Theorem 2.10 in the case of .
Lemma 3.18**.**
[8, Proposition 2.9, 2.16]
- (1)
For , the reflection length and residual dimension are equal: . 2. (2)
The reflection length is sub-additive: i.e. for
[TABLE] 3. (3)
If then
[TABLE]
Lemma 3.19**.**
[20, Lemma 3.2] The reflection length is stable under the embedding for all satisfying . Moreover:
- (1)
If the modified type of is , then . 2. (2)
If the modified types of are respectively, then
[TABLE]
Proposition 3.17, Lemma 3.19 and Lemma 3.18 are sufficient to prove that the index function
[TABLE]
is independent of if
[TABLE]
where and are stable types of and , respectively. However, to prove that the structural function is indeed independent of requires to know that there are only finitely many index functions which contribute to the structural function and this is equivalent to show that the fibers admits only finitely many orbits with respect to the simultaneous conjugation. Such result relies on the normal form results of Wan and Wang:
Lemma 3.20**.**
[20] Let and . Moreover, let be such that
[TABLE]
then
[TABLE]
Remark 3.21**.**
Wan and Wang do not present this last lemma as an isolated entity but produce it as a by product of the proof of the proposition below. We, instead, present it independently because we will use it in the context of symplectic groups.
Proposition 3.22** (Normal Form Theorem).**
[20, Proposition 3.3] Let and be their modified types respectively. Suppose and set . Then there exists and such that
[TABLE]
Corollary 3.23**.**
The simultaneous conjugation admits finitely many orbits. Hence is a uniformly saturated family.
The following theorem is the stability property of the uniformly saturated family and it is proved using the previous results as analogs of them used to prove the stability result for the uniformly saturated family .
Theorem 3.24** (Stability Theorem).**
[20, Theorem 3.4] Let , , be three elements of . If , then is a non-negative integer independent of .
4. The case of symplectic groups:
In this chapter, we start dealing with the case of symplectic groups. In the first section the basics of symplectic spaces and alternating forms are discussed. In the subsequent section a detailed review of conjugacy in symplectic groups is presented. The results of the second section are used to obtain a rational form for the unipotent symplectic matrices. In the fourth section the reviewed theory is used to construct the uniformly saturated family . Finally, the main theorem, the stability property of center of the symplectic group rings is proved assuming Theorem 4.29 whose proof is deferred to the next chapter.
4.1. Review of symplectic groups
This section presents the basic properties of the symplectic groups over finite field with elements. The main reference for this section are the books Symplectic Groups by O.T. Oโmeara [15] and Linear Algebra and Geometry, a seconds course, by I. Kaplansky, [10],
Let be an vector space of dimension , where is an odd prime power. An alternating form (or symplectic form) on is a map such that for all and , the equalities
- (1)
, (alternating property) 2. (2)
, (bilinearity)
hold. If is an alternating form on then the pair is called a symplectic space. Given two symplectic spaces , , over are called equivalent if there is a bijective linear map such that
[TABLE]
for all In the case of equality , one speaks of the equivalency of and and drop the underlying vector space from the notation. As done for all bilinear forms, the effect of on can be written in terms of matrices. Let be a fixed ordered basis of and let be the matrix where
[TABLE]
The matrix is a skew symmetric in the sense that, , as a consequence of the fact that is alternating. Let be two elements that are considered as column vectors written with respect to the ordered basis . Then it is easily seen that
[TABLE]
Two elements are said to be orthogonal to each other, denoted as , if . Similarly, two subspaces are said to be orthogonal to each other if for all , , . The orthogonality of subspaces again denoted by the notation . For a subspace , the subspace of elements that are orthogonal to is . A symplectic space is said to be non-degenerate if . The non-degeneracy of a form is equivalent to non-vanishing of , which is independent of the chosen basis. A hyperbolic pair with respect to is an element of with the property . In this case will be referred as the positive part and will be referred as the negative part of the hyperbolic pair.
Lemma 4.1**.**
[15, Theorem 1.1.13] Let be a symplectic space. Then the following are equivalent:
- (1)
is non-degenerate. 2. (2)
admits an ordered basis where is a hyperbolic pair for , such that for , where is the subspace generated by the hyperbolic pair . With respect to this basis the matrix of is equal to the block diagonal matrix
[TABLE]
In particular, non-degenerate symplectic spaces must be even dimensional and if and are two non-degenerate symplectic forms on then they are equivalent.
A basis satisfying 2. of Lemma 4.1 is called a hyperbolic basis. In this case and are said to be hyperbolic conjugates of each other. If is an hyperbolic basis, then denote the positive parts of hyperbolic pairs in , and denote the negative parts of hyperbolic pairs in .
Let be a non-degenerate symplectic space. An element of is said to be a symplectic transformation if
[TABLE]
for all . The set of symplectic transformations form a group which is called the symplectic group and denoted by . It is contained in the special linear group of linear transformations with determinant ([15], Thm. 2.1.110). For an element , whether or not is a symplectic transformation can be checked via hyperbolic bases. Let be a hyperbolic basis for and . Then is an element of if and only if is a hyperbolic basis.
4.2. Conjugacy classes in
In this section, the references that we follow are On isometries of inner product space by J. Milnor [14], and Conjugacy Classes by Springer-Steinberg in [2]. Since these results are not comprehensively covered in text books, we will present a thorough discussion.
Let be a non-degenerate symplectic space of dimension . By Proposition 3.6, conjugacy classes of are parameterized by the partition valued functions on the , which are of weight :
[TABLE]
However, if one considers elements , then one can not realize all the partition valued functions of weight . This is not the only obstacle. Namely, let be two isometries and assume that . Then it is known that and are conjugate only over a suitable extension over , (cf. [10], Theorem 70, pg. 79), which means for a fixed , the family is not saturated.
Let and denotes -module whose underlying space is , on which acts as . i.e. . Let denotes the minimal polynomial of and introduce the module . From the fact that and the bilinearity of it follows that for every polynomial one has
[TABLE]
Substituting in the equation Eq.(62) one gets
[TABLE]
. Since the form is non-degenerate, it follows that and thus the minimal polynomial of divides that of . By symmetry and the fact that both polynomials are monic, it follows that . As a result, the map
[TABLE]
induces an isomorphism on , which is obviously an involution.
Definition 4.2**.**
For , introduce the dual by
[TABLE]
A self-dual polynomial is called dual-irreducible if f is either irreducible or where is an irreducible polynomial that is not self-dual. Denote the set of dual irreducible polynomials with .
Remark 4.3**.**
It is straightforward that , hence, if is an irreducible polynomial then its dual is also irreducible. It is also clear that a self-dual polynomial is a product of dual-irreducible polynomials.
Lemma 4.4**.**
If then the minimal polynomial of is self-dual. In particular, is a product of dual-irreducible polynomials.
Proof.
We start with noticing the following relation between the automorphism of sending to , and the dual operation defined on polynomials (cf. Eq.(64)):
[TABLE]
Invoking this observation in Eq. (62) and taking yields
[TABLE]
As is invertible and is non-degenerate, it follows that . The desired equality now follows from the equality of the degrees. โ
Lemma 4.5**.**
If , are distinct monic irreducible factors of , the minimal polynomial of , then the generalized eigenspaces V_{f_{i}}=\{v\in V:f_{i}^{k}(U)v=0,\;\text{for large k}\} for are orthogonal to each other unless .
Proof.
Let be such that for all . Then, for all , one gets
[TABLE]
Next we assume that . As are both irreducible, it follows that and are coprime and there exist such that . As the action of on is zero, it follows that, on we have , in particular it acts as an automorphism of , so does . This finishes the proof. โ
Let . Let be a dual-irreducible divisor of . If is irreducible, set to be (the generalized eigenspace of ) and if for some irreducible non-self-dual polynomial , then set as the subspace . With this notation, the above findings can be packed into the following proposition. Recall that is defined to be the set of dual-irreducible polynomials in .
Lemma 4.6**.**
[14] For each dual-irreducible divisor of , the subspace is a non-degenerate symplectic space and is equal to the orthogonal sum of โs, as ranges over dual-irreducible factors of . In particular, the restriction is an isometry of and admits the following orthogonal sum of invariant subspaces:
[TABLE]
Proposition 4.7**.**
[14] Let be two isometries of . The isometries and are conjugate in if and only if
- (1)
, 2. (2)
The isometries and are conjugate in , for .
In particular, the conjugacy class of for is completely determined by the Jordan form.
Proof.
For self-dual, see the proof of Theorem 3.2 in [14]. For non-self-dual, see the second paragraph following Theorem 3.4 in ibid. โ
This reduces the study of conjugacy classes into the study of conjugacy classes of elements such that the polynomial is a power of .
Theorem 4.8**.**
[14, Theorem 3.2] Let be an isomorphism , and be as in Lemma 4.6. The space admits an orthogonal decomposition
[TABLE]
where is a free -module and .
Proof.
(Sketch) Consider a not necessarily orthogonal decomposition of as in statement of the lemma. Then the restriction of the inner product to is non-degenerate [19, Lemma 1.4.6], [14, Theorem 3.2]. So we can consider the orthogonal decomposition of and continue by induction. โ
Theorem 4.9**.**
[14, Theorem 3.4] We keep the notation and the assumptions of the previous Theorem.
- (1)
For each , there exists a vector space and a bilinear form on , called the Wall form. 2. (2)
The dimension of is , where is a non-degenerate symplectic form for odd , and is a symmetric bilinear form for even . 3. (3)
The equivalence classes of completely determine the conjugacy classes of .
Remark 4.10**.**
Following Milnor (cf. [14, Section 3]), we will recall the construction of the vector spaces and the definition of the Wall forms for a fixed , hence we restrict ourselves to the case , i.e. to the unipotent case. Let and , where is the image of in . Introduce . The subspace is a free -module, hence equal to direct sum of cyclic modules , for some . Since is a cyclic module, there exists such that the translates generate . Then, it follows that is generated by , and hence
[TABLE]
The association
[TABLE]
is well-defined and defines bilinear form on . According to the theorem, it is a symplectic non-degenerate form for odd and symmetric non-degenerate form for even . As, over a given vector space, all non-degenerate symplectic forms are isomorphic, one can take for odd. Likewise, as non-degenerate symmetric bilinear forms over are parameterized by , for even we have is equal to or .
Definition 4.11**.**
- (1)
A signed partition is a couple such that is an ordinary partition and satisfying the following property: if then . 2. (2)
The weight of a signed partition is defined as the weight of the underlying partition.
Remark 4.12**.**
One can write a signed partition in the form . For example, if then one can write as . Also observe that the weight of a symplectic partition is always an even integer.
Definition 4.13**.**
- (1)
A signed-partition is called a symplectic partition if for odd , is even and . The set of symplectic partitions is denoted by . 2. (2)
A symplectic partition valued function (simply, a symplectic function) is a triple , where is a partition valued function defined on , and , are symplectic partitions. The weight of such a function is defined as the weight of the underlying partition valued function. The set of symplectic partition valued functions of weight is denoted by and the set of all symplectic partition valued functions is denoted by .
With this notation, we can rephrase Theorem 4.9 as follows.
Corollary 4.14**.**
[16, Theorem 1.20] The conjugacy classes in are parameterized by the symplectic partition valued functions of weight . If is the symplectic partition valued function that corresponds to the isometry , then the underlying partition valued function is equal to , when viewed as an element of . The symplectic function is called the symplectip type of .
4.3. Rational forms for unipotent blocks in
Following [7], we introduce a family of matrices what will serve as rational forms for unipotent matrices in the symplectic groups. Introduce the matrices for are defined as follows. First recall that the matrices
[TABLE]
were defined earlier. Clearly, the minimal and characteristic polynomials of and are equal to . Now introduce the matrices
[TABLE]
and for
[TABLE]
written with respect to the ordered hyperbolic basis . The matrices of the form will be called -dimensional symplectic blocks and matrices of the form will be called an -dimensional orthogonal blocks. The matrices and are elements of the symplectic group, which can be readily seen by checking the equality
[TABLE]
as ranges over . The minimal polynomial of is equal to the minimal polynomial of and the minimal polynomial of is equal to . In particular, is the unique eigen-value in both cases. Notice also that and no other satisfies such an equality.
Remark 4.15**.**
When is an matrix, we will view as a linear operator of in two ways: Let
- (1)
The association is called the right action of . The fixed space of this action is denoted by . The following identities are obvious:
[TABLE] 2. (2)
The association is called the left action of . The fixed space of this action is denoted by . The following identities are obvious:
[TABLE]
In case of a symplectic block, the space splits off into two cyclic spaces with cyclic vectors and . And in case of an orthogonal block, the space contains as a cyclic vector.
Remark 4.16**.**
When the rows and columns of a matrix are labeled with bases elements, then we consider the matrix as a linear operator in two different ways, as described in the previous remark. In this case, we will consider both rows and columns of the matrix as vectors of the appropriate vector space determined by the bases.
Our next aim is to show that each symplectic unipotent conjugacy class is realized as the orthogonal sums of suitable symplectic and orthogonal blocks. To this end, we will investigate the -module structures on that are induced by and . More precisely, we will investigate the induced bilinear forms , as explained in Remark 4.10.
Let , which acts on the symplectic space . The minimal polynomial of is and is equal to the direct sum of two cyclic -modules and . So, and for . The subspace (resp. ) is generated by the translates of (resp. ). Recall that is defined as . Thus we have
[TABLE]
and hence
[TABLE]
The space is generated by and
[TABLE]
This means is a non-degenerate symplectic space with hyperbolic basis . In particular, the symplectic type of can be described as follows. For , , the empty partition, and . As is the empty partition, is a sequence of length zero. The sign corresponding to is as the sign is determined by the isomorphism class of , which is a non-degenerate symplectic form. So, . With this point of view, if , where the direct sum is the usual orthogonal sum and โs are allowed to be zero, then .
Next we consider the case , where , with its action on . The minimal polynomial of is and thus for , consequently, is equal to the ambient space . The space is generated by the translates of the cyclic vector , so is generated by the image of in . We also have
[TABLE]
and
[TABLE]
where . As a result, we have
[TABLE]
whose image in is equal to the discriminant of the symmetric bilinear form , consequently, is non-degenerate. By taking to be a or a non-square, one can obtain both possible discriminant values in . This means, the symplectic type of is defined as follows: for and . In order to generalize as done above, consider , where, as before โs are allowed to be zero. Then
[TABLE]
One can combine the investigated situations immediately and derive the following proposition:
Proposition 4.17**.**
[7, Proposition 2.3] Let be a unipotent matrix. Then there is a hyperbolic basis so that the matrix of in this basis is equal to the orthogonal sum of suitable symplectic and orthogonal unipotent blocks.
Remark 4.18**.**
When considering matrices, we will always label rows and columns with basis elements, hence each matrix will determine a unique endomorphism. So, if is a matrix, then one can check whether is an isometry or not by checking the equality
[TABLE]
where range over the basis set that is used to label rows and columns. One can also decide whether is an isometry or not, by considering the matrix of (again denoted by ) with respect to the basis used to label . Indeed, the question of being an isometry is equivalent to the equality
[TABLE]
The matrix of with respect to the basis used in the definition of symplectic/orthogonal blocks is the following:
[TABLE]
4.4. The uniformly saturated family
Let be an infinite dimensional -vector space. We will consider with the ordered basis and the subspace generated by will be denoted as . The hyperbolic conjugate of is denoted by . We endow with the unique symplectic structure where is a non-degenerate symplectic space and is a hyperbolic basis. For , the orthogonal complement of in is denoted by and its hyperbolic basis is denoted by . The inclusion induces an embedding from
[TABLE]
which carries into and thus defines a direct system of groups. The direct limit of this system will be denoted by and referred as the infinite symplectic group. The similar map from to is defined in [20] and it is denoted by . It is clear that the map from to coincides with the map defined above. The group is defined in the same manner.
Recall that the weight of a symplectic function on was defined as the weight of the underlying partition valued function.The modification operation , completion and -th completion โn are defined in a similar way. In particular, let be a symplectic function.
Definition 4.19**.**
The weight of is by definition
[TABLE]
The set of symplectic functions of weight is denoted by . The set of all symplectic functions is denoted by . For the modification is defined by setting
[TABLE]
where and is defined as follows. First recall that is by definition a symplectic partition. As a result, it can be written as where and for odd , is even and . The modified partition is then equal to . So we define where for . In particular, the resulting signed partition can be written as . Clearly, the resulting signed partition is in general not a symplectic partition. Likewise,
[TABLE]
where . Finally, the -completion of is defined by the rule where and is defined similarly. In fact, consider . Then we define the sequence so that the equality holds, where . The unipotent and non-unipotent blocks are defined analogously.
Remark 4.20**.**
Note that, unlike the maps and , the modification operator does not map to itself as the weight of the resulting function may fail to be even. The set of modified symplectic functions is defined as the image of . Clearly in this case maps the modified symplectic functions to the symplectic functions.
If and is the symplectic type of , then it follows that
[TABLE]
where the operation for partition valued functions was described in Remark 3.3. Relying on this observation we follow the idea of the definition given in [20] and introduce the map
[TABLE]
and called the image function modified symplectic type of .
Remark 4.21** (Reflection length).**
Let be an abstract group and be a set of elements that generates as a monoid. The length of with respect to is defined to be the minimum of
[TABLE]
Such a function is clearly a sub-additive function. If is closed under conjugation then is invariant on the conjugacy classes. In the case of symplectic groups, the set is taken to be transvections in general, which are by definition reflections of determinant . In this case, the relation between reflection length and residual space of an element is as follows, (cf [15], Thm. 2.1.11):
- (1)
If is an involution then . 2. (2)
If is not involution then .
This means, the reflection length on induced by transvections is not consistent with the weight of the stable type. As a result, we will be considering with the reflection length induced from .
Lemma 4.22**.**
- (1)
The family is a saturated family. 2. (2)
The map induces a bijection between the conjugacy classes of , and the set of all stabilized symplectic functions . 3. (3)
Let be a modified symplectic function. Then contains an element whose symplectic stable type is if and only if . 4. (4)
Let be a modified symplectic function such that . Let be an element whose modified type is and be an integer greater than . Then
[TABLE]
where denotes the image of in . 5. (5)
Reflection length remains unchanged under the embedding and it is equal to the weight of the stable type.
Proof.
- (1)
By Eq.(73) one can see that non-conjugate elements in remain non-conjugate in for which proves the first claim. 2. (2)
The fact that defines a well-defined map from to follows from Eq.(73) and the rest follows from Theorem 4.14. 3. (3)
and 4. are formal consequences of the definitions. 4. 5.
Follows from the fact that the weight of the symplectic stable type is equal to the weight of the stable type and Lemma 3.19/1.
โ
The following two lemmas are symplectic analogous of Lemma 3.19 and Lemma 3.18.
Lemma 4.23**.**
[8, Proposition 2.9, 2.16]
- (1)
For the reflection length is equal to the . 2. (2)
The reflection length is sub-additive: i.e. , the inequality holds for all . 3. (3)
If then and .
Lemma 4.24**.**
[20, Lemma 3.2] The reflection length is stable under the embedding for all satisfying . Moreover:
- (1)
If the modified type of is , then . 2. (2)
If the modified type of are then
[TABLE]
Proof.
(of 4.23 and 4.24) Use Lemma 3.18 and Lemma 3.19 and the fact that the reflection length on is the reflection length induced by and along with the fact that weight of a symplectic function is equal to the weight of the underlying partition valued function. โ
We end this section following the lines of [20] in the context of symplectic groups. Let be a stabilized symplectic function and let also denote the conjugacy class in which corresponds to . Let be a positive integer. Then
[TABLE]
in which case we set
[TABLE]
is an element of , the center of the integral group algebra . Notice that if then the above sum is over the empty set and hence equal to [math].
Lemma 4.25**.**
The set forms the class sum -basis for the center , for each .
4.5. Structure constants of and the main theorems
We start with proving the normal form theorem (cf. Proposition 3.22) in the context of symplectic groups. This will allow us to deduce that the simultaneous conjugation admits finitely many orbits.
Proposition 4.26** (Normal Form Theorem).**
Let and be their modified symplectic types respectively. Suppose and .There exists and such that
[TABLE]
and
[TABLE]
Proof.
We will use Lemma 3.20 as it is used in the proof of Prop. 3.22 in [20]. Since the modified symplectic type of is , and , it follows that there exists a symplectic transformation which is conjugate to , hence there exists an element in so that the matrix of is equal to the matrix :
[TABLE]
Considering , , as elements of and using the fact that the weight of the symplectic partition valued function and the weight of the ordinary partition valued function defined by the same element are equal, we may apply Lemma 3.20 to the triple , , , from which the result follows. โ
Let be the set of elements such that . The group acts on by simultaneous conjugation, which is defined by the rule , for .
Corollary 4.27**.**
The set admits finitely many orbits with respect to the simultaneous conjugation.
Proof.
Follows directly from the normal form theorem as each orbit contains a representative in , which is a finite set. โ
By the proposition, up to conjugation, we may assume that , and are all contained in . Let be the dimension of the fixed space of .
Corollary 4.28**.**
Let be the totality of orbits in and . Let and for . Then for
[TABLE]
where is the coefficient of satisfying
[TABLE]
Proof.
For , the elements and are conjugate to each other and together conjugate to , so one can take . This means, is in fact the set of such that , hence . Order of the orbit of is equal to , where is the stabilizer of under the simultaneous conjugation. The cardinality of the stabilizer is clearly equal to . โ
Theorem 4.29** (Growth of centralizers).**
For the following equalities hold:
[TABLE]
and
[TABLE]
Proof.
See the next chapter. โ
The following theorem is the stability theorem in the case of symplectic groups. We present it in the form given in [20].
Theorem 4.30** (Stability Theorem).**
Let , be three modified symplectic functions and assume that . Then is a non-negative integer independent of .
Proof.
Substituting the order formulas (82) and (83) in the equation given in Corollary 4.28 we see that each summand in the right hand side of the Eq. (81) is equal to
[TABLE]
which is independent of .
โ
5. Proof of Centralizer growth theorem
In this chapter, we will prove the Theorem 4.29, which was the main ingredient of the proof of the Theorem 4.30.
5.1. Generic matrices and symplectic equations
Let be an arbitrary field and be positive integers. The set of matrices whose entries are in is called the generic matrices. Let be a set of indices. A generic matrix with free indices in is a generic matrix such that if and if . By substituting elements from to the variables in , each generic matrix with free variables in defines a function from to . If , the image of under this map is denoted by and each matrix in the image of a generic matrix is called a realization of . In the case of there is a unique generic matrix, the universal generic matrix . For example, if , then
[TABLE]
is a generic matrix with respect to . Then the realization of is
[TABLE]
Let be a function of the entries of . Then one can define a function on the set of realizations of . For example for introduced above is given by the following formula:
[TABLE]
Recall our conventions on the labeling of the rows and columns of matrices. We now insist on the condition that when the matrix is square, the labeling of rows and columns will be assumed to be done with respect to the same ordered basis. For example if is the generic matrix and is an hyperbolic basis for , then columns and rows of the are indexed by the basis elements preserving their orders. So, an entry of is of the following form: where . To be even more concrete, we present the following example.
Example 5.1**.**
Assume that is the universal generic matrix and the indexing of its columns (and hence its rows) is . Then we write the universal matrix as
[TABLE]
The -th symplectic equation with respect to the fixed hyperbolic basis with a prescribed ordering, which concerns the entries of -th and -th columns of , is defined as follows:
[TABLE]
Observe that the left hand side of the equation is nothing but the formal image of . In fact, by considering matrices with labeled rows and columns, we will view the columns of matrices as elements in the image vector space, and we will often identify the column and the vector defined by the column (depending on the labeling). For example symplectic equation for above can be calculated by treating the entries as coefficients of basis vectors. That is
[TABLE]
The set of all symplectic equations , is called the symplectic equations with respect to and denoted by .
Remark 5.2**.**
Symplectic equations can be considered for generic matrices with free variables. For example, consider the the following generic matrix with free variables in
[TABLE]
Then the symplectic equations with respect to are obtained by specifying entries of in the symplectic equations and the will be denoted again by when the basis and are fixed.
- (1)
The equation is obtained by considering the equality
[TABLE]
hence is , or simply
[TABLE] 2. (2)
The equations and can be computed similary and they are simply . 3. (3)
Finally, the equation is
[TABLE]
This means that there is no symplectic realization of .
Using this terminology, there is a tautological result concerning the symplectic transformations which we record as the next lemma. It will be beneficial in the calculation of the growth of the centralizers of unipotent elements.
Lemma 5.3**.**
Let be a non-degenerate symplectic space and be an hyperbolic basis with a prescribed order. Let . Then, if and only if the columns of satisfy the symplectic equations .
We end this section with inducing the question of the growth of the centralizer of a general symplectic matrix case to the unipotent case:
Remark 5.4** (Growth depends on the unipotent block).**
Let be a symplectic transformation whose non-modified type is the symplectic partition valued function of weight . Then, by Lemma 4.6, we may assume that has the form
[TABLE]
where the type of is , the type of is , and the diagonal sum of the matrices is an orthogonal sum. From this we conclude that that the minimal polynomial of is a power of and the minimal polynopmial of is coprime to . Now we consider the embedding of into for some and and an element from the centralizer of and writing it in the block form of yields the following eaulity:
[TABLE]
Then one obtains the following equality of matrices:
[TABLE]
From this, it follows that each is an intertwining operator between -modules. However, as pointed out earlier in Remark 3.7 and Remark 45, an intertwining operator between two modules with distinct primary cyclic parts must be zero. Since the primary cyclic parts of the modules defined by and are all of type for some and the primary cyclic parts of the modules defined by are all of type for some and it follows that the intertwining operators are all zero. As a result
[TABLE]
where is in the centralizer of and is in the centralizer of . This means, in order to investigate the growth of the centralizer of a symplectic matrix under the embedding , it is sufficient to consider the same question for the unipotent block of .
5.2. Unipotent Matrix Actions
In this section, we introduce an action of on as follows. For every square matrix , and put
[TABLE]
We will introduce some terminology concerning the fixed points of a fixed which is similar to the concept of symplectic equations introduced earlier. Taking as the generic matrix and writing
[TABLE]
induces a homogeneous system of linear equations in the variables , , which will be denoted by . Clearly, each solution of the system defines a fixed point of . An index is called a free index with respect to , if does not appear in the system of linear equations induced by Eq.(93), in which case we refer to as a free variable with respect to , or simply a free variable. This means, if then the condition of being a fixed point can be checked without knowing , so the following definition makes sense: A generic fixed point of with respect to a set of free indices is a generic matrix with free variables in where is a fixed point of for every .
Example 5.5**.**
Let . Then the equation Eq.(93) reads as
[TABLE]
Direct multiplication yields
[TABLE]
Therefore, the induced homogeneous system of linear equations is
[TABLE]
This means, the only free index with respect to is . The matrix
[TABLE]
is thus a generic fixed point of and the realization of is an actual fixed point of .
Lemma 5.6**.**
Let and let be the set of free indices induced by . If denotes the set of generic fixed points of and denotes the set of fixed points of then
[TABLE]
Proof.
Follows from the definitions. โ
The last lemma will be useful when considering the growth of the centralizer of elements under the natural embedding for , where the next lemma will be useful when considering the intersection of centralizers of two matrices. An matrix whose only non-zero is and placed at the will be denoted by . Observe that in the notation there is no reference to the size, but in each case, it will be determined by the context.
Lemma 5.7**.**
An index is a free index with respect to if and only if the matrix is a fixed point of .
Proof.
Assume that is a free index. Then the linear system of equations induced by is homogeneous and does not appear in these equations. As every homogeneous system of linear equations admits the trivial solution, is a fixed point of .
Assume that is not free and let
[TABLE]
where . But in this situation the previous equation becomes as the all the variables are equal to zero except , which is absurd. โ
Now we will restrict the previous action to a certain subset of unipotent matrices in for which we will be able to determine the free indices precisely. We define as the set of unipotent matrices of size which satisfy the following properties: is lower triangular and the subdiagonal entries of are all non-zero. Hence, elements of are of the following form:
[TABLE]
where for .
Remark 5.8**.**
- (1)
Let be a basis and suppose that the rows and columns of the matrix are indexed by . Then and . 2. (2)
Moreover, a symplectic block is a diagonal sum of two matrices from and an orthogonal block is an element of .
For , one can restrict the previous action to . This action will be called the unipotent action. We are interested in the free indices of with , the unipotent action. So let us fix and . Observe that is closed under inversion and hence . So we may write
[TABLE]
Consider an matrix . Then the rows of will be labeled with and the columns of will be labeled with
Lemma 5.9**.**
The index is the unique free index of the unipotent pair . In general, is the unique free index.
Proof.
Let be the generic matrix. By direct multiplication we calculate the -th entry of and and obtain
[TABLE]
As the subdiagonal entries of and are non-zero, it follows that, in the linear equation induced by the -th position, the coefficients of and are non-zero, hence they can not be free. On the other hand, the equation (97) shows that, in the equation induced by the -th position, none of the entries below or on the right of -th position occurs. This proves the claim concerning the index . โ
Remark 5.10**.**
The claim that the index is free can be proved using the description of the eigen-vectors of and , which were determined in Remark 5.8. Thus we have
[TABLE]
[TABLE]
This means is a solution of . By the Lemma 5.7, is a free index. This observation, i.e. proving an index is free by means of -eigen-vectors, will be useful when considering the intersection of two centralizers in the symplectic group.
Lemma 5.11**.**
In a generic fixed point of unipotent action (hence in all fixed points), the first row is zero, except possibly for the first entry. This row is called the leading row of . The basis element corresponding to this row is called the leading basis element.
Proof.
The first row of can be directly computed, hence we can consider the first row of and . By doing so, one obtains the following system of equations that a generic fixed point must satisfy:
[TABLE]
Since the subdiagonal entries are non-zero, it follows from the second equation that . Using this fact in the third equation yields
[TABLE]
As is a subdiagonal entry, it is non-zero and hence . Clearly, this procedure can be iterated until the last equation, which proves the lemma. โ
As a result, a generic fixed point of is of the following form:
[TABLE]
where for every the matrix obtained by substituting in is a fixed point of under the unipotent action. The row (resp. column) containing the free index will be called the pivotal row (resp. leading column). For a generic fixed point , the element in the intersection of the leading row and leading column will be called the leading element. Hence, in the above example, the leading element of is .
Now we generalize these notions to the diagonal sum of matrices. Let and be two matrices where each block (resp. ) of (resp. ) are contained in . A fixed point of is subject to the homogeneous system of linear equations , which is defined by the following equation:
[TABLE]
Let the sizes of and be and respectively, for . And let be the block form of that is induced from the block forms of and . More precisely, the is an matrix. It is then clear that, the homogeneous system of equations is equal to the union of homogeneous system of equations defined by the equation.
[TABLE]
But this means, if is a fixed point of then each is a fixed point of a certain unipotent action, and hence, one can talk about pivotal row, leading column and leading row of . It is also clear that each contains distinct variables, as a result, an indeterminate can occur in at most one system of equations . In particular, the set equality concerning linear equations below holds:
[TABLE]
It is also clear that each contains distinct variables, as a result, an indeterminate can occur in at most one system of equations . Call this system of equations . It is then clear that does not occurs in the homogeneous system of linear equations induced from if and only if it does not appear in , i.e. it is a free variable of the equation . Relying on this observation, we define the set of free variables of as the union of the set of free variables of .
From our previous work, we know that the unique free variable of is the the variable placed in the position . So, if we consider two blocks in the same column, then, their free variables are contained in the same column of , i.e. leading column of and are contained in the same column of . As a result, one can talk about the leading columns of . In fact, the same kind of work can be done for leading rows and pivotal rows as well. Finally, a matrix is called a generic fixed point of , if is a generic fixed point of .
5.3. Centralizers of unipotent elements
In this section, we start working with our original setting. Let be a unipotent matrix in where is the modified symplectic type and . By Theorem 4.8, it follows that , where โs are non-degenerate symplectic spaces that are invariant under . Moreover, Proposition 4.17 allows us, up to conjugation we may assume
[TABLE]
and and that are symplectic unipotent blocks and are orthogonal unipotent blocks. The ordered basis of that is used to index the columns and rows of is . The set forms a hyperbolic basis for . We also fix , the matrix where is an indeterminate over . As in the previous section, we consider as a block matrix , which is induced by the block form of .
Note that the matrix is an element of , and it is a again a block diagonal matrix with the same block diagonal structure. Clearly the splitting is preserved by . We will label the rows and columns of again labeled with the elements of . A generic fixed point of will be called a generic centralizer of . Finally, let be the dimension .
Proposition 5.12**.**
Let be a generic centralizer of and let be the blocks of induced by the block structure of . Then:
- (1)
If and are both orthogonal, then the block of the generic solution is of the following form:
[TABLE]
where is the leading term of . 2. (2)
If are both symplectic, then the block is of the following form
[TABLE] 3. (3)
If is symplectic and is orthogonal, then the block is of the form:
[TABLE]
and if is orthogonal and is symplectic, then the block is of the form:
[TABLE]
Proof.
As pointed out earlier, the homogeneous system of equations induced by the equality is equal to the disjoint union of the homogeneous system of equations induced by . So, one can consider blocks individually. All cases are similar. We will just prove the last two cases. Let and . Recall that, for , the matrix is defined as follows.
[TABLE]
The blocks and are subject to the equations
[TABLE]
Write the matrices and as block matrices as follows:
[TABLE]
where โs are matrices and โs are matrices. Using the fact that is a block diagonal matrix, one can write equation (104) as follows:
[TABLE]
and
[TABLE]
This means, are all fixed points of the unipotent action. As a result, the top rows of are zero except possibly for the first entries. The claim concerning the indices of the free variables follows from Lemma 5.9 and Lemma 5.11. โ
Definition 5.13**.**
The set of basis elements that corresponds to a leading row (resp. pivotal row) is called a leading basis (resp. pivotal basis) element. The set of leading (resp. pivotal) basis elements is denoted with (resp. ). In detail:
[TABLE]
and
[TABLE]
Bearing in mind the block form of and using Remark 4.15 we see that the subset is a basis of the fixed subspace , i.e. the fixed space of the map defined by multiplication by on the right. Likewise, the subset is a basis of the fixed subspace , i.e. the fixed space of the map defined by multiplication by on the left, equivalently, the fixed space of the map defined by multiplication by on the left. The subspace of generated by is denoted by .
Lemma 5.14**.**
Keeping the notation , cf. Eq. 99, we have the following.
- (1)
The subspaces and are generated by and . 2. (2)
The set hyperbolic conjugates of elements of is equal to and the cardinality of both of these sets are equal to , dimension of the fixed space of . 3. (3)
The subspaces and are totally isotropic. 4. (4)
The subspace is a non-degenerate symplectic space, and it splits in :
[TABLE]
We will write in place of . As a result, if then , where , and .
Proof.
- (1)
The fact that the subspaces and are generated by and is already discussed in the previous paragraph. 2. (2)
This follows from the explicit determination of the blocks of a generic element in the centralizer of , as given in Proposition 5.12. 3. 3,4
Follows from 2.
โ
Remark 5.15**.**
Notice that . We also observe that, the set of leading basis elements is equal to the set of basis elements that corresponds to the leading columns. From this we conclude that, an index is a free index if and only if .
Definition 5.16**.**
- (1)
A matrix will be called a primitive matrix if for , and for . In particular, if then the column defines a unique element of . 2. (2)
A square matrix whose entries are indexed by will be called a free-index matrix. 3. (3)
For a free-index matrix , substituting for defines an element which is denoted by . The matrix is called a realization of . 4. (4)
The map given by the rule is denoted by . The submatrix of will be referred as the pivotal submatrix of . 5. (5)
The leading submatrix of a matrix (which can be a primitive matrix as well) is defined as the matrix . If is a realization of then and . Entries of (or ) will be referred as leading entries of (or ). 6. (6)
The column of or will be called a leading column for . 7. (7)
If is a free-indexed matrix, then where if and if . 8. (8)
Let be two basis elements and be a primitive centralizer of . We introduce the notation
[TABLE]
where is an element of the symplectic space and is an element of the orthogonal complement of .
Remark 5.17**.**
Let be a free-index-matrix and consider . Then by definition of free indices and Lemma 5.14 it follows that the columns of are eigen-vectors of and rows of are eigen-vectors of .
Lemma 5.18**.**
Let be a primitive matrix with respect to . If is a free-index-matrix such that is in the centralizer of then is in the centralizer of for all free-index-matrix .
Proof.
This follows directly from the definition of a free index. That is, the entries of do not occur in the equations for . โ
A primitive matrix is called a primitive centralizer of if a realization (hence all realizations) of commutes with .
Lemma 5.19**.**
Let be a primitive centralizer of , be a leading basis element and be the row of corresponding to . Then all the entries of is zero except the leading entries , i.e. for . In short, if and then .
Proof.
This is a reformulation of Lemma 5.11. โ
Example 5.20**.**
Consider the block diagonal matrix whose diagonal entries are and with and let be a primitive centralizer of . Write where is a matrix. Then implies
[TABLE]
By the Proposition 5.12 it follows that is of the following type:
[TABLE]
where, for each choice of , the resulting matrix commutes with . Clearly, the set of pivotal basis elements is , and the set of leading basis elements is . Consider the vectors and . Then we have the following equalities:
[TABLE]
Likewise we have the following equalities:
[TABLE]
This means
[TABLE]
as
[TABLE]
and
[TABLE]
Consider the matrices and along with the matrix which is introduced as:
[TABLE]
where instead of labeling elements w.r.t the corresponding pivotal basis elements ; the usual labeling of entries are used. We observe that
[TABLE]
Each realization of a primitive centralizer of is a true centralizer of . However, it is not always the case that . Even existence of a realization of which is an element of is not guaranteed as the conditions for being an isometry involves equations with the indeterminates . As a result, we introduce the concept of primitive symplectic centralizer of . First we make some observations. In order to simplify the notation, we will use and instead of and respectively.
Remark 5.21**.**
Let be a primitive matrix and for , denote the hyperbolic conjugate of with . For , using Lemma 5.14, we write , where the summands are orthogonal to each other. If then
[TABLE]
and
[TABLE]
If then
[TABLE]
[TABLE]
Now we will investigate several cases of inner-products.
Case 1: . In this case, the inner product can be written as:
[TABLE]
and as consists of hyperbolic conjugates of the elements of , using the last equation we get
[TABLE]
where the . Clearly, .
Case 2: . In this case, and defines an element of and hence .
Case 3: . In this case we have
[TABLE]
Notice that only the second summand contains indeterminates. However, since and by Lemma 5.19 we get , hence the summand involving the indeterminates vanishes and thus, in this last case, the inner product is a scalar. Recall that we write to indicate the inner product and to indicate the inner product . We also introduce the matrices
[TABLE]
Let and , be two columns of a primitive centralizer of . We want to consider the equality
[TABLE]
Case 1: . By Remark 5.21 it follows that . As a result, the above equality can be checked directly.
Case 2: , . Then the inner product is given by Eq.(107) above. This means, the inner product does not involve indeterminates and the above equation can be checked directly.
Observe that, these equalities hold for if and only if they hold for one (hence for any) realizations of . As a result we obtain the following:
Lemma 5.22**.**
Let be a primitive centralizer of and be a realization of . If then the following hold:
- (1)
for all . 2. (2)
is invertible.
Proof.
The first assertion is already dealt prior to the lemma. By the Lemma 5.19, the leading rows of and , when considered as vectors, define the same elements in . Hence, a non-trivial linear relation between the rows of yields a non-trivial linear relation between the rows of . As is invertible, this can not be the case. โ
In the light of the lemma, we say that a primitive centralizer of is a primitive symplectic centralizer of if satisfies the conditions 1. and 2. of Lemma 5.22. By definition, for a fixed primitive symplectic centralizer of and its realization of , it follows that is an element of if and only for as elements of are orthogonal to each other by Lemma 5.14. Using the matrices and introduced in (5.21), this observation can be rephrased as follows:
Lemma 5.23**.**
Let be a realization of a primitive symplectic centralizer of . Then if and only if
[TABLE]
Proof.
Follows from the fact that for . โ
Proposition 5.24**.**
There exists an invertible matrix such that
[TABLE]
for all . In particular,
We need two lemmas:
Lemma 5.25**.**
Let be a symplectic space with a hyperbolic basis and let be arbitrary elements of , written as column vectors:
[TABLE]
Let (resp. ) be the -tuple vector obtained from by keeping tuples indexed by the basis vectors (resp. ) for and removing the other entries. Let and be the set of matrices whose -th column is and respectively. Then
[TABLE]
Proof.
This follows from direct calculation. The -th row of is and the -th column of is and hence the right hand side of the above equation is
[TABLE]
which is clearly equal to the inner product
[TABLE]
โ
Next we assume that is an arbitrary partition of so that none of the hyperbolic pairs fall into the same . Observe that the partition above satisfies this property. We call such a partition isotropic. Finally, a square matrix is called a signed permutation matrix if each row and each column has only one non-zero entry which is either or .
Corollary 5.26**.**
Let , be an arbitrary hyperbolic basis in an arbitrary order, and be as above. Let is an isotropic partition of and , be defined in the manner described in the previous lemma. Then, there is a signed permutation matrix such that
[TABLE]
Proof.
Multiplication with a permutation matrix on the left acts on the rows the of matrix. Let be the permutation of so that the -th element of and form hyperbolic pairs and let be the corresponding permutation matrix. Let be the diagonal matrix with entries where entry is if and only if the -th element of is the negative part of the hyperbolic pair that is contained. Now take . โ
Proof.
(of 5.24) Take to be , which is generated by . Take to be the set of leading basis elements and to be the set of pivotal basis elements and apply the corollary. โ
Recall that if is a free-indexed matrix, then was defined as by the rule if and otherwise.
Proposition 5.27**.**
Let be a primitive symplectic centralizer and be a realization of . Then the following are equivalent:
- (1)
is a symplectic matrix. 2. (2)
The free-indexed matrix satisfies the equation
[TABLE] 3. (3)
where is a free-indexed symmetric matrix and . 4. (4)
There exists a symmetric matrix such that
[TABLE]
As a result, for each primitive symplectic centralizer , there exists a realization of which is an isometry. In fact, there exists many symplectic realizations of and they are of the form
[TABLE]
where is an symmetric matrix.
Proof.
Write in place of . From Lemma 5.23 it follows that is an isometry if and only if . Hence the equivalence of (1) and (2) follows from Proposition 5.24 which states that . Assuming (2) and taking yields (3). Conversely, assume that with symmetric . This implies as is an anti-symmetric matrix. As a result, , which is the statement of (2). The equivalence of (3) and (4) follows from the fact that and are invertible matrices. โ
5.4. Growth of centralizers
We keep our assumptions on , and and consider . The hyperbolic basis for is denoted by . Thus, the union of the hyperbolic bases , is equal to and is a hyperbolic basis of . As before, rows and columns of the matrices in are indexed by the basis . If and then denotes column of which corresponds to basis element . Finally, recall that generates and generates and these bases form hyperbolic conjugates of each other. Next consider . An element will be considered as a block matrix of the form , where is an matrix.
We recall Theorem 3.17 in this context.
Proposition 5.28**.**
[20, Proposition 2.5] The centralizer of is given by
[TABLE]
The columns of and rows of are indexed by the elements of . Moreover, the columns of (resp. rows of ) are elements of (resp. ). By Lemma 5.14, it follows that, for , the -th column (resp. row ) of (resp. ) are of the form
[TABLE]
and
[TABLE]
respectively, as is generated by and is generated by . From these equations we get the following:
Lemma 5.29**.**
Columns of are orthogonal to each other. Moreover, if is not a pivotal basis element and if is not a leading basis element.
Proof.
Let . The inner product of and is the sum of products of the form where and is the hyperbolic conjugate of . So, one of the factor must be zero, as implies , and thus . โ
We will call an matrix a primitive centralizer of if is a primitive centralizer of , entries of and are in ; and
[TABLE]
Example 5.30**.**
Let us revisit the block diagonal matrix whose diagonal entries are and with of Example 5.12. We consider generic fixed points of . By Lemma 5.29, and are of the form
[TABLE]
[TABLE]
and is a primitive centralizer of , i.e. is of the following form
[TABLE]
Finally, is an arbitrary invertible matrix.
In order to determine the true definition of primitive symplectic centralizer of we will investigate the equation with for a fixed primitive centralizer of and a realization of . Since , each column vector of (or ) admits a sum where and . As a consequence . Recall that also admits the orthogonal decomposition , c.f. Lemma 5.14.
Case 1: .
Lemma 5.31**.**
for all if and only if . In particular, if then .
Proof.
As discussed above, a column for is equal to and the summands are orthogonal to each other. So by Lemma 5.29 it follows that . This proves the assertion. โ
Case 2: . In this case, as , the equation under discussion becomes
[TABLE]
Since is not leading, by Lemma 5.29, the column is the zero vector. As a consequence, the second inner-product vanishes automatically. So, consider and . The inner product of these elements is given by
[TABLE]
where is the hyperbolic conjugate of and is equal to . But by Lemma 5.29, if , hence the above sum becomes
[TABLE]
as the factor if and . Hence, the above summation vanishes. This proves the following:
Lemma 5.32**.**
For and the equality below holds.
[TABLE]
Case 3: . The equation under discussion is again
[TABLE]
Let be the matrix obtained by the rows of that correspond to the pivotal basis elements in , i.e. keeping the possible non-zero entries. So, the rows of are indexed by and columns are indexed by . Observe that the vectors induced by the columns of and are the same, as the removed entries are all zero. As discussed in the proof of Proposition 5.24, the first inner product is equal to the product of the -th row of with . Thus, fixing and letting ranges over and writing as a column vector, the above equation can be written as a matrix product:
[TABLE]
where . Since and are invertible matrices, it follows that , and hence , is uniquely determined by , and . The only non-zero entries of correspond to pivotal basis elements and thus we denote the matrix obtained by the entries of that are not contained in a leading row by , which is an matrix. Likewise, we denote the matrix obtained by removing the columns of that do not correspond to a pivotal row is denoted by . With these notations we get the following.
Lemma 5.33**.**
for all and for all if and only if
[TABLE]
Proof.
Notice also that the right hand side of (118) is uniquely determined by , as is invertible. โ
Case 4: . As before, the equations under discussion becomes
[TABLE]
since the leading basis elements are orthogonal to each other.
Lemma 5.34**.**
If then is a primitive symplectic centralizer of .
Proof.
Let and assume that is not leading. Writing , and using the fact that the summands are orthogonal to each other along with the fact that , it follows that
[TABLE]
, , as is in an isometry. As a result, is a primitive symplectic centralizer. โ
With these observations, the following definition makes sense.
Definition 5.35**.**
A primitive centralizer of is called a primitive symplectic centralizer of if is a primitive symplectic centralizer of , and satisfy the equation in Lemma 5.33.
Let be a primitive symplectic centralizer of and be a realization of . Notice that is automatically contained in the centralizer of .
Lemma 5.36**.**
if and only if
[TABLE]
for all .
Proof.
According to the discussion prior to the definition of primitive symplectic centralizer of , we have for all . โ
As we have done in the previous section, we will write as a sum of orthogonal vectors. is equal to the orthogonal sum and is equal to the orthogonal sum of and . So, each leading column vector can be written as an orthogonal sum
[TABLE]
where and were defined in Lemma 5.14. By the last lemma, if and only if
[TABLE]
or equivalently
[TABLE]
The following lemma can be proved in the same way Proposition 5.27 is proved.
Lemma 5.37**.**
is a symplectic matrix if and only if there exists a symmetric matrix such that
[TABLE]
Combining all, we get the following variant of Proposition 3.17 which is proved in [20]:
Proposition 5.38**.**
The centralizer of in admits the following description:
[TABLE]
Equivalently
[TABLE]
In particular, if is an arbitrary isometry whose modified symplectic type is and , then
[TABLE]
Proof.
() Let . By Lemma 5.31 . The equalities and follow from Proposition 3.17. The equality
[TABLE]
follows from the Lemma 5.33. The only difference between and occur in the free indices, hence is also in the centralizer of by Proposition 5.12. By Lemma 5.37,
[TABLE]
As a result satisfies the 4th of Proposition 5.27 hence is an isometry and commutes with .
() Let be an element of the right handside. The last condition ensures that is in the centralizer of , and hence as above, is in the centralizer of . The first three conditions now ensure that is in the centralizer of . The fact that is an isometry is a consequence of the previous investigations.
The second set equality follows from the first one, as the defining conditions of the second set implies that is an isometry, as dealt in the preceding discussion. Now consider equality concerning the cardinalities. First assume that is a unipotent element. Then the equality follows from the previous set equality as the is uniquely determined by and , and the number of possible matrices is as is the dimension of the -eigenspace of . For general , the result follows from Remark 3.7. โ
Now assume that where and are their modified symplectic types. Moreover, assume that and .
Lemma 5.39**.**
The following equality holds:
[TABLE]
Proof.
For , Proposition 3.17 implies that if and only if the following hold:
- (1)
2. (2)
Columns of consist of eigen-vectors of , 3. (3)
Columns of consist of eigen-vectors of the .
Let denote the fixed spaces of and , respectively. By Lemma 3.18/3 we know that
[TABLE]
as reflection length of and are same. Now assume that is contained in the intersection. Then by 1., . Conversely, assume that is contained in the intersection. Then . As columns of (respectively rows of ) consists of elements of (respectively ) it follows that by Lemma 3.17. โ
Lemma 5.40**.**
Let and . Let . Assume that if . Then as well.
Proof.
All the entries of except is zero. We know from Remark 5.17 that each column (resp. row) of is then a -eigenvector of (resp. ). Invoking 3.18/3 we see that each column (resp. row) of is then a -eigenvector of and (resp. and ). This means, is contained in . Now the result follows from the fact that and . โ
Proposition 5.41**.**
Let denote the intersection for . Then the set equality
[TABLE]
holds for . In particular, if are isometries and the modified symplectic type of is with and , then
[TABLE]
Proof.
Let . Then as . So by Proposition 5.38, the assertions , and follows immediately. By Lemma 5.39, is an element of and by Lemma 5.40, . As argued in Proposition 5.38, is an isometry. The converse containment follows from direct calculation using the discussion concerning the sufficiency conditions for being an isometry. โ
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Kรผrลat Aker and Mahir Bilen Can. Generators of the hecke algebra of (s 2n, bn). Advances in Mathematics , 231(5):2465โ2483, 2012.
- 2[2] Armand Borel, Roger William Carter, Charles W Curtis, Nagayoshi Iwahori, TA Springer, and Robert Steinberg. Seminar on algebraic groups and related finite groups: held at the Institute for Advanced Study, Princeton/NJ, 1968/69 , volume 131. Springer, 2006.
- 3[3] Mahir Bilen Can and ลafak รzden. Corrigendum to โgenerators of the hecke algebra of (s 2n, bn)โ[adv. math. 231 (2012) 2465โ2483]. Advances in Mathematics , 100(308):1337โ1339, 2017.
- 4[4] Tullio Ceccherini-Silberstein, Fabio Scarabotti, and Filippo Tolli. Harmonic analysis on finite groups: representation theory, Gelfand pairs and Markov chains , volume 108. Cambridge University Press, 2008.
- 5[5] Tullio Ceccherini-Silberstein, Fabio Scarabotti, and Filippo Tolli. Representation theory of the symmetric groups: the Okounkov-Vershik approach, character formulas, and partition algebras , volume 121. Cambridge University Press, 2010.
- 6[6] HK Farahat and Graham Higman. The centres of symmetric group rings. Proc. R. Soc. Lond. A , 250(1261):212โ221, 1959.
- 7[7] Samuel Gonshaw, Martin W Liebeck, and EA OโBrien. Unipotent class representatives for finite classical groups. Journal of Group Theory , 20(3):505โ525, 2017.
- 8[8] Jia Huang, Joel Brewster Lewis, and Victor Reiner. Absolute order in general linear groups. Journal of the London Mathematical Society , 95(1):223โ247, 2017.
