Topological expansion in isomorphism theorems between matrix-valued fields and random walks
Titus Lupu (CNRS, INSMI, LPSM (UMR\_8001))

TL;DR
This paper explores the relationship between matrix-valued Gaussian fields and random walks on electrical networks, revealing topological expansions via ribbon graphs and extending to fields twisted by various connections.
Contribution
It introduces a topological expansion framework for matrix-valued Gaussian fields linked to random walks, including twisted cases with holonomies and boundary cycle considerations.
Findings
Topological expansions are encoded by ribbon graphs.
Isomorphisms involve traces of holonomies in twisted cases.
Framework applies to real, complex, and quaternionic matrix fields.
Abstract
We consider Gaussian fields of real symmetric, complex Hermitian or quaternionic Hermitian matrices over an electrical network, and describe how the isomorphisms between these fields and random walks give rise to topological expansions encoded by ribbon graphs. We further consider matrix-valued Gaussian fields twisted by an orthogonal, unitary or symplectic connection. In this case the isomorphisms involve traces of holonomies of the connection along random walk loops parametrized by boundary cycles of ribbon graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Geometry and complex manifolds · Graph theory and applications
Topological expansion in isomorphism
theorems between matrix-valued fields and random walks
Titus Lupu
CNRS and LPSM, UMR 8001, Sorbonne Université, 4 place Jussieu, 75252 Paris cedex 05, France
Abstract.
We consider Gaussian fields of real symmetric, complex Hermitian or quaternionic Hermitian matrices over an electrical network, and describe how the isomorphisms between these fields and random walks give rise to topological expansions encoded by ribbon graphs. We further consider matrix-valued Gaussian fields twisted by an orthogonal, unitary or symplectic connection. In this case the isomorphisms involve traces of holonomies of the connection along random walk loops parametrized by boundary cycles of ribbon graphs.
Key words and phrases:
discrete gauge theory, Gaussian free field, Gaussian orthogonal ensemble, Gaussian symplectic ensemble, Gaussian unitary ensemble, isomorphism theorems, holonomy, matrix integrals, matrix models, random matrices, random walks, ribbon graphs, topological expansion, Wilson loops
2010 Mathematics Subject Classification:
60G15, 81T18, 81T25 (primary), and 15B52, 60J55 (secondary)
1. Introduction
It is known since the works of Symanzik [Sym65, Sym66, Sym69] and Brydges, Fröhlich and Spencer [BFS82] that the Gaussian free field (GFF) has representations involving random walks, sometimes referred to as ”isomorphisms”. For a survey on the subject we refer to [MR06, Szn12]. Here we will be interested in a representation that appears in Brydges, Fröhlich, Spencer [BFS82] and Dynkin [Dyn84a, Dyn84b], that expresses
[TABLE]
for a GFF, in terms of pairings of vertices -s and random walks joining the pairs. Following [BHS21], we will call it the BFS-Dynkin isomorphism.
Kassel and Lévy considered vector-valued GFFs twisted by an orthogonal or unitary connection [KL16]. In this setting isomorphism theorems involve the holonomy of the connection along the random walks. Holonomies along random walk or Brownian loops have been also studied in [LJ17, LJ20, CLJR21].
In this paper we will consider fields of random Gaussian matrices, real symmetric, complex Hermitian or quaternionic Hermitian, on an electrical network. These are matrix-valued GFFs. The matrix above any vertex of the network is proportional to a GOE, GUE or GSE matrix. Here we will write an isomorphism for
[TABLE]
where is the matrix-valued GFF, , is the size of the matrices, are positive integers with even, and vertices on the network. By taking the -s equal inside each of the traces, we get symmetric polynomials in the eigenvalues. By expanding the traces and the product above, one can write a BFS-Dynkin’s isomorphism for each of the terms of the sum. However, one gets many different terms that give identical contributions, many terms with contributions that cancel out, being of opposite sign, and many terms that give zero contribution. By regrouping the terms surviving to cancellation into powers of , one gets a combinatorial structure known as a topological expansion. The terms of the expansion correspond to ribbon graphs with vertices, obtained by pairing and gluing ribbon half-edges. Each gluing may be straight or twisted. The power of is then given by the number of cycles formed by the boundary components of the ribbons. It can be also expressed in terms of genera of compact surfaces, orientable or not.
The topological expansion has been introduced by ’t Hooft for the study of Quantum Chromodynamics [tH74], and further developed by Brézin, Itzykson, Parisi and Zuber [BIPZ78, IZ80]. Nowadays there is a broad, primarily physics literature on this topic. In particular, topological expansion of one matrix or several matrix integrals is used for the enumeration of maps on surfaces and other graphical objects [BIZ80, Zvo97, LZ04, Eyn16]. Compared to the case of one matrix integrals, where each ribbon edge comes only with a scalar weight, in our setting each ribbon edge will be associated to a measure on random walk paths between two vertices and on the network. For an introduction to the topological expansion we refer to[Zvo97, EKR18].
We will further extend our framework and consider matrix-valued free fields twisted by a connection of orthogonal (), unitary () or symplectic () matrices. We rely for this on results of Kassel and Lévy for twisted vector-valued GFFs [KL16]. If is the matrix-valued GFF twisted by a connection and its fields of eigenvalues, then the isomorphism for
[TABLE]
involves a topological expansion where instead of to the power the number of cycles in a ribbon graph appears a product of traces of holonomies of the connection, one per each boundary cycle in the ribbon graph. The holonomies are taken along loops made of concatenated random walk paths. Such traces of holonomies along loops are called Wilson loop observables.
2. Preliminaries
2.1. Quaternions, symplectic matrices and quaternionic Hermitian matrices
will denote the skew (non-commutative) field of quaternions. Its elements are of the form
[TABLE]
where , and i, j and k satisfy the relations
[TABLE]
[TABLE]
The coefficient is the real part of the quaternion . The algebra of quaternions has the usual representation over complex matrices:
[TABLE]
The conjugate of a quaternion is given by
[TABLE]
The matrix is the adjoint of for the Hermitian inner product:
[TABLE]
If ,
[TABLE]
The absolute value is given by
[TABLE]
For more on quaternions, we refer to [MGS14].
We will denote by the ring of matrices with quaternionic entries. The product of matrices is defined in the same way as for matrices over a commutative field:
[TABLE]
One can associate to a matrix a matrix with complex entries, by replacing each entry by a block . The resulting matrix in will be again denoted . The map is then a morphism of rings from to .
The trace of a matrix of quaternions is defined as usually:
[TABLE]
However, it is more convenient to deal with the real part of the trace, as
[TABLE]
and for ,
[TABLE]
Note that in general there is no equality between and , since the product of quaternions is not commutative.
The quaternion adjoint of a matrix , denoted , extends the notion of adjoint for matrices with complex entries:
[TABLE]
where is the quaternion conjugate. We have that
[TABLE]
where on the left-hand side ∗ denotes the quaternion adjoint, and on the right-hand side, ∗ denotes the complex adjoint. If ,
[TABLE]
The quaternionic unitary group, is the set of matrices satisfying
[TABLE]
being the identity matrix. The relation above is equivalent to
[TABLE]
If ,
[TABLE]
and . The image of by is the compact symplectic group , a subgroup of .
The set of quaternionic Hermitian matrices is composed of matrices satisfying
[TABLE]
A matrix is quaternionic Hermitian if and only if is complex Hermitian. The diagonal entries of a quaternionic Hermitian matrix are real. Given , there exists such that is diagonal with real entries:
[TABLE]
with . The family is uniquely determined. This is also the family of ordered eigenvalues of , but the multiplicities have to be doubled. are the right eigenvalues of , and form the right spectrum of , i.e. the set of , for which the equation
[TABLE]
has a non-zero solution. There is also a notion of left spectrum, corresponding to the equation . But the right and the left spectra do not necessarily coincide, even for quaternionic Hermitian matrices. For details on eigenvalues of quaternionic matrices we refer to [Zha97, MGS14]. For , the trace of also equals
[TABLE]
2.2. BFS-Dynkin isomorphism
Let be a finite undirected connected graph. We do not allow multiple edges or self-loops. Edges are endowed with conductances . There also a not identically zero killing measure , with . The graph will be further referred to as an electrical network. Let be the Markov jump process to nearest neighbors with jump rates given by the conductances. is also killed by . Let be the first time gets killed by .
Let be the Green’s function:
[TABLE]
Let be the transition probabilities of . Then and
[TABLE]
Let be the bridge probability measure from to , where one conditions by . Let be the following measure on paths from to in finite time:
[TABLE]
The measure has total mass . The image of by time reversal is .
Given and a partition in pairs of , will denote the following product measure on -tuples of paths:
[TABLE]
We will sometimes, in particular in Section 3.2, use the convention that . The order of the pairs in p will not be important.
In general, for a path and , will denote the occupation field of ,
[TABLE]
where is the life-time of the path.
The (scalar real) Gaussian free field (GFF) will denote here the centered Gaussian process with covariance
[TABLE]
The distribution of is given by
[TABLE]
The following isomorphism relates the square of the GFF and the occupation fields of paths under the measures . It first appears in the work of Brydges, Fröhlich and Spencer [BFS82] (see also [Frö82, BFS83b, BFS83a]) and then in that of Dynkin [Dyn84a, Dyn84b] (see also [Dyn84c]). It is also related to earlier works of Symanzik [Sym65, Sym66, Sym69]. For more on isomorphism theorems, see [MR06, Szn12].
Theorem 2.1** **(Brydges-Fröhlich-Spencer [BFS82],
Let , and a bounded measurable function . Then
[TABLE]
2.3. Connections, gauge equivalence and Wilson loops
Let , . Let be the group of either orthogonal matrices , or unitary matrices , or quaternionic unitary matrices . We consider that each undirected edge in consists of two directed edges of opposite direction. We consider a family of matrices in , , with
[TABLE]
is our connection on the vector bundle with base space and fiber respectively , or .
Given a nearest-neighbor oriented discrete path , the holonomy of along is the product
[TABLE]
If the path is a nearest-neighbor path parametrized by continuous time, and does only a finite number of jumps, the holonomy is defined as the holonomy along the discrete skeleton of . We will denote by the time-reversal of a path . We have that
[TABLE]
Given a nearest-neighbor oriented discrete closed path (i.e. a loop) , with , we will consider the observable
[TABLE]
in the orthogonal and unitary case, and
[TABLE]
in the quaternionic unitary case. Such observables are called Wilson loops [Wil74]. Note that the Wilson loop observable does not depend on where the loop is rooted. Indeed, if is the loop visiting , and if is the path visiting then
[TABLE]
Given another family of matrices in , , this time on top of vertices, it induces a gauge transformation on the connection :
[TABLE]
Two connections related by a gauge transformation are said to be gauge equivalent. A connection is trivial if it is gauge equivalent to the identity connection. A criterion for triviality is that along any nearest-neighbor loop , with ,
[TABLE]
In general, any two gauge equivalent connections have the same Wilson loop observables. The converse is also true (but non-obvious): the collection of all possible Wilson loop observables characterizes a connection up to gauge transformations [Gil81, Sen94, Lé04].
2.4. BFS-Dynkin isomorphism for the Gaussian free field twisted by a connection
In [KL16] Kassel and Lévy introduced the vector-valued GFF twisted by an orthogonal/unitary connection, and generalized the isomorphisms with random walks to this case. Here we will do a less abstract, more computational presentation of the same object. Kassel and Lévy’s isomorphisms rely on a covariant Feynman-Kac formula ([BFS79] and Theorem 3.1 in [KL16]).
Let us consider on top of the electrical network an orthogonal connection , . The Green’s function associated to the connection is a function from to (i.e. the matrices with real entries), with the entries given by
[TABLE]
where the measure on paths is given by (2.1). Since the image of by time reversal is , and because of (2.3), we have that
[TABLE]
i.e. and is symmetric. One can see as a symmetric linear operator on . It is positive definite (see Proposition 2.15 in [KL16]). We will denote by the determinant of this operator.
The -valued Gaussian free field on twisted by the connection is a random Gaussian function () with the distribution given by
[TABLE]
where is the usual norm on and
[TABLE]
Note that if ,
[TABLE]
We have that . As for the covariance structure, we have (see Proposition 4.1 in [KL16]):
[TABLE]
If is a gauge transformation, then is the Gaussian free field related to the connection . In particular, if the connection is trivial, the field can be reduced to i.i.d. copies of the scalar GFF with distribution (2.2).
In [KL16], Theorems 5.1 and 7.3, Kassel and Lévy gave a BFS-Dynkin-type isomorphism for GFFs twisted by connections.
Theorem 2.2** **(Kassel-Lévy
[KL16]).
Let , , and a bounded measurable function . Then
[TABLE]
where the sum runs over the partitions of in pairs.
Next we rewrite slightly the isomorphism above. This will be used in Section 4, in the proofs of Lemmas 4.1 and 4.6. Let be an i.i.d. family of random Gaussian vectors with components, following the law .
Lemma 2.3**.**
Let , , and a bounded measurable function . Then
[TABLE]
where the sum runs over the partitions of in pairs.
Proof.
Indeed,
[TABLE]
2.5. Ribbon graphs and surfaces
Here we describe the ribbon graphs and the related two-dimensional surfaces. For more details, we refer to [Eyn16, Sections 2.2, 2.3], [EKR18, Chapter 2], [LZ04, Sections 3.2, 3.3], [Zvo97], and [MT01, Section 3.3].
Let , where , and for all , . We will denote
[TABLE]
We will assume that is even.
Given as above, we consider vertices, where each vertex has adjacent ribbon half-edges: half-edges for the first vertex, for the second, etc. A ribbon half-edge is a two-dimensional object and carries an orientation. Also, the ribbon half-edges around each vertex are ordered in a cyclic way. The ribbon half-edges are numbered from to . See Figure 1 for an illustration with .
Since the total number of half-edges, , is even, one can pair them to obtain a ribbon graph (not necessarily connected), with vertices and ribbon edges. Each time we pair two half-edges, we can glue the corresponding ribbons in two different ways. Either the orientations of the two ribbon half-edges match, or are opposite. In the first case we get a straight ribbon edge, in the second a twisted ribbon edge. See Figure 2. We call such a pairing of ribbon half-edges that keeps straight or twists the ribbons a ribbon pairing. Let be the set of all possible ribbon pairings associated to . The number of different ribbon pairings is
[TABLE]
Figure 3 displays an example of a ribbon pairing with only straight edges, and Figure 4 an example with both straight and twisted edges.
A ribbon pairing induces a partition in pairs of , denoted . The pairs correspond to the labels of ribbon half-edges associated into an edge. Conversely, given p a partition in pairs of , will denote the subset of made of all ribbon pairings such that ().
Given a ribbon pairing , one can see the corresponding ribbon graph as a two-dimensional compact bordered surface (not necessarily connected). Let denote the number of the connected components of the boundary, that is to say the number of distinct cycles formed by the borders of ribbons. On Figure 3, , and on Figure 4, . Then, one can glue along each connected component of the boundary a disk ( disks in total), and obtain in this way a two-dimensional compact surface (not necessarily connected) without boundary. We will denote it , and consider it up to diffeomorphisms. On the example of Figure 3, has two connected components, a torus on the left and a sphere on the right. On the example of Figure 4, has again two connected components, a Klein bottle on the left and a projective plane on the right. Observe that if all the edges are straight, the surfaces that appear are orientable. Let denote the Euler’s characteristic of . According to Euler’s formula,
[TABLE]
Next we introduce additional combinatorial objects related to the ribbon pairings. We will consider tuples , where , each of the is in , and each of the is one of the three abstract symbols , or . We will endow such tuples by an equivalence relation generated by the following rules.
- •
Cyclic permutation: for any , is identified to .
- •
Reversal of the direction: is identified to
, where is , is , and is .
For lack of a better name, we will call trails the equivalence classes of .
Given a ribbon pairing , we will associate to a set made of trails, one per each boundary cycle in the ribbon pairing. One starts on such a boundary cycle in an arbitrary place, and travels along it in any of the two directions. Then one successively visits ribbon half-edges with labels and then returns to the half-edge . One can go from the half-edge to the half-edge either by following a gluing, and we will denote this , or by going through a vertex. In the latter case, one either does a turn clockwise, and we will denote this , or counterclockwise, and we will denote this . A special rule is applied if the vertex has only one outgoing half-edge, one just makes the arrows in the trail and on the picture match. This is how a trail is obtained. Note that by construction, there is an alternation between on one hand , and on the other hand or . In the example of Figure 3, there are three trails:
[TABLE]
In the example of Figure 4, there are two trails:
[TABLE]
We will also consider oriented trails. Like the (unoriented) trails, they can contain positive integer numbers and symbols and , but not the symbol . In the oriented trails we quotient by cyclic permutations, but not by the reversal of direction. We will associate oriented trails to ribbon pairing that contain only straight edges. Given with only straight edges, will be a set of oriented trails, one per each boundary cycle where one follows the cycle in the direction of the arrows (clockwise). The oriented trails corresponding to Figure 3 are given by (2.4).
2.6. One matrix integrals and topological expansion
will denote , the space of real symmetric matrices, for , , the space of complex Hermitian matrices, for , and , the space of quaternionic Hermitian matrices, for .
[TABLE]
is endowed with the real inner product
[TABLE]
The Gaussian Orthogonal Ensemble GOE, the Gaussian Unitary Ensemble GUE and Gaussian Symplectic Ensemble GSE are Gaussian probability measures on , with for the GOE, for the GUE and for the GSE. We will use the usual notation GE. The density with respect to the Lebesgue measure on is given by
[TABLE]
The distribution of the ordered family of eigenvalues of GE is given by
[TABLE]
For more on random matrices see [Meh04].
Let , where for all , , and
[TABLE]
is even. Next we recall the expressions for the matrix integrals
[TABLE]
Note that if is odd, the above integrals are zero. The expression for (2.6) is a polynomial in , with powers , where are ribbon pairings associated to . Since can be expressed using Euler’s characteristic of surfaces, the expression for (2.6) is often referred to as topological expansion. The expansion for complex Hermitian and real symmetric matrices appears in [BIPZ78] (see also [BIZ80]). The combinatorics for quaternionic Hermitian matrices are given in [MW03] (see also [BP09]). For more on the topological expansion, we also refer to [Eyn16, Chapter 2], [EKR18, Chapter 2], [LZ04, Chapter 3], and [Zvo97].
Given a ribbon pairing , we associate to it a weight depending on :
[TABLE]
In all three cases , for every p partition in pairs of ,
[TABLE]
Theorem 2.4** **(Brézin-Itzykson-Parisi-Zuber [BIPZ78],
Mulase-Waldron [MW03]).
For and even, the value of the matrix integral (2.6) is given by
[TABLE]
For instance, equals . For and one gets
[TABLE]
3. Main statements
3.1. Matrix-valued free fields, isomorphisms and topological expansion
Let be an electrical network as in Section 2.2. For , will be a random Gaussian function from to . The distribution of is
[TABLE]
The field is a matrix-valued Gaussian free field. It can be obtained out of i.i.d. copies of the scalar GFF (2.2), by considering the coefficients of the matrices. For any , is distributed as a GE matrix. The brackets will denote the expectation with respect to the law of for the corresponding values of .
Let , where for all , , and is even. Let be vertices in , not necessarily distinct and a bounded measurable function . By applying Theorem 2.1, one can a priori write an isomorphism for
[TABLE]
However, if one expands the traces and the product, one gets many terms that give identical contributions, many terms with contributions that compensate, and many terms that do not contribute at all. Here we will be interested in the exact combinatorics that appear. What emerges is a topological expansion, generalizing that of Theorem 2.4.
Let be the following positive measure on families of nearest-neighbor paths on :
[TABLE]
Next we give examples.
[TABLE]
The measures with are linear combinations of , and . We summarize the coefficients in some cases in the table below.
[TABLE]
In the examples of Section 2.5, the terms in corresponding to the pairings displayed on Figures 3, respectively 4, are measures of the form with prefactors , respectively .
Theorem 3.1**.**
For and a bounded measurable function , one has the following equality:
[TABLE]
where is a product measure. For ,
[TABLE]
In particular, if is the family of eigenvalues of , , and
[TABLE]
then, for ,
[TABLE]
where the notation means that is repeated times.
Remark 3.2*.*
In the quaternionic case , when considering a single GSE matrix as in Theorem 2.4, one does not need to take the real part of , since is quaternionic Hermitian and its diagonal entries are real. However, in Theorem 3.1 above, the products
[TABLE]
may involve several different matrices, and thus are not always quaternionic Hermitian. So one needs to take the real part of the traces.
Now, we consider a family of deterministic square matrices with complex entries of size :
[TABLE]
[TABLE]
[TABLE]
Note that by convention, for each such that , we have a single matrix . For , will denote the product
[TABLE]
In case , .
Next, for , we will write an isomorphism for
[TABLE]
It will involve the following (complex-valued) measure on -tuples of nearest-neighbor paths on :
[TABLE]
Here, is a product of matrices of the form or , where T denotes the transpose (and not the adjoint). For each sequence in the trail we add the factor to the product, and for each sequence , we add the factor , all by respecting cyclic order of the trail. For instance, if
[TABLE]
which is one of the trails on Figure (4), then
[TABLE]
Note that while the product depends on the particular representative of the equivalence class , its trace does not. Indeed, the trace is invariant by a cyclic permutation of the factors. Moreover, reversing the direction of a representative of amounts to taking the transpose of the product, which has the same trace.
Next we give examples of measures :
[TABLE]
Note that if all of the matrices are equal to , the identity matrix, then is just , because all of the traces equal then .
For , we will need a slightly different setting. We consider matrices , with the same indices as for the matrices , but instead the ’s are quaternion-valued. The (signed) measure will be defined as follows
[TABLE]
Here, is a product of matrices of the form or . For each sequence in the trail we add the factor to the product, and for each sequence , we add the factor , all by respecting cyclic order of the trail. Let us emphasize that for , we use the quaternion adjoint ∗, and not the transpose T. For the trail (3.4), one gets
[TABLE]
Next are two examples:
[TABLE]
Theorem 3.3**.**
For and a bounded measurable function , one has the following equality:
[TABLE]
where is a product measure. For ,
[TABLE]
Theorem 3.3, which contains Theorem 3.1 as a special case, will be proved in Section 4.1.
3.2. Isomorphisms and topological expansion for matrix-valued fields twisted by a connection
We will denote by the group if , if , and if . We consider a connection on , , with and
[TABLE]
Let be the following probability measure on , defined by the density
[TABLE]
Note that if , then
[TABLE]
We will denote by the field under the measure . It is the matrix-valued Gaussian free field twisted by the connection . If is a gauge transformation, then is the field associated to the connection . If the connection is trivial, then for all , is distributed as a GE matrix. This is not necessarily the case if the connection is non-trivial.
As in Section 3.1, we take , where for all , , and is even. Let be vertices in , not necessarily distinct. As in Section 3.1, the ’s respectively ’s are families of square matrices with complex, respectively quaternionic entries of size . The products and are defined as in (3.3).
Next we will write an isomorphism for
[TABLE]
and for
[TABLE]
For , we introduce the following (complex) measure on -tuples of nearest-neighbor paths on :
[TABLE]
Here, is a product of matrices of the form or , and or , being one of the paths. For each sequence in the trail we add the factor to the product, and for each sequence , we add the factor , as in the construction of . Moreover, for each sequence with , a measure is present, and we add to the product the factor . For each sequence with , a measure is present, and we add to the product the factor . In the product, the factors respect the cyclic order on the trail.
For , we will need oriented trails. The (complex) measure on -tuples of nearest-neighbor paths on is as follows:
[TABLE]
Here, is a product of matrices of the form and or , being one of the paths. For each sequence in the oriented trail we add the factor to the product. Moreover, for each sequence with , a measure is present, and we add to the product the factor . For each sequence with , a measure is present, and we add to the product the factor . In the product, the factors respect the cyclic order on the trail. The reason we use oriented trails is that the reversal of the orientation of the trail changes the trace, as complex adjoints of holonomies appear.
For , we return to unoriented trails. We introduce the (signed) measure on -tuples of nearest-neighbor paths in , constructed as follows:
[TABLE]
Here, is a product of matrices of the form or , and or , being one of the paths. For each sequence in the trail we add the factor to the product, and for each sequence , we add the factor . Moreover, for each sequence with , a measure is present, and we add to the product the factor . For each sequence with , a measure is present, and we add to the product the factor . In the product, the factors respect the cyclic order on the trail.
Next are some examples of measures and :
[TABLE]
[TABLE]
[TABLE]
Theorem 3.4**.**
For and a bounded measurable function , one has the following equality:
[TABLE]
where is a product measure. For ,
[TABLE]
Theorem 3.4 will be proved in Section 4.2.
Remark 3.5*.*
Note that in the measures for , and in , the holonomy along each path appears twice.
Remark 3.6*.*
If one does not have , then from a geometrical viewpoint it is not very natural to consider just the trace
[TABLE]
This is because then the live on fibers above different points of the base. So one needs a way to compare fibers above different points. For this one can intertwine the matrices and , with real symmetric , respectively complex Hermitian , and quaternionic Hermitian . However, it turns out that the identities of Theorem 3.4 are the same for and being more general.
Remark 3.7*.*
Consider the particular case when the connection is trivial, i.e. for any closed path (loop) , . There is a gauge transformation such that
[TABLE]
Then for any and nearest-neighbor path from to ,
[TABLE]
The field under has the same law as under . So, in the particular case of a trivial connection, Theorem 3.4 follows directly from Theorem 3.3.
A special case of particular interest in Theorem 3.4 is when all the matrices and equal and
[TABLE]
Then, on the left-hand side of (3.6), we have
[TABLE]
where is the family of eigenvalues of . On the right-hand side of (3.6) appears a product of Wilson loops. Indeed, each , and is then a holonomy along a loop formed by concatenating some of the paths . In the example of Figure 3, the holonomies are
[TABLE]
where and are paths from to , is a path from from to and a path from to . In the example of Figure 4, we get
[TABLE]
Note that since the joint distribution of all eigenvalues above all vertices is invariant under gauge transformations, it is natural that expectations with respect to only these eigenvalues involve only Wilson loops; see Section 2.3 and [Gil81, Sen94, Lé04]. We summarize this paragraph in the following corollary.
Corollary 3.8**.**
For and a non-trivial connection, in the isomorphism for
[TABLE]
compared to the case of a trivial connection (3.2), each power of in the topological expansion, that is , is replaced by a product of Wilson loops corresponding to holonomies along random walk loops, one for each boundary cycle of the ribbon in the ribbon pairing .
Remark 3.9*.*
The density (3.5) can be factorized by using the orthogonal decomposition
[TABLE]
We have that
[TABLE]
and
[TABLE]
So, under , for , the matrix-valued field and the scalar field are independent. Moreover, the field
[TABLE]
is distributed as a scalar GFF (2.2), and in particular its law is the same whatever the connection . The latter point can also be seen through the covariance structure of . In the expression of two-point correlations
[TABLE]
appear only ribbon graphs with one boundary component . Thus, the two-point correlations are expressed with
[TABLE]
Hence,
[TABLE]
4. Proofs
4.1. Proof of Theorem 3.3
We give the proof of Theorem 3.3, which contains Theorem 3.1 as a special case. A possible approach would be to expand the product of traces on the left-hand side of the isomorphism identity, apply Theorem 2.1, and then recombine the terms to get the right-hand side of the isomorphism identity. This works well for (see [Zvo97] for one matrix integrals), but for this approach is less tractable because of the non-commutativity of quaternions. Instead, we will rely on an induction over the numbers of edges , similar to that in [BP09].
We use the notations of Section 3.1. For , let be an i.i.d. sequence of GE(n) matrices with distribution (2.5). Given a partition of in pairs and , will denote the product of matrices
[TABLE]
where, for , we denote by the unique index such that . Note that how exactly the pairs in the partition p are ordered will not be important. The product is defined similarly, with matrices instead of . Note that in the products
[TABLE]
each for appears exactly twice, at positions corresponding to a pair in the partition p.
Lemma 4.1**.**
Then, for and a bounded measurable function , one has the following equality:
[TABLE]
For ,
[TABLE]
Proof.
On the left-hand side one can expand the product of traces
[TABLE]
Then, one applies to each term in the sum Lemma 2.3 (in the particular case ), so as to make appear the entries of GE matrices . Then one factorizes these entries into
[TABLE]
It remains to compute the moments
[TABLE]
for i.i.d. GE matrices. For we will use expressions of moments of quaternionic Gaussian r.v. that appeared in [BP09].
Lemma 4.2** (Bryc-Pierce [BP09]).**
Let be a quaternionic Gaussian r.v. with distribution
[TABLE]
Then, for any ,
[TABLE]
[TABLE]
Lemma 4.3**.**
Let be a random GE matrix (2.5), . Let be two deterministic matrices in , and two deterministic matrices in . Then
[TABLE]
Proof.
If , the identities follow from the second moments of the entries:
[TABLE]
[TABLE]
all other second moments being zero.
If , the diagonal entries are still real and commute with quaternions, so for all ,
[TABLE]
[TABLE]
For the offdiagonal entries, is distributed according to (4.1), so we apply Lemma 4.2. For all ,
[TABLE]
[TABLE]
All other second moments are zero. ∎
The following lemma will conclude the proof of Theorem 3.3.
Lemma 4.4**.**
For , and p a partition in pairs of ,
[TABLE]
For ,
[TABLE]
Proof.
The proof can be done by induction on . If , the identities above are exactly those of Lemma 4.3.
If , we fix a partition of in pairs. One can take conditional expectations with respect to that appears at positions and (i.e. conditioning on ). For that, one again applies Lemma 4.3. will denote the partition of induced by p. To construct a ribbon pairing one can proceed as follows.
- (1)
First pair the ribbon half-edges and in an either straight or twisted way. 2. (2)
Then contract the ribbon edge . After this operation one gets a new family of positive integers, if the edge was straight, or if the edge was twisted, and in both cases . 3. (3)
Finally take a ribbon pairing in , respectively .
One can show that the steps (1) and (2) above correspond to taking the conditional expectation with respect to the law , and the step (3) to further taking the expectations with respect to the law of . One needs to see how the weights and , respectively , are related, with a particular attention to the case .
This edge contraction procedure appears in the proof of a quaternionic Wick formula in Bryc and Pierce [BP09], Theorem 3.1. There the authors do in particular the verifications for the weights . Our setting is more general, and not limited to , but the recurrence on ribbon graphs is the same. For completeness, we give the details in Appendix A. ∎
Remark 4.5*.*
For one can alternatively prove Lemma 4.4 by expanding the product of traces, applying Wick’s rule to each scalar term and then recombining the resulting terms. If one wishes to proceed like that in the quaternionic case , one needs the Wick formula (4.9) for quaternionic Gaussian r.v.s; see Appendix B. This formula is more general than the one given in [BP09]. However, proceeding like that does not simplify the proof of Lemma 4.4, since the proof of the quaternionic Wick formula (4.9) relies itself on an induction on ribbon edges. Moreover, then one would need a particular treatment for the diagonal coefficients of the matrices, since those are real Gaussian r.v.s.
4.2. Proof of Theorem 3.4
We give the proof of Theorem 3.4. We use the notations of Section 3.2. As in Section 4.1, for , is an i.i.d. sequence of GE(n) matrices with distribution (2.5). Consider , a partition of in pairs, with , and nearest-neighbor paths on , with going from to . For , will denote the following product of matrices.
[TABLE]
where the matrix is given by
[TABLE]
The product is defined similarly, with matrices instead of .
Lemma 4.6**.**
Then, for and a bounded measurable function , one has the following equality:
[TABLE]
For ,
[TABLE]
Proof.
This follows from Lemma 2.3. Indeed, the action of on (), (), respectively (), induces an action on by conjugation:
[TABLE]
will denote the corresponding linear orthogonal operator on . The holonomy of the connection along a path is related to that of along by
[TABLE]
So one applies Lemma 2.3 to the connection . ∎
To finish the proof of Theorem 3.4, one needs to check, for every fixed partition in pairs p, the following expressions of expectations with respect to the law of :
[TABLE]
[TABLE]
[TABLE]
The identities above follow already from Lemma 4.4. One has to apply the latter to matrices , respectively , instead of , respectively , where and are as follows:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Then, for every ,
[TABLE]
Further, if and ,
[TABLE]
If is the only ribbon pairing in with only straight edges (the setting for ), if and is the corresponding unoriented trail, then
[TABLE]
Appendix A: induction on ribbon edges
Here we detail the induction on edges used in Lemma 4.4. We primarily distinguish the cases according to whether the ribbon half-edges and are adjacent to the same vertex (Figure 5) or to two different vertices (Figure 6). The case of one vertex corresponds to both occurrences of being in the same trace. This also corresponds to the left-hand side in equations (4.2), (4.4) and (4.6). The case of two vertices corresponds to the two occurrences of being in different traces. This also corresponds to the left-hand side in equations (4.3), (4.5) and (4.7).
We start with the case of one vertex. Recall that denotes a ribbon pairing of and the induced ribbon pairing of . We further distinguish the following cases.
- •
The generic case, when the vertex has other ribbon half-edges on both sides between and . Then, the straight pairing of and is represented on Figure 7. After contracting the ribbon edge , the vertex is split into two. This corresponds to having a product of two traces in the first term on the right-hand side in equations (4.2), (4.4) and (4.6). The orientations are preserved after contraction. This corresponds to not having transposes or adjoints in the first term on the right-hand side in equations (4.2), (4.4) and (4.6). Further, in case of a straight pairing, we have that
[TABLE]
Thus,
[TABLE]
So indeed we get the coefficients in front of the first term on the right-hand side in equations (4.2), (4.4) and (4.6).
The twisted pairing of and is represented on Figure 8. It can only occur for . After contracting the ribbon edge , the vertex is not divided. This corresponds to having a single trace in the second term on the right-hand side in equations (4.2) and (4.6). The orientations on one side of the contracted edge are reversed. This corresponds to having a transpose, respectively an adjoint, in the second term on the right-hand side in equation (4.2), respectively (4.6). Further, in case of a twisted pairing, we have that
[TABLE]
[TABLE]
So we get the coefficients in front of the second term on the right-hand side in equations (4.2) and (4.6).
- •
The first degenerate case, when the vertex has other ribbon half-edges on only one side between and . Then, for a straight pairing we have that
[TABLE]
and again,
[TABLE]
Moreover, the side between and with no other ribbon half-edges gives rise, after edge contraction/averaging by , to a factor consisting of a deterministic trace, with no random matrices inside.
As for the twisted pairing, the result in this degenerate case is the same as in the generic case. Nothing changes.
- •
The second degenerate case, when the vertex is of degree and its only ribbon half-edges are and . Then, for a straight pairing we have that
[TABLE]
and again,
[TABLE]
Moreover, after edge contraction/averaging by , appears a factor consisting of a product of two deterministic traces.
For a twisted pairing we have that
[TABLE]
and again,
[TABLE]
Moreover, after edge contraction/averaging by , appears a factor consisting of a deterministic trace.
Now we deal with the case of two vertices. We further distinguish the following cases.
- •
The generic case, when at least one of the two vertices is of degree at least two. Then, the straight pairing of and is represented on Figure 9. After contracting the ribbon edge , the two vertices are merged into one. This corresponds to having a single trace in the first term on the right-hand side in equations (4.3), (4.5) and (4.7). The orientations are preserved after contraction. This corresponds to not having transposes or adjoints in the first term on the right-hand side in equations (4.3), (4.5) and (4.7). Further, in case of a straight pairing, we have that
[TABLE]
Thus,
[TABLE]
So indeed we get the coefficients in front of the first term on the right-hand side in equations (4.3), (4.5) and (4.7).
The twisted pairing of and is represented on Figure 10. After contracting the ribbon edge , the two vertices are merged into one. This corresponds to having a single trace in the second term on the right-hand side in equations (4.3) and (4.7). The orientations on one of the parent vertices are reversed after contraction. This corresponds to the transpose, respectively adjoint, in the second term on the right-hand side in equations (4.3), respectively (4.7). Further, in case of a twisted pairing, we have that
[TABLE]
[TABLE]
So we get the coefficients in front of the second term on the right-hand side in equations (4.3) and (4.7).
- •
The degenerate case, when both vertices are of degree one. Then, for a straight pairing we have that
[TABLE]
and again,
[TABLE]
The same coefficients appear for a twisted pairing. Moreover, both in case of a straight and of a twisted pairing appears, after edge contraction/averaging by , a factor consisting of a deterministic trace, with no random matrices inside.
Appendix B: a quaternionic Wick formula
Here we present a Wick formula for quaternionic Gaussian r.v.s. It is more general then the one given in Theorem 3.1 in [BP09] and involves trails (see Section 2.5). We are not aware whether our formula has already appeared elsewhere.
Let be a sequence of i.i.d. quaternionic Gaussian r.v.s distributed according to (4.1). Let , where for all , , and is even. Let be a family of r.v.s, where each is either a r.v. , or a r.v. , for some . We also consider deterministic quaternions
[TABLE]
[TABLE]
[TABLE]
Note that for each such that , we have a single quaternion . For , will denote the product
[TABLE]
In case , . We will express the moment
[TABLE]
Theorem 3.1 in [BP09] gives an expression in case all the quaternions equal . Note that in order for the moment (4.8) to be different from [math], the number of occurrences of plus the number of occurrences of in the family has to be even for each . will denote the subset of made of all ribbon pairings such that for each straight ribbon edge with labels , a.s., and for each twisted ribbon edge with labels , a.s. Given a ribbon pairing and a trail , let denote a product of quaternions of the form or . For each sequence in the trail we add the factor to the product, and for each sequence , we add the factor , all by respecting cyclic order of the trail.
Proposition B1**.**
With the notations above, we have that
[TABLE]
Proof.
On can proceed by induction on ribbon edges as in the proof of Lemma 4.4. The case is given by Lemma 4.2. ∎
Acknowledgements
This work was supported by the French National Research Agency (ANR) grant within the project MALIN (ANR-16-CE93-0003).
The author thanks the two anonymous reviewers for their helpful remarks on the previous version of this paper.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BFS 79] David Brydges, Jürg Fröhlich, and Erhard Seiler. On the construction of quantized gauge fields. I. General results. Annals of Physics , 121:227–284, 1979.
- 2[BFS 82] David Brydges, Jürg Fröhlich, and Tom Spencer. The random walk representation of classical spin systems and correlation inequalities. Communications in Mathematical Physics , 83(1):123–150, 1982.
- 3[BFS 83a] David Brydges, Jürg Fröhlich, and Alan Sokal. A new proof of the existence and non-triviality of the continuum ϕ 2 4 subscript superscript italic-ϕ 4 2 \phi^{4}_{2} and ϕ 3 4 subscript superscript italic-ϕ 4 3 \phi^{4}_{3} quantum field theories. Communications in Mathematical Physics , 91:141–186, 1983.
- 4[BFS 83b] David Brydges, Jürg Fröhlich, and Alan Sokal. The random walk representation of classical spin systems and correlation inequalities. II. The skeleton inequalities. Communications in Mathematical Physics , 91:117–139, 1983.
- 5[BHS 21] Roland Bauerschmidt, Tyler Helmuth, and Andrew Swan. The geometry of random walk isomorphism theorems. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques , 57(1):408–454, 2021.
- 6[BIPZ 78] Édouard Brézin, Claude Itzykson, Giorgio Parisi, and Jean-Bernard Zuber. Planar diagrams. Communications in Mathematical Physics , 59:35–51, 1978.
- 7[BIZ 80] Daniel Bessis, Claude Itzykson, and Jean-Bernard Zuber. Quantum field theory techniques in graphical enumeration. Advances in Applied Mathematics , 1(2):109–157, 1980.
- 8[BP 09] Wlodzimierz Bryc and Virgil Pierce. Duality of real and quaternionic random matrices. Electronic Journal of Probability , 14(17):452–476, 2009.
