SearcharxivSearch

arXiv · 2109.02101

On the square of the antipode in a connected filtered Hopf algebra

Abstract

It is well-known that the antipode $S$ of a commutative or cocommutative Hopf algebra satisfies $S^{2}=\operatorname*{id}$ (where $S^{2}=S\circ S$). Recently, similar results have been obtained by Aguiar, Lauve and Mahajan for connected graded Hopf algebras: Namely, if $H$ is a connected graded Hopf algebra with grading $H=\bigoplus_{n\geq0}H_n$, then each positive integer $n$ satisfies $\left( \operatorname*{id}-S^2\right)^n \left( H_n\right) =0$ and (even stronger) \[ \left( \left( \operatorname{id}+S\right) \circ\left( \operatorname{id}-S^2\right)^{n-1}\right) \left( H_n\right) = 0. \] For some specific $H$'s such as the Malvenuto--Reutenauer Hopf algebra $\operatorname{FQSym}$, the exponents can be lowered. In this note, we generalize these results in several directions: We replace the base field by a commutative ring, replace the Hopf algebra by a coalgebra (actually, a slightly more general object, with no coassociativity required), and replace both $\operatorname{id}$ and $S^2$ by "coalgebra homomorphisms" (of sorts). Specializing back to connected graded Hopf algebras, we show that the exponent $n$ in the identity $\left( \operatorname{id}-S^2\right) ^n \left( H_n\right) =0$ can be lowered to $n-1$ (for $n>1$) if and only if $\left( \operatorname{id} - S^2\right) \left( H_2\right) =0$. (A sufficient condition for this is that every pair of elements of $H_1$ commutes; this is satisfied, e.g., for $\operatorname{FQSym}$.)

Explore related subjects

Keep this discovery

BibTeXRIS

Darij Grinberg. 2021-09-05. On the square of the antipode in a connected filtered Hopf algebra. https://doi.org/10.46298/cm.10431

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