From Quantum Mechanics to Quantum Field Theory: The Hopf route

# From Quantum Mechanics to Quantum Field Theory: The Hopf route

A. I. Solomon    G. E. H. Duchamp    P. Blasiak    A. Horzela and K.A. Penson Physics and Astronomy Department,The Open University, Milton Keynes MK7 6AA, UK Lab.de Phys.Théor. de la Matière Condensée, University of Paris VI, France Institut Galil ee, LIPN, CNRS UMR 7030 99 Av. J.-B. Clement, F-93430 Villetaneuse, France H. Niewodniczański Institute of Nuclear Physics, Polish Academy of Sciences, Division of Theoretical Physics, ul. Eliasza-Radzikowskiego 152, PL 31-342 Kraków, Poland a.i.solomon@open.ac.uk, gduchamp2@free.fr, pawel.blasiak@ifj.edu.pl, andrzej.horzela@ifj.edu.pl, penson@lptl.jussieu.fr
###### Abstract

We show that the combinatorial numbers known as Bell numbers are generic in quantum physics. This is because they arise in the procedure known as Normal ordering of bosons, a procedure which is involved in the evaluation of quantum functions such as the canonical partition function of quantum statistical physics, inter alia. In fact, we shall show that an evaluation of the non-interacting partition function for a single boson system is identical to integrating the exponential generating function of the Bell numbers, which is a device for encapsulating a combinatorial sequence in a single function.

We then introduce a remarkable equality, the Dobinski relation, and use it to indicate why renormalisation is necessary in even the simplest of perturbation expansions for a partition function.

Finally we introduce a global algebraic description of this simple model, giving a Hopf algebra, which provides a starting point for extensions to more complex physical systems.

## 1 Introduction

The motivation for this work is as follows: Recent analysis of perturbative quantum field theory (pQFT) has shown that at the heart of this theory there lies a Hopf algebra description. Since pQFT is a subtle and as yet not completely solved area, it is of pedagogical value to examine simpler systems to illustrate how these algebraic constructs may arise. In this note we examine the simple theory given by the quantum partition function of a non-relativistic boson system, a completely solvable model (at least in the free boson case). On the basis of a combinatorial methodology, we show that certain combinatorial numbers, known as Bell numbers, play a central role in such an analysis. The graphical approach to the description of these combinatorial numbers leads to a sort of non-relativistic analogue of Feynman diagrams. En route, we also remark how that even in this simple case, uncritical expansion methods may lead to divergences, which can be cured by regularization; this imitates the renormalization methods of pQFT. This theory does not depend on space or time; so it is a non-field theory. However, the description of the Quantum Partition Function that we employ uses the coherent state parameter as integration variable; and this plays the role of integration over space and time in the relativistic case.

The core of the note then deals with how an elementary Hopf algebra arises naturally from this approach. Although the resulting Hopf algebra, which we call BELL (since it arises directly from a graphical description of the combinatorial Bell numbers), is rather too uncomplicated, (technically it is commutative and co-commutative), it serves as a starting point for an extension to more complicated algebraic systems. Indeed, in later work we show that extensions and deformations of this algebra can emulate that of pQFT, thus supplying an alternate, algebraic, route from the physical path which takes us from the non-relativistic arena to that of relativistic quantum field theory.

## 2 Bell and Stirling Numbers; Exponential Generating Function

The Bell number simply gives the number of partitions of . Thus for the set , we have

 {1,2,3},{1,2}{3}{1,3}{2}{3,2}{1}{1}{2}{3}

so that . Equivalently, gives the number of ways in which distinct objects may be distributed among identical containers, some of which may remain empty. The first few values of are

 B(n)=1,1,2,5,15,52,203,…,n=0,1,2,….

A compact way of defining a combinatorial sequence is by means of a generating function. For the Bell numbers, the exponential generating function is given by

 ∞∑n=0B(n)xnn!=exp(ex−1). (1)

We shall give a proof of Eq.(1) after we introduce a graphical description for the Bell numbers in Section 3.2. A slight generalization of the exponential generating function for the Bell numbers is given by that defining the Bell polynomials :

 exp(y(ex−1))=∞∑n=0Bn(y)xnn! (2)

With this notation .

Stirling numbers (of the second kind) are related to the Bell numbers. These are defined as the number of ways of putting different objects into identical containers, leaving none empty. From this definition we have .

Bell and Stirling numbers are fundamental in quantum theory. This is because they arise naturally in the normal ordering problem of bosonic operators. By the normal ordering operation we mean reorder the boson operators in so that all annihilation operators are on the right. For canonical boson creation and annihilation operators satisfying , the Stirling numbers of the second kind intervene through [2, 3]

 N(a†a)n=n∑k=1S(n,k)(a†)kak. (3)

The corresponding Bell numbers are simply the expectation values

 B(n)=⟨z|(a†a)n|z⟩z=1 (4)

taken in the coherent state defined by

 a|z⟩=z|z⟩ (5)

for .

## 3 Graphs

### 3.1 Bell number diagrams

We now give a graphical representation of the Bell numbers, based on work of Brody, Bender and Meister [4, 5], which we have extended in [6]. Consider labelled lines which emanate from a white dot, the origin, and finish on a black dot, the vertex. We shall allow only one line from each white dot but impose no limit on the number of lines ending on a black dot. Clearly this simulates the definition of and , with the white dots playing the role of the distinguishable objects, whence the lines are labelled, and the black dots that of the indistinguishable containers. The identification of the graphs for 1, 2 and 3 lines is given in Figure 1 below.

We have concentrated on the Bell number sequence and its associated graphs since, as we shall show, there is a sense in which this sequence of graphs is generic in the evaluation of the Quantum Partition Function. By this we mean the following: The exponential generating function for the Bell polynomials is identical to the (integrand of) the Canonical Quantum Partition Function of a non-interacting single-mode boson model. Then, when interactions are present these may be incorporated by the use of suitable strengths associated with the vertices of the graphs. That is, we can represent the perturbation expansion of an interacting model by the same sequence of graphs as in Figure 1, with suitable vertex multipliers (denoted by the terms in the same figure).

### 3.2 The Connected Graph theorem

We introduce this important theorem[7] in order to obtain the exponential generating function of the Bell numbers. The theorem states:

###### Theorem 1

Connected Graph Theorem: If is the exponential generating function of a set of CONNECTED labelled graphs then is the exponential generating function of ALL the graphs.

In Figure 2 we see that there is only one connected graph for each , so

 C(x)=x/1!+x2/2!+x3/3!+…=ex−1

whence

 A(x)=exp(ex−1)

gives the exponential generating function for the Bell numbers.

## 4 Quantum Partition Function

We now show that the Canonical Partition Function of Quantum Statistical mechanics is simply related to the exponential generating function of the Bell polynomials.

### 4.1 Free boson gas and Bell polynomials

The canonical partition function associated with a quantum mechanical hamiltonian is given by

 Z=Trexp(−βH) (6)

where is the usual inverse temperature ( ). We start with the elementary case of the hamiltonian for the single–mode free boson gas (ignoring an additive constant), . The usual computation of the partition function, exploiting the completeness property , is immediate:

 Z = Trexp(−βϵa†a) (7) = ∞∑n=0⟨n|e−βϵ^n|n⟩ = ∞∑n=0e−βϵn = (1−e−βϵ)−1.

However, we may use any complete set to perform the trace. We choose coherent states as defined in Eq.(5) above, which are explicitly given by

 |z⟩=e−|z|2/2∑n(zn/n!)a†n|0⟩. (8)

For these states the completeness or resolution of unity property is

 1π∫d2z|z⟩⟨z|=I≡∫dμ(z)|z⟩⟨z|. (9)

The appropriate trace calculation is

 Z = 1π∫d2z⟨z|exp(−βϵa†a)|z⟩= (10) = 1π∫d2z⟨z|:exp(a†a(e−βϵ−1)):|z⟩, (11)

where we have used the following well-known relation [8, 9] for the forgetful normal ordering operator which means normally order the creation and annihilation operators in forgetting111This procedure generally alters the value of the operator to which it is applied. the commutation relation :

 Nexp(xa†a)=:exp(a†a(ex−1)):. (12)

We therefore obtain, integrating over the angle variable and the radial variable ,

 Z=1π∫2π0dθ∫∞0rdrexp(r2(e−βϵ−1)), (13)

which gives us as before.

We rewrite the above equation to show the connection with our previously–defined combinatorial numbers. Writing and , Eq.(13) becomes

 Z=∞∫0dyexp(y(ex−1)). (14)

This is an integral over the classical exponential generating function for the Bell polynomials as given in Eq.(2). This leads to the combinatorial form for the partition function

 Z=∫∞0dy∞∑n=0Bn(y)xnn!. (15)

### 4.2 General partition functions

We now apply this graphical approach to the general partition function in second quantized form, with the usual definition for the partition function Eq.(6). In general the hamiltonian is given by , where is the energy scale, and is a string (= sum of products of positive powers) of boson creation and annihilation operators. The partition function integrand for which we seek to give a graphical expansion, is

 Z(x)=∫F(x,z)dμ(z), (16)

where

 F(x,z) = ⟨z|exp(xw)|z⟩=(x=−βϵ) (17) = ∞∑n=0⟨z|wn|z⟩xnn! = ∞∑n=0Wn(z)xnn! = exp(∞∑n=1Vn(z)xnn!),

with obvious definitions of and . The sequences and may each be recursively obtained from the other [10]. This relates the sequence of multipliers of Figure 1 to the hamiltonian of Eq.(6). The lower limit in the summation is a consequence of the normalization of the coherent state .

Although Eq.(15) is remarkably simple in form, it is often by no means a straightforward matter to evaluate the analogous integral for other than the free boson system considered here. Further, as we show below, we may not interchange the integration and the summation, as each individual integral diverges. At this point the analogue of this model to perturbative quantum field theory becomes more transparent. For example, to calculate the partition Function , we must integrate over the Partition Function Integrand . Here, the integration over the coherent state parameter plays the role of the space-time integration of Quantum Field Theory. As we have just remarked, with reference to Eq.(15) for the non-interacting case, and as in pQFT (perturbative quantum field theory), term-by-term integration, corresponding to fallaciously interchanging the summation and integration actions, results in infinities at each term, as we now verify for the non-interacting case. Thus even here an elementary form of renormalization is necessary, if we resort to term-wise integration.

Considerations such as these have led many authors, as noted in reference [1], to consider a global, algebraic approach to pQFT; and this we shall do in Section 6.

But first we show how divergences arise.

## 5 The Dobiński Relation and Divergence

### 5.1 Divergence

The celebrated Dobiński relation for the Bell numbers is given by (see, for example, [11]):

 B(n)=1e∞∑k=0knk!,      n=1,2,… (18)

and for the Bell polynomials by

 Bn(y) = e−y∞∑k=0knk!yk. (19)

These relations have been extended in [12].

Using the Dobiński relation Eq.(19) we can rewrite the expression for the partition function for the free single-mode boson Eq.(15) as

 Z = ∫∞0dy∞∑n=0Bn(y)xnn! (20) = ∫∞0∞∑n=0xnn!{e−y∞∑k=0knk!yk}dy (21)

We may attempt to write this as a perturbation expansion (in ) by interchanging the integration and summation, thus:

 Z = ∞∑n=0xnn!∞∑k=0knk!∫∞0{e−yyk}dy (22) = ∞∑n=0xnn!∞∑k=0knk!Γ(k+1) (23) = ∞∑n=0xnn!∞∑k=0kn. (24)

Therefore the resulting “perturbation expansion” is of the form

 Z=∞∑0bnxnbn=1n!∞∑k=0kn=∞

with each term in the expansion being infinite.

Thus even in this simple case of a free boson expansion, a perturbation expansion obtained from the illegal interchange of integration and summation is divergent in every term.

### 5.2 Regularization

In this section we illustrate how the method of regularization may be applied to alleviate the problem of divergences. Writing the partition function Eq.(14) as

 Z=∫∞0e−αydy(α=1−e−βϵ) (25)

immediate evaluation gives as in Eq.(7).

However, if we expand

 Z=∫∞0∞∑n=0(−αy)n/n!dy (26)

and exchange the order of integration, we obtain

 (FALSE)Z=∞∑n=0(−α)n/n!∫∞0yndy (27)

each term of which diverges. The regularization method is to write

 Z=limM→∞∫M0∞∑n=0(−αy)n/n!dy (28)

and, since the integration is over a finite range, we may interchange integration and summation, to obtain

 Z = limM→∞∞∑n=0(−α)n/n!∫M0yndy (29) = limM→∞∞∑n=0{(−α)n/n!}{M(n+1)/(n+1)} (30) = limM→∞∞∑n=0{(−αM)(n+1)/(n+1)!}(−1/α) (31) = limM→∞{(e−Mα−1)(−1/α)} (32) = 1/α (33)

as before.

Note that bounded by a finite implies the eminently reasonable assumption of a maximum energy for the coherent state as defined in Eq.(5).

## 6 Hopf Algebra structure

So far we have discussed the analytic and combinatorial structure of our simple model. Modern approaches to perturbative quantum field theory introduce a global algebraic structure. We describe the analogue of this Hopf Algebra structure in the context of our model, which we refer to as BELL below. We first introduce a basic Hopf Algebra, which we call POLY, generated by a single parameter . This is essentially a standard one-variable polynomial algebra on which we impose the Hopf operation of co-product, co-unit and antipode, as a useful pedagogical device for describing their properties. The Hopf structure associated with our model described above is simply a multi-variable extension of POLY.

### 6.1 The Hopf Algebra Poly

POLY consists of polynomials in (say, over the real field , for example).The standard algebra structure of addition and associative multiplication is obtained in the usual way, by polynomial addition and multiplication. The additional Hopf operations are:

1. The coproduct is defined by

 Δ(e) = e×e(unite) Δ(x) = x×e+e×x(generatorx) Δ(AB) = Δ(A)Δ(B)otherwise

so that is an algebra homomorphism.

2. The co-unit satisfies otherwise .

3. The antipode satisfies ; on the generator , . It is an anti-homomorphism, i.e. .

It may be shown that the foregoing structure satisfies the axioms of a commutative, co-commutative Hopf algebra.

### 6.2 Bell

We now briefly describe the Hopf algebra which is appropriate for the diagram structure introduced in this note, defined by the diagrams of Figure 1.

1. Each distinct diagram is an individual basis element of ; thus the dimension is infinite. (Visualise each diagram in a “box”.) The sum of two diagrams is simply the two boxes containing the diagrams. Scalar multiples are formal; for example, they may be provided by the coefficients.

2. The identity element is the empty diagram (an empty box).

3. Multiplication is the juxtaposition of two diagrams within the same “box”. is generated by the connected diagrams; this is a consequence of the Connected Graph Theorem (as discussed above in 3.2). Since we have not here specified an order for the juxtaposition, multiplication is commutative.

4. The coproduct is defined by

 Δ(e) = e×e(unite) Δ(y) = y×e+e×y(generatory) Δ(AB) = Δ(A)Δ(B)otherwise

so that is an algebra homomorphism.

5. The co-unit satisfies otherwise .

6. The antipode satisfies ; on a generator , . It is an anti-homomorphism, i.e. .

### 6.3 Bell as an extension of Poly

It may be seen that is a multivariable version of . To show this, we code the diagrams by letters. We use an infinite alphabet and code each connected diagram with one black spot and white spots with the letter . An unconnected diagram will be coded by the product of its letters.
In this way, the diagrams of Figure 1 are coded as follows:

• first line :

• second line : and

• third line : and and  .

Thus one sees that each diagram of weight with connected components is coded bijectively by a monomial of weight (the weight of a monomial is just the sum of the indices ) and letters. The algebra is coded by commutative polynomials in the infinite alphabet ; that is, the coding is an isomorphism . As an aside, one may note that the basis elements of are sometimes referred to as forests. As above, it may be shown that the foregoing structure satisfies the axioms of a commutative, co-commutative Hopf algebra.

## 7 Discussion

In this note we have shown the value of the combinatorial method, which leads inter alia through the graphical approach, to a Hopf algebra description of a simple non-relativistic free boson system. We named the resulting (commutative, co-commutative) Hopf algebra BELL. To extend this simple description to more realistic models, it is convenient to introduce a symmetrized form of BELL; i.e. where the black and white spots appear symmetrically[13]. Thus we have introduced the Hopf algebra DIAG where a typical series of graphs is given in Figure 3 below.

Note that since the black and white spots play symmetrical roles, in the figure we permit ourselves to exchange their order from that used in, for example, Figure 1. We may also apply “weights” to the black spots as well. Although the resulting Hopf algebra DIAG is still commutative/co-commutative, it may in turn be extended to a non-commutative Hopf algebra (LDIAG) which forms the basis of an extension of this algebraic approach to a description sufficiently general to emulate those algebras which describe pQFT. This extension is described in detail in a subsequent artcle in this conference [14].

## Acknowlegements

The authors wish to acknowledge support from the Agence Nationale de la Recherche (Paris, France) under Program No. ANR-08-BLAN-0243-2 and from PAN/CNRS Project PICS No.4339(2008-2010) as well as the Polish Ministry of Science and Higher Education Grant No.202 10732/2832.

## References

• [1] Kreimer D 2000 Knots and Feynman Diagrams, Cambridge Lecture Notes in Physics, CUP
• [2] Katriel J 1974 Lett. Nuovo Cimento 10 565
• [3] Katriel J 2000 Phys. Lett. A. 273 159
• [4] Bender C M, Brody D C and Meister B K 1999 Quantum field theory of partitions Journal of Mathematical Physics 40 3239
• [5] Bender C M, Brody D C and Meister B K 2000 Combinatorics and field theory, Twistor Newsletter 45 36
• [6] Blasiak P, Penson K A, Solomon A I, Horzela A and Duchamp G H E 2005 J.Math.Phys. 46, 052110 and arXiv:quant-ph/0405103
• [7] Ford G W and Uhlenbeck G E 1956 Proc.Nat.Acad.42122
• [8] Klauder J R and Sudarshan E C G 1968 Fundamentals of Quantum Optics Benjamin, New York
• [9] Louisell W H 1990 Quantum Statistical Properties of Radiation (J. Wiley, New York)
• [10] Pourahmadi M 1984 Amer. Math. Monthly 91, 303
• [11] Wilf H S 1994 Generatingfunctionology New York, Academic Press
• [12] Penson K A, Blasiak P, Duchamp G H E, Horzela A and Solomon A I 2004 Hierarchical Dobiński-type relations via substitution and the moment problem. J.Phys.A:Math.Gen. 37 3475
• [13] Duchamp G H E, Blasiak P, Horzela A, Penson K A and Solomon A I 2006 Feynman graphs and related Hopf algebras J. Phys.: Conf. Ser. 30 107
• [14] Minh H N, Duchamp G H E, Solomon A I and Goodenough S 2010 An interface between physics and number theoryThese proceedings
You are adding the first comment!
How to quickly get a good reply:
• Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
• Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
• Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters