Search arXivSearch

arXiv · math/0304077

Two linear transformations each tri-diagonal with respect to an eigenbasis of the other; the TD-D canonical form and the LB-UB canonical form

Abstract

Let $\K$ denote a field and let $V$ denote a vector space over $\K$ with finite positive dimension. We consider an ordered pair of linear transformations $A:V\to V$ and $B:V\to V$ which satisfy both (i), (ii) below. (i) There exists a basis for $V$ with respect to which the matrix representing $A$ is irreducible tridiagonal and the matrix representing $B$ is diagonal; (ii) There exists a basis for $V$ with respect to which the matrix representing $A$ is diagonal and the matrix representing $B$ is irreducible tridiagonal. We call such a pair a Leonard pair on $V$. We introduce two canonical forms for Leonard pairs. We call these the TD-D canonical form and the LB-UB canonical form. In the TD-D canonical form the Leonard pair is represented by an irreducible tridiagonal matrix and a diagonal matrix, subject to a certain normalization. In the LB-UB canonical form the Leonard pair is represented by a lower bidiagonal matrix and an upper bidiagonal matrix, subject to a certain normalization. We describe the two canonical forms in detail. As an application we obtain the following results. Given square matrices $A,B$ over $\K$, with $A$ tridiagonal and $B$ diagonal, we display a necessary and sufficient condition for $A,B$ to represent a Leonard pair. Given square matrices $A,B$ over $\K$, with $A$ lower bidiagonal and $B$ upper bidiagonal, we display a necessary and sufficient condition for $A,B$ to represent a Leonard pair. We briefly discuss how Leonard pairs correspond to the $q$-Racah polynomials and some related polynomials in the Askey scheme. We present some open problems concerning Leonard pairs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paul M. Terwilliger. 2003-04-06. Two linear transformations each tri-diagonal with respect to an eigenbasis of the other; the TD-D canonical form and the LB-UB canonical form. https://arxiv.org/abs/math/0304077

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Graphs of Moore-Penrose inverse of matrices possessing the treeangle property

It is known that the inverse of an invertible real square matrix satisfying the treeangle property, is a treediagonal matrix. A converse statement also holds. We show that the verbatim analogues are not true for the Moore-Penrose inverse, and obtain the precise structure of graphs corresponding to the Moore-Penrose inverse of matrices possessing the treeangle property.

math.RA