Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1708.04136

Theory of Series in the $\mathcal{A}$-calculus and the $N$-Pythagorean Theorem

James S. Cook·Daniel Freese
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we study sequences, series, power series and uniform convergence in the $\mathcal{A}$-Calculus. Here $\mathcal{A}$ denotes an associative unital real algebra. We say a function is $\mathcal{A}$-differentiable if it is real differentiable and its differential is in the regular representation of the algebra. We show the theory of sequences and numerical series resembles the usual theory, but, the proof to establish this claim requires modification of the standard arguments due to the submultiplicativity of the norm on $\mathcal{A}$. In contrast, the theorems concerning divergence of power series over $\mathcal{A}$ are modified notably from the standard theory. We study how the ratio, root and geometric series results are modified due to both the submultiplicativity of the norm and the calculational novelty of zero-divisors. Despite these difficulties, we find natural generalizations of the usual theorems of real analysis for uniformly convergent series of functions. We prove the usual calculations with power series transfer nicely to the $\mathcal{A}$-calculus. Then power series are used to define sine, cosine, hyperbolic sine, hyperbolic cosine and the exponential. Many standard identities are derived for entire functions on an arbitrary commutative $\mathcal{A}$. Finally, special functions are introduced and we derive the $N$-Pythagorean Theorem which produces $\cos^2 \theta+ \sin^2 \theta=1$ and $\cosh^2 \theta - \sinh^2 \theta = 1$ as well as a host of other less known identities.

Explore related subjects

math.RA

Keep this discovery

BibTeXRIS

James S. Cook, Daniel Freese. 2017-08-04. Theory of Series in the $\mathcal{A}$-calculus and the $N$-Pythagorean Theorem. https://arxiv.org/abs/1708.04136

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↗