Search arXivSearch

arXiv · 1204.4576

Square Roots of -1 in Real Clifford Algebras

Abstract

It is well known that Clifford (geometric) algebra offers a geometric interpretation for square roots of -1 in the form of blades that square to minus 1. This extends to a geometric interpretation of quaternions as the side face bivectors of a unit cube. Systematic research has been done [32] on the biquaternion roots of -1, abandoning the restriction to blades. Biquaternions are isomorphic to the Clifford (geometric) algebra $Cl(3,0)$ of $\mathbb{R}^3$. Further research on general algebras $Cl(p,q)$ has explicitly derived the geometric roots of -1 for $p+q \leq 4$ [17]. The current research abandons this dimension limit and uses the Clifford algebra to matrix algebra isomorphisms in order to algebraically characterize the continuous manifolds of square roots of -1 found in the different types of Clifford algebras, depending on the type of associated ring ($\mathbb{R}$, $\mathbb{H}$, $\mathbb{R}^2$, $\mathbb{H}^2$, or $\mathbb{C}$). At the end of the paper explicit computer generated tables of representative square roots of -1 are given for all Clifford algebras with $n=5,7$, and $s=3 \, (mod 4)$ with the associated ring $\mathbb{C}$. This includes, e.g., $Cl(0,5)$ important in Clifford analysis, and $Cl(4,1)$ which in applications is at the foundation of conformal geometric algebra. All these roots of -1 are immediately useful in the construction of new types of geometric Clifford Fourier transformations.

Explore related subjects

Keep this discovery

BibTeXRIS

Eckhard Hitzer, Jacques Helmstetter, Rafal Ablamowicz. 2012-04-20. Square Roots of -1 in Real Clifford Algebras. https://arxiv.org/abs/1204.4576

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