SearcharxivSearch

arXiv · 1708.04135

Introduction to $\mathcal{A}$-Calculus

Abstract

Let $\mathcal{A}$ denote a real, $n$-dimensional, unital, associative algebra.This paper provides an introductory exposition of calculus over $\mathcal{A}$. An $\mathcal{A}$-differentiable function is one for which the differential is right-$\mathcal{A}$-linear. We discuss the basis-dependent correspondence between right-$\mathcal{A}$-linear maps and the regular representation of real matrices in detail. The requirement that the Jacobian matrix of a function fall in the regular representation of $\mathcal{A}$ gives $n^2-n$ generalized $\mathcal{A}$-CR equations. In contrast, some authors use a deleted-difference quotient to describe differentiability over an algebra. We compare these concepts of differentiability over an algebra and prove they are equivalent in the semisimple commutative case. We also show how difference quotients are ill-equipt to study calculus over a nilpotent algebra. The Wirtinger calculus is shown to generalize. We find the $\mathcal{A}$-CReqns are equivalent to the condition that the partial derivatives in all $n-1$ conjugate variables vanish. Our construction modifies that given by Alvarez-Parrilla, Fr\'ias-Armenta, L\'opez-Gonz\'alez and Yee-Romero in a 2012 paper. We also discuss how this conjugate technology gives us a method to convert real PDEs into differential equations over $\mathcal{A}$. Following Wagner, we show how Generalized Laplace equations are naturally seen from the multiplication table of an algebra. Taylor's Theorem and a Tableau for $\mathcal{A}$-differentiable function are derived. We prove many of the usual theorems of integral calculus including Cauchy's Integral Theorem for $\mathcal{A}$ and the Fundamental Theorems of Calculus part I and II. Certainly we do not claim originality in some of what we present, however, we hope this paper adds something useful to the existing literature.

Explore related subjects

Keep this discovery

BibTeXRIS

James S. Cook. 2017-08-04. Introduction to $\mathcal{A}$-Calculus. https://arxiv.org/abs/1708.04135

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