SearcharxivSearch

arXiv · 0802.1096

The structure of a tridiagonal pair

Abstract

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 the following conditions: (i) each of $A,A^*$ is diagonalizable; (ii) there exists an ordering $\{V_i\}_{i=0}^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$ and $V_{d+1}=0$; (iii) there exists an ordering $\{V^*_i\}_{i=0}^δ$ of the eigenspaces of $A^*$ such that $A V^*_i \subseteq V^*_{i-1} + V^*_i + V^*_{i+1}$ for $0 \leq i \leq δ$, where $V^*_{-1}=0$ and $V^*_{δ+1}=0$; (iv)there is no subspace $W$ of $V$ such that $AW \subseteq W$, $A^* W \subseteq W$, $W \neq 0$, $W \neq V$. We call such a pair a tridiagonal pair on $V$. It is known that $d=δ$ and for $0 \leq i \leq d$ the dimensions of $V_i, V_{d-i}, V^*_i, V^*_{d-i}$ coincide. In this paper we show that the following (i)--(iv) hold provided that $K$ is algebraically closed: (i) Each of $V_0$, $V^*_0$, $V_d$, $V^*_d$ has dimension 1. (ii) There exists a nondegenerate symmetric bilinear form $(,)$ on $V$ such that $(Au,v)=(u,Av)$ and $(A^*u,v)=(u,A^*v)$ for all $u,v \in V$. (iii) There exists a unique anti-automorphism of $End(V)$ that fixes each of $A,A^*$. (iv) The pair $A,A^*$ is determined up to isomorphism by the data $(\{þ_i\}_{i=0}^d; \{þ^*_i\}_{i=0}^d; \{ζ_i\}_{i=0}^d)$, where $þ_i$ (resp. $þ^*_i$) is the eigenvalue of $A$ (resp. $A^*$) on $V_i$ (resp. $V^*_i$), and $\{ζ_i\}_{i=0}^d$ is the split sequence of $A,A^*$ corresponding to $\{þ_i\}_{i=0}^d$ and $\{þ^*_i\}_{i=0}^d$.

Explore related subjects

Keep this discovery

BibTeXRIS

Kazumasa Nomura, Paul Terwilliger. 2008-02-08. The structure of a tridiagonal pair. https://arxiv.org/abs/0802.1096

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

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA