Leibniz triple systems

Abstract

We define Leibniz triple systems in a functorial manner using the algorithm of Kolesnikov and Pozhidaev which converts identities for algebras into identities for dialgebras. We verify that Leibniz triple systems are the natural analogues of Lie triple systems in the context of dialgebras by showing that both the iterated bracket in a Leibniz algebra and the permuted associator in a Jordan dialgebra satisfy the defining identities for Leibniz triple systems. We construct the universal Leibniz envelopes of Leibniz triple systems and prove that every identity satisfied by the iterated bracket in a Leibniz algebra is a consequence of the defining identities for Leibniz triple systems. To conclude, we present some examples of 2-dimensional Leibniz triple systems and their universal Leibniz envelopes.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…