Flat -connections and fatgraphs
Abstract.
We study the moduli space of flat -connections on a punctured surface from the point of view of graph connections. To each fatgraph, a system of coordinates is assigned, which involves two bosonic and two fermionic variables per edge, subject to certain relations. In the case of trivalent graphs, we provide a closed explicit formula for the Whitehead moves. In addition, we discuss the invariant Poisson bracket.
1. Introduction
Recently, the study of super-analogues of Teichmüller spaces and supermoduli spaces achieved much progress. In particular, Penner-type coordinates were discovered in [penzeit], [ipz], [ipz2] for versions of Teichmüller space and their decorated analogues. In that particular case, these spaces were viewed as a subspace of the character variety , where is the fundamental group of a hyperbolic Riemann surface with punctures. For the standard Teichmüller space , , while the super-analogues , cases are related to rank and rank supergroups , correspondingly.
Penner coordinates [DTT], [penner] are essential not only in the study of hyperbolic geometry, but they also provide a geometric example of a fundamental algebraic object, known as a cluster algebra. Let us briefly characterize the context. One starts from an ideal triangulation of the Riemann surface, or, equivalently, the dual trivalent fatgraph (aka ribbon graph). Penner coordinates assign a parameter for every edge of triangulation/fatgraph related to a suitably renormalized geodesic length. This provides coordinates for a trivial bundle over , known as the decorated Teichmüller space. There is a simple transformation to coordinates on Teichmüller space so that these new coordinates are subject to linear constraints. One of the benefits of such coordinates is that the action of mapping class group on is described in a combinatorial way by embedding into the Ptolemy groupoid. The Ptolemy groupoid is generated by elementary moves on the fatgraphs, called flips. The action of flips on Penner coordinates gives an example of the so-called cluster transformations. The other benefit of Penner coordinates is that they serve as Darboux-type coordinates for the Weil-Petersson 2-form, which makes them useful for the quantization of [Kashaev97], [Chekhov99].
The supergroups , which give rise to super-Teichmüller spaces both contain as their body subgroup. Penner coordinates have been generalized successfully in both of these cases, leading to the super-analogue of Ptolemy transformation. Currently, there are a lot of attempts to construct a super-analogue of cluster algebras based on these formulas [ovshap],[musikoven], [musikoven2]. The critical ingredient of both constructions were the graph -connections: -graph connections describing the spin structures on for , and two such spin structures accompanied by -graph connection for . In particular, part of the decoration for was related to the gauge equivalences of -graph connections. One of the choices of root systems for is such that simple roots are “grey”, namely each of them gives rise to a subgroup. is a reductive supergroup of rank , which contains two abelian subgroups as its body. Thus, only the odd coordinates are responsible for non-commutativity.
In this note, we study the first nontrivial case of a character variety related to simple supergroups, namely
which is quite interesting on its own. We will consider this space as the space of -graph connections on the trivalent fatgraph associated with . Then, we will define coordinates on this space through the assignment of specific parameters to edges of the fatgraph. These parameters are related to Gaussian decomposition of . Using these coordinates, we obtain a characterization of the action of the Ptolemy groupoid. Finally, we discuss a Poisson bracket structure on .
We believe that character variety is essential in the context of the super-analogue of abelianization [hn]. Another important context is the quantum Chern-Simons theory [Rozansky92], which recently attracted some attention [Aghaei18].
The structure of the paper is as follows. Section 2 reviews some of the notions of super mathematics and necessary facts about the supergroup. Section 3 discusses fatgraphs, -graph connections, and Ptolemy groupoid actions on trivalent fatgraph -connections. Section 4 is devoted to the construction of a coordinate system on and its decorated version using its fatgraph -connection realization through Gaussian decomposition of . Section 5 is primarily of a computation nature, where we describe the action of flip transformation using the minimal amount of changing variables in the decorated space. Finally, in Section 6, we discuss the Poisson bracket structure on .
Acknowledgements
We thank R.C. Penner for useful discussions and his comments on the manuscript. A.M.Z. is partially supported by Simons Collaboration Grant 578501 and NSF grant DMS-2203823.
2. supergroup
2.1. Conventions on superspaces and Grassmann algebras
In this section we follow the conventions from [Supermanifolds].
Let the real Grassmann algebra with generators , for . The generators have relations and . In particular, . We also use the notation for an ordered multi-index . Note that if has a repeated index, then . If the multi-index is empty, the corresponding element is the empty product, 1. By our commutation relations, any can have its terms rearranged so that the indices of the terms are increasing. Thus, an element in can be written in the form for as runs over all strictly increasing multi-indices.
Definition 2.1.
The degree of a term is defined as the size of the multi-index .
Thus has a superalgebra structure given by the decomposition into elements which are sums of terms of even (respectively, odd) degree. Since the generators anti-commute, is supercommutative.
Definition 2.2.
The body map is the projection of an element onto its coefficient of . The soul map is defined by .
Since there are anti-commuting generators, we have that . Thus if and only if is invertible. Explicitly,
In a similar vein, we can use series expansions to define, say, for with positive body, as the series will terminate.
Remark.
Inequalities such as for will be taken to be inequalities on the body .
Definition 2.3.
Given , the superspace is defined as .
In other words, we have a two-dimensional space with one even and one odd coordinate. We can define more generally .
Remark.
From now on, we will use the convention that odd elements are denoted by Greek letters, and even elements are denoted by Latin letters.
2.2. supergroup and its Lie superalgebra
Definition 2.4.
A Lie superalgebra is a superalgebra whose multiplication, denoted by , is super-anticommutative, and furthermore satisfies the super Jacobi identity .
Let us introduce a Lie superalgebra . It has two even generators and two odd generators , which satisfy the following commutation relations:
(2.1) |
In the defining representation, as elements of these generators are given by the supermatrices below:
(2.2) |
Definition 2.5.
is the group of invertible linear transformations of . Elements of can be identified as supermatrices of the form for with .
In what follows, will refer to the identity component of this group, which means the even entries will have positive body.
The Lie superalgebra of is given by , so that any element of can be represented as , where .
To keep the Lie superalgebra/Lie supergroup correspondence explicit, we choose the following multiplication of two elements in as follows:
(2.3) |
In particular, we note the minus signs in the multiplication formula. Let us elaborate on this choice. We identify with . Then, when multiplying , the result should agree with . Upon expanding the latter product, we have the term . Since and are both odd, we have . Thus
which agrees with our choice of multiplication.
Other references may define supermatrix multiplication without these extra signs. There is an isomorphism from our convention to the other convention.
There is also a notion of supertrace, namely . This gives rise to a nondegenerate invariant bilinear form on . This takes the role of the Killing form, which is degenerate in this case.
2.3. Parametrization of and its decomposition
Any element in admits the following unique Gaussian factorization:
(2.4) |
We choose the following parametrization of :
(2.5) |
The scalar factor in front is meant as an element propotional to the unit matrix as an element of . This presentation is unique and thus provides a parametrization of . Given an element in the standard form, say , its coordinates in this parametrization are
(2.6) |
The reason to introduce the extra factor in front is that it provides compact formula for the inverse element. We write the formulas for multiplication and inversion in these coordinates:
(2.7) |
3. Fatgraphs and graph connections
We consider surfaces with genus and punctures, such that .
Definition 3.1.
A fatgraph (also known as ribbon graph) is a graph with a cyclic ordering of the edges at each vertex. An orientation on a fatgraph is an assignment of direction to each edge of the graph.
One can reconstruct from a fatgraph by fattening the edges and verticies along with cyclic ordering of edges at the vertices (see e.g. [DTT] for details). The condition is necessary to choose a trivalent fatgraph for a given surface, as the number of vertices of such a graph is equal to . There are Whitehead (flip) transformations as in Figure 1, which take the edge between vertices , adjacent to and respectively, shrinks it, and then extends an edge connecting vertices adjacent to and respectively. Flips are known to act transitively on the collection of trivalent fatgraphs of . Altogether they form a Ptolemy groupoid . Composition of flips are known to give generators for the mapping class group of a surface [DTT].
Given a fatgraph and a Lie (super)group , we define a -graph connection on as follows.
Definition 3.2.
A -graph connection is the assignment to each edge of an element and an orientation, so that if is the inverse-oriented edge. We denote the space of -graph connections as . Two graph connections , are gauge equivalent if there is an assignment , for all vertices , such that , where starts and ends at and respectively. We will denote the space of gauge equivalence classes of elements in by .
The space of graph connections modulo gauge equivalences can be identified with a more common differential-geometric object. Namely, there is a natural one-to-one correspondence between and the moduli space of flat -connections. This correspondence is constructed as follows: one identifies , the monodromy of the flat connection along the oriented edge of the fatgraph , with the group element . This way, the space is identified with the space of flat connections modulo gauge transformations which are equal to identity at the vertices. Altogether, compositions of these group elements along the cycles of the fatgraph contain all information about the gauge classes of . However, there is a residual gauge symmetry at the vertices of the fatgraph, which one has to take into account, and that is precisely the equivalence relation for graph connections.
One can formulate this as follows.
Theorem 1.
If deformation retracts to , then the moduli space of flat -connections on is isomorphic to the space of gauge equivalent classes of -graph connections on corresponding to , i.e.
(3.1) |
For any element , let us denote the corresponding graph connection on a fatgraph .
We are interested in understanding the action of on graph connections. We require that for any and any cycle , if is the flat connection, the transformed connection is such that . This gives a natural action of on .
To write it formally, we look at the elementary flip transformation as in Figure 1, which involves 5 edges.

There are 6 pieces of possible cycles on such a fatgraph, corresponding to a choice of 2 of the 4 boundary edges. The monodromy conservation along these pieces after the flip transformation thus leads to the following equations:
The solution to those equations is unique up to equivalence and given by the following theorem.
Theorem 2.
For any flip of , the transformation is such that the -graph connection corresponding to is related to as depicted in Figure 2, where

One can verify the relations explicitly by the choice of gauge transformation and . However, another method is the following trick. One can use gauge transformations to make and then shrink that edge, since it does not participate in monodromy. This results in a 4-valent vertex. Expanding the edge makes two trivalent vertices and the edge . After that, one makes a gauge transformation to achieve .
We note that this solution works for any group; however, it is asymmetric. Group elements spread in one direction of the graph but not the other. In the next section we will put the coordinates on , represented as graph connections in the case of . We will find the formulas for the flip transformations in those coordinates which remove this spreading effect.
4. Coordinates on the moduli space of -graph connections
We fix a surface with genus and punctures such that . We also fix a trivalent fatgraph with orientation .
Assigning to every edge a group element of , or alternatively assigning an ordered tuple in the parametrization (2.5), we obtain a vector in the coordinate system for the space of -graph connections without factoring by the gauge group equivalences. Thus the chart gives a diffeomeorphism:
(4.1) |
However, we need to take into account that one can change the orientation on edges of the graph, thus leading to an equivalent coordinate system on .
Definition 4.1.
We say that two charts and , corresponding to orientations , , are equivalent if the assignments agree on the edges where orientation is the same, but are related by the formula , where the orientation is reversed.
Our goal is now to reformulate the gauge transformations at the vertices of a fatgraph as relations between coordinates in the charts .
Definition 4.2.
Let be a coordinate vector. Suppose are edges oriented towards a vertex such that, for each , has coordinates . Then a vertex rescaling at is one of three coordinate changes for the coordinates of each , where is positive and even and is odd:
-
•
;
-
•
;
-
•
.
If are oriented away from a vertex , then there is also a vertex rescaling at for odd :
-
•
.
It turns out that the edge reversal and the vertex rescalings define an equivalence relation on the chart . The vertex rescalings come from the equivalences on graph connections provided by the appropriate 1-parameter subgroups. This leads to the following theorem.
Theorem 3.
Let be the quotient by the equivalences provided by edge reversal and vertex rescalings. Then is in bijection with the moduli space .
Proof.
Indeed, explicitly, the coordinates correspond to
in . The inverse of such an element is
which corresponds to the coordinates . Therefore, the rule for reversing orientations in matches the rule for reversing orientations of a graph connection on .
Now consider a graph connection on . For an edge directed towards a vertex in , there is a gauge transformation , where is a group element on , and is a group element associated to the vertex . Similarly, if is directed away from , the gauge transformation is . This gauge transformation at acts on each edge adjacent to . In the case of a trivalent , there are three edges at a given vertex . Then the vertex rescalings correspond to gauge transformations at , where is one of the following:
-
•
,
-
•
,
-
•
,
-
•
.
Again, is positive even and is odd. In the first three gauge transformations, we require that all point towards , and for the fourth, we require that the edges all point away from . The claim that the vertex rescalings correspond to gauge transformations follows from routine multiplication in . For instance, in the third scenario, we have
These four gauge elements generate all possible gauge transformations, since each of the four elements together generate . ∎
It is not hard to see that one can simply constrain the vertex rescalings. To do that let us introduce the following notation: for a given edge with assignment , which is adjacent to vertex , we denote , , , , if edge is oriented towards , and , , otherwise. Then, let us give the following definition.
Definition 4.3.
Let so that are the assignments for edges adjacent to vertex . We refer to the following conditions as gauge constraints at vertex :
(4.2) |
One can see that, for fixed orientation , such constraints pick exactly one element from the equivalence classes provided by vertex rescalings. Moreover, we have the following theorem.
Theorem 4.
The coordinate chart modulo gauge constraints at all vertices of provides a real-analytic isomorphism
(4.3) |
so that is a trivial bundle over with the fiber .
There are benefits of working with the “decorated space” instead of . As we shall see in the next section, the gauge freedom allows us to write a compact formula for a flip transformation in our coordinates, somewhat in the spirit of Penner coordinates on decorated Teichmüller space.
5. Minimal formula for the flip transformations
First we describe the suitable description of the elements of in terms of coordinates in the extended chart .
Namely, we assign coordinates , corresponding to a group element, to an oriented edge as follows: the odd parameters are assigned to the terminal and initial points of the edge, while we put the pair of even parameters between them, as depicted in Figure 3. This ordering goes along with the Gaussian decomposition from Section 2.

Let us now describe the minimal representation of flip transformation which involves change of the minimal number of parameters. We will fix the odd elements at the ends, as well as eliminate the dependence on fermionic coordinates in the mid-edge after the flip, as depicted in Figure 4.

Theorem 5.
Let represent the flip of at an edge , with orientations as depicted in Figure 1. Let and let be the corresponding element in modulo gauge equivalences. Choose coordinates for such that represent the edges where the flip occurs. Then there is a choice for , which is described on the Figure 4, where the primed variables are given by the following formulas:
(5.1) |
Proof.
Recall that the product of elements and is .
Applying this formula to the general solution of the flip (Theorem 2) means that we can first write with coordinates
We see that and are already in place, so we do not want to change these. We reverse the orientations of the second, fourth, and fifth edges so that we may alter the term of the second and the term of the fourth. This gives
Now that the second, third, and fifth edges are pointed towards a vertex, we apply a move which adds to the first fermionic coordinate of these edges.
Now, we can invert the second edge again to get it to its original orientation; its formula is saved for the end of the proof.
The first, fourth, and fifth edges are all pointed away from a common vertex. We can then apply a move that adds to the second fermionic coordinate of these edges. This gives
We invert the fourth and fifth edges to match the original choice of orientation, giving the final coordinates for :
These coordinates have the desired fixed fermionic ends. ∎
6. Poisson bracket
In this section, we discuss in detail the Poisson structure that can be endowed on the space of graph connections . It descends onto , so that the isomorphism with the space of flat connections, modulo the action of the gauge group, is a Poisson manifold isomorphism. We recall this construction from [fock1998poisson].
As before, let us fix a surface with genus and punctures, such that , and a trivalent fatgraph . is the space of graph connections on . Let be the gauge group; that is, a direct product of the group with itself, one copy for each vertex in .
We have seen that acts on , which gives the equivalence of graph connections. In order for the action to be a Poisson map, needs a Poisson-Lie structure. Then itself needs a Poisson-Lie structure. This can be attained by choosing an -matrix, which involves the Lie algebra of [Chari:1994pz]. This is an object satisfying the so-called classical Yang-Baxter equation (CYBE), namely:
(6.1) |
We also assume that the symmetric part of the -matrix is the Casimir element , i.e.
(6.2) |
based on the invariant bilinear form on (so that is an orthonormal basis). For example, consider simple Lie algebras with the standard triangular decomposition . Here, is the Cartan part and are spanned by positive and negative root elements. The basic classical -matrix of is given by , where is the Casimir element restricted to , and for all with respect to an invariant form. For , one can construct a solution of CYBE in a similar fashion: the only difference is that the nondegenerate bilinear form is defined by supertrace in the defining representation, not by the Killing form, which is degenerate. This way, the solution to CYBE with the condition (6.2) is given by (see also [Gizem04]):
(6.3) |
This natually provides a Poisson-Lie structure on .
Let us describe the construction in [fock1998poisson] of a Poisson bracket on , adapted to our needs (simple supergroups). Let us adopt the following notation for graph connections. To a half-edge adjacent to a given vertex , we associate an element . To the opposite half edge we associate the element . In this way, we do not need to refer to a specific orientation of the edge. We then have a map
(6.4) |
associated to every edge of , giving a map .
Given an orthonormal basis , one can define a tangent vector at on the image of map (6.4), where are left- and right-invariant vector fields associated to .
The final ingredient needed to write the Poisson structure is to fix a linear order at each vertex of , not just a cyclic one. This is called a ciliation in [fock1998poisson]. Since is trivalent, this means each vertex has edges labelled in a cyclic manner. For a vertex of , we write the labels of the edges as elements of the vertex.
This allows us to write the following Poisson bivector which is a sum of bivectors over the set of vertices :
(6.5) |
where are edges adjacent to ordered according to ciliation, and is an -matrix associated to vertex .
Then one has the following theorem.
Theorem 6.
[fock1998poisson] The bivector defines a Poisson structure on , and the group acts on in a Poisson way.
If each has the same symmetric part, then denoting the antisymmetric part as , we obtain:
(6.6) |
Here is the generator of gauge transformations at and is tangent to the orbits of , and
(6.7) |
where stands for the parity of generator . From here one can see that the choice of antisymmetric part of the -matrix is irrelevant when considering the Poisson bracket on the quotient .
In our case . In , we sum over the index to get terms corresponding to the symmetric part (Casimir element). Once we sum over , there is no need for 6.7, so we use the simplified . Then we have
(6.8) |
Given our system of coordinates for , one can easily write down the presentation of the generators . Let us assume that an edge , with coordinates , is oriented towards a vertex . Then
(6.9) |
We introduce a change of coordinates by rearranging the one-parameter subgroups, as follows:
(6.10) |
This change of coordinates simplifies the vector fields:
(6.11) |
These coordinates, given that all three edges are pointed at the vertex , form a Darboux-like chart for the bivector .