Search arXivSearch

arXiv · 1801.08072

A framework for rank identities -- With a view towards operator algebras

Abstract

For every square matrix $A$ over a field $\mathbb{K}$, we have the equality $\mathrm{rank}(A) + \mathrm{rank}(I-A) = \mathrm{rank}(I) + \mathrm{rank}(A-A^2)$ where $I$ denotes the identity matrix with the same dimensions as $A$. In this article, we start a program to systematically characterize and generalize such rank identities with a view towards applications to operator algebras. We initiate the study of so-called ranked rings (unital rings with a `rank-system'), the main examples of interest being finite von Neumann algebras, Murray-von Neumann algebras, and von Neumann rank-rings. In our framework, a field $\mathbb{K}$ may be viewed as a ranked ring with a $\mathbb{Z}^+$-valued rank-system consisting of the usual rank functions on $M_n(\mathbb{K})$ (for $n \in \mathbb{N})$ and serves as the motivating example. We show that a finite von Neumann algebra $\mathscr{R}$ with center $\mathscr{C}$ (and the corresponding Murray-von Neumann algebra $\mathscr{R}_{\textrm{aff}}$) may be endowed with a $\mathscr{C}^{+}$-valued rank-system, considering $\mathscr{C}^{+}$ as a commutative monoid with respect to operator addition. We give an algorithm to generate rank identities in ranked $\mathbb{K}$-algebras via the polynomial function calculus, and in ranked complex Banach algebras via the holomorphic function calculus. As an illustrative application, using these abstract rank identities we show that the sum of finitely many idempotents $e_1, \ldots, e_m$ in a finite von Neumann algebra is an idempotent if and only if they are mutually orthogonal, that is, $e_i e_j = \delta_{ij} e_i$ for $1 \le i, j \le m$. In contrast, this does not hold in general in the ring of bounded operators on an infinite-dimensional complex Hilbert space.

Explore related subjects

Keep this discovery

BibTeXRIS

Soumyashant Nayak. 2018-01-24. A framework for rank identities -- With a view towards operator algebras. https://arxiv.org/abs/1801.08072

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