SearcharxivSearch

arXiv · 1407.0513

Modified weak multiplier Hopf algebras

Abstract

Let $(A,Δ)$ be a regular weak multiplier Hopf algebra. Denote by $E$ the canonical idempotent of $(A,Δ)$ and by $B$ the image of the source map. Recall that $B$ is a non-degenerate algebra, sitting nicely in the multiplier algebra $M(A)$ of $A$ so that also $M(B)$ can be viewed as a subalgebra of $M(A)$. Assume that $u,v$ are invertible elements in $M(B)$ so that $E(vu\otimes 1)E=E$. This last condition is obviously fulfilled if $u$ and $v$ are each other inverses, but there are also other cases. Now modify $Δ$ and define $Δ'(a)=(u\otimes 1)Δ(a)(v\otimes 1)$ for all $a \in A$. We show in this paper that $(A,Δ')$ is again a regular weak multiplier Hopf algebra and we obtain formulas for the various data of $(A,Δ')$ in terms of the data associated with the original pair $(A,Δ)$. In the case of a finite-dimensional weak Hopf algebra, the above deformation is a special case of the twists as studied by Nikshych and Vainerman. It is known that any regular weak multiplier Hopf algebra gives rise in a natural way to a regular multiplier Hopf algebroid. This result applies to both the original weak multiplier Hopf algebra $(A,Δ)$ and the modified version $(A,Δ')$. However, the same method can be used to associate another regular multiplier Hopf algebroid to the triple $(A,Δ,Δ')$. This turns out to give an example of a regular multiplier Hopf algebroid that does not arise from a regular weak multiplier Hopf algebra although the base algebra is separable Frobenius.

Explore related subjects

Keep this discovery

BibTeXRIS

Alfons Van Daele. 2014-07-02. Modified weak multiplier Hopf algebras. https://arxiv.org/abs/1407.0513

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