Balanced Leonard Pairs
Abstract
Let K denote a field and let V denote a vector space over K with finite positive dimension. By a Leonard pair on V we mean an ordered pair of linear transformations A:V V and A*:V V that satisfy the following two conditions: (i) There exists a basis for V with respect to which the matrix representing A is irreducible tridiagonal and the matrix representing A* is diagonal. (ii) There exists a basis for V with respect to which the matrix representing A* is irreducible tridiagonal and the matrix representing A is diagonal. Let v*0, ..., v*d (resp. v0, ..., vd) denote a basis for V that satisfies (i) (resp. (ii)). For 0 ≤ i ≤ d let ai denote the coefficient of v*i, when we write A v*i as a linear combination of v*0, ..., v*d, and let a*i denote the coefficient of vi, when we write A* vi as a linear combination of v0..., vd. In this paper we show a0=ad if and only if a*0=a*d. Moreover we show that for d ≥ 1 the following are equivalent: (i) a0=ad and a1=ad-1; (ii) a*0=a*d and a*1=a*d-1; (iii) ai=ad-i and a*i=a*d-i for 0 ≤ i ≤ d. We say A, A* is balanced whenever (i)--(iii) hold. We say A, A* is essentially bipartite (resp. essentially dual bipartite) whenever ai (resp. a*i) is independent of i for 0 ≤ i ≤ d. Observe that if A, A* is essentially bipartite or dual bipartite, then A, A* is balanced. For d ≠ 2 we show that if A, A* is balanced then A, A* is essentially bipartite or dual bipartite.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.