
TL;DR
This paper characterizes Leonard pairs, which are pairs of linear transformations with specific tridiagonal and diagonal matrix representations, providing two new criteria based on intersection numbers and dual eigenvalues.
Contribution
The paper introduces two new characterizations of Leonard pairs focusing on different parameter sets, enhancing understanding of their structure.
Findings
Provides criteria based on intersection numbers and dual eigenvalues
Characterizes Leonard pairs using two distinct parameter-focused conditions
Enhances the theoretical framework for identifying Leonard pairs
Abstract
Let denote a vector space with finite positive dimension. We consider an ordered pair of linear transformations and that satisfy (i) and (ii) below. (i) There exists a basis for with respect to which the matrix representing is irreducible tridiagonal and the matrix representing is diagonal. (ii) There exists a basis for with respect to which the matrix representing is irreducible tridiagonal and the matrix representing is diagonal. We call such a pair a Leonard pair on . In the literature, there are some parameters that are used to describe Leonard pairs called the intersection numbers , , , and the dual eigenvalues . In this paper, we provide two characterizations of Leonard pairs. For the first…
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 · graph theory and CDMA systems · Matrix Theory and Algorithms
How to recognize a Leonard pair
Edward Hanson
Abstract
Let denote a vector space with finite positive dimension. We consider an ordered pair of linear transformations and that satisfy (i) and (ii) below.
- (i)
There exists a basis for with respect to which the matrix representing is irreducible tridiagonal and the matrix representing is diagonal. 2. (ii)
There exists a basis for with respect to which the matrix representing is irreducible tridiagonal and the matrix representing is diagonal.
We call such a pair a Leonard pair on . In the literature, there are some parameters that are used to describe Leonard pairs called the intersection numbers , , , and the dual eigenvalues . In this paper, we provide two characterizations of Leonard pairs. For the first characterization, the focus is on the and . For the second characterization, the focus is on the , , and .
Keywords. Leonard pair, tridiagonal matrix, distance-regular graph, intersection numbers, orthogonal polynomials. 2010 Mathematics Subject Classification. Primary: 15A21. Secondary: 05E30.
1 Introduction
We begin by recalling the notion of a Leonard pair [6, 7]. We will use the following terms. A square matrix is called tridiagonal whenever each nonzero entry lies on either the diagonal, the subdiagonal, or the superdiagonal. Assume is tridiagonal. Then is called irreducible whenever each entry on the subdiagonal is nonzero and each entry on the superdiagonal is nonzero.
We now define a Leonard pair. For the rest of this paper, will denote a field.
Definition 1.1
[7, Definition 1.1] Let denote a vector space over with finite positive dimension. By a Leonard pair on , we mean an ordered pair of -linear maps and that satisfy (i) and (ii) below.
- (i)
There exists a basis for with respect to which the matrix representing is irreducible tridiagonal and the matrix representing is diagonal. 2. (ii)
There exists a basis for with respect to which the matrix representing is irreducible tridiagonal and the matrix representing is diagonal.
Note 1.2
In a common notational convention, denotes the conjugate-transpose of . We are not using this convention. In a Leonard pair , the linear transformations and are arbitrary subject to (i), (ii) above.
The concept of a Leonard pair originated in the study of -polynomial distance-regular graphs [1, p. 260], [6, Definition 2.3]. Since that time, Leonard pairs have found application in a variety of contexts, such as special functions/orthogonal polynomials [7, 8, 9, 13] and representation theory [9, 11]. Motivated by these applications, a number of characterizations of Leonard pairs have been discovered. For instance, there are characterizations of Leonard pairs in terms of orthogonal polynomials [10, Theorem 19.1] [12, Theorem 4.1], parameter arrays [7, Theorem 1.9], upper/lower bidiagonal matrices [12, Theorem 3.2] [13, Theorem 17.1], tridiagonal/diagonal matrices [13, Theorem 25.1], the notion of a tail [2, Theorem 5.1] [4, Theorem 10.1], and the intersection numbers [3, Theorem 5.1].
In this paper, we consider the following situation. Fix an integer and consider matrices and over that have the following form:
[TABLE]
It is desirable to have attractive necessary and sufficient conditions for to form a Leonard pair. In the literature, there exist two kinds of results along this line. For the first kind of result, the focus is on the parameters and [3, Theorem 5.1]. For the second kind of result, the focus is on the parameters , , and [13, Theorem 25.1]. Each of these results has its drawbacks which we will describe shortly. The present paper has two main theorems, the first of which improves on [3, Theorem 5.1] and the second of which improves on [13, Theorem 25.1]. We now describe the drawbacks of [3, Theorem 5.1] and [13, Theorem 25.1], and how our results are an improvement. One shortcoming of [3, Theorem 5.1] is that it assumes is diagonalizable. Our improvement requires no such assumption. The result [13, Theorem 25.1] involves some equations containing the products , and checking the equations becomes cumbersome. Our improvement avoids this difficulty by treating the and separately. Our two main results are Theorem 3.1 and Theorem 4.1.
2 Leonard systems
When working with a Leonard pair, it is often convenient to consider a related object called a Leonard system. To prepare for our definition of a Leonard system, we recall a few concepts from linear algebra. From now on, fix an integer . Let denote the -algebra consisting of all by matrices with entries in . We index the rows and columns by . Let denote the vector space over consisting of all by matrices with entries in . We index the rows by . The algebra acts on by left multiplication. Let denote a vector space over with dimension . Let denote the -algebra consisting of the -linear maps from to . The identity of will be denoted by . The -algebra is isomorphic to . Let denote a basis for . For and , we say that represents with respect to whenever for . Let denote an element of . A subspace will be called an eigenspace of whenever and there exists such that ; in this case, is the eigenvalue of associated with . We say that is diagonalizable whenever is spanned by the eigenspaces of . We say that is multiplicity-free whenever is diagonalizable and each eigenspace of has dimension one. By a system of mutually orthogonal idempotents in , we mean a sequence of elements in such that
[TABLE]
[TABLE]
By a decomposition of , we mean a sequence of one-dimensional subspaces of such that
[TABLE]
The following lemmas are routinely verified.
Lemma 2.1
Let denote a decomposition of . For , define such that and if . Then is a system of mutually orthogonal idempotents in . Conversely, let denote a system of mutually orthogonal idempotents in . Define for . Then is a decomposition of .
Lemma 2.2
Let denote a system of mutually orthogonal idempotents in . Then .
Let denote a multiplicity-free element of and let denote an ordering of the eigenvalues of . For , let denote the eigenspace of for . Then is a decomposition of ; let denote the corresponding system of mutually orthogonal idempotents from Lemma 2.1. One checks that and for . Moreover,
[TABLE]
We refer to as the primitive idempotent of corresponding to (or ).
We now define a Leonard system.
Definition 2.3
[7, Definition 1.4] By a Leonard system on , we mean a sequence
[TABLE]
that satisfies (i)–(v) below.
- (i)
Each of is a multiplicity-free element of . 2. (ii)
is an ordering of the primitive idempotents of . 3. (iii)
is an ordering of the primitive idempotents of . 4. (iv)
{\displaystyle{E^{*}_{i}AE^{*}_{j}=\begin{cases}0,&\text{if ;|i-j|>1;}\\ \neq 0,&\text{if ;|i-j|=1}\end{cases}}}\qquad\qquad(0\leq i,j\leq d). 5. (v)
{\displaystyle{E_{i}A^{*}E_{j}=\begin{cases}0,&\text{if ;|i-j|>1;}\\ \neq 0,&\text{if ;|i-j|=1}\end{cases}}}\qquad\qquad(0\leq i,j\leq d).
The Leonard system is said to be over .
Let denote a Leonard system on . Then the pair is a Leonard pair on said to be associated with . See [7, pp. 4–5] for the precise connection between Leonard pairs and Leonard systems.
Definition 2.4
Let denote a Leonard system on . For , let (resp. ) denote the eigenvalue of (resp. ) associated with (resp. ). We call (resp. ) the eigenvalue sequence (resp. dual eigenvalue sequence) of .
Definition 2.5
Let denote a Leonard pair on . By an eigenvalue sequence (resp. dual eigenvalue sequence) of , we mean the eigenvalue sequence (resp. dual eigenvalue sequence) of an associated Leonard system.
For the remainder of this section, let denote a Leonard system on with eigenvalue sequence and dual eigenvalue sequence . To avoid trivialities, we assume . By construction, are mutually distinct and contained in . Similarly, are mutually distinct and contained in . By [7, Theorem 12.7], the expressions
[TABLE]
are equal and independent of for . Define as follows. For , let be the common value of (1). For , let be arbitrary. By (1), is independent of for . Let denote this common value, so
[TABLE]
For notational convenience, define (resp. ) such that (2) holds at (resp. ). Similarly, there exists such that
[TABLE]
For notational convenience, define (resp. ) such that (3) holds at (resp. ). Choose . By [8, Lemma 5.1], is a basis for . Moreover, is a basis for . By Lemma 2.2,
[TABLE]
With respect to the basis , the matrices representing and take the form
[TABLE]
for some scalars with for . We call the scalars , , and the intersection numbers of . By (4) and since ,
[TABLE]
where . By [10, Definition 7.1 and Lemma 7.2],
[TABLE]
where tr denotes trace. The next equation involves the intersection number for the Leonard system . By [12, Lemma 9.2],
[TABLE]
By [14, Theorem 5.3], there exist such that
[TABLE]
Using (7), we obtain
[TABLE]
Proposition 2.6
With the above notation,
[TABLE]
where .
Proof: Let the integer be given. In (6), eliminate using (5) to obtain
[TABLE]
In (10), replace by to obtain
[TABLE]
In (6), eliminate using (5) to obtain
[TABLE]
Adding (11) to (12) and simplifying the result using (2), (3), and (8), we routinely obtain (9).
3 The first main theorem
In this section, we obtain our first main result. It involves the following setup. Fix an integer . Let denote a vector space over of dimension . Let denote a system of mutually orthogonal idempotents in . Define such that
[TABLE]
Let denote scalars in and define
[TABLE]
Let denote any scalars in .
Theorem 3.1
With the above notation, suppose the following (i)–(vi) hold.
- (i)
* if .* 2. (ii)
* .* 3. (iii)
There exist such that
[TABLE]
*Define *(*resp. ) such that (15) holds at *(resp. ). 4. (iv)
There exist nonzero vectors such that
[TABLE] 5. (v)
There exist such that for ,
[TABLE]
where . 6. (vi)
* .*
Then is a Leonard pair on with eigenvalue sequence and dual eigenvalue sequence .
Proof: By (13) and [2, Corollary 3.4], the elements and together generate . Using (14) and the fact that are mutually orthogonal idempotents, we obtain
[TABLE]
Consequently, is generated by and . The vector space is irreducible as an -module, so is irreducible as a module for .
By [2, Lemma 3.5], there exists a unique antiautomorphism of such that and for . By this and (14), .
Recall the scalars and from below (15). By construction,
[TABLE]
We claim that the scalar
[TABLE]
is independent of for . Denote this scalar by . For ,
[TABLE]
In this equation, the right-hand side equals [math] by (18). Consequently, is independent of for . The claim is now proven. Let denote the common value of (19), so
[TABLE]
We now show that
[TABLE]
To verify (21), in the right-hand side, replace by (19) and eliminate both occurrences of in the resulting expression using (18). We have now verified (21).
For notational convenience, we introduce a -variable polynomial
[TABLE]
We now claim that
[TABLE]
In (23), let denote the left-hand side minus the right-hand side. We show . Using , we obtain
[TABLE]
For , we show . Using and ,
[TABLE]
To further examine (24), we consider two cases. First assume . In this case, (24) becomes
[TABLE]
If , then by (13). If , then by (20). Therefore, under our present assumption that . Next assume . In this case, (24) becomes
[TABLE]
By (21) and (22), we find . By [3, Proposition 3.6], . Evaluating the right-hand side of (25) using these comments, we find that it equals times
[TABLE]
The scalar (26) is equal to 0 by (17), so . We have now shown for . Therefore, . We have now verified (23).
We now claim that for , there exists a nonzero vector such that both
[TABLE]
where is from (16). We prove the claim by induction on . The case follows by condition (iv). Next assume . Note that are linearly independent, because they are eigenvectors for with distinct eigenvalues. For , define . By construction,
[TABLE]
By induction,
[TABLE]
We apply both sides of (23) to and evaluate the result using . This gives
[TABLE]
For notational convenience, define
[TABLE]
Evaluate (31) using (32), and simplify the result using and . This gives
[TABLE]
By (27), (32), and induction, . Using (29) and (30), and . Using these comments to simplify (33), we obtain
[TABLE]
We now show that . Suppose . By this, together with (28) and (30), . By (29), . Comparing the dimensions of and , we obtain . This contradicts the fact that is irreducible as a module for . We have shown that . Let denote the subspace of spanned by and . The vectors form a basis for . Recall that for . By this and (34), and the action of on has characteristic polynomial . By condition (i), the roots of this characteristic polynomial are mutually distinct, so is diagonalizable on with eigenvalues . Let denote an eigenvector for with eigenvalue . So . Note that , so there exists such that . Replacing by , we may assume . We have shown . The claim is proven.
By construction and since are mutually distinct, is a basis for consisting of eigenvectors for . It follows that is multiplicity-free. For , let denote the primitive idempotent of corresponding to . We now show that is a Leonard system on . To do this, we verify conditions (i)–(v) of Definition 2.3. Definition 2.3(ii) holds by construction and Definition 2.3(iv) holds by (13). It is convenient to check the remaining conditions in a nonstandard order. Consider Definition 2.3(v). By (27),
[TABLE]
Applying ,
[TABLE]
Definition 2.3(v) holds by (35) and (36). To obtain Definition 2.3(i), we show that is multiplicity-free. The map is given in (14). By assumption, are mutually orthogonal idempotents in . Therefore, by Lemma 2.1, the sum is direct and has dimension for . By (14), for . By these comments, is diagonalizable. To show that is multiplicity-free, we show that are mutually distinct. Define a polynomial and note that . The elements are linearly independent by Definition 2.3(v) and [2, Lemma 3.1], so the minimal polynomial of has degree . Therefore, the minimal polynomial of is precisely . Because is diagonalizable, the roots of are mutually distinct. Therefore, is multiplicity-free as desired. We have established Definition 2.3(i). By (14) and since is multiplicity-free, we see that is an ordering of the primitive idempotents of . This gives Definition 2.3(iii). By these comments, is a Leonard system on . Consequently, is a Leonard pair on with eigenvalue sequence and dual eigenvalue sequence .
4 The second main theorem
In this section, we obtain our second main result.
Theorem 4.1
Fix an integer . Suppose there exist scalars , , and , , in such that the following (i)–(viii) hold.
- (i)
* if .* 2. (ii)
* .* 3. (iii)
There exist such that
[TABLE]
*Define *(*resp. ) such that (37) holds at *(resp. ). 4. (iv)
* for .* 5. (v)
* for , where .* 6. (vi)
There exists such that
[TABLE] 7. (vii)
There exists such that
[TABLE]
is independent of for . 8. (viii)
Define . Then
[TABLE]
Then there exists a Leonard system over with eigenvalue sequence , dual eigenvalue sequence , and intersection numbers , , .
Proof: Define the vector space . We identify with . Define as follows:
[TABLE]
For , define with -entry and all other entries [math]. The elements are mutually orthogonal idempotents. Note that and satisfy the conditions stated above Theorem 3.1.
We now show that is a Leonard pair. Our strategy is to invoke Theorem 3.1. We now check the conditions of Theorem 3.1. First note that Theorem 3.1(i), Theorem 3.1(ii), and Theorem 3.1(iii) are satisfied by conditions (i). (ii), and (iii) in the present theorem, respectively. We now verify Theorem 3.1(iv). Let denote the vector with every component equal to . By condition (v) in the present theorem, . Combining conditions (v) and (vi) in the present theorem, we obtain
[TABLE]
Let denote the vector with component for . By condition (ii) in the present theorem, . By (41) and (42), we obtain and . This implies Theorem 3.1(iv).
We now show Theorem 3.1(v). Evaluating (38) using condition (v), we obtain
[TABLE]
Rearranging the terms in (43), we obtain
[TABLE]
Evaluating (38) using condition (v), we similarly obtain
[TABLE]
For , consider the equation obtained from (44) by replacing with . Add this to (45) to obtain
[TABLE]
for .
Let denote the common value of (39). By (46) and condition (vii) in the present theorem,
[TABLE]
for . In (47), eliminate using . Evaluating the results using (37), we obtain
[TABLE]
for . Let denote the right-hand side of (48). So,
[TABLE]
For , we multiply each side of (49) by . After some rearranging, we obtain
[TABLE]
Consequently, the scalar
[TABLE]
is independent of for . Let denote the common value of (50). So,
[TABLE]
By the equation on the left in (41) and by the definition of following (41), we routinely obtain . This establishes Theorem 3.1(v). Theorem 3.1(vi) follows from (40). We have established the conditions of Theorem 3.1. Therefore, the pair is a Leonard pair on with eigenvalue sequence and dual eigenvalue sequence . For , is the primitive idempotent of associated with . For , let denote the primitive idempotent of associated with the eigenvalue . By construction, the sequence is a Leonard system on with eigenvalue sequence and dual eigenvalue sequence . By the equation on the left in (41), has intersection numbers , , and .
5 Three applications of Theorem 4.1
In this section, we illustrate Theorem 4.1 with three examples.
Proposition 5.1
Fix an integer . Assume that the characteristic of is zero or an odd prime greater than . Define
[TABLE]
Then the conditions of Theorem 4.1 are satisfied with
[TABLE]
Proof: Using the data (51)–(57), one routinely verifies that each of conditions (i)–(viii) from Theorem 4.1 holds.
Note 5.2
Referring to Proposition 5.1, the corresponding Leonard system from Theorem 4.1 is said to have Krawtchouk type; see [11, Section 24].
Proposition 5.3
Let be arbitrary and fix an integer . Let , , , and denote nonzero scalars in such that each of the following hold.
- •
* for .*
- •
Neither of is among .
- •
None of is among .
Define
[TABLE]
where . Then the conditions of Theorem 4.1 are satisfied with
[TABLE]
Proof: Using the data (58)–(67), one routinely verifies that each of conditions (i)–(viii) from Theorem 4.1 holds. In this calculation, it is useful to note that
[TABLE]
for . In Theorem 4.1(vii), expression (39) is equal to
[TABLE]
for .
Note 5.4
Referring to Proposition 5.3, the corresponding Leonard system from Theorem 4.1 is said to have -Racah type; see [5, Section 5].
In applications, we are often presented with a tridiagonal matrix and a diagonal matrix, each with numerical entries, and we wish to know whether this is a Leonard pair. In our next example, we illustrate how to proceed using Theorem 4.1.
Proposition 5.5
Assume that the characteristic of is zero. Define and
[TABLE]
Then the conditions of Theorem 4.1 are satisfied with
[TABLE]
Proof: We now verify conditions (i)–(viii) in Theorem 4.1. Theorem 4.1(ii) holds by (68). Theorem 4.1(iv) holds by (69) and (70). Concerning Theorem 4.1(iii), using the data (68), we evaluate (37) at and to compute and . We then verify (37) and compute and . We have now verified Theorem 4.1(iii). Using the data (69)–(71), we verify that Theorem 4.1(v) holds with . Concerning Theorem 4.1(vi), using the data (68)–(70), we evaluate (38) at and . We routinely solve for and , and verify (38). We have now verified Theorem 4.1(vi). Concerning Theorem 4.1(vii), using the data (68)–(70), we evaluate (39) at to obtain and, using that value, we routinely verify (39). We have now verified Theorem 4.1(vii). We obtain using the first equation in Theorem 4.1(viii). We define , , , and so that (40) holds. We obtain (). Note that Theorem 4.1(i) is satisfied. We have now verified each of conditions (i)–(viii) from Theorem 4.1.
Note 5.6
Referring to Proposition 5.5, the corresponding Leonard system from Theorem 4.1 is said to have Racah type; see [11, Example 35.9].
6 The first and second split sequence
Consider the Leonard system from Definition 2.3. In [7], this Leonard system was described using a sequence of scalars called its parameter array. A parameter array takes the form , where is the eigenvalue sequence and is the dual eigenvalue sequence. The sequences and are called the first and second split sequences, respectively [12, p. 5]. It follows from [11, Definition 23.1 and Theorem 23.5] that for ,
[TABLE]
Assume that our Leonard system is the one from Proposition 5.1. Using (52)–(54) to simplify (72)–(75), we obtain
[TABLE]
This matches the data presented in [8, Section 16].
Next, assume that our Leonard system is the one from Proposition 5.3. Using (59)–(63) to simplify (72)–(75), we find that for ,
[TABLE]
This matches the data presented in [5, Definition 6.1].
Finally, assume that our Leonard system is the one from Proposition 5.5. Using (68)–(70) to simplify (72)–(75), we find that
[TABLE]
7 Acknowledgment
The author thanks Paul Terwilliger for providing many valuable ideas and detailed suggestions, and John Caughman for providing the data for the example from Proposition 5.5.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] E. Bannai, T. Ito, Algebraic Combinatorics I: Association Schemes . Benjamin/Cummings, London, 1984.
- 2[2] E. Hanson, A characterization of Leonard pairs using the notion of a tail. Linear Algebra Appl. 435 (2011) 2961–2970; ar Xiv:0911.0098 v 1 .
- 3[3] E. Hanson, A characterization of Leonard pairs using the parameters { a i } i = 0 d superscript subscript subscript 𝑎 𝑖 𝑖 0 𝑑 \{a_{i}\}_{i=0}^{d} . Linear Algebra Appl. 438 (2013) 2289–2305; ar Xiv:1205.4368 v 1 .
- 4[4] E. Hanson, A characterization of bipartite Leonard pairs using the notion of a tail. Linear Algebra Appl. 452 (2014) 46–67; ar Xiv:1308.3826 v 1 .
- 5[5] H. Huang, The classification of Leonard triples of Q Racah type. Linear Algebra Appl. 436 (2012) 1442–1472; ar Xiv:1108.0458 v 1 .
- 6[6] P. Terwilliger, The subconstituent algebra of an association scheme I. J. Algebraic Combin. 1 (1992) 363–388.
- 7[7] P. Terwilliger, Two linear transformations each tridiagonal with respect to an eigenbasis of the other. Linear Algebra Appl. 330 (2001) 149–203; ar Xiv:math/0406555 v 1 .
- 8[8] P. Terwilliger, Leonard pairs from 24 points of view. Rocky Mountain J. Math. 32(2) (2002) 827–888; ar Xiv:math/0406577 v 1 .
