SearcharxivSearch

arXiv · 2508.02715

Cholesky decomposition for symmetric matrices, Riemannian geometry, and random matrices

Abstract

For each $n \geq 1$ and sign pattern $\epsilon \in \{ \pm 1 \}^n$, we introduce a cone of real symmetric matrices $LPM_n(\epsilon)$: those with leading principal $k \times k$ minors of signs $\epsilon_k$. These cones are pairwise disjoint and their union $LPM_n$ is an open dense cone in all symmetric matrices; they subsume positive and negative definite matrices, and symmetric (P-,) N-, PN-, almost P-, and almost N- matrices. We show that each $LPM_n$ matrix $A$ admits an uncountable family of Cholesky-type factorizations - yielding a unique lower triangular matrix $L$ with positive diagonals - with additional attractive properties: (i) each such factorization is algorithmic; and (ii) each such Cholesky map $A \mapsto L$ is a smooth diffeomorphism from $LPM_n(\epsilon)$ onto an open Euclidean ball. We then show that (iii) the (diffeomorphic) balls $LPM_n(\epsilon)$ are isometric Riemannian manifolds as well as isomorphic abelian Lie groups, each equipped with a translation-invariant Riemannian metric (and hence Riemannian means/barycentres). Moreover, (iv) this abelian metric group structure on each $LPM_n(\epsilon)$ - and hence the log-Cholesky metric on Cholesky space - yields an isometric isomorphism onto a finite-dimensional Euclidean space. The complex version of this also holds. In the latter part, we show that the abelian group $PD_n$ of positive definite matrices, with its bi-invariant log-Cholesky metric, is precisely the identity-component of a larger group with an alternate metric: the open dense cone $LPM_n$. This also holds for Hermitian matrices over several subfields $\mathbb{F} \subseteq \mathbb{C}$. As a result, (v) the groups $LPM_n^{\mathbb{F}}$ and $LPM_\infty^{\mathbb{F}}$ admit a rich probability theory, and the cones $LPM_n(\epsilon), TPM_n(\epsilon)$ admit Wishart densities with signed Bartlett decompositions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Apoorva Khare, Prateek Kumar Vishwakarma. 2025-07-31. Cholesky decomposition for symmetric matrices, Riemannian geometry, and random matrices. https://arxiv.org/abs/2508.02715

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