The split decomposition of a tridiagonal pair

Mathematics – Rings and Algebras

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages

Scientific paper

Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension. We consider a pair of linear transformations $A:V \to V$ and $A^*:V \to V$ that satisfy (i)--(iv) below: (i) Each of $A$, $A^*$ is diagonalizable. (ii) There exists an ordering $V_{0},V_{1},...,V_{d}$ of the eigenspaces of $A$ such that $A^* V_i \subseteq V_{i-1} + V_{i} + V_{i+1}$ for $0 \leq i \leq d$, where $V_{-1}=0$, $V_{d+1}=0$. (iii) There exists an ordering $V^*_{0},V^*_{1},...,V^*_{\delta}$ of the eigenspaces of $A^*$ such that $A V^*_i \subseteq V^*_{i-1} + V^*_{i} + V^*_{i+1}$ for $0 \leq i \leq \delta$, where $V^*_{-1}=0$, $V^*_{\delta+1}=0$. (iv) There is no subspace $W$ of $V$ such that both $AW \subseteq W$, $A^* W \subseteq W$, other than W=0 and $W=V$. We call such a pair a tridiagonal pair on $V$. In this note we obtain two results. First, we show that each of $A,A^*$ is determined up to affine transformation by the $V_i$ and $V^*_i$. Secondly, we characterize the case in which the $V_i$ and $V^*_i$ all have dimension one. We prove both results using a certain decomposition of $V$ called the split decomposition.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The split decomposition of a tridiagonal pair does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The split decomposition of a tridiagonal pair, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The split decomposition of a tridiagonal pair will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-369259

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.