| J. Phys. A: Math. Theor. 42 No 46 (20 November 2009) 462001 (6pp) |
| doi:10.1088/1751-8113/42/46/462001 |
Multi-operator brackets acting thrice
Thomas Curtright, Xiang Jin and Luca Mezincescu
Department of Physics, University of Miami, Coral Gables, FL 33124-8046, USA
E-mail: curtright@miami.edu
Received 9 September 2009, in final form 24 September 2009
Published 22 October 2009
| Abstract. We generalize an identity first found by Bremner for Nambu 3-brackets. For odd N-brackets built from associative operator products, we show that
for any fixed A, when totally antisymmetrized over all the Bs. PACS numbers: 02.10.Ox, 02.10.Xm, 02.20.Sv, 11.25.–w, 11.25.Hf |
1. Introduction
Nambu introduced a multilinear operator bracket in the context of a novel formulation of mechanics [13]. His N-bracket is defined by
where the sum is over all N! permutations of the operators. For example, [ABC] = ABC – ACB + BCA – BAC + CAB – CBA. The operator product is assumed to be associative. To avoid ambiguities when some of the entries within a bracket are themselves products, commas are often used to separate the entries. Parentheses also suffice in such cases. For example, [AD, B, C] = [(AD)BC] = ADBC – ADCB + BCAD – BADC + CADB – CBAD.
The same construction independently appeared in the mathematical literature [10, 11]. The theory of such multi-operator products, as well as their `classical limits' in terms of multivariable Jacobians, has been studied extensively [1–4, 6–9, 12, 14–18].
From an algebraic point of view, it is natural to seek the analogue of the Jacobi identity for N-brackets. For the case of even N-brackets, the obvious generalization where one N-bracket acts on another leads to a true identity if all entries are totally antisymmetrized (see (5) below). But for odd N-brackets this procedure does not work [1, 4]—the total antisymmetrization over all entries of one odd N-bracket acting on another does not vanish, but rather yields a higher order (2N – 1)-bracket.
Nevertheless, an interesting generalization of the Jacobi identity was discovered by Bremner for 3-brackets acting three times [1]. He showed
where A is fixed, but it is implicitly understood that lowercase entries are totally antisymmetrized by summing over all 6! signed permutations of them. The point of this short communication is to show that Bremner's identity generalizes to all odd N-brackets.
Before discussing the general case, we anticipate and indicate a proof for the case of 3-brackets. The Bremner identity can be proved through a resolution of both left- and right-hand sides as a series of canonically ordered words. By direct calculation we find
where all lowercase entries are implicitly totally antisymmetrized. Precisely the same expansion holds for [[Abc][def]g], again by direct calculation. Hence, the identity is established.
That is to say, both [[A[bcd]e]fg] and [[Abc][def]g] can be rendered as a 7-bracket plus another 3-bracket containing 3-brackets, when antisymmetrized over lowercase entries:
Thus, the Bremner identity amounts to the combinatorial statement, as written, that there are two distinct ways to present a 7-bracket in terms of nested 3-brackets.
2. Results for any N
As known, and previously mentioned, even brackets need only act twice to yield an identity. Namely [4, 9]
Total antisymmetrization of all the Bs is understoodNote1. When N = 2 this is the familiar Jacobi identity. The proof is by direct calculation and follows as a consequence of associativity.
However, for odd N, [B1 · · · BN–1[BN · · · B2N–1]] ≠ 0, but instead produces the (2N – 1)-bracket [B1 · · · B2N–1] upon total antisymmetrization [3, 4]. Apparently, the simplest identity obeyed by odd brackets of only one type, that does not introduce higher order brackets, requires that they act at least three times. For any odd N = 2L + 1, a valid relation is the immediate generalization of that found by Bremner for the case of 3-brackets. To show this, we present two easily established lemmata, followed by our main theorem and its proof. Firstly,
Total antisymmetrization of the Bs is understood. Here we have also used the convention that an empty product equals 1. Explicitly, B1 · · · B0 = 1 = BJ + 1 · · · BJ, so that the first and last terms in the sum are
and
, respectively. It is a simple exercise to use this first lemma to prove (5). Similarly,
Finally, it is rather tedious but fairly straightforward to use both lemmata to prove the following.
Theorem 1. For associative products, with implicit total antisymmetrization of the Bs,
Proof. The result (8) follows from resolving the left- and right-hand sides into sums of canonically ordered words, as illustrated above for the case of 3-brackets. We have
All the coefficients m(1,2)n in these two resolutions are manifestly positive integers. The theorem is established by showing that m(1)n = m(2)n for all n.
By direct calculation, through the use of the two lemmata, we find
The determination of the mns is just a matter of enumerating the ways to obtain a particular intercalation of A among the Bs.
Consider in more detail some of the calculations involved. As a first step, with the implicit antisymmetrizationNote2, the internal brackets [B1 · · · B2L + 1] or [B2L + 1 · · · B4L + 1] may be supplanted by products: [B1 · · · B2L + 1] = (2L + 1)!(B1 · · · B2L + 1) or [B2L + 1 · · · B4L + 1] = (2L + 1)!(B2L + 1 · · · B4L + 1). Then we may write, on the one hand,
In this expression, we may now rename indices, bearing in mind the antisymmetrization:
Next, we apply lemma 2 for J = 2L – 1, and identify [AB2L · · · B4L–1] with
, and (B4L · · · B6L) with
:
To continue, consider first the coefficients m(1)n where n ≤ 2L.
For the determination of m(1)n≤2L, since
consists of (2L + 1) Bs, it must be placed to the right of
in the application of lemma 2. Otherwise there would be too many Bs to the left of A. Thus, for m(1)n≤2L we need keep only the first line in the last relation, (14a). To place a total of n Bs to the left of the A contained in
, with k Bs already to the left as in (14a), we then need only the terms in
with an additional (n – k) Bs to the left of A. That is to say, from lemma 1, with J = 2L and all B indices shifted up by 2L – 1,
and from this we need only the term with l = n – k. The net result for m(1)n≤2L is
On the other hand, with similar steps, we have
We again apply lemma 2 for J = 2L – 1, but to [AB1 · · · B2L–1(B2L · · · B4L)], so now we identify A with
, and (B2L · · · B4L) with
. As before, consider first only m(2)n coefficients where n ≤ 2L. For the determination of m(2)n≤2L,
must once again be placed to the right of
, so we need keep only the line (14a). We pick up an additional (n – k) Bs by applying again lemma 1, only this time to the remaining outside bracket in (18). The net result for m(2)n≤2L is
with exactly the same expression for cn≤2L as before, (17). Thus, we have shown m(1)n≤2L = m(2)n≤2L.
Next, consider the coefficients where 2L + 1 ≤ n ≤ 3L. There are still contributions to either m(1)n or m(2)n from the line (14a), as above, of the form (2L + 1)!(2L)!(2L – 1)! × cn, and these contributions to either m(1)n or m(2)n still turn out to be the same. But in this case the sums contributing to cn give
Moreover, from applying lemma 2, there are now contributions to either m(1)n or m(2)n from the second line, (14b), where the respective
s are placed to the left of the
s. Following steps similar to those above, it is not difficult to see that these other terms contribute the same amount to either m(1)n or m(2)n, for 2L + 1 ≤ n ≤ 3L. Namely, (2L + 1)!(2L)!(2L – 1)!×
Thus, the net result is m(1)2L + 1≤n≤3L = m(2)2L + 1≤n≤3L = (2L + 1)!(2L)!(2L – 1)! × c2L + 1≤n≤3L with
Finally, consider the coefficients for 3L + 1 ≤ n ≤ 6L. These are given by an elementary reflection symmetry: m(1)n = m(1)6L–n and m(2)n = m(2)6L–n. Thus, m(1)n = m(2)n = (2L + 1)!(2L)!(2L – 1)! × c6L–n for 3L + 1 ≤ n ≤ 6L. ![]()
As a check, the coefficients must sum to give the number of generic terms that appear in three nested (2L + 1)-brackets (i.e. in either [[[ · · · ] · · · ] · · · ] or [[ · · · ] · · · [ · · · ]]). That is ∑6Ln = 0 mn = ((2L + 1)!)3. Equivalently,
This condition is indeed satisfied by the cn given in (11).
3. Conclusion
Perhaps N-brackets and algebras have an important role to play in physics, as originally suggested by Nambu. Recently there has been considerable interest in N-brackets, especially 3-brackets, as expressed in the physics literature (see [2] and references therein). These ideas await further development.
Acknowledgments
We thank David Fairlie and Cosmas Zachos for sharing their thoughts about Nambu brackets. We also thank the referee for comments which significantly improved the exposition of this communication. One of us (TC) further thanks the Lago Mar Resort for providing the beautiful and stimulating surroundings where portions of this work were completed. This work was supported by NSF Awards 0555603 and 0855386.
ReferencesNotes
where the sum is over all (6N)! permutations of the indices, 1, ..., 6N. Similar meanings apply to the other implicitly antisymmetrized expressions in the communication.
Thomas Curtright et al 2009 J. Phys. A: Math. Theor. 42 462001
I. Vidal et al 2008 EPL 82 34004
C Quesne 2008 J. Phys. A: Math. Theor. 41 392001
I V Litvinyuk et al 2008 New J. Phys. 10 083011
Iddo Eliazar and Joseph Klafter 2009 J. Phys. A: Math. Theor. 42 472003
M Valiente and D Petrosyan 2009 J. Phys. B: At. Mol. Opt. Phys. 42 121001
K. Belczynski et al 2008 ApJ 680 L129
Aurélien Crida et al 2009 ApJ 705 L148
Vladislav Popkov et al 2008 J. Phys. A: Math. Theor. 41 432002
Juna A. Kollmeier et al 2009 ApJ 705 L158