SearcharxivSearch

arXiv · 1210.3954

Weak Multiplier Hopf Algebras. Preliminaries, motivation and basic examples

Abstract

Let $G$ be a {\it finite group}. Consider the algebra $A$ of all complex functions on G (with pointwise product). Define a coproduct $Δ$ on A by $Δ(f)(p,q)=f(pq)$ where $f\in A$ and $p,q\in G$. Then $(A,Δ)$ is a Hopf algebra. If $G$ is only a {\it groupoid}, so that the product of two elements is not always defined, one still can consider $A$ and define $Δ(f)(p,q)$ as above when $pq$ is defined. If we let $Δ(f)(p,q)=0$ otherwise, we still get a coproduct on $A$, but $Δ(1)$ will no longer be the identity in $A\ot A$. The pair $(A,Δ)$ is not a Hopf algebra but a weak Hopf algebra. If $G$ is a {\it group}, but {\it no longer finite}, one takes for $A$ the algebra of functions with finite support. Then $A$ has no identity and $(A,Δ)$ is not a Hopf algebra but a multiplier Hopf algebra. Finally, if $G$ is a {\it groupoid}, but {\it not necessarily finite}, the standard construction above, will give, what we call in this paper, a weak multiplier Hopf algebra. Indeed, this paper is devoted to the development of this 'missing link': {\it weak multiplier Hopf algebras}. We spend a great part of this paper to the motivation of our notion and to explain where the various assumptions come from. The goal is to obtain a good definition of a weak multiplier Hopf algebra. Throughout the paper, we consider the basic examples and use them, as far as this is possible, to illustrate what we do. In particular, we think of the finite-dimensional weak Hopf algebras. On the other hand however, we are also inspired by the far more complicated existing analytical theory. In forthcoming papers on the subject, we develop the theory further.

Explore related subjects

Keep this discovery

BibTeXRIS

Alfons Van Daele, Shuanhong Wang. 2012-10-15. Weak Multiplier Hopf Algebras. Preliminaries, motivation and basic examples. https://arxiv.org/abs/1210.3954

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