Abstract
A general class of multi-parametric families of unital associative complex algebras, defined by commutation relations associated with group or semigroup actions of dynamical systems and iterated function systems, is considered. A generalization of these commutation relations in three generators is also considered, modifying Lie algebra type commutation relations, typical for usual differential or difference operators, to relations satisfied by more general twisted difference operators associated with general twisting maps. General reordering and nested commutator formulas for arbitrary elements in these algebras are presented, and some special cases are considered, generalizing some well-known results in mathematics and physics.
Access provided by Autonomous University of Puebla. Download conference paper PDF
Similar content being viewed by others
Keywords
MSC 2010 Classification:
22.1 Introduction
The main object considered in this paper is the multi-parametric family \(\mathcal {A}_{\sigma _j}\) of unital associative complex algebras generated by the element Q and the finite or infinite set \(\big \{S_j\big \}_{j\in \mathcal {J}}\) of elements satisfying the commutation relations
where \(\sigma _j\) is a polynomial for all \(j\in \mathcal {J}\). For \(\mathcal {J}=\{1,2\}\), with the notation that \(S_1=S\), \(S_2=T\), \(\sigma _1=\sigma \) and \(\sigma _2=\tau \), this reduces to the multi-parametric family \(\mathcal {A}_{\sigma ,\tau }\) of unital associative complex algebras generated by three elements S, T and Q satisfying the commutation relations
Writing \(R=(dS-bT)/(ad-bc)\) and \(J=(aT-cS)/(ad-bc)\), where a, b, c and d are complex numbers with \(ad\ne bc\), we obtain and consider also a generalization of \(\mathcal {A}_{\sigma ,\tau }\), the multi-parametric family \(\mathcal {B}_{\sigma ,\tau }\) of unital associative complex algebras generated by three elements R, J and Q satisfying the commutation relations
Observe that the relations of the form (22.2) are recovered for \(b=c=0\).
The importance of commutation relations (22.1) can be best seen from some well-known examples. Consider the case where \(\mathcal {J}=\{1\}\), that is, the case
If \(\sigma (x) = x\), then S and Q commute, that is, \(SQ=QS.\) If \(\sigma (x) = -x\), then S and Q anti-commute, that is, \(SQ=-QS.\) If \(\sigma (x) = qx+c\) for some complex numbers q and c, then S and Q satisfy
This is a deformed Heisenberg–Lie commutation relation of quantum mechanics. The famous classical Heisenberg–Lie relation is obtained when \(q=1\) and \(c=1\). If \(c=0\), then S and Q are said to q-commute, that is, they satisfy the relation
which is often called the quantum plane relation in the context of noncommutative geometry and quantum groups. If \(\sigma (x)=qx^d\) for some positive integer d, then S and Q satisfy the commutation relation
This reduces to the quantum plane relation for \(d=1\) and to the relation
for \(q=1\), having important applications, for instance in wavelet analysis and in investigation of transfer operators [6, 11, 12], which are fundamental for statistical physics, dynamical systems and ergodic theory.
The commutation relations of the form (22.4) play a central role in the study of crossed products and their representations, in the theory of dynamical systems and in the investigation of covariant systems and systems of imprimitivity and thus in quantum mechanics, statistical physics and quantum field theory [6,7,8, 11, 12, 16,17,18,19, 30, 35, 45, 46]. The commutation relations of the form (22.4) arise in the investigations of nonlinear Poisson brackets, quantization and noncommutative analysis [13, 28]. Bounded and unbounded operators satisfying relation (22.4) have also been considered in the context of representations of \(*\)-algebras and spectral theory [34, 36, 37, 40, 41].
On the other hand, relations (22.3) generalizes Lie algebra type commutation relations, typical for usual differential or difference operators, to relations satisfied by more general twisted difference operators associated to general twisting maps.
This paper is devoted to the reordering of arbitrary elements in the algebras \(\mathcal {A}_{\sigma _j}\), \(\mathcal {A}_{\sigma ,\tau }\) and \(\mathcal {B}_{\sigma ,\tau }\). Reordering of arbitrary elements in noncommutative algebras defined by commutation relations is important in many research directions, open problems and applications of the algebras and their operator representations. For a broader view of this active area of research, see, for example, [1,2,3,4,5, 9, 10, 20,21,22, 24, 26,27,29, 37, 39, 42,43,44, 47] and the references therein. In investigation of the structure, representations and applications of noncommutative algebras, an important role is played by the explicit description of suitable normal forms for noncommutative expressions or functions of generators. These normal forms are particularly important for computing commutative subalgebras or commuting families of operators which are a key ingredient in representation theory of many important algebras [15, 31,32,33, 38, 45].
In Sect. 22.2, we give an introduction to commutation relations and reordering. In Sect. 22.3 general reordering formulas for arbitrary elements in the family \(\mathcal {A}_{\sigma _j}\) are presented, and in Sect. 22.4 some reordered expressions for corresponding nested commutators are described. In Sect. 22.5 special cases for different choices of \(\sigma _j\) are considered, putting in a new perspective and generalizing some well-known results in mathematics and physics. A generalization of the family \(\mathcal {A}_{\sigma _j}\) in three generators is constructed in Sect. 22.6, with some reordering formulas presented in Sect. 22.7. We conclude by mentioning some operator representations of our algebras in Sect. 22.8. We would also like to point out that some of the results in this paper are published without proofs in our recent article [27].
22.2 Commutation Relations and Reordering
This paper is about reordering of elements in noncommutative algebras defined by commutation relations. We follow the nice exposition by Mansour and Schork [20]. A commutation relation is a relation that describes the discrepancy between different orders of operation of two operations, say S and Q. To describe it, we use the commutator
If S and Q commute, then the commutator vanishes. How far a given structure deviates from the commutative case is described by the right-hand side of the commutation relation. For example, in a complex Lie algebra \(\mathfrak {g}\) one has a set of generators \(\{S_j\}_{j\in J}\) with the Lie bracket \(\left[ S_jS_k\right] =\sum _{l\in J}c_{jk}^{l}S_l\), where the coefficients \(c_{jk}^{l}\in \mathbb {C}\) are called the structure constants of the Lie algebra \(\mathfrak {g}\). The associated universal enveloping algebra \(\mathcal {U}(\mathfrak {g})\) is an associative algebra generated by \(\{S_j\}_{j\in J}\), and the above bracket becomes
One of the earliest instances of a noncommutative structure was recognized in the context of operational calculus. If \(D=\frac{\mathrm{d}}{\mathrm{d}x}\), the ordinary derivative, then the Leibniz rule (the product rule) states that
Interpreting the multiplication with the independent variable x as an application of the multiplication operator \(Q_{x}\), and suppressing the operand f, this equation can be written as the commutation relation
where \(\mathbbm {1}\) is the identity operator: \(\mathbbm {1}f(x)=f(x)\).
Let us first introduce the concept of an alphabet, words and letters, and thereafter explain what we mean by reordering of an element in a noncommutative algebra defined by commutation relations.
Definition 22.1
(see Mansour and Schork, 2016 [20]) Let a finite or infinite set \(\mathcal {A}=\big \{S_j\big \}_{j\in J}\) of objects be given. For all \(j\in J\), we call each \(S_j\) a letter and \(\mathcal {A}\) the alphabet. For some positive integer r, an element of \(\mathcal {A}^r\) will be called a word of length r in the alphabet \(\mathcal {A}\). A word \(\omega =\big (S_{j_1}, S_{j_2},\dots , S_{j_r}\big )\) will be written in the form \(\omega =S_{j_1}S_{j_2}\cdots S_{j_r}\), that is, as concatenation of its letters. For convenience, we also introduce the empty word \(\varnothing \in \mathcal {A}^0\). If \(\omega \) is a word, we denote the concatenation \(\omega \omega \cdots \omega \) (n times) briefly by \(\omega ^n\). In the case \(\mathcal {A}\) consists of n elements, an element of \(\mathcal {A}^r\) is called n-ary word of length r. The words with letters from the set of two elements \((n=2)\) are called binary words, and the words with letters from the set of three elements are called ternary words.
Example 22.1
If \(\mathcal {A}=\big \{1, 2, 3\big \}\), then the 3-ary (ternary) words of length two are 11, 12, 13, 21, 22, 23, 31, 32 and 33. If \(\mathcal {A}=\big \{0,1\big \}\), then the binary words of length three are given by 000, 001, 010, 011, 100, 101, 110 and 111.
Example 22.2
Let \(\mathcal {A}=\big \{S, T, U, V\big \}\) be an alphabet with four letters. Then \(\omega _1=SSSTT\), \(\omega _2=STUVS\), \(\omega _3=VTUST\) and \(\omega _4=UTUTU\) are words of length five which in general are not related. The words \(\omega _1\) and \(\omega _4\) can be written briefly as \(\omega _1=S^3T^2\) and \(\omega _4=(UT)^2U\).
Let us turn to the situation where the alphabet is given by the finite or infinite set \(\mathcal {A}=\big \{S_j, Q\big \}_{j\in J}\) of elements in a unital associative algebra satisfying the commutation relation
An arbitrary word \(\omega \) in the alphabet \(\mathcal {A}=\big \{S_j, Q\big \}_{j\in J}\) can be written as
for some \(k_t, l_t\in \mathbb {N}_0\) (\(\mathbb {N}_0\) denotes the set of nonnegative integers). If \(\sigma _j\) is given by the polynomial \(\sigma _j(x)=x+1\) for all \(j\in J\), then the above commutation relation becomes the famous classical Heisenberg–Lie commutation relation
and two adjacent letters \(S_j\) and Q in a word can be interchanged according to this relation. Each time one uses it in a word \(\omega \), two new words result. If we write the original word as \(\omega =\omega _1S_jQ\omega _2\) (where each \(\omega _r\) can be the empty word), then applying (22.5) gives that \(\omega =\omega _1(QS_j+S_j)\omega _2=\omega _1QS_j\omega _2+\omega _1S_j\omega _2\).
Example 22.3
In the last sentence of the preceding paragraph, if \(\omega _1=\omega _2=\varnothing \), the empty words, then \(\omega =S_jQ\) can be written as \(\omega =QS_j+S_j\). Using (22.5) again, the word \(S_jQ^2\) can be written as
As demonstrated in this example, one can use commutation relation (22.5) successively and transform each word in \(S_j\) and Q into a sum of words, where each of these words has all the powers of Q to the left. For our considerations throughout this paper, we have the following definition.
Definition 22.2
(cf. Mansour and Schork, 2016 [20]) A word \(\omega \) in the alphabet \(\mathcal {A}=\big \{S_j, Q\big \}_{j\in J}\) is called normal ordered if \( \omega =a_{kl_{1}\cdots l_{r}}Q^{k}S_{j_1}^{l_1}\cdots S_{j_r}^{l_r} \) for some \(k, l_{1},\dots , l_{r}\in \mathbb {N}_0\), where \(a_{kl_{1}\cdots l_{r}}\in \mathbb {C}\) are arbitrary coefficients depending on the exponents \(k, l_{1},\dots , l_{r}\). An expression consisting of a sum of words is called normal ordered if each of the summands is normal ordered. The process of bringing a word (or a sum of words) into its normal ordered form is called normal ordering. Writing the word \(\omega \) in its normal ordered form,
the coefficients \(A_{kl_{1}\cdots l_{r}}(\omega )\) are called the normal ordering coefficients of \(\omega \). In a similar fashion, the word \( \omega =b_{k_{1}\cdots k_{r}, l}S_{j_1}^{k_1}\cdots S_{j_r}^{k_r}Q^{l} \) is called antinormal ordered. Writing the word \(\omega \) in its antinormal ordered form,
the coefficients \(B_{k_{1}\cdots k_{r}l}(\omega )\) are called the antinormal ordering coefficients of \(\omega \), and the process of doing this is called antinormal ordering. By reordering, we mean either normal ordering or antinormal ordering.
This paper is devoted to the normal ordering of arbitrary elements in the algebras \(\mathcal {A}_{\sigma _j}\), \(\mathcal {A}_{\sigma ,\tau }\) and \(\mathcal {B}_{\sigma ,\tau }\) introduced in Sect. 22.1. The paper also derives reordered expressions for nested commutators using unimodal permutations.
Definition 22.3
Let n be a positive integer. A function \(f:\big \{1,\dotsc ,n\big \}\rightarrow \mathbb {R}\) is said to be unimodal if there exists some \(\nu \) such that
A permutation of a set is a bijection from the set to itself.
For example, written as tuples, there are four unimodal permutations of the set \(\big \{1,2,3\big \}\), namely: (3, 1, 2), (3, 2, 1), (2, 1, 3) and (1, 2, 3).
Definition 22.4
The commutator of two elements A and B of an algebra \(\mathcal {A}\) is given by
Using this definition, it is easy to see that for all \(A,B,C\in \mathcal {A}\) and \(p,q\in \mathbb {C}\),
-
(a)
\([A,q\mathbbm {1}]=0=[A,A]\),
-
(b)
\([A,A]=0\),
-
(c)
\([A,B]=-[B,A]\),
-
(d)
\([A,pB+qC]=p[A,B]+q[A,C]\),
-
(e)
\([A,BC]=[A,B]C+B[A,C]\),
-
(f)
\([A,[B,C]]+[B,[C,A]]+[C,[A,B]]=0.\)
22.3 Reordering Formulas for \(S_j,Q\)-Elements
In the following an algebra means a unital associative complex algebra, \(\mathbb {N}_0\) the set of nonnegative integers, and \(\mathbb {N}\) the set of positive integers. The basic result is the following theorem.
Theorem 22.1
Let r be a positive integer. If Q and \(\big \{S_j\big \}_{j\in J}\) are elements of an algebra satisfying (22.1), then for any nonnegative integer k and any polynomial F,
and for any nonnegative integers \(k_t\) and any polynomials \(F_t\), where \(t=1,\dots ,r\),
where \(\circ \) denotes composition of functions, \(\sigma ^{\circ k}\) the k-fold composition of a function \(\sigma \) with itself, and we adopt the convention that \( \prod _{t=1}^{r} a_t={a_1}{a_2}{a_3}\dots {a_r}. \)
Proof
We first prove that for all positive integers l, the formula \( S_jQ^l=\big (\sigma _j(Q)\big )^lS_j \) holds, and we proceed by induction. For \(l=1\), the formula follows from (22.1). Now suppose that the formula holds for some integer \(l\ge 1\), then
proving the assertion. This implies that for a given polynomial \(F(Q)=\sum f_{l}Q^l\),
We can now prove formula (22.6) by induction on k. For \(k=1\), formula (22.6) follows from (22.9). Now suppose that (22.6) holds for some \(k\ge 1\), then
and this proves formula (22.6).
Next we prove formula (22.8) by induction on r. For \(r=1\), formula (22.8) follows from (22.6). Now suppose that formula (22.8) holds for some positive integer r, then
and this proves (22.8), which gives formula (22.7) for \(j_1=\dots =j_r=j\), \(k_1=\dots =k_r=k\) and \(F_1=\dots =F_r=F\). \(\square \)
As a corollary of Theorem 22.1, we obtain the following result for \(F(x)=x^l\), a result which is useful for computing the central elements of our algebras.
Corollary 22.1
Let r be a positive integer. If Q and \(\big \{S_j\big \}_{j\in J}\) are elements of an algebra satisfying (22.1), then for any nonnegative integers k and l,
for any nonnegative integers \(k_t\) and \(l_t\), where \(t=1,\dots ,r\),
Theorem 22.1 also can be formulated in terms of monomials by observing that for all \(k_t, N_t\in \mathbb {N}_0\), and any polynomials \(F_t(Q)=\sum _{l_t=0}^{N_t}f_{l_t}Q^{l_t}\), where \(t=1,\dots ,r\),
where \(I_t=\big \{0,\dots , N_t\big \}\).
We thus have the following result, which is useful for computing explicit formulas when specific polynomials are given.
Theorem 22.2
Let r be a positive integer. If Q and \(\big \{S_j\big \}_{j\in J}\) are elements of an algebra satisfying (22.1), then for any nonnegative integers k and N, and any polynomial \(F(Q)=\sum _{l=0}^{N}f_{l}Q^{l}\),
and for any nonnegative integers \(k_t\) and \(N_t\), and any polynomials \(F_t(Q)=\sum _{l_t=0}^{N_t}f_{l_t}Q^{l_t}\), where \(t=1,\dots ,r\),
where \(I_t=\big \{0,\dots , N_t\big \}\).
Example 22.4
Formula (22.6) in Theorem 22.1 implies that
as it should be with formula (22.8) for \(r=2\). For \(F_t(x)=x^{l_t}\), this reduces to
as it should be with formula (22.12) for \(r=2\). For \(l_1=0\), this becomes
and denoting \(S_{j_1}=S\), \(S_{j_2}=T\), \(\sigma _{j_1}=\sigma \) and \(\sigma _{j_2}=\tau \) yields the following instance of Theorem 22.1 for algebras generated by three generators.
Example 22.5
Let r be a positive integer, \(\sigma \) and \(\tau \) be polynomials, and let S, T and Q be elements of an associative algebra satisfying the relations
Then for any nonnegative integers \(j, k, l, j_t, k_t\) and \(l_t\), and any polynomials F and \(F_t\), where \(t=1,\dots ,r\), we have
Similar examples can be obtained for algebras generated by four generators, five generators, six generators and so on.
22.4 Commutator Formulas for \(S_j,Q\)-Elements
Let n be a positive integer. A function \(f:\big \{1,\dotsc ,n\big \}\rightarrow \mathbb {R}\) is said to be unimodal if there exists some \(\nu \) such that \(f(1) \ge \cdots \ge f(\nu ) \le \cdots \le f(n).\) A permutation of a set is a bijection from the set to itself. For example, written as tuples, there are four unimodal permutations of the set \(\big \{1,2,3\big \}\), namely: (3, 1, 2), (3, 2, 1), (2, 1, 3) and (1, 2, 3). For the permutation \(\rho =(3,1,2)\), we have \(\rho (2)=1\) and \(\rho ^{-1}(3)=1\). Finally, the commutator of two elements x and y is defined by \([x,y] = xy-yx.\) We now have the following proposition.
Proposition 22.1
For all positive integers n, we have
where \(U_n\) denotes the set of all unimodal permutations of the set \(\big \{1,\dots , n\big \}\).
Proof
We proceed by induction. For \(n=1\), we have \(x_1=x_1\). For \(n=2\), we have
Now suppose that (22.34) holds for some positive integer n, then
where \(V_n\) and \(W_n\) denotes the sets of all unimodal permutations of \(\big \{1,\dots , n\big \}\) with \(x_n\) on the left and on the right, respectively. \(\square \)
Example 22.6
For \(n=3\), we have
Example 22.7
For \(n=4\), we have
In the following we use a more convenient notation for nested commutators:
Combining Proposition 22.1 with Theorem 22.1, we have the following reordering result.
Theorem 22.3
Let \(r_1,\dots ,r_n, n\in \mathbb {N}\). If Q and \(\big \{S_j\big \}_{j\in J}\) are elements of an algebra satisfying relations (22.1), then for any \(k_1,\dots ,k_n\in \mathbb {N}_0\) and any polynomials \(F_1,\dots ,F_n\),
Furthermore, if \(r_n>\dots>r_1>1\), then for \(k_1,\dots ,k_{r_n}\in \mathbb {N}_0\) and polynomials \(F_1,\dots ,F_{r_n}\),
where \(\rho (0)=0\) and \(r_0=0\).
Proof
For formula (22.35), we have
where the first equality follows from Proposition 22.1, and the last equality follows from formula (22.8) in Theorem 22.1. For formula (22.36), we have
where the first equality follows from Proposition 22.1, the second equality follows from formula (22.7) in Theorem 22.1, and the last equality is a reordering of all the Qs to the left. For formula (22.37), we have
where the first equality follows from Proposition 22.1, the second equality follows from formula (22.8) in Theorem 22.1, and the last equality is a reordering of all the Qs to the left. \(\square \)
As a corollary of Theorem 22.3, we obtain the following result for \(F(x)=x^l\).
Corollary 22.2
Let \(r_1,\dots ,r_n, n\in \mathbb {N}\). If Q and \(\big \{S_j\big \}_{j\in J}\) are elements of an algebra satisfying relations (22.1), then for any \(k_1,\dots ,k_n,l_1,\dots ,l_n\in \mathbb {N}_0\), one obtains
Furthermore, if \(r_n>\dots>r_1>1\), then for any \(k_1,\dots ,k_{r_n},l_1,\dots ,l_{r_n}\in \mathbb {N}_0\), one obtains
where \(\rho (0)=0\), \(r_0=0\).
Example 22.8
By direct computation using the definition of the commutator, one obtains for any \(r_1, r_2\in \mathbb {N}\) with \(r_2>r_1>1\), and for any \(k_1,\dots ,k_{r_2},l_1,\dots ,l_{r_2}\in \mathbb {N}_0\), that
which agrees with formula (22.40) for \(n=2\).
Example 22.9
Similarly, one can obtain for any \(r_1, r_2, r_3\in \mathbb {N}\) with \(r_3>r_2>r_1{>}1\), and for any \(k_1,\dots ,k_{r_3},l_1,\dots ,l_{r_3}\in \mathbb {N}_0\), that
which again agrees with formula (22.40) for \(n=3\).
Theorem 22.3 can also be presented in terms of monomials, which is useful for computing explicit formulas when specific polynomials are given. For example, for formula (22.35) one gets the following reordering result for nested commutators.
Theorem 22.4
Let \(n\in \mathbb {N}\) with \(n>1\). If Q and \(\big \{S_j\big \}_{j\in J}\) are elements of an algebra satisfying (22.1), then for any \(k_t,N_t\in \mathbb {N}_0\), and any polynomials \(F_t(Q)=\sum _{l_t=0}^{N_t}f_{l_t}Q^{l_t}\), where \(t=1,\dots ,n\),
where \(I_t=\{0,\dots , N_t\}\).
Proof
For any nonnegative integers \(k_t\) and \(N_t\), and any polynomials
where \(t=1,\dots ,n\), we have
where \(I_t=\big \{0,\dots , N_t\big \}\), and where the last equality follows from Corollary 22.2. \(\square \)
22.5 Examples
22.5.1 When \(\sigma _j(x)=-x\)
Let \(\sigma _j\) be the polynomial \(\sigma _j(x)=-x\). Then commutation relations (22.1) become
The following lemma is useful for obtaining the reordering results.
Lemma 22.1
For any positive integer t and any nonnegative integers k, \(k_1,\dots , k_t\),
Proof
We prove (22.43) by induction on k. For \(k=1\), the formula follows from the definition of \(\sigma _j\). Now suppose that (22.43) holds for some integer \(k\ge 1\), then
which proves (22.43). Next we prove (22.44) by induction on t. For \(t=1\), (22.44) follows from (22.43). Now suppose that (22.44) holds for some integer \(t\ge 1\), then
and this proves the assertion. \(\square \)
Theorem 22.5
Let \(r\in \mathbb {N}\). If Q and \(\big \{S_j\big \}_{j\in J}\) are elements of an algebra satisfying (22.42), then for any nonnegative integers k and N, and any polynomial \(F(Q)=\sum _{l=0}^{N}f_{l}Q^{l}\),
and for all \(k_t, N_t\in \mathbb {N}_0\), and polynomials \(F_t(Q)=\sum _{l_t=0}^{N_t}f_{l_t}Q^{l_t}\), where \(t=1,\dots ,r\),
where \(I_t=\big \{0,\dots , N_t\big \}\) for some t.
Proof
Substituting (22.43) into (22.13) and (22.14) gives (22.45) and (22.46), respectively, and substituting (22.44) into (22.15) gives (22.47). More precisely,
and for the more general formula,
where \(I_t=\big \{0,\dots , N_t\big \}\). Formula (22.46) can also be obtained from formula (22.47) by choosing \(j_1=\dots =j_r=j\) and \(k_1=\dots =k_r=k\). \(\square \)
For the particular case where F is a monic monomial, that is, \(F(Q)=Q^l\) for some nonnegative integer l, Theorem 22.5 yields the following result.
Corollary 22.3
Let r be a positive integer. If Q and \(\big \{S_j\big \}_{j\in J}\) are elements of an algebra satisfying (22.42), then for all nonnegative integers k and l,
and for all nonnegative \(k_t\) and \(l_t\), where \(t=1,\dots ,r\),
Example 22.10
For \(r=2\), we have
which for \(l_1=0\) becomes
and denoting \(S_{j_1}=S\) and \(S_{j_2}=T\), we have the following case of Corollary 22.3.
Corollary 22.4
Let r be a positive integer. If S, T and Q are elements of an algebra satisfying the relations
then for all nonnegative integers j, k and l,
and for all nonnegative integers \(j_t, k_t\) and \(l_t\), where \(t=1,\dots ,r\),
For the more general case, we have the following result.
Corollary 22.5
Let r be a positive integer. If S, T and Q are elements of an algebra satisfying (22.53), then for any nonnegative integers j, k and N, and any polynomial \(F(Q)=\sum _{l=0}^{N}f_{l}Q^{l}\), one obtains
and for any nonnegative integers \(j_t, k_t\), \(N_t\), and any polynomials
where \(t=1,\dots ,r\), one obtains
where \(I_t=\big \{0,\dots , N_t\big \}\) for some t.
22.5.2 When \(\sigma _j(x)=c_j x^{q_j}\)
Let \(c_j\) be complex numbers, \(q_j\) be positive integers, and let \(\sigma _j\) be the polynomials \(\sigma _j(x)=c_j x^{q_j}\). Then commutation relations (22.1) become
The following lemma is useful for obtaining the reordering results.
Lemma 22.2
For any positive integer t and any nonnegative integers k, \(k_1,\dots , k_t\),
where \(\{k\}_q\) for some complex number q denotes the q-number
and we use the convention that \(\prod _{m=n+1}^{t}q_{j_m}^{k_m}=1\) for \(t<n+1\).
Proof
We prove (22.61) by induction on k. For \(k=1\), the formula follows from the definition of \(\sigma _j\). Now suppose that (22.61) holds for some integer \(k\ge 1\), then
proving (22.61). Next we prove (22.62) by induction on t. For \(t=1\), the formula follows from (22.61). Now suppose that (22.62) holds for some integer \(t\ge 1\), then
and this proves the assertion. \(\square \)
Theorem 22.6
Let \(r\in \mathbb {N}\). If Q and \(\big \{S_j\big \}_{j\in J}\) are elements of an algebra satisfying relations (22.60), then for any \(k,N\in \mathbb {N}_0\) and any polynomial \(F(Q)=\sum _{l=0}^{N}f_{l}Q^{l}\),
where as before \(\{k\}_q\) for some \(q\in \mathbb {C}\) denotes the q-number of k, and
More generally, for all \(k_t, N_t\in \mathbb {N}_0\) and all polynomials \(F_t(Q)=\sum _{l_t=0}^{N_t}f_{l_t}Q^{l_t}\), where \(t=1,\dots ,r\),
where \(\varDelta _{{k}, r}\) for \(I_t=\big \{0,\dots , N_t\big \}\) is the set given by
Remark 22.1
Observe that for positive integers \(q_j\), one obtains that \(\min {\varGamma _{k, r}}=0\), \(\min {\varDelta _{{k}, r}}=0\), \(\max {\varGamma _{k, r}}=\sum _{t=1}^{r}q_{j}^{kt}{N}\), and \(\max {\varDelta _{{k}, r}}=\sum _{t=1}^{r}\left( \prod _{n=1}^{t}q_{j_n}^{k_n}\right) {N_t}\). We strongly believe that formulas (22.64), (22.65), (22.66) are probably true also for negative integers \(q_j\).
Remark 22.2
Formula (22.65) can be obtained from formula (22.66) by choosing \(j_1=\dots =j_r=j\) and \(k_1=\dots =k_r=k\), and observing that for all positive integers k and r,
where the last equality is a well-known identity (see, for example [9, p. 187]).
Proof
Substituting (22.61) into (22.13) and (22.14) gives (22.64) and (22.65), respectively, and substituting (22.62) into (22.15) gives (22.66). More precisely,
and for the more general formula,
from which the results follow. \(\square \)
For the particular case where F is a monomial, that is, \(F(Q)=Q^l\) for some positive integer l, Theorem 22.6 yields the following result.
Corollary 22.6
Let r be a positive integer. If Q and \(\big \{S_j\big \}_{j\in J}\) are elements of an algebra satisfying
then for any nonnegative integers k and l,
and for any nonnegative integers \(k_t\) and \(l_t\), where \(t=1,\dots ,r\),
Example 22.11
For \(r=2\), we have
which for \(l_1=0\) becomes
and denoting \(S_{j_1}=S\), \(S_{j_2}=T\), we have the following case of Corollary 22.6.
Corollary 22.7
Let r be a positive integer, \(c_\sigma \) and \(c_\tau \) be complex numbers, and let \(q_{\sigma }\) and \(q_{\tau }\) be positive integers. If S, T and Q are elements of an algebra satisfying the relations
then for any nonnegative integers j, k and l,
and for any nonnegative integers \(j_t, k_t\) and \(l_t\), where \(t=1,\dots ,r\),
For the more general case, we have the following result.
Corollary 22.8
Let r be a positive integer. If S, T and Q are elements of an algebra satisfying (22.72), then for any nonnegative integers j, k and N, and any polynomial \(F(Q)=\sum _{l=0}^{N}f_{l}Q^{l}\),
More generally, for all \(j_t, k_t, N_t\in \mathbb {N}_0\), and any polynomials \(F_t(Q)=\sum _{l_t=0}^{N_t}f_{l_t}Q^{l_t}\),
where \(t=1,\dots ,r\) and \(I_t=\big \{0,\dots , N_t\big \}\).
Corollaries 22.7 and 22.8 can also be derived in the following way. Let \(c_\sigma \), \(c_\tau \) be complex numbers, \(q_{\sigma }\), \(q_{\tau }\) be positive integers, and let \(\sigma \), \(\tau \) be the polynomials
Then commutation relations (22.16) become
Let j and k be nonnegative integers. Lemma 22.2 implies the relations
and the relations
and the corresponding formulas in Example 22.5 become
Let us derive an expression for \((\tau ^{\circ k_t}\circ \sigma ^{\circ j_t}\circ \dots \circ \tau ^{\circ k_1}\circ \sigma ^{\circ j_1})(Q)\) for any nonnegative integers \(j_1,\dots , j_t, k_1,\dots , k_t\) by induction on t. For \(t=2\), (22.83) implies that
In general, one has for all positive integers t the relation
Substituting relation (22.87) into Example 22.5 yields Corollaries 22.7 and 22.8. In general, relation (22.87) is useful for directly obtaining reordering results for the algebra generated by relations (22.79) and (22.80).
22.5.3 When \(\sigma _j(x)=c_jx\)
Let \(a_j, b_j\) and \(c_j\) be complex numbers, and let \(q_j\) be positive integers. Section 22.5.2 considers the case \(\sigma _j(x)=c_jx^{q_j}\) while Sect. 22.5.4 considers the case \(\sigma _j(x)=a_jx+b_j\). The intersection of these two cases is the case \(\sigma _j(x)=c_jx\), for which commutation relation (22.1) become the relation
often called the quantum plane relation, in the context of noncommutative geometry and quantum groups. The following result follows from Theorem 22.6 by choosing \(q_j=1\).
Corollary 22.9
Let r be a positive integer. If Q and \(\big \{S_j\big \}_{j\in J}\) are elements of an algebra satisfying (22.88), then for any nonnegative integers k and N, and any polynomial \(F(Q)=\sum _{l=0}^{N}f_{l}Q^{l}\),
and for \(k_t, N_t\in \mathbb {N}_0\), and any polynomials \(F_t(Q)=\sum _{l_t=0}^{N_t}f_{l_t}Q^{l_t}\), where \(t=1,\dots ,r\),
where \(I_t=\big \{0,\dots , N_t\big \}\) for some t.
For the particular case where F is a monic monomial in Q, Corollary 22.9 yields the following result.
Corollary 22.10
Let r be a positive integer. If Q and \(\big \{S_j\big \}_{j\in J}\) are elements of an algebra satisfying (22.88), then for all nonnegative integers k and l,
and for all nonnegative integers \(k_t\) and \(l_t\), where \(t=1,\dots ,r\),
Example 22.12
For \(r=2\), we have
which for \(l_1=0\) becomes
Denoting \(S_{j_1}=S\) and \(S_{j_2}=T\), we have the following case of Corollary 22.10.
Corollary 22.11
Let r be a positive integer. Let \(c_\sigma \) and \(c_\tau \) be complex numbers. If S, T and Q are elements of an algebra satisfying the relations
then for all nonnegative integers j, k and l,
and for all nonnegative integers \(j_t, k_t\) and \(l_t\), where \(t=1,\dots ,r\),
Corollary 22.12
Let \(r\in \mathbb {N}\) and \(c_\sigma , c_\tau \in \mathbb {C}\). If S, T and Q are elements of an algebra satisfying (22.92), then for any \(j, k,N\in \mathbb {N}_{0}\), and any polynomial \(F(Q)=\sum _{l=0}^{N}f_{l}Q^{l}\),
and for \(j_t, k_t, N_t\in \mathbb {N}_0\), and polynomials \(F_t(Q)=\sum _{l_t=0}^{N_t}f_{l_t}Q^{l_t}\), where \(t=1,\dots ,r\),
where \(I_t=\big \{0,\dots , N_t\big \}\).
22.5.4 When \(\sigma _j(x)=a_{j}x+b_{j}\)
Let \(a_{j}\) and \(b_{j}\) be complex numbers, and let \(\sigma _j\) be the polynomials
Then commutation relations (22.1) become
These are deformed Heisenberg–Lie commutation relations of quantum mechanics. The classical Heisenberg–Lie relations \(S_jQ-QS_j=S_j\) are obtained when \(a_{j}=1\) and \(b_{j}=1\). If \(c_{j}=0\), then we get the quantum plane relations \(S_jQ=q_{j}QS_j\)
The following lemma is useful for obtaining the reordering results.
Lemma 22.3
For any positive integer t and any nonnegative integers k, \(k_1,\dots , k_t\),
Proof
We prove (22.101) by induction on k. For \(k=1\), the formula follows from (22.99). Now suppose that (22.101) holds for some integer \(k\ge 1\), then
which proves (22.101). Next we prove (22.102) by induction on t. For \(t=1\), it follows from (22.101). Now suppose that (22.102) holds for some integer \(t\ge 1\), then
and this proves the assertion. \(\square \)
Theorem 22.7
Let \(r\in \mathbb {Z}_+\). If Q and \(\big \{S_j\big \}_{j\in J}\) are elements of an algebra satisfying (22.100), then for all \(k, l, N\in \mathbb {N}_0\), and any polynomial \(F(Q)=\sum _{l=0}^{N}f_{l}Q^{l}\),
where \(I=\big \{0,\dots , N\big \}\) and \(M_t=\big \{0,\dots , l_t\big \}\).
Proof
Substituting (22.101) into (22.10), (22.11), (22.13) and (22.14) gives (22.103), (22.104), (22.105) and (22.106), respectively. For example for (22.104), we have
Formula (22.106) can also be obtained directly from (22.104) using (22.14). \(\square \)
Let \(a_{\sigma }, a_{\tau }, b_{\sigma }\) and \(b_{\tau }\) be complex numbers, and let \(\sigma \) and \(\tau \) be the polynomials \(\sigma (x)=a_{\sigma }x+b_{\sigma }\) and \(\tau (x)=a_{\tau }x + b_{\tau }\). Then commutation relations (22.16) become
Let j and k be nonnegative integers. Lemma 22.3 implies the relations
and the relations
and the corresponding formulas in Example 22.5 become
Let us derive an expression for \((\tau ^{\circ k_t}\circ \sigma ^{\circ j_t}\circ \dots \circ \tau ^{\circ k_1}\circ \sigma ^{\circ j_1})(Q)\) for any nonnegative integers \(j_1,\dots , j_t, k_1,\dots , k_t\) by induction on t. For \(t=2\), relation (22.111) implies
In general, one has for all positive integers t the relation
Relation (22.115) is useful for directly obtaining reordering results for the algebra generated by relations (22.107) and (22.108).
22.6 Linear Transformation of the \(S_j\)-Generators
Proposition 22.2
Let \(\big \{R_k\big \}_{k\in K}\) be a set of elements of an algebra, m and n positive integers, and \(a_{j_mk_n}\) complex numbers. If
then the commutator of \(S_{j_1}\) and \(S_{j_2}\) is given by
Proof
We proceed by induction on n. For \(n=1\), we have
which agrees with formula (22.116). For \(n=2\), we have
Now suppose that (22.116) holds for some integer \(n\ge 1\), then we have for \(n+1\) that
and this proves formula (22.116). \(\square \)
Example 22.13
For \(n=3\), we have
which agrees with the formula. For \(n=4\), one can similarly obtain
which also agrees with the formula.
Corollary 22.13
Let \(a,b,c,d\in \mathbb {C}\).
-
1.
In any algebra, if
$$\begin{aligned} S&=aR+bJ,\\ T&=cR+dJ, \end{aligned}$$then the commutator of S and T is given by
$$\begin{aligned}{}[S,T] = \det \left( \begin{array}{cc}a &{} b \\ c &{} d\end{array}\right) [R,J]. \end{aligned}$$ -
2.
If \( \det {\left( \begin{array}{cc}a &{} b \\ c &{} d\end{array}\right) }\ne 0\), that is, \(ad\ne bc\), then \(ST=TS\) if and only if \(RJ=JR\).
Example 22.14
In any algebra, if \(S=R+iJ\) and \(T=R-iJ\), then the commutator of S and T is given by
and so, \(ST=TS\) if and only if \(RJ=JR\).
Theorem 22.8
Let \(a,b,c,d\in \mathbb {C}\) with \(ad\ne bc\). If
then the elements R, J and Q satisfy the relations
if and only if the elements S, T and Q satisfy relations (22.16).
Proof
Writing \(S=aR+bJ\) and \(T=cR+dJ\), we have \(R=(dS-bT)/(ad-bc)\) and \(J=(aT-cS)/(ad-bc)\). Therefore, if relations (22.16) hold, then
and
Conversely, if (22.117) and (22.118) hold, then
and
\(\square \)
22.7 Reordering Formulas for \(R_j, Q\)-Elements
Theorem 22.9
Let \(a,b,c,d\in \mathbb {C}\) with \(ad\ne bc\). If R, J and Q are elements of an algebra satisfying relations (22.117) and (22.118), then for any nonnegative integer k,
Proof
By Theorem 22.8, relations (22.117) and (22.118) hold if relations (22.16) hold with \(R=(dS-bT)/(ad-bc)\) and \(J=(aT-cS)/(ad-bc)\). Therefore,
and
\(\square \)
Corollary 22.14
If R, J and Q are elements of an algebra satisfying relations (22.117) and (22.118), then for any polynomial \(F(\cdot )\) in one variable,
Proof
Theorem 22.9 implies that given a polynomial \(F(Q)=\sum a_{k}Q^k\), we have
Similarly for JF(Q), that is,
\(\square \)
Corollary 22.15
If R, J and Q are elements of an algebra satisfying relations (22.117) and (22.118), then
Proof
This result follows directly from Corollary 22.14 by letting \(F(x)=\sigma (x)\) for the first two formulas, and \(F(x)=\tau (x)\) for the last two formulas. \(\square \)
22.8 Some Operator Representations
We conclude by mentioning that a concrete representation of relations (22.1) is given by the operators \(\alpha _{\sigma _j}(f)(x)=f(\sigma _j(x))\) and \(Q_x(f)(x)=xf(x)\) acting on polynomials or other suitable functions. Furthermore, a concrete representation of relations (22.3) is given by the operators
also acting on polynomials or other suitable functions. For \(\sigma (x)=x+i\), \(\tau (x)=x-i\), \(a=c=1\), \(b=i\) and \(d=-i\), these operators reduce to the operators
acting on complex functions. Three systems of orthogonal polynomials belonging to the class of Meixner–Pollaczek polynomials that are connected by these operators were presented in [14, 23, 25]. Boundedness properties of the operators \(R_{i}^{-1}\) and \(J_{i}R_{i}^{-1}\) in the function spaces related to the three systems of orthogonal polynomials were investigated in [15, 25].
References
Aleixo, A.N.F., Balantekin, A.B.: The ladder operator normal ordering problem for quantum confined systems and the generalization of the Stirling and Bell numbers. J. Phys. A: Math. Theor. 43, 045302 (2010)
Al-Salam, W.A., Ismail, M.E.H.: Some operational formulas. J. Math. Anal. Appl. 51, 208–218 (1975)
Bender, C.M., Dunne, G.V.: Polynomials and operator orderings. J. Math. Phys. 29, 1727–1731 (1988)
Blasiak, P., Horzela, A., Penson, K.A., Duchamp, G.H.E., Solomon, A.I.: Boson normal ordering via substitutions and Sheffer-type polynomials. Phys. Lett. A 338, 108–116 (2005)
Bourgeois, G.: How to solve the matrix equation \(XA-AX = f(X)\). Linear Algebra Appl. 434, 657–668 (2011)
Bratteli, O., Jorgensen, P.E.T.: Wavelets Through a Looking Glass. Birkhäuser Verlag (2002)
Bratteli, O., Robinson, D.: Operator Algebras and Statistical Mechanics. Springer (1981)
Davidson, K.R.: C*-Algebras by Example. American Mathematical Society (1996)
Hellström, L., Silvestrov, S.D.: Commuting Elements in \(q\)-Deformed Heiseberg Algebras. World Scientific (2000)
Hellström, L., Silvestrov, S.: Two-sided ideals in \(q\)-deformed Heisenberg algebras. Expo. Math. 23, 99–125 (2005)
Holschneider, T.: Wavelets: An Analysis Tool. Clarendon Press, Oxford (1998)
Jorgensen, P.E.T.: Ruelle operators: functions which are harmonic with respect to a transfer operator. Mem. Am. Math. Soc. 152(720) (2001)
Karasev, M.V., Maslov, V.P.: Nonlinear Poisson Brackets. Geometry and Quantization, Translations of Mathematical Monographs, vol. 119. American Mathematical Society, Providence (1993)
Kaijser, S.: Några nya ortogonala polynom. Normat 47(4), 156–165 (1999)
Kaijser, S., Musonda, J.: \(L^p\)-boundedness of two singular integral operators of convolution type. In: Silvestrov, S., Rančić, M. (eds.), Engineering Mathematics II, Springer Proceedings in Mathematics & Statistics, vol. 179 (2016)
Li, B.R.: Introduction to Operator Algebras. World Scientific (1992)
Mackey, G.W.: Induced Representations of Groups and Quantum Mechanics. Editore Boringhieri (1968)
Mackey, G.W.: The Theory of Unitary Group Representations. The University of Chicago Press (1976)
Mackey, G.W.: Unitary Group Representations in Physics, Probability and Number Theory. Addison-Wesley (1989)
Mansour, T., Schork, M.: Commutation Relations, Normal Ordering, and Stirling Numbers. CRC Press (2016)
Mansour, T., Schork, M.: On a close relative of the quantum plane. Mediterr. J. Math. 15, 124 (2018)
Meng, X.G., Wang, J.S., Liang, B.L.: Normal ordering and antinormal ordering of the operator \((fq + gp)^n\) and some of their applications. Chin. Phys. B. 18, 1534–1538 (2009)
Musonda, J.: Three Systems of Orthogonal Polynomials and Associated Operators, U.U.D.M. Project Report (2012:8)
Musonda, J.: Orthogonal Polynomials, Operators and Commutation Relations, Mälardalen University Press Licentiate Theses Mälardalen University ISBN 978-91-7485-320-9 (2017)
Musonda, J., Kaijser, S.: Three systems of orthogonal polynomials and \(L^2\)-boundedness of two associated operators. J. Math. Anal. Appl. 459, 464–475 (2018)
Musonda, J.: Reordering in Noncommutative Algebras, Orthogonal Polynomials and Operators, Mälardalen University Press Dissertations, Mälardalen University ISBN 978-91-748-411-4 (2018)
Musonda, J., Richter, J., Silvestrov, S.D.: Reordering in a multi-parametric family of algebras. J. Phys.: Conf. Ser. 1194, 012078 (2019)
Nazaikinskii, V.E., Shatalov, V.E., Sternin, B.Yu.: Methods of Noncommutative Analysis. Theory and Applications, De Gruyter Studies in Mathematics, vol. 22. Walter De Gruyter & Co., Berlin (1996)
Ostrovskyĭ, V.L., Samoĭlenko, Yu.S.: Introduction to the theory of representations of finitely presented \(*\)-Algebras. I. Representations by bounded operators. Rev. Math. Math. Phys. 11. Gordon and Breach (1999)
Pedersen, G.K.: C*-Algebras and their Automorphism Groups. Academic Press (1976)
Persson, T., Silvestrov, S.D.: From dynamical systems to commutativity in non-commutative operator algebras. In: A. Khrennikov (ed.), Dynamical systems from number theory to probability - 2, Växjö University Press, Series: Mathematical Modeling in Physics, Engineering and Cognitive Science, vol. 6, 109–143 (2003)
Persson, T., Silvestrov, S.D.: Commuting elements in non-commutative algebras associated with dynamical systems. In: A. Khrennikov (ed.), Dynamical systems from number theory to probability - 2, Växjö University Press, Series: Mathematical Modeling in Physics, Engineering and Cognitive Science, vol. 6, 145–172 (2003)
Persson, T., Silvestrov, S.D.: Commuting operators for representations of commutation relations defined by dynamical systems. Numer. Funct. Anal. Optim. 33(7–9), 1126–1165 (2012)
Rynne, B.P., Youngson, M.A.: Linear Functional Analysis. Springer (2008)
Sakai, S.: Operator Algebras in Dynamical Systems. Cambridge University Press (1991)
Samoilenko, Y., Ostrovskyi, V.L.: Introduction to the theory of representations of finitely presented \(\ast \)-algebras. Representations by bounded operators. Rev. Math. Phys. 11. The Gordon and Breach Publishing Group (1999)
Samoĭlenko, Y.S.: Spectral Theory of Families of Selfadjoint Operators, Kluwer Academic Publishers (1991)
Schmudgen, K.: Unbounded Operator Algebras and Representation Theory. Birkhauser Verlag (1990)
Shibukawa, G.: Operator orderings and Meixner-Pollaczek polynomials. J. Math. Phys. 54, 033510 (2013)
Silvestrov, S.D., Tomiyama, J.: Topological dynamical systems of Type I. Expositiones Mathematicae 20(2), 117–142 (2002)
Silvestrov, S.D.: Representations of commutation relations. A dynamical systems approach. Haddronic J. Suppl. 11 (1996)
Silvestrov, S.D.: On rings generalizing commutativity. Czech. J. Phys. 48, 1495–1500 (1998)
Silvestrov, S.D., Tomiyama, Y.: Topological dynamical systems of Type I. Expos. Math. 20, 117–142 (2002)
Suzuki, T., Hirshfeld, A.C., Leschke, H.: The role of operator ordering in quantum field theory. Prog. Theor. Phys. 63, 287–302 (1980)
Svensson, C., Silvestrov, S., de Jeu, M.: Dynamical systems and commutants in crossed products. Int. J. Math. 18(4), 455–471 (2007)
Tomiyama, J.: C*-Algebras and topological dynamical systems. Rev. Math. Phys. 8, 741–760 (1996)
Varvak, A.: Rook numbers and the normal ordering problem. J. Comb. Theory, Ser. 112, 292–307 (2005)
Acknowledgements
This research was supported by the Swedish International Development Cooperation Agency (Sida), International Science Programme (ISP) in Mathematical Sciences (IPMS), Eastern Africa Universities Mathematics Programme (EAUMP). John Musonda is also grateful to the research environment Mathematics and Applied Mathematics (MAM), Division of Applied Mathematics, Mälardalen University and to the Department of Mathematics and Statistics, University of Zambia, for providing an excellent and inspiring environment for research.
We are also grateful to Lars Hellström for fruitful suggestions on Proposition 22.1.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Musonda, J., Richter, J., Silvestrov, S. (2020). Reordering in Noncommutative Algebras Associated with Iterated Function Systems. In: Silvestrov, S., Malyarenko, A., Rančić, M. (eds) Algebraic Structures and Applications. SPAS 2017. Springer Proceedings in Mathematics & Statistics, vol 317. Springer, Cham. https://doi.org/10.1007/978-3-030-41850-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-41850-2_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-41849-6
Online ISBN: 978-3-030-41850-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)