Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2505.11747

Structure of the Cayley-Dickson algebras

G. P. Wilmot
View original source ↗Read source document ↗Export metadata ↓

Abstract

Viewing the Cayley-Dickson process as a graded construction provides a rigorous definition of associativity consisting of three classes and the non-associative parts dividing into four types. These simplify the Moufang loop identities and Mal'cev's identity, which identifies the non-associative Lie algebra structure. Analysing the non-associativity structure uncovers 3-cycles that distinguish between the Moufang identities and are used to identify three power-associative subalgebras of sedenions and higher level Cayley-Dickson algebras. Power-associativity introduces zero divisors into Cayley-Dickson algebras in a systematic way and it is convenient to replace the terminology hypercomplex numbers with {\it ultracomplex numbers} for the power-associative algebras. The non-associative types show that zero divisors in these algebras occur in multiples of 84 and cycles and modes are uncovered that reduce these down to factors of seven primary zero divisor pairs. It is shown that this is due to the power-associative subalgebras being embedded into ultracomplex numbers in multiples of seven. The graded notation allows the eight octonion and seven power-associative subalgebras of sedenions to be uniquely derived, up to representation. The zero divisors for split sedenion algebras are analysed and mappings between three of these are provided. These split algebras are shown to involve the same power-associative subalgebras as sedenions.

Explore related subjects

math.RA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

G. P. Wilmot. 2025-05-16. Structure of the Cayley-Dickson algebras. https://arxiv.org/abs/2505.11747

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗