Dendriform Analogues of Lie and Jordan Triple Systems

Abstract

We use computer algebra to determine all the multilinear polynomial identities of degree ≤7 satisfied by the trilinear operations (a·b)·c and a·(b·c) in the free dendriform dialgebra, where a·b is the pre-Lie or the pre-Jordan product. For the pre-Lie triple products, we obtain one identity in degree 3, and three independent identities in degree 5, and we show that every identity in degree 7 follows from the identities of lower degree. For the pre-Jordan triple products, there are no identities in degree 3, five independent identities in degree 5, and ten independent irreducible identities in degree 7. Our methods involve linear algebra on large matrices over finite fields, and the representation theory of the symmetric group.

Key Words:

• Computer algebra
• Dendriform dialgebras
• Pre-Lie algebras
• Pre-Jordan algebras
• Polynomial identities
• Representation theory of the symmetric group
• Triple systems

2010 Mathematics Subject Classification:

• Primary: 17A40
• Secondary: 17-04
• 17A30
• 17A32
• 17A50
• 17B01
• 17B60
• 17C05
• 17C50

Notes

¹This short and beautiful paper deserves to be better known in the representation theory and computer algebra communities. In his MathSciNet review (MR0624907), G. D. James states: “Most methods for working out the matrices for the natural representation are messy, but this paper gives an approach which is simple both to prove and to apply.”

Communicated by A. Elduque.