Leonard Pair in Linear Algebra

• Leonard pair is an ordered pair of diagonalizable linear maps on a finite-dimensional space with mutually irreducible tridiagonal and diagonal representations.
• Its parameter arrays and recognition criteria enable precise classification and reveal deep connections with Q-polynomial distance-regular graphs and orthogonal polynomials.
• Leonard pairs underpin various algebraic frameworks, influencing self-duality, spin conditions, and higher-rank extensions in representation theory and integrable models.

A Leonard pair is an ordered pair of diagonalizable linear transformations $A, A^*$ on a finite-dimensional vector space $V$ such that there exists a basis in which $A$ is irreducible tridiagonal and $A^*$ is diagonal, and there exists a basis in which $A^*$ is irreducible tridiagonal and $A$ is diagonal. In this sense, each transformation acts on an eigenbasis for the other one in an irreducible tridiagonal fashion. Leonard pairs form a linear-algebraic abstraction of $Q$-polynomial distance-regular graphs and constitute a basic algebraic framework for the bispectrality of finite families of orthogonal polynomials, especially in the Askey and $q$-Askey settings (Hanson, 2013, Nomura et al., 2012).

1. Definition, multiplicity-freeness, and Leonard systems

The defining feature of a Leonard pair is the mutual tridiagonalization/diagonalization property. Here “irreducible tridiagonal” means that all entries immediately above and below the main diagonal are nonzero. A basic consequence is multiplicity-freeness: both $A$ and $A^*$ are diagonalizable and each of their eigenspaces is one-dimensional (Nomura et al., 2012).

A refined object attached to a Leonard pair is a Leonard system

$V$0

where $V$1 and $V$2 are standard orderings of the primitive idempotents of $V$3 and $V$4, respectively. The associated parameter array

$V$5

records the eigenvalue and split-sequence data and determines the Leonard system up to isomorphism. The eigenvalue sequences satisfy a uniform second-order condition: the quantities

$V$6

are equal and independent of $V$7 for the indicated ranges, and the common value is written as $V$8, where $V$9 is the fundamental parameter (Nomura, 2014, Nomura, 2014).

This parameter-array viewpoint is central to classification. It supports both explicit canonical forms and invariant-based descriptions, and it underlies later refinements such as end-parameter theory, self-duality, bipartite conditions, and the passage to more general bispectral structures.

2. Recognition criteria and parameter-based characterizations

A substantial part of the theory concerns the inverse problem: given tridiagonal and diagonal data, how can one recognize that a pair is Leonard? One characterization uses the parameter sequence $A$0, defined in one standard orientation by

$A$1

together with the dual eigenvalues $A$2. In this framework, the key conditions are a leaf condition in an auxiliary graph $A$3, a three-term recurrence

$A$4

a quadratic relation

$A$5

and distinctness of the dual eigenvalues (Hanson, 2012).

A later recognition theorem reformulates the problem in terms of the intersection numbers $A$6, $A$7, $A$8 and the dual eigenvalues $A$9. In a basis where $A^*$0 is diagonal, $A^*$1 takes the irreducible tridiagonal form with diagonal entries $A^*$2, superdiagonal entries $A^*$3, and subdiagonal entries $A^*$4. This characterization separates the roles of $A^*$5 and $A^*$6 and provides a direct test from explicit matrix data (Hanson, 2019).

These recognition results are purely algebraic. They generalize earlier $A^*$7-polynomial criteria from distance-regular graph theory, but they do so without relying on graph-theoretic hypotheses. A plausible implication is that Leonard-pair recognition is most naturally understood as a problem in the interaction between primitive idempotents, tridiagonal adjacency, and low-order recurrences rather than as a secondary consequence of combinatorial regularity.

3. Bipartite, near-bipartite, self-dual, and spin structures

One important special class is the bipartite Leonard pair. In the bipartite setting, the relevant diagonal entries vanish. In one formulation, if $A^*$8 is an eigenbasis for $A^*$9 on which $A^*$0 is irreducible tridiagonal and $A^*$1 denotes the projection onto $A^*$2, then the flat part

$A^*$3

captures the diagonal of $A^*$4. The pair is bipartite exactly when $A^*$5. It is near-bipartite when $A^*$6 is again a Leonard pair; in that case $A^*$7 is bipartite and is called the bipartite contraction. Over an algebraically closed field, near-bipartite Leonard pairs are classified up to isomorphism: they are precisely the essentially bipartite, the reinforced dual $A^*$8-Krawtchouk type, or the Krawtchouk type (Nomura et al., 2023).

For bipartite Leonard pairs, the notion of a tail yields a sharp characterization. One forms a graph $A^*$9 on the primitive idempotents of $A$0, declaring $A$1 adjacent to $A$2 when $A$3. An ordered pair $A$4 of distinct primitive idempotents is a tail if the vertex corresponding to $A$5 is adjacent to no vertex except $A$6, and the vertex corresponding to $A$7 is adjacent to at most one vertex besides $A$8. In the bipartite case, $A$9 is $Q$0-polynomial if and only if $Q$1 is normalizing, $Q$2 is a tail, and the eigenvalues of $Q$3 are mutually distinct. The proof passes through a three-term recurrence

$Q$4

that is independent of $Q$5 (Hanson, 2013).

Another distinguished symmetry is self-duality. A Leonard pair is self-dual when there exists an automorphism of $Q$6 swapping $Q$7 and $Q$8. This automorphism is unique. In the self-dual case there exists an invertible linear map $Q$9 such that $q$0 realizes the duality; moreover, $q$1 can be expressed as a polynomial in $q$2 and $q$3, and its action on canonical flags, decompositions, and bases can be described explicitly (Nomura et al., 2018).

The spin condition strengthens this picture. A Leonard pair has spin when there exist invertible maps $q$4 such that $q$5, $q$6, and

$q$7

Assuming the ground field is algebraically closed and $q$8, a Leonard pair has spin if and only if it is self-dual and there exist scalars $q$9, not all zero, such that

$A$0

Equivalently, the zero diagonal space $A$1 is nonzero (Nomura et al., 25 Sep 2025).

4. Orthogonal polynomials, representation theory, and combinatorial realizations

Leonard pairs are closely tied to finite orthogonal polynomial systems. For Krawtchouk type, both the eigenvalue and dual eigenvalue sequences are

$A$2

and every Leonard pair of Krawtchouk type arises from finite-dimensional irreducible $A$3-modules. In that realization, Krawtchouk polynomials appear as transition coefficients between eigenbases, and their three-term recurrence, orthogonality, difference equation, and generating function follow from the Leonard-pair and module structure (Nomura et al., 2012).

At the $A$4-Racah level, Leonard pairs occur naturally in the representation theory of the universal double affine Hecke algebra $A$5 of type $A$6. If $A$7 is a feasible finite-dimensional irreducible $A$8-module, then $A$9 and $A^*$0 act on each eigenspace of $A^*$1 as a Leonard pair of $A^*$2-Racah type. The isomorphism class of such a pair is encoded by Huang data $A^*$3, and the paper gives necessary and sufficient conditions for a pair of $A^*$4-Racah Leonard pairs to arise from this DAHA construction (Nomura et al., 2017).

In algebraic combinatorics, Leonard pairs govern thin irreducible modules for Terwilliger algebras of distance-regular graphs. They also enter the theory of spin models. For a formally self-dual distance-regular graph of $A^*$5-Racah type, if for all base vertices all irreducible Terwilliger modules are thin with equal endpoint and dual endpoint and have the specified intersection numbers, then the graph affords a spin model $A^*$6 explicitly constructed from Leonard-pair data. This links Leonard pairs, Bose–Mesner algebras, Terwilliger algebras, Nomura algebras, and Jones-type spin models within a single framework (Nomura et al., 2019).

Leonard pairs also appear in integrable systems. The Heun–Askey–Wilson operator can be diagonalized within the framework of the algebraic Bethe ansatz using Leonard pairs. In this setting, two families of on-shell Bethe states generate explicit bases on which a Leonard pair acts in a tridiagonal fashion, and the associated $A^*$7-polynomials satisfy Baxter $A^*$8-$A^*$9 relations. For a special case, the $V$00-polynomial is identified with the Askey–Wilson polynomial (Baseilhac et al., 2019).

5. Canonical matrix forms, moduli, and isomorphism invariants

A recurrent theme in the classification theory is the search for canonical matrix realizations. One such realization is LB-TD form: $V$01 is lower bidiagonal with all subdiagonal entries $V$02, and $V$03 is irreducible tridiagonal. Over an algebraically closed field and for $V$04 not a root of unity, all Leonard pairs in $V$05 with LB-TD form are classified. In that regime, only the $V$06-Racah, $V$07-Hahn, and dual $V$08-Hahn types admit LB-TD forms, and a Leonard pair has LB-TD form if and only if at least two of $V$09, $V$10, $V$11 are nonzero (Nomura, 2014).

Another canonical problem is zero-diagonal TD-TD form, where both $V$12 and $V$13 are irreducible tridiagonal with all diagonal entries $V$14. This case is completely classified. The decisive criterion is self-oppositeness: a Leonard pair has zero-diagonal TD-TD form if and only if it is isomorphic to its opposite $V$15. For $V$16, the possible types are Krawtchouk, Bannai–Ito when $V$17 is even, and $V$18-Racah (Nomura, 2015).

The invariant theory of Leonard systems admits a particularly sharp boundary description. The end-parameters

$V$19

together with the fundamental parameter $V$20 determine a Leonard system up to isomorphism. Moreover, for specified end-parameters, there are up to inverse at most $V$21 Leonard systems, and this upper bound is best possible (Nomura, 2014). A related refinement replaces end-parameters by end-entries

$V$22

In this formulation, a Leonard system is determined up to isomorphism by its end-entries and $V$23 precisely in the generic cases $V$24 with $V$25, or $V$26 with $V$27; otherwise there are infinitely many non-isomorphic systems with the same data (Nomura, 2014).

Compatibility theory adds another layer to the moduli problem. Two Leonard pairs $V$28 and $V$29 on the same space are compatible when $V$30 and $V$31. A companion of $V$32 is a polynomial $V$33 such that $V$34 is again a Leonard pair. These notions are equivalent under $V$35, and the compatible pairs are classified through equalities involving the invariant value $V$36 and the endpoint split-sequence products (Nomura et al., 2021).

6. Generalizations, failures of Leonard duality, and higher-rank extensions

Leonard duality does not exhaust finite bispectrality. The dual $V$37 Hahn polynomials provide a basic counterexample: they are orthogonal on a finite discrete set and satisfy a three-term recurrence, but they do not satisfy the Leonard duality property. Instead of a second-order difference equation, they satisfy a fourth-order difference eigenvalue equation. The corresponding generalized Leonard pair consists of matrices $V$38 such that, in the eigenbasis where $V$39 is diagonal, $V$40 is 3-diagonal, while in the eigenbasis where $V$41 is diagonal, $V$42 is 5-diagonal (Tsujimoto et al., 2011).

A direct extension of the Leonard-pair paradigm is the Leonard trio $V$43. In an irreducible Leonard trio, both $V$44 and $V$45 are Leonard pairs, while the overlap coefficients between eigenbases are in general rational rather than polynomial. These coefficients satisfy generalized eigenvalue problems and biorthogonality relations. For $V$46-Racah-type irreducible Leonard trios, Wilson’s rational functions appear as overlap coefficients, and they admit recurrence, difference, and biorthogonality relations (Crampé et al., 21 Jan 2026).

A higher-rank analogue is the factorized $V$47-Leonard pair. It is introduced as a rank $V$48 Leonard pair whose actions in certain bases correspond to the root system of the Weyl group $V$49, with additional factorization properties. The transition-matrix entries are bivariate orthogonal polynomials of Tratnik type with bispectral properties, and the most general examples are associated with an intricate product of univariate $V$50-)Hahn and dual $V$51-)Hahn polynomials (Crampe et al., 2023).

Recent work also shows that Leonard-pair operations can change the polynomial family while preserving the same inner product. For dual Hahn polynomials with parameters $V$52 and $V$53, if $V$54 denote the corresponding Leonard pair, then

$V$55

is again a Leonard pair. In that regime, the same orthogonal system can be treated not only as dual Hahn polynomials but also as Racah polynomials with respect to the same inner product (Huang, 4 Aug 2025).

These developments indicate that the classical Leonard-pair framework is both rigid and extensible: rigid enough to admit exact classifications, explicit canonical forms, and strong invariant theory, yet extensible enough to accommodate generalized dualities, higher-order difference operators, rational overlap coefficients, and higher-rank bispectral structures.