SearcharxivSearch

arXiv · 0806.2089

Tools for working with multiplier Hopf algebras

Abstract

Let $(A,Δ)$ be a multiplier Hopf algebra. In general, the underlying algebra $A$ need not have an identity and the coproduct $Δ$ does not map $A$ into $A\otimes A$ but rather into its multiplier algebra $M(A\otimes A)$. In this paper, we study {\it some tools} that are frequently used when dealing with such multiplier Hopf algebras and that are typical for working with algebras without identity in this context. The {\it basic ingredient} is a unital left $A$-module $X$. And the basic construction is that of extending the module by looking at linear maps $ρ:A\to X$ satisfying $ρ(aa')=aρ(a')$ where $a,a'\in A$. We write the module action as multiplication. Of course, when $x\in X$, and when $ρ(a)=ax$, we get such a linear map. And if $A$ has an identity, all linear maps $ρ$ have this form for $x=ρ(1)$. However, the point is that in the case of a non-unital algebra, the space of such maps is in general strictly bigger than $X$ itself. We get an {\it extended module}, denoted by $\bar X$ (for reasons that will be explained in the paper). We study all sorts of more complicated situations where such extended modules occur and we illustrate all of this with {\it several examples}, from very simple ones to more complex ones where iterated extensions come into play. We refer to cases that appear in the literature. We use this basic idea of extending modules to explain, in a more rigorous way, the so-called {\it covering technique}, which is needed when using {\it Sweedler notations} for coproducts and coactions. Again, we give many examples and refer to the existing literature where this technique is applied.

Explore related subjects

Keep this discovery

BibTeXRIS

Alfons Van Daele. 2008-06-12. Tools for working with multiplier Hopf algebras. https://arxiv.org/abs/0806.2089

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