Linear transformations that are tridiagonal with respect to the three decompositions for an LR triple

preprint2015arXivOpen access

Abstract

Fix an integer d≥0d \geq 0, a field F\mathbb{F}, and a vector space VV over F\mathbb{F} with dimension d+1d+1. By a decomposition of VV we mean a sequence {Vi}i=0d\{V_i\}_{i=0}^d of 11-dimensional subspaces of VV whose sum is VV. For a linear transformation AA from VV to VV, we say AA lowers {Vi}i=0d\{V_i\}_{i=0}^d whenever AVi=Vi−1A V_i = V_{i-1} for 0≤i≤d0 \leq i \leq d, where V−1=0V_{-1}=0. We say AA raises {Vi}i=0d\{V_i\}_{i=0}^d whenever AVi=Vi+1A V_i = V_{i+1} for 0≤i≤d0 \leq i \leq d, where Vd+1=0V_{d+1}=0. An ordered pair of linear transformations A,BA,B from VV to VV is called LR whenever there exists a decomposition {Vi}i=0d\{V_i\}_{i=0}^d of VV that is lowered by AA and raised by BB. In this case the decomposition {Vi}i=0d\{V_i\}_{i=0}^d is uniquely determined by A,BA,B; we call it the (A,B)(A,B)-decomposition of VV. Consider a 33-tuple of linear transformations AA, BB, CC from VV to VV such that any two of AA, BB, CC form an LR pair on VV. Such a 33-tuple is called an LR triple on VV. Let αα, ββ, γγ be nonzero scalars in F\mathbb{F}. The triple αA,βB,γCαA, βB, γC is an LR triple on VV, said to be associated to A,B,CA,B,C. Let {Vi}i=0d\{V_i\}_{i=0}^d be a decomposition of VV and let XX be a linear transformation from VV to VV. We say XX is tridiagonal with respect to {Vi}i=0d\{V_i\}_{i=0}^d whenever XVi⊆Vi−1+Vi+Vi+1X V_i \subseteq V_{i-1} + V_i + V_{i+1} for 0≤i≤d0 \leq i \leq d. Let X\cal X be the vector space over F\mathbb{F} consisting of the linear transformations from VV to VV that are tridiagonal with respect to the (A,B)(A,B) and (B,C)(B,C) and (C,A)(C,A) decompositions of VV. There is a special class of LR triples, called qq-Weyl type. In the present paper, we find a basis of X\cal X for each LR triple that is not associated to an LR triple of qq-Weyl type.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.