Continuing with Lecture 12, we are analyzing the Taylor series

of the smooth function

where is a smooth function on the line such that the above integral converges, and whose Taylor series is of the form

I should say here that I’m trying out a new notation: if is a function of the real variable which is smooth in a neighborhood of then I write

this being a formal power series in a single indeterminate which by abuse of notation I also call So it does not make sense to write

since the LHS is a number and the RHS is a formal power series. However, Taylor’s theorem with remainder tells you that if you take a finite number of terms of the formal power series and trade the formal variable for a real number you get a good approximation to the real number

Back to the problem at hand, what we are trying to do is to express the formal power series in terms of the formal power series What we currently know is that

where the internal (finite) sum is over Young diagrams with , with the number of fixed point free involutions in and the conjugacy class in of permutations of cycle type and

subject to So, in completely algebraic language, one could say that we are studying the “Feynman transform”

defined by

The domain of this map is the principal ideal generated by in the algebra of formal power series in with coefficients being polynomials in the and the codomain is formal power series in with coefficients in the same polynomial ring. The problem then is to simplify the output of the Feynman map as a power series in i.e. to determine the coefficient of for each

What we want to do in this lecture is give a diagrammatic solution to the above algebraic problem. Note that the solution to this problem has analytic value via Laplace’s method, but the solution itself does not involve any analysis and is purely combinatorial.

The first step is to think of the number as the cardinality of where again is the conjugacy class of permutations in the symmetric group and is the set of fixed point free involutions in Note that is nonempty if and only if is even, in which case

where is the Young diagram with rows of length Every pair is a combinatorial map. Associated to this map are two topological maps, which are dual to one another. To construct these topological maps, we use the following construction. First, for each cycle of we draw a polygon whose number of sides is equal to the length of and whose edges are labeled counterclockwise in the cyclic order prescribed by At the same time, we place into this polygon the corresponding dual object, namely a vertex in the interior of the polygon together with line segments, called “half edges” or “darts,” which emanate from the vertex, one for each edge of the polygon and labeled in the same way. Note that we need only consider the case where is even, since otherwise, and moreover where all rows of have length at least since meaning that all polygons in this construction have at least three sides, or dually that all stars have degree at least Now we glue the sides of the polygons together according to the pairing permutation and at the same time pair half edges of stars in the same manner, i.e. using This produces a pair of dual topological maps on a compact oriented surface Our convention is that we view as the topological map obtained by glueing stars, and as the topological map obtained by glueing polygons. The figure below illustrates this construction for the combinatorial map

Now let us consider the Feynman transform

from the point of view of topological rather than combinatorial maps. First, the powers of occurring in the transformed power series have a clear interpretation: we have

where are the number of vertices and edges in Observe that actually the difference depends only on the underlying graph, not actually on its embedding, so that this is a purely combinatorial parameter. Indeed, it is closely related to the so-called circuit rank of a graph, which is the number of independent cycles in the graph, or equivalently the minimal number of edges which must be deleted in order to obtain an acyclic graph, i.e. a forest. The precise relationship between these parameters is

with the circuit rank and the number of connected components. This is pretty obvious if you think about it: consider the extremal case where we have one connected component consisting of a tree. In this case the difference is obviously equal to zero, and if we start adding edges the circuit rank goes up by one every time we add an edge, and moreover the construction is additive in the number of components (graph theory people – did I get that right?).

So, at the coarsest level, the output of the Feynman transform is apparently a generating function for (possibly disconnected) graphs sorted by circuit rank, where we are restricting to graphs in which every vertex has degree at least Now this is not quite the case, since many combinatorial maps will give rise to the same topological map. Indeed, if we take the combinatorial map and conjugate it by an arbitrary permutation then we get another combinatorial map which obviously yields the same topological map when the construction described above is performed, since we have simply relabeled everything by conjugating. Thus we expect that the correspondence between combinatorial and topological maps should be -to-one, which would be excellent news, since then the factor

would be equal to one. However, this is not precisely true, since there may be permutations whose conjugation action on the combinatorial map has no effect, leaving this combinatorial map unaltered; this happens precisely when commutes with both and , or in other words belongs to the centralizer of the subgroup of the symmetric group . Which they generate. It is thus reasonable to define the automorphism group of a combinatorial map to be this centralizer. We then see that the Feynman transform is indeed a generating function for graphs arranged by circuit rank, but in which each graph is counted with a weight equal to the reciprocal of the order of its automorphism group:

the sum being over all topological maps of minimum vertex degree with

where the product is over all vertices of This product is called the “Feynman amplitude” of and it is the only part of the above construction which actually depends on the generating function we started with — everything else is universal, being exactly the same irrespective of what is. And that’s the general idea of the Feynman diagram expansion in zero-dimensional scalar-valued quantum field theory. It’s pretty useful, because for example we can say that the leading contribution in the asymptotic expansion of the integral we’re trying to approximate in the limit comes from graphs which have minimum vertex degree and two independent cycles, and there are only three of those:

We’ll clean this up a bit next week, and then go on to the matrix-valued case, where the expansion depends not just on the underlying graph of a topological map, but also on the topology of the surface into which it is embedded.