SearcharxivSearch

arXiv · 2410.04558

Spaces of Generators for Azumaya Algebras with Unitary Involution

Abstract

Let $A$ be a finite dimensional algebra (possibly with some extra structure) over an infinite field $K$ and let $r\in\mathbb{N}$. The $r$-tuples $(a_1,\dots,a_r)\in A^r$ which fail to generate $A$ are the $K$-points of a closed subvariety $Z_r$ of the affine space underlying $A^r$, the codimension of which may be thought of as quantifying how well a generic $r$-tuple in $A^r$ generates $A$. Taking this intuition one step further, the second author, Reichstein and Williams showed that lower bounds on the codimension of $Z_r$ in $A^r$ (for every $r$) imply upper bounds on the number of generators of \emph{forms} of the $K$-algebra $A$ over finitely generated $K$-rings. That work also demonstrates how finer information on $Z_r$ may be used to construct forms of $A$ which require many elements to generate. The dimension and irreducible components of $Z_r$ are known in a few cases, which in particular lead to upper bounds on the number of generators of Azumaya algebras and Azumaya algebras with involution of the first kind (orthogonal or symplectic). This paper treats the case of Azumaya algebras with a unitary involution by finding the dimension and irreducible components of $Z_r$ when $A$ is the $K$-algebra with involution $(\mathrm{M}_n(K)\times \mathrm{M}_n(K), (a,b)\mapsto (b^{\mathrm{t}},a^{\mathrm{t}}))$. Our analysis implies that every Azumaya algebra with a unitary involution over a finitely generated $K$-ring of Krull dimension $d$ can be generated by $\lfloor \frac{d}{2n-2}+\frac{3}{2} \rfloor$ elements. We also give examples which require at least half that many elements to generate, by building on the work of the second author, Reichstein and Williams. Our method of finding the dimension and irreducible components of $Z_r$ actually applies to all $K$-algebras $A$ satisfying a mild assumption.

Explore related subjects

Keep this discovery

BibTeXRIS

Omer Cantor, Uriya A. First. 2024-10-06. Spaces of Generators for Azumaya Algebras with Unitary Involution. https://arxiv.org/abs/2410.04558

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