 Short report
 Open Access
 Published:
A simple proof of orientability in colored group field theory
SpringerPlus volume 1, Article number: 6 (2012)
Abstract
Background
Group field theory is an emerging field at the boundary between Quantum Gravity, Statistical Mechanics and Quantum Field Theory and provides a path integral for the gluing of nsimplices. Colored group field theory has been introduced in order to improve the renormalizability of the theory and associates colors to the faces of the simplices.
The theory of crystallizations is instead a field at the boundary between graph theory and combinatorial topology and deals with nsimplices as colored graphs. Several techniques have been introduced in order to study the topology of the pseudomanifold associated to the colored graph.
Although of the similarity between colored group field theory and the theory of crystallizations, the connection between the two fields has never been made explicit.
Findings
In this short note we use results from the theory of crystallizations to prove that color in group field theories guarantees orientability of the piecewise linear pseudomanifolds associated to each graph generated perturbatively.
Conclusions
Colored group field theories generate orientable pseudomanifolds. The origin of orientability is the presence of two interaction vertices in the action of colored group field theories. In order to obtain the result, we made the connection between the theory of crystallizations and colored group field theory.
Introduction
There has been recently a growth of interest in group field theories Freidel ([2005]) and Oriti ([2009]) and there are many reasons for this to happen. Group field theories (GFT) are a generalization of matrix models to higher dimensions Brezin et al. ([1978]) and David ([1985]) and a generalization of tensor models as well Ambjorn et al. ([1991]). Moreover, GFT are known to generate the partition function of Spin Foams, thus having a direct relation with Loop Quantum Gravity Rovelli ([2004]).
It is known that matrix models have a topological expansion in which the genus, the only topological invariant needed to characterize orientable surfaces, plays the role of the parameter of this expansion. Roughly speaking a ndimensional group field theory has a vertex associated to an nsimplex and a propagator which glues the (n−1)simplices. Feynman diagrams of a ndimensional group field theory can be interpreted as gluings of simplices and then have the interpretation of piecewise linear (PL) manifolds. A colored version of group field theory (cGFT) has been introduced recently Gurau (2009, 2010a) and Geloun et al. ([2010a]). One important reason to introduce color in the diagrams is that it is possible to have a better control over the perturbatively generated singularities of GFT. The challenge in these models is to obtain a topological expansion as in the 2dimensional case Bonzom and Smerlak ([2010]); Freidel et al. ([2009]); Geloun et al. ([2010b]); Magnen et al. ([2009]). Remarkably, it has been shown Gurau ([2010b]) that spheres dominates the partition function in any dimension. In order to achieve this result, techniques from the theory of crystallizations have been used. In fact, colored ngraphs are well known in mathematics as gems: graphencoded manifolds Pezzana ([1974]) and Lins ([1995]).
In this paper we use the results in this field of mathematics to show that the growth of interest in colored models is not unjustified: colored models generate orientable pseudomanifolds in any number of dimensions. Many of the theorems we will use were known for long time in the context of crystallization and here we report briefly these results. The outcome of this note is that the generation of pseudomanifolds is due to the color, while the orientability in the colored versions of group field theory models is due to the presence of two different vertices (clockwise and anticlockwise). In the following we will focus on the Boulatov model, but the result is more general because it relies only on the presence of vertices of opposite orientation in the perturbative expansion of the partition function. In fact, the result can be easily generalized to other types of theory with color and with a similar interaction structure, given the interpretation of the vertices as a simplicial complex.
Another point we would like to stress, is that the present paper establishes a dictionary between the mathematical field of crystallisation and colored graphs within the context of tensor field models. This dictionary and the results obtained in the theory of crystallisation allowed the simple proof of the result. We believe that these techniques could be very useful for the field. For instance, the proof of the 1/N expansion used in Gurau ([2010b]) heavily relies on the dipole moves we will discuss later in the paper.
The paper is organized as follows: in section The colored boulatov model we recall the colored Boulatov model and its standard interpretation. In section A survey of graphembedded manifolds results we review basic results in the field of 3gems and crystallizations. We will use some of these results in section Orientability in cGFT to prove the orientability of simplicial complexes generated perturbatively by the colored Boulatov model. Conclusions follow.
The colored boulatov model
In this section we introduce the colored Boulatov model Boulatov ([1992]) and Gurau ([2009]). Let us consider a compact Lie group H, denote h its elements, e the unit element, and $\int \mathrm{dh}$ the integral with respect to the Haar measure of the group.
In 3 dimensions we introduce two fields, ${\stackrel{\u0304}{\psi}}^{i}$ and ψ^{i}, i=0,1,2,3 be four couples of complex scalar (or Grassmann) fields over three copies of G, ${\psi}^{i}:G\times G\times G\to \u2102$. The index i runs from=0 to n+1, where n is the number of dimensions, and the ψ and $\stackrel{\u0304}{\psi}$ are functions of n copies of the group. In the fermionic version of the theory the indices i can be seen as the dependence of the field from a (global) gauge group SU(N), where N=n + 1. We denote δ^{Θ}(h) the regularized delta function over G with some cutoff Θ such that δ^{Θ}(e) is finite, but diverges when Θ goes to infinity. A feasible regularization is given, for instance for the group G=SU(2), by
where χ^{j}(h) is the character of h in the representation j. The path integral for the colored Boulatov model over G is:
where the Gaussian measure P is chosen such that:
and:
The fermionic colored model has two types interactions, a “clockwise” and an “anticlockwise”, and one is obtained from the other one by conjugation in the internal group color SU(N), where N is 4 in 3 dimensions, one for each face of the 3simplex ^{a}. For convenience we denote ψ(h,p,q)=ψ_{ hpq }. Invariance under global rotations in the internal color group require at least two interactions:
where we omitted the internal structure of the group elements of the fields ψ^{i} and ${\stackrel{\u0304}{\psi}}^{i}$. In order to make the notation clearer (already the orientation of the colors is sufficient to distinguish the two vertices), we call “red” the vertex involving the ψ’s and “black” the one involving the $\stackrel{\u0304}{\psi}$’s. Thus any line coming out of a cGFT vertex has a color i.
The group elements h_{ij} in eq. (3) are associated to the propagators (represented as solid lines), and glue two vertices with opposite orientation. The vertex can be seen as the dual of a tetrahedron and its lines represent the triangles which form the tetrahedron. Each propagators is decomposed into three parallel strands which are associated to the three arguments of the fields, i.e. the 1dimensional elements of the 1skeleton of the tetrahedron which bound every face. These are associated to the edges of the tetrahedron. A colored line represents the gluing of two tetrahedra (of opposite orientations) along triangles of the same color as in Figure (1).
It is easy to understand that a cGFT graph can be seen either as a stranded graph (using the vertex and the propagators as depicted in Figure 2) or as a “colored graph” with (colored) solid lines, and two classes of oriented vertices. In this paper we consider only vacuum graphs, i.e. all the vertices of the graphs are 4valent and we deal only with connected graphs (thus with the logarithm of the partition function (2)). The lines of a vacuum cGFT graph Γ have two natural orientations given by the fact that only vertices of opposite orientations can be glued. It is easy to see that a vacuum cGFT graph must have the same number of black and red vertices. For any graph Γ, we denote n as the number of vertices, l as the lines of Γ, and we define as faces (not to be confused with the faces of the tetrahedron!), ${\mathcal{\mathcal{F}}}_{\Gamma}$, as any closed strand in the Feynman graph of a GFT. Thus a generic vacuum Feynman amplitude of the theory can be written as:
where l_{0} is a line associated to a face f and σ(l_{0},f) is alternatively +1 or 1 depending on the orientation. In the following we will assume that an orientation is fixed. Because of the properties of δ ″ s the orientation does not affect the amplitude. To each colored graph associated to an amplitude of the colored Boulatov model it is possible to associate bubbles by removing all the edges of one color. We call ${\mathcal{\mathcal{B}}}_{{i}_{1},\cdots \phantom{\rule{0.3em}{0ex}},{i}_{k}}$ the set of kbubbles associated to the deletion of nk colors. In 3dimensions, for instance, 3bubbles have 3colors (surfaces), 2bubbles have 2 colors (lines) and so on and so forth. Bubbles play a special role in the theory, since they discriminate manifold from pseudomanifolds (see next section for the same result in the theory of 3gems).
A survey of graphembedded manifolds results
In this section we review some basic results in the field of 3gems and make a dictionary between the two literatures, as colored group field theory can gain much from the results obtained in all the years of research in such field.
Let Γ be a finite, edgecolored graph, parallel edges allowed. A k residue of Γ k∈N is a connected component of subgraph of Γ induced by k color classes (this is what in colored group field theory are called bubbles). These graphs represent a piecewice linear manifold in the following sense (a pseudocomplex) Ferri et al. ([1986]). A nregular ncolored graph is an edgecolored graph which has a nodes of degree n. To a couple (Γ γ)_{n + 1} there is an associated pseudocomplex K(Γ) given by the following construction. Take an nsimplex σ^{n}for each V(Γ) and label its vertices Δ_{ n }. If x y in V(Γ) are joined by an edge, then attach the (n1)faces of their associated simplices. This is the same interpretation given to attaching faces of nsimplices in a ndimensional group field theory. We denote Γ the pseudocomplex associated with the colored graph Γ.
Lemma 1
For any PL nmanifold $\mathcal{\mathcal{M}}$ there exist a (n+1)graph Γ such that $\left\Gamma \right\simeq \mathcal{\mathcal{M}}$.
We now restrict to the case of 3dimensions and list some of the basic results Lins ([1995]). Let Γ be a 4edgecolored 4graph and denote by v e b t respectively the number of vertices (0residues), edges (1residues), 2residues and 3residues.
Definition 1
A 3gem (a 3 graphembedded manifold) is a 4regular properly edgecolored graph such that
A 4regular properly edgecolored graph for which (5) does not apply is called 3gepm (a 3 graphembedded pseudomanifold).
Lemma 2
A necessary and sufficient condition for the graph (Γ γ)_{4}to represent a manifold, is to meet the relation between its 2 and 3 residues (read as it 2 and 3 colored bubbles) and the number of vertices (read as the perturbative order) v+t=b. This Lemma clarifies the reason why 3gems have to satisfy the relation (5). Let now introduce few definitions which will turn useful later Ferri et al. ([1986]):
Definition 2
A triball is a connected, cubic, 3edgecolored graph ${\Gamma}_{3}\subset \Gamma $ such that its Euler characteristic is the one of the 2sphere. Thus we have the relation between its 2residues ${b}_{{\Gamma}_{3}}$ and the vertices: $2{b}_{{\Gamma}_{3}}v=4$. An important fact is the following:
Lemma 3
A graph (Γ γ)_{4}is a 3gem iff each of its 3residue is a triball. Thus, the condition that graphs have to satisfy in order to be 3gems is a condition on the topology of its 3residues. We now discuss crystallizations of 3gems [Ferri and Gagliardi ([1982]); Lins ([1995]); Lins and Mandel ([1985])]. Let first introduce the fusion process. Let be ${\mathcal{\mathcal{B}}}_{\mathrm{ijk}}$ and ${{\mathcal{\mathcal{B}}}^{\u2033}}_{\mathrm{ijk}}$ two different 3residues separated by a unique color which, by construction, is different from the color i j k. We call 1dipole this edge connecting the two 3residues. The generalization to k dipoles which connect (n k)residues is obvious. We call fusion the process of contraction of two vertices through the first two combinatorial moves depicted in Figure 3. Each cancellation of a 1dipole has the effect of decreasing by one the number of iresidues, where i is the color of the edge which defines the 1dipole, not changing the number of jresidues, for j≠i. Thus by a succession of 1dipole cancellation we obtain a 3gem with 4 triballs. Such a 3gem is said to be contracted and is called a crystallization for the associated 3manifold. It is a fact that any closed 3manifolds has a crystallization, and two closed 3manifolds are related by a homeomorphism if and only if they are related by creation or contraction of 1 and 2 dipoles with the fusion rules; in this case, the two 3manifolds are said to be equivalent or homeomorphic. Thus it is easy to understand that the fusion rules are the combinatorial equivalent of homeomorphisms. Let now discuss crystallization for generic colored (n+1)graphs. The following results hold:
Theorem 1
For every PL nmanifold $\mathcal{\mathcal{M}}$ there exist a crystallization.
Theorem 2
Two ngraphs Γ_{1} and Γ_{2} are crystallizations of the same manifold $\mathcal{\mathcal{M}}$ if one is converted into the other by:

a)
Adding or removing a nondegenerate mdipole with n−1>m>1;

b)
Adding a 1dipole and deleting another 1dipole.
A general theorem on the orientability of ngraphs holds:
Theorem 3
(Orientability) Let (Γ,γ)_{n + 1}be any crystallization of an nmanifold $\mathcal{\mathcal{M}}$. Then $\mathcal{\mathcal{M}}$ is orientable iff Γ is bipartite. These theorems are fundamental in order to have a clear geometrical understanding of graphs generated by a colored group field theory i.e. that to vertices there are associated nsimplices. This interpretation will be used in the next section, in which the main result of the paper is presented.
Orientability in cGFT
In this section we prove a Lemma on the orientability of PL manifolds associated to graphs generated by the colored Boulatov model. Orientability of a manifold is a requirement if we want to construct a spin bundle. In 4dimensions, for instance, the requirement to have a global spin bundle is to have a vanishing first and second StiefelWhitney class. While the second can be neglected by constructing local spin bundle and then gluing the charts, the vanishing of the first is a strict requirement and is equivalent to ask the orientability of the manifold. Another important fact is that orientability restricts enormously the class of 3manifolds which could be generated. As an example, in 2dimensions the most general decomposition is given by connected sum of spheres, torii and projective planes. Orientability excludes the connected sum of projective planes, which allows the expansion in the ordinary genus we are used to.
Lemma 4
(3dimensions) Let Γ be a connected vacuum finite graph generated by the colored Boulatov model. Let ${\mathcal{\mathcal{B}}}_{\mathrm{ijk}}$ and ${\mathcal{\mathcal{B}}}_{\mathrm{ij}}$ be the set of 3 and 2 bubbles of Γ respectively. Then the pseudomanifolds associated to Γ is an oriented pseudomanifold. Moreover, Γ represents a closed and orientable 3manifold iff
Proof
This lemma follows directly from the properties of graphs generated by the colored Boulatov model and its interpretation, which is the same of the simplicial construction of 3gepms. By Lemma 1 the graph generated is a manifold if and only if the condition (6) is met. Since the graph is finite, the manifold is also closed. Thus what we have to show is that they are orientable. By the theorem on the orientability the 3gem represents an orientable manifold if and only if the crystallization graph is bipartite. First we note that the graphs generated by colored group field theory are bipartite. Let A and B be the set of clockwise and anticlockwise vertices of Γ respectively. Since by construction a clockwise vertex has to be contracted with an anticlockwise, then all the edges are between the set A and the set B and none is within the sets, thus the graph is bipartite. Now we have to show that its contraction is still bipartite. However, this fact is trivial because any of the moves in Figure 3 keeps the bipartiteness of the original graph, thus in particular the fusion of a 1dipole. Moreover, since the graph is finite, the crystallization is reached in a finite number of moves.
The orientability part of this Lemma can be generalized to higher dimensions. The construction given in the third section of this note ensures that to each ndimensional pseudocomplex there is at least a colored (n+1)graph which is homehomorphic to it. It is then easy to see why colored group field theories generates only orientable pseudomanifolds in any number of dimensions; we state it as a Lemma, even if it clearly follows from the construction given in Pezzana ([1974]) of nedgecolored graphs in any number of dimensions, while orientability comes from a generalization to mdipoles (as in Theorem 2) of the previous proof and the fact that there are two types of vertices: This means that, at any finite order, the connected vacuum graphs generated by the partition function of a colored group field theory are associated with closed and orientable PL pseudomanifolds. □
Conclusions
In this short paper we have used results in the field of 3gems to prove that all the graphs generated by the colored Boulatov model are related to orientable pseudomanifolds. In order to prove it we used new tools which could turn to be very useful in the context of group field theory, more specifically in the colored version of it. In fact, color is a fundamental ingredient in all we said. It should be said that what proved here is not an unexpected result Oriti and Gurau ([2010]). The fact that an orientation for the faces can be chosen with ease was a hint of what proved here. Indeed, as far as the author is concerned, this is the first rigorous proof appeared so far.
References
Ambjorn J, Durhuus B, Jonsson T: ThreeDimensional Simplicial Quantum Gravity And Generalized Matrix Models. Mod Phys Lett A 1991, 6: 1133. 10.1142/S0217732391001184
Bonzom V, Smerlak M: Lett Math Phys. 2010, 93: 295.
Brezin E, Itzykson C, Parisi G, Zuber JB: Planar Diagrams. Commun Math Phys 1978, 59: 35. 10.1007/BF01614153
Boulatov DV: A Model of threedimensional lattice gravity. Mod Phys Lett A 7, 1629 1992. [arXiv:hepth/9202074]
David F: A Model Of Random Surfaces With Nontrivial Critical Behavior. Nucl Phys B 1985, 257: 543.
Ferri M, Gagliardi C: Crystallisation moves. Pac J Mathematics 1982.,100(1):
Ferri M, Gagliardi C, Grasselli L: A graphtheoretical representation of PLmanifolds  A survey on crystallizations. Aequationes Mathematicae 1986, 31: 121141. 10.1007/BF02188181
Freidel L: Group field theory: An overview. Int J Theor Phys 2005, 44: 1769. [arXiv:hepth/0505016] 10.1007/s1077300588941
Freidel L, Gurau R, Oriti D: Group field theory renormalization  the 3d case: power counting of divergences. Phys Rev D 2009, 80: 044007. [arXiv:0905.3772 [hepth]]
Geloun JB, Magnen J, Rivasseau V: Bosonic Colored Group Field Theory. 2010a. [arXiv:0911.1719 [hepth]].
Geloun JB, Krajewski T, Magnen J, Rivasseau V: Linearized Group Field Theory and Power Counting Theorems. Class Quant Grav 2010b, 27: 155012. [arXiv:1002.3592 [hepth]] 10.1088/02649381/27/15/155012
Gurau R: Colored Group Field Theory. 2009. [arXiv:0907.2582 [hepth]]
Gurau R: Topological Graph Polynomials in Colored Group Field Theory. Annales Henri Poincare 2010a, 11: 565. [arXiv:0911.1945 [hepth]] 10.1007/s0002301000356
Gurau R: The 1/N expansion of colored tensor models. 2010b. [arXiv:1011.2726v2 [grqc]]
Lins S: . Gems, Computers and Attractors for 3Manifolds, (Series on Knots and Everything, Vol 5) 1995. ISBN: 9810219075/ISBN13: 9789810219079
Lins S: “Graphencoded 3manifolds”. Discrete Mathematics 1985, 57: 261284. 10.1016/0012365X(85)901797
Magnen J, Noui K, Rivasseau V, Smerlak M: Scaling behaviour of threedimensional group field theory. Class Quant Grav 2009, 26: 185012. [arXiv:0906.5477 [hepth]] 10.1088/02649381/26/18/185012
Oriti D: The group field theory approach to quantum gravity: some recent results. 2009. [arXiv:0912.2441 [hepth]]
Oriti D, Gurau R: Private communications. 2010.
Pezzana M: Sulla struttura topologica delle varietà compatte. Atti Sem Mat Fis Univ Modena 1974, 23: 269277.
Rovelli C: Quantum Gravity. In Perez, A “Introduction to Loop Quantum Gravity and Spin Foams.”. Cambridge University Press, Cambridge; 2004. [arXiv:grqc/0409061]
Acknowledgements
We would like to thank Razvan Gurau for several discussions on the topic of group field theory. Also, we would like to thank Daniele Oriti for advices on the presentation of this result and Lorenzo Sindoni for reading carefully the manuscript. Research at Perimeter Institute for Theoretical Physics is supported in part by the Government of Canada through NSERC and by the Province of Ontario through MRI.
Author information
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Received
Accepted
Published
DOI
Keywords
 Partition Function
 Simplicial Complex
 Piecewise Linear
 Colored Version
 Colored Graph