SearcharxivSearch

arXiv · 1410.2159

Cauchy Pairs and Cauchy Matrices

Abstract

Let $\mathbb{K}$ denote a field and let $\mathfrak{X}$ denote a finite non-empty set. Let $\text{Mat}_\mathfrak{X}(\mathbb{K})$ denote the $\mathbb{K}$-algebra consisting of the matrices with entries in $\mathbb{K}$ and rows and columns indexed by $\mathfrak{X}$. A matrix $C \in \text{Mat}_\mathfrak{X}(\mathbb{K})$ is called Cauchy whenever there exist mutually distinct scalars $\{x_i\}_{i \in \mathfrak{X}}, \{\tilde{x}_i\}_{i \in \mathfrak{X}}$ from $\mathbb{K}$ such that $C_{ij} = (x_i - \tilde{x}_j)^{-1}$ for $i, j \in \mathfrak{X}$. In this paper, we give a linear algebraic characterization of a Cauchy matrix. To do so, we introduce the notion of a Cauchy pair. A Cauchy pair is an ordered pair of diagonalizable linear transformations $(X, \tilde{X})$ on a finite-dimensional vector space $V$ such that $X-\tilde{X}$ has rank 1 and such that there does not exist a proper subspace $W$ of $V$ such that $X W \subseteq W$ and $\tilde{X} W \subseteq W$. Let $V$ denote a vector space over $\mathbb{K}$ with dimension $|\mathfrak{X}|$. We show that for every Cauchy pair $(X, \tilde{X})$ on $V$, there exists an $X$-eigenbasis $\{v_i\}_{i \in \mathfrak{X}}$ for $V$ and an $\tilde{X}$-eigenbasis $\{w_i\}_{i \in \mathfrak{X}}$ for $V$ such that the transition matrix from $\{v_i\}_{i \in \mathfrak{X}}$ to $\{w_i\}_{i \in \mathfrak{X}}$ is Cauchy. We show that every Cauchy matrix arises as a transition matrix for a Cauchy pair in this way. We give a bijection between the set of equivalence classes of Cauchy pairs on $V$ and the set of permutation equivalence classes of Cauchy matrices in $\text{Mat}_\mathfrak{X}(\mathbb{K})$.

Explore related subjects

Keep this discovery

BibTeXRIS

Alison Gordon Lynch. 2014-10-08. Cauchy Pairs and Cauchy Matrices. https://arxiv.org/abs/1410.2159

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