Geometric realizations of cyclic actions on surfaces
Shiv Parsad, Kashyap Rajeevsarathy, Bidyut Sanki

TL;DR
This paper provides an explicit geometric construction for finite order mapping classes on surfaces, solving the Nielsen realization problem for cyclic subgroups and linking combinatorial and algebraic perspectives.
Contribution
It introduces an inductive method to realize cyclic mapping classes as isometries on hyperbolic surfaces and connects these to fat graph automorphisms and symplectic representations.
Findings
Explicit hyperbolic structures for cyclic actions are constructed.
Finite order mapping classes are characterized as fat graph automorphisms.
Methods to compute images and roots of Dehn twists under symplectic representation.
Abstract
Let denote the mapping class group of the closed orientable surface of genus , and let be of finite order. We give an inductive procedure to construct an explicit hyperbolic structure on that realizes as an isometry. In other words, this procedure yields an explicit solution to the Nielsen realization problem for cyclic subgroups of . Furthermore, we give a purely combinatorial perspective by showing how certain finite order mapping classes can be viewed as fat graph automorphisms. As an application of our realizations, we determine the sizes of maximal reduction systems for certain finite order mapping classes. Moreover, we describe a method to compute the image of finite order mapping classes and the roots of Dehn twists, under the symplectic representation $\Psi: \text{Mod}(S_g) \to \text{Sp}(2g;…
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
TopicsGeometric and Algebraic Topology · Advanced Combinatorial Mathematics · Mathematical Dynamics and Fractals
Geometric realizations of
cyclic actions on surfaces
Shiv Parsad
Department of Mathematics
Indian Institute of Science Education and Research Bhopal
Bhopal Bypass Road, Bhauri
Bhopal 462 066, Madhya Pradesh
India
,
Kashyap Rajeevsarathy
Department of Mathematics
Indian Institute of Science Education and Research Bhopal
Bhopal Bypass Road, Bhauri
Bhopal 462 066, Madhya Pradesh
India
[email protected] https://home.iiserb.ac.in/${}_{\widetilde{\phantom{n}}}$kashyap/ and
Bidyut Sanki
Department of Mathematics
Institute of Mathematical Sciences
IV Cross Road, CIT Campus, Taramani
Chennai 600 113 Tamil Nadu
India
Abstract.
Let denote the mapping class group of the closed orientable surface of genus , and let be of finite order. We give an inductive procedure to construct an explicit hyperbolic structure on that realizes as an isometry. In other words, this procedure yields an explicit solution to the Nielsen realization problem for cyclic subgroups of . Furthermore, we give a purely combinatorial perspective by showing how certain finite order mapping classes can be viewed as fat graph automorphisms. As an application of our realizations, we determine the sizes of maximal reduction systems for certain finite order mapping classes. Moreover, we describe a method to compute the image of finite order mapping classes and the roots of Dehn twists, under the symplectic representation .
Key words and phrases:
surface, mapping class, finite order maps, symplectic representation, fat graphs
2000 Mathematics Subject Classification:
Primary 57M60; Secondary 57M50, 57M99
1. Introduction
Let be a closed orientable surface of genus , and let denote the mapping class group of . The Nielsen realization problem [7] asks whether a given finite subgroup of , for , can be realized as a group of isometries of some hyperbolic metric on . Stated in other words, the question asks whether the action of on the Teichmüller space has a fixed point. While Nielsen [8] solved this problem for cyclic subgroups, it was later settled for arbitrary subgroups by Kerkchoff [3]. Taking the existential nature of these results into consideration, a natural question is whether one can determine an explicit hyperbolic structure on that realizes as a group of isometries. In this paper, we answer this question for the case when is cyclic.
For , let be a cyclic subgroup of of order that acts on with a quotient orbifold [14, Chapter 16] of genus . If there exists an imbedding of under which can realized as the restriction of a rotation of , then we say that is a rotational action. Such an imbedding induces a Riemannian metric on , whose conformal class contains a hyperbolic metric (which is unique up to scaling) that realizes this rotation as an isometry. As obtaining an explicit description of such a metric is rather straightforward, we shall focus our attention on other types of cyclic actions. Our realizations of non-rotational cyclic actions fall into one general philisophy, which involves the decompostion of the given action into its irreducible components. To this effect, we appeal to a result of Gilman [2] which states that an action is irreducible if, and only if is (topologically) a sphere with three cone points. Moreover, a beautiful result of Kulkarni [4] shows the existence of a polygon (with a suitable side-pairing) whose rotation realizes a given -action with a common fixed point. Taking inspiration from these results, we introduce the notion of a Type 1 cyclic action , for which has three cone points, at least one of which is a distinguished cone point of order . Denoting this distinguished cone point by , we see that lifts under to a fixed point , around which induces a local rotation of , where . For , let be the remaining two cone points of orders that lift to orbits of sizes with local rotation angles , where . The following result gives a geometric realization of an arbitrary Type 1 action.
Theorem 1**.**
For , a Type 1 action on can be realized explicitly as the rotation of a hyperbolic polygon with a suitable side-pairing , where is a hyperbolic -gon with
[TABLE]
and for ,
[TABLE]
*where , and
*
A non-rotational action that is not of Type 1, is called a Type 2 action. Our understanding of the realizations of arbitrary Type 2 actions can be motivated with the following subtle, yet intriguing, geometric construction. For , consider Type 1 actions on surfaces inducing local rotational angles around points in distinguished orbits of size , so that . We call such a pair of orbits as compatible. For , we remove pairwise disjoint invariant disks around the points in ensuring that the pairs of disks have the same hyperbolic area (under the structures ), and then identify the resultant boundary components with that have the same length . This defines an explicit hyperbolic structure that realizes an action on , where . We say the Type 2 action is realizable as a compatible pair of Type 1 actions. The hyperbolic structure that realizes depends on the structures , and the parameter . Alternatively, one can also realize cyclic actions by identifying pairs of boundary components obtained by deleting a pairwise disjoint collection of invariant disks around compatible orbits induced within the same surface. We call such actions as self compatible, and the structures that realize these actions are analogous to those that are realized as compatible pairs. Using the result of Gilman [2] mentioned earlier, we can infer that every Type 2 action has a maximal reductive system . Consequently, will induce a finite order map on the (possibly disconnected) surface obtained by capping . By analyzing the surface orbits of , we can obtain a decomposition of into finitely many compatibilities (of the types mentioned above) between irreducible cyclic actions.
Theorem 2**.**
For , any Type 2 action on has a decomposition into finitely many compatibilities between irreducible cyclic actions. Consequently, the hyperbolic structures that realize as isometries can be built from the structures that realize the compatible pairs and self-compatibilities in the decomposition.
Thus, Theorems 1 and 2 together give an explicit solution to the Nielsen realization problem for all non-rotational cyclic actions.
In Section 3, we give a combinatorial perspective to these realizations by establishing a correspondence between certain finite order mapping classes and fat graph automorphisms [13]. Let be fat graph with one boundary component with a vertex set and an edge set . An automorphism of of order is said to be irreducible if with either and or and . In this direction, we have the following result.
Theorem 3**.**
There is a bijective correspondence between irreducible Type 1 actions and irreducible fat graph automorphisms.
Furthermore, we show that a compatibility between irreducible Type 1 actions determines a notion of compatibility between the corresponding irreducible fat graph automorphisms, and this leads to the following result.
Theorem 4**.**
Every cyclic action that decomposes into compatibilities between finitely many irreducible Type 1 actions can be viewed as a fat graph automorphism.
In Section 3, we give several applications of our geometric realizations. As a consequence of Theorem 2, we determine the size of maximal reduction systems for certain finite order maps, as detailed in the following result.
Theorem 5**.**
Let be a cyclic action on .
- (i)
If is of Type 1, then there exists a maximal reduction system for such that
[TABLE] 2. (ii)
If is a Type 2 action realizable as a compatible pair of Type 1 actions on , then there exists a maximal reduction system for such that
[TABLE]
where .
We now turn our attention to some algebraic consequences of our realizations. Let be the symplectic representation of . As a consequence of these realizations, in Section 4, we derive an explicit procedure for determining the . It is not hard to see that for a rotational action that is either free or of order , is a simple permutation matrix. However, when is a non-free action of order 2, it has fixed points, and has the form where is the identity matrix of order , and is some permutation matrix of order . When is a Type 1 action, we give an explicit handle normalization algorithm to obtain a symplectic basis in terms of the letters in (see Proposition 4.2). This enables us to compute by reading the action from (see Theorem 4.5). We then use Theorem 2 to obtain the symplectic representations of generic cyclic actions. As the restriction to finite order mapping classes is faithful [1, Chapter 6], one can perceive this as a significant step towards finding an explicit word representation for finite order elements of in terms of its standard Dehn twist generators.
Let be a nonseperating simple closed curve in , and let denote the left-handed Dehn twist about . It is known [5, 6] that a root of of degree corresponds to a finite order action on that has a distinguished pair (for ) of fixed points around which the induced angles satisfy The root is then realized by removing invariant disks around the and attaching an annulus with a twist across the resultant boundary components. So our procedure for computing the symplectic representations of finite order actions naturally extends to roots of . In particular, we show that (see Theorem 4.11):
Theorem 6**.**
For , let be a nonseperating simple closed curve in , and let be a root of of degree . Then
[TABLE]
where is obtained using Theorem 2, and the block (and hence ) is completely determined by the action of on the pair of standard homology generators determined by the attachment of .
Suppose that is a separating curve in so that . Then a root of of degree corresponds to a pair of finite order maps, where for , is an order map on with a distinguished fixed point satisfying with . An immediate consequence of this fact is that where the are obtained using Theorem 2. Finally, we indicate how these results could be extended to compute the symplectic representations of roots of Dehn twists about multicurves [10].
2. Geometric realizations of cyclic actions
2.1. Preliminaries
Let be a faithful -action on , where denotes the cyclic group of order . We fix a generator for and identify the finite order homeomorphism as the generating homeomorphism of the action. For convenience, we also use to denote the generating homeomorphism of the action.
In general, a -action on induces a branched covering
[TABLE]
which have branched points (or cone points) in the quotient orbifold of orders , respectively. For each , the cone point lifts to an orbit of size on , and the local rotation induced by around the points in the orbit is given by , where . This motivates the following definition.
Definition 2.1**.**
A data set of degree is a tuple
[TABLE]
where , , and are integers, and each is a residue class modulo such that:
- (i)
if, and only if , and when , we have , 2. (ii)
each , 3. (iii)
for each , , and 4. (iv)
.
The number determined by the equation
[TABLE]
is called the genus of the data set, which we shall denote by . We denote the degree of the data set by , the number by , and the number by .
The following proposition (see [10, Theorem 3.8] for a proof) establishes a correspondence between the conjugacy classes of cyclic actions and data sets.
Proposition 2.2**.**
Data sets of degree and genus correspond to conjugacy classes of -actions on .
From here on, we will use data sets for describing the conjugacy classes of cyclic actions. Note that the quantity associated with a data set will be non-zero if, and only if, represents a free rotation of by . For brevity, we will avoid writing in the notation of a data set, whenever . Equation R-H in Definition 2.1 is the Riemann-Hurwitz equation associated with the branched covering . Before diving into the geometric realizations of cyclic actions, we classify -actions on into three broad categories.
Definition 2.3**.**
Let be a -action on . Then is said to be a:
- (i)
rotational action, if either , or is of the form
[TABLE]
for integers and with , and , if and only if . 2. (ii)
Type 1 action, if , and for some . 3. (iii)
Type 2 action, if is neither a rotational nor a Type 1 action.
Remark 2.4**.**
In order to make sense of Definition 2.3 (i), we first consider the case when a rotational action is a free rotation. In this case, the quotient map is a covering space, and by the multiplicativity of the Euler characteristic, we have that the genus of satisfies . On the other hand, if is a non-free rotation, then will have fixed points which are induced at the points of intersection of the axis of rotation with . Moreover, these fixed points will form pairs of points , for , such that the sum of the angles of rotation induced by around and add up to [math] modulo .
As mentioned in Section 1, every rotational action on , for , can be realized as a restriction of a rotation of under a fixed imbedding , the standard euclidean metric on will induce a Riemannian metric on . By the uniformization theorem, the metric is conformally equivalent to a unique hyperbolic metric on that also realizes as an isometry. For this reason, we will focus on non-rotational actions, beginning with the realizations of Type 1 actions.
2.2. Type 1 actions
In this subsection, we will show that a Type 1 action can be realized as the rotation of an even sided polygon with an appropriate side-pairing. We will assume throughout this section that has the form
[TABLE]
We motivate the realization of Type 1 actions with an example.
Example 2.5**.**
Consider -action
[TABLE]
on . This action can be realized in two possible ways, as shown in Figure 1 below.
For a positive even integer , we denote an -gon by , the reduced boundary word of (i.e. side-pairing) by , and the quotient surface determines by . It is implicitly assumed that comes equipped with some . Taking inspiration from Example 2.5, we have the following definition.
Definition 2.6**.**
Let be an irreducible Type 1 action, that is, a Type 1 action with . Then:
- (i)
The topological polygon associated with is defined by , where
[TABLE]
and for , we define
[TABLE]
[TABLE] 2. (ii)
The rotational angle associated with is defined by
[TABLE]
First, we will restrict our analysis to irreducible Type 1 actions on . In this direction, our goal will be to establish the following theorem, which gives an explicit hyperbolic structure on that realizes such actions as isometries.
Theorem 2.7**.**
An irreducible Type 1 cyclic action can be realized as a rotation of by .
In order to establish Theorem 2.7, we will need the following technical lemma.
Lemma 2.8**.**
Let be an irreducible Type 1 action. Then .
Proof.
First, we consider the case when . For , set to be the initial and the terminal point of , respectively. Let , and let be the cyclic group of order , generated by . Consider the action of on given by
[TABLE]
The side-pairing yields the relations
[TABLE]
which can also be written as
[TABLE]
The subgroups of act on sets
[TABLE]
respectively. Observe that the canonical cellular decomposition of the resultant quotient surface has vertices (0-cells). Applying Burnside’s Lemma [12, Theorem 3.22], we have for ,
[TABLE]
and so the number of vertices is given by , where and are the orders of and in respectively.
Since , the order of in is . Also, condition on the data set implies that
[TABLE]
and therefore the order of in is . So, the number of vertices of the resultant surface is given by . By the Riemann-Hurwitz equation, we have
[TABLE]
and a simple Euler characteristic argument yields the result. A similar argument works for the case when either or equals . ∎
We are now ready to prove Theorem 2.7.
Proof.
(Theorem 2.7.) Once again, we begin with the case when . By Lemma 2.8, the pairing on the polygon yields . Define a homeomorphism by
[TABLE]
that is, a rotation of by . Clearly, generates a -action on . We wish to prove that data set for is .
Under the branched covering , a cone point of order lifts to an orbit of size . The center of corresponds to a cone point of order . In the notation of Lemma 2.8, the sets correspond to cone points of orders and respectively. In the view of the condition on the data set in Definition 2.1, it suffices to show that local rotational angle around the cone point of order is .
Viewing the surface from , the angle between and is . The stabilizer of the orbit of size is generated by . If , then
[TABLE]
By the side-pairing condition,
[TABLE]
which implies
[TABLE]
Therefore we have,
[TABLE]
that is, , which establishes the result. An analogous argument works for the other case. ∎
Remark 2.9**.**
Suppose that is an irreducible Type 1 action with . When one of the equals , it follows from basic hyperbolic trigonometry that the polygon determines a unique hyperbolic structure on that realizes as an isometry. However, when , it can be shown that there exists one-parameter family of hyperbolic structures carried by in which each structure is uniquely determined by the hyperbolic distance between the center and one of the vertices of .
The generalization of Theorem 2.7 to the case when will involve a subtle topological construction, which we detail in the following remark.
Remark 2.10**.**
Consider a -action on . Suppose that there exist distinct orbits and of of size such that the angles induced by around the points in the satisfy
[TABLE]
For , we remove mutually disjoint disks , cyclically permuted by , around the points in the , and attach annuli connecting the resultant boundary components with the . This induces an action with and .
We will now describe a necessary condition on a -action that would facilitate a construction as in Remark 2.10, assuming that the size of the chosen orbits is strictly less than .
Definition 2.11**.**
For , let
[TABLE]
be a -action. Then is said to be -self compatible, if there exist such that
- (i)
, and 2. (ii)
.
It is now apparent that the new action constructed from in Remark 2.10 will have the following description.
Lemma 2.12**.**
Let be an -self compatible -action as in Definition 2.11. Then the tuple
[TABLE]
defines a -action such that
[TABLE]
We denote the action described in Lemma 2.12 by . We will see later that this kind of compatibility will hold great relevance in the realization of Type 2 actions.
Remark 2.13**.**
It is quite apparent that the construction in Remark 2.10 is always possible, if one assumes that the sizes of the pair of chosen orbits equals . We will call such a compatibility a trivial self compatibility. While the new -action in this case will have the same fixed point data as , the construction increases the genus of the quotient orbifold by one, and so we have:
[TABLE]
We will denote the action describe above (with ) by , and we will denote the data set obtained from by an inductive application of the trivial self compatibility times by . Note that is topologically equivalent to the action obtained from by removing cyclically permuted (mutually disjoint) disks around points in an orbit of size , and then attaching copies of the surface along the resultant boundary components. (Here, denotes the surface of genus with boundary components.) Conversely, given an action of type , for some , one can reverse the topological process described above to obtain the action .
The following theorem, which is simply a formalization of the type construction described in Remark 2.13, will play a central role in the geometric realizations of arbitrary Type 1 actions.
Theorem 2.14**.**
Every Type 1 action with is of the form .
The following corollary, which gives an explicit topological realization for generic Type 1 actions, follows directly from Theorems 2.7 and 2.14.
Corollary 2.15**.**
For , a Type 1 action on with can be realized explicitly as the rotation by of a hyperbolic polygon with a suitable side-pairing , where is a hyperbolic -gon with
[TABLE]
and for ,
[TABLE]
*where , and
*
Given a topological realization of an action on , in the following remark, we describe explicit hyperbolic structures on that realize the actions of types and .
Remark 2.16**.**
Consider a -self compatible -action
[TABLE]
and a geometric structure on that realizes as an isometry, and let . For , we choose pairs of distinct orbits of of size . For each , we choose disjoint disks and , for , of the same area around the points in and , respectively, that are cyclically permuted by . After removing these disks, for each , we identify the pairs of the resulting boundary components of length (without any twisting), thereby defining a hyperbolic structure
[TABLE]
on that realizes , which depends on and the parameter . Conversely, given a hyperbolic structure of type on (for suitably chosen ), we can reverse this geometric construction to obtain the structure on . In an analogous manner, we can define a structure that realizes an action of type , which when applied inductively yields a structure that realizes a type action. This structure, which depends on and parameters , will be denoted by .
We have shown that for a Type 1 action with , one can apply Theorem 2.14 to get another Type 1 action with identical fixed point data with . We can then use Theorem 2.7 to obtain a structure that realizes . Finally, by Remarks 2.10, 2.13, and 2.16, we can construct a hyperbolic structure of type that realizes . Thus, it follows immediately that a structure of type realizes an arbitrary Type 1 action, which we formalize in the following theorem.
Theorem 2.17**.**
Consider a Type 1 action with . Then there exists a Type 1 action with , and positive real numbers such that is realizable as an isometry of the surface with the hyperbolic structure .
2.3. Type 2 actions
We motivate the realization of Type 2 actions with an interesting example.
Example 2.18**.**
Consider the -action
[TABLE]
on . Observe that has no cone point of order , and hence is a Type 2 action. However, we can realize the action in the following manner. Consider the Type 1 -actions
[TABLE]
on . The local rotational angles induced by these actions around their unique fixed points are and , respectively, which add up to . Now consider these actions on two distinct copies of , remove invariant disks around the fixed point on each copy of , and then attach an annulus across the resultant boundary circles, as illustrated in Figure 2, thereby realizing the action .
This realization of was made possible by the fact that the rotational angles around the fixed points of the actions added up to [math] modulo . Taking inspiration from this idea, we now define the notion of a compatible pair of Type 1 actions, that is, a pair of Type 1 actions that will allow such a construction.
Definition 2.19**.**
For , two actions
[TABLE]
are said to form an -compatible pair if there exists and such that
- (i)
, and 2. (ii)
.
The number will be denoted by
In the following lemma, we give a combinatorial recipe for constructing a Type 2 action from compatible pair of Type 1 actions. The proof of the lemma follows immediately from the definition of a data set.
Lemma 2.20**.**
Given an -compatible pair of actions, we obtain an action
[TABLE]
such that
[TABLE]
We denote action in Lemma 2.20 obtained from an -compatible pair by . The geometric structure that realizes a Type 2 action , where the are Type 1 actions (as Lemma 2.20 indicates) will depend on the individual structures , and the compatibility. We make this more explicit in the following remark.
Remark 2.21**.**
Let be a Type 2 action that can be realized as a -compatible pair of Type 1 actions as in Lemma 2.20. On each , the will induce an orbit of size . Furthermore, and induce local rotational angles and around the points in and respectively. For , we choose mutually disjoint disks around each point in the that are cyclically permuted by the , ensuring that the pairs of invariant disks have the same area . We remove these disks on each yielding the surfaces , all of whose boundary components have the same length . On each , there is a natural hyperbolic structure induced by the structures . Since condition of Definition 2.19 on the pair ensures that we can identify the pairs of boundary circles, thereby extending the actions on the to the action on . Note that this identification also defines an hyperbolic structure (that we denote by) on realizing , that is completely determined by the structures , the number , and the parameter .
The discussion in Remark 2.21 leads to the following theorem.
Theorem 2.22**.**
Let be a Type 2 action that can be realized as an -compatible pair of Type 1 actions as in Lemma 2.20. Then there exists such that can be realized as an isometry of the hyperbolic structure on .
Remark 2.23**.**
In the context of -compatible pairs of actions, there exists a natural analog to the self compatibility that we have seen in Remark 2.13. As expected, this compatibility also occurs across a pair of full-sized orbits under the actions. For , consider actions
[TABLE]
of degree . Choose distinguished orbits of of size on . For each , we choose mutually disjoint disks , for having the same area around the points in that are cyclically permuted by the . We remove these disks yielding the surfaces all of whose boundary components have the same length . As there is no local rotation induced around each component of , we identify the pairs of boundary circles. This process yields a -action
[TABLE]
with , and a hyperbolic structure (we denote by) on that is completely determined by the structures and parameter .
In order to obtain the realizations of arbitrary Type 2 actions, we need to understand the realizations of irreducible Type 2 actions. The realizations of such actions is rather subtle, which we address through the following technical lemma.
Lemma 2.24**.**
Let be an irreducible Type 2 action. Then can be built topologically from three pairwise compatible irreducible Type 1 actions.
Proof.
Let
[TABLE]
where , for any , be a Type 2 action. Without loss of generality, we may assume that are odd and is even. By a simple number-theoretic argument, we can see that for , the tuple
[TABLE]
is a Type 2 data set. Moreover, we can choose our ’s in order to ensure that forms a -compatible pair, and forms a -compatible pair. These compatibilities yield a -self compatible Type 2 data set
[TABLE]
with . Finally, we apply Lemma 2.12 to obtain a topological realization of the action
[TABLE]
from which the result follows. ∎
We have now developed the requisite tools to describe the realizations of arbitrary Type 2 actions.
Theorem 2.25**.**
For , a Type 2 action on can be constructed from finitely many compatibilities of the following types involving Type 1 actions:
- (i)
, 2. (ii)
, 3. (iii)
, and 4. (iv)
.
Proof.
For a Type 2 action of degree on , it follows from the work of J. Gilman [2] that has a nonempty reduction system . We may assume, without loss of generality, that is maximal. Let denote the surface obtained from by removing a closed annular neighborhood of and then capping . Note that every nonseparating yields distinguished marked points on the same component of , while a separating curve yields two distinguished marked points on two distinct components of . Clearly, induces a -action on . If every component of is the -sphere , then it is apparent that is a rotational action, which contradicts our assumption. Hence, has at least one component , for some , and every component of this form satisfies with being irreducible. Moreover, there exists no spherical component of such that
Suppose that has only one component, which is not a sphere. Then it is follows from [2] that has to be an irreducible Type 2 action. By Theorem 2.14, it follows that there exits an action of type with . We now appeal to Lemma 2.24 to realize as a combination of two -compatibilities, and one self-compatibility. If has exactly two nonspherical components say so that , for . When has no spherical components, is realized either by a structure of type or . On the other hand, if has a nontrival spherical orbit, then this orbit should have come from a -type compatibility (with ) for some . Applying this approach inductively, we can realize all Type 2 actions. ∎
The following corollary is a direct consequence of Theorem 2.25, and Remarks 2.16, 2.21, and 2.23.
Corollary 2.26**.**
For , the hyperbolic structure that realizes an arbitrary Type 2 action on as an isometry can be constructed from finitely many structures of the following types:
- (i)
, 2. (ii)
, 3. (iii)
, and 4. (iv)
,
We conclude this section with an example of a topological realization of an arbitrary Type 2 action whose quotient orbifold has more than 3 cone points. The geometric structure that realizes this action is implicit from the discussions that we have seen so far.
Example 2.27**.**
Consider the -action
[TABLE]
on . We will construct this action from the following Type 1 actions, namely
[TABLE]
Note that forms a -compatible pair, and forms a -compatible pair. Using these compatibilities, By Lemma 2.24, we obtain the following -action on
[TABLE]
Finally, observe that forms a -compatible pair, thereby realizing the required action.
3. A combinatorial perspective using Fat Graphs
A fat graph [13] is a graph equipped with a cyclic order on the set of edges incident at each vertex. If the valency of a vertex is less than three, then the cyclic order on the set of edges incident at that vertex is trivial. So, we consider the graphs with valency at each vertex is at least three. We denote a graph by a triple , where is a non-empty, finite set with even number of elements, is an equivalence relation on and is a fixed-point free involution on . It is straight forward to see that is equivalent to a standard graph. Each element of the set is called an undirected edge. The set of vertices is . If is a vertex then the degree of is defined by .
Definition 3.1**.**
A fat graph is a quadruple , where
- (i)
is a graph, and 2. (ii)
is a permutation on so that each cycle of is a cyclic order on some .
Definition 3.2**.**
A bijective map is said to be a fat graph isomorphism if
- (i)
, for all , and 2. (ii)
We denote the automorphism group of a fat graph by .
Example 3.3**.**
Consider the quadruple described in the following manner (see Figure 3). The set of directed edges is E=\{\vec{e}_{i},\reflectbox{\vec{\reflectbox{}}}_{i}|\ i=1,2,3\}. The equivalence classes of are and v_{2}=\{\reflectbox{\vec{\reflectbox{}}}_{i}|\ i=1,2,3\}. The fixed point free involution is given by \sigma_{1}=(\vec{e}_{1},\reflectbox{\vec{\reflectbox{}}}_{1})(\vec{e}_{2},\reflectbox{\vec{\reflectbox{}}}_{2})(\vec{e}_{3},\reflectbox{\vec{\reflectbox{}}}_{3}) and \sigma_{0}=(\vec{e}_{1},\vec{e}_{2},\vec{e}_{3})(\reflectbox{\vec{\reflectbox{}}}_{1},\reflectbox{\vec{\reflectbox{}}}_{3},\reflectbox{\vec{\reflectbox{}}}_{2}). The surface obtained by thickening the edges of the graph (as shown in Figure 3) is the sphere with three holes. Note that, if one considers \sigma^{\prime}_{0}=(\vec{e}_{1},\vec{e}_{2},\vec{e}_{3})(\reflectbox{\vec{\reflectbox{}}}_{1},\reflectbox{\vec{\reflectbox{}}}_{2},\reflectbox{\vec{\reflectbox{}}}_{3}) instead of , then the associated surface is .
A fat graph is called decorated if the degree of each vertex is an even integer . A cycle in a decorated fat graph is called a standard cycle if every two consecutive edges are opposite to each other in the cyclic order on the edges incident at the their common vertex. Note that each edge uniquely determines a standard cycle. A decorated fat graph can be written as an edge-disjoint union of standard cycles. Let be the surface with boundary associated with . Then the number of boundary components in is the same as the number of orbits of (see [13] for more details on this topic).
3.1. Fat graph for a polygon with side-pairing
Given a polygon with a side-pairing, we can associate a fat graph with it. Let
[TABLE]
and with a boundary word comprising letters from . Then we define a fat graph associated with the polygon as follows:
- (i)
. 2. (ii)
Before describing the equivalence relation , we describe . The fixed point free involution is defined by , and , for 3. (iii)
The equivalence classes of are defined in the following manner. Given , we define to be the edge of immediately after . In general, we define to be the edge of immediately after . Then the equivalence class of is , where is the smallest positive integer such that 4. (iv)
If is a vertex such that is the edge of immediately after for all , then we define . The fat graph structure is given by
[TABLE]
Example 3.4**.**
Consider the polygon (see Figure 4) labeled by the elements of Then the fat graph is described as follows.
- (i)
. 2. (ii)
. 3. (iii)
Let , then which is the edge of next to . Similarly, we have, , and . Therefore, the equivalence class containing is The other equivalence class is Thus, . 4. (iv)
.
We will now establish a correspondence between finite order maps realizable as a rotations of a polygons and automorphisms of fat graphs with one boundary component (via ).
Theorem 3.5**.**
There is a bijective correspondence between finite order homeomorphisms on realizable as rotations of polygons and automorphisms of fat graphs with a single boundary component.
Proof.
Let be a finite order homeomorphism on that is realized as the rotation of a -sided polygon with boundary word comprising letters from
[TABLE]
which is the set of directed edges of the graph . The map induced by is injective, as it is the restriction of the rotation map of . From this, it follows that is bijective. To prove is an automorphism, we need to show that the two diagrams in Figure 5 are commutative.
Let and . As is induced from an orientation preserving homeomorphism, we have . Therefore, we have , and so it follows that diagram (1) commutes.
Now, let and . By definition, we have is the edge of next to , from which it follows that is the edge of next to . So, we have . Therefore, is the edge next to , which is the same as , and the commutativity of (2) follows.
Conversely, let be a fat graph with vertices, edges, and a single boundary component satisfying Let be the boundary component with . Let be a fat graph automorphism. We can represent as a reduced word with letters in . In this representation, each letter and its inverse appears exactly once (with the convention that ). Therefore, the boundary determines a polygon , and its pairing . By an Euler characteristic argument and the condition , we conclude .
The automorphism naturally extends to an orientation preserving homeomorphism on the surface . The restriction of on to the boundary is a orientation preserving homeomorphism of the circle, and hence a rotation which we denote by . Now we show that gives a finite order homeomorphism on . Let , then we have , from which it follows that . The condition ensures that is an orbit of the vertices of with respect to the side-pairing if, and only if is also an orbit. Therefore, can be extended to a homeomorphism in the quotient space , which we denote by . As is of finite order, so is . ∎
In order to establish a correspondence between generic finite order mapping classes and fat graph automorphisms, we restrict our attention to a special class of fat graph automorphisms as defined below.
Definition 3.6**.**
Let be a fat graph of genus and one boundary component. We say an order automorphism is irreducible if it satisfies the following:
- (i)
. 2. (ii)
In the following result, which is a direct consequence of Theorem 3.5, we establish a correspondence between irreducible fat graph automorphisms and irreducible Type 1 actions. For brevity, we state the result for irreducible fat graph automorphisms which satisfy , as the result for the case when is analogous.
Corollary 3.7**.**
Let be a fat graph of genus , and let be irreducible of order with . Let be product of disjoint cycles, where , and is the cyclic order at . Suppose that is the least positive integer such that , for , and is the least positive integer such that . Then corresponds to an irreducible Type 1 action on , where for , , and , for .
In view of above corollary, we denote by , the irreducible fat graph automorphism that corresponds to a irreducible Type 1 action , and we have the following definition.
Definition 3.8**.**
We say a pair , for , of irreducible fat graph automorphisms in form a compatible pair , if there exits irreducible Type 1 action such that
- (i)
, and 2. (ii)
the form an -compatible pair .
We now give an example that will motivate the construction of a fat graph automorphism corresponding to an -compatible pair.
Example 3.9**.**
Consider the -action
[TABLE]
on realizable as a -compatible pair of the Type 1 data sets, where
[TABLE]
Applying Theorem 3.5, we can obtain , where .
Consider the polygons obtained from by removing invariant discs around each point of the compatible orbits of size 2, as shown in Figure 6. This gives the following gluing conditions (up to some choice):
[TABLE]
Define a fat graph , which is described as follows.
- (i)
. 2. (ii)
. 3. (iii)
Let , then which is the edge of next to . By the gluing conditions , and hence we have, , which is the edge of next to . Again by the gluing conditions, we have , and since is the edge of next to , we have , and so . Therefore, the equivalence class containing is Similarly, the other equivalence classes are given by . Thus we have . 4. (iv)
, where .
Define induced by the action of on by
[TABLE]
A simple calculations shows that the action of on is given by
[TABLE]
and it is easy to see that and . Therefore, .
In the following remark, we generalize the idea in Example 3.9, to describe a construction of a fat graph automorphism that corresponds to an -compatible pair of irreducible Type 1 actions.
Remark 3.10**.**
Consider a compatible pair of irreducible fat graph automorphisms as in Definition 3.8, where the , and let denote the vertex set of . Suppose that . Then are compatible (in the sense that they correspond to orbits that were involved in the compatibility of the ). Let for with . Observe that when we remove invariant (pairwise disjoint) disks around vertices in the compatible orbits, the local picture at each vertex in is transformed to where the boundary circles are the concatenations of the arcs . We now define a fat graph as follows:
- (i)
. 2. (ii)
The vertices of are given by the following procedure: Let , take . There exist such that . If and is the unique vertex containing , then we define to be the succeeding edge to in the cyclic order at in and so on. Continuing this way, we obtain the set of all vertices and hence the fat graph .
Now, we define a map on as follows:
[TABLE]
It is straightforward to see that is an automorphism of . An analogous construction works for the case when .
The discussion in Remark 3.10 leads us to the following result.
Theorem 3.11**.**
There is a bijective correspondence between -compatible pairs of irreducible Type 1 actions and compatible pairs of irreducible fat graph automorphisms via the correspondence .
By an inductive application of Theorems 3.11 and 2.25, we can obtain the following result.
Theorem 3.12**.**
Every cyclic action that decomposes into compatibilities between finitely many irreducible Type 1 actions determines a fat graph automorphism.
4. Some applications of the geometric realizations
In this section, we derive some applications of the theory we have developed in Section 2.
4.1. Maximal reduction systems
In this subsection, we will apply our realizations to derive the size of maximal reduction systems of Type 1 actions and Type 2 compatible pairs, which are the essential building blocks of arbitrary non-rotational cyclic actions.
Theorem 4.1**.**
Let be a cyclic action on .
- (i)
If is of Type 1, then there exists a maximal reduction system for such that
[TABLE] 2. (ii)
If is a Type 2 actions realizable as a compatible pair of Type 1 actions on , then there exists a maximal reduction system for such that
[TABLE]
where .
Proof.
It follows from Theorem 2.14 and Remark 2.13 that can be realized as type, where is a Type 1 action with . Part (i) now follows from the fact that is irreducible [2], and the fact that a pants decomposition for comprises nonisotopic curves, when . Finally, (ii) is a direct application of (i) and Remark 2.21. ∎
We conclude this subsection by pointing out that by an inductive application of Theorem 2.25, one can generalize Theorem 4.1 to arbitrary Type 2 actions.
4.2. Symplectic representations of cyclic actions
In this subsection, we will apply the realizations obtained in Section 2 to describe a procedure for deriving the image of a non-rotational cyclic action under the symplectic representation We will later extend these results to obtain the representations of the roots of Dehn twists.
Consider a polygon with a reduced boundary word , when read in the counter-clockwise sense. A direct application of the methods detailed in [11, Chapter 3] shows that is of the form
[TABLE]
for some words (possibly empty), and letters . Then we have the following proposition.
Proposition 4.2**.**
Let . Suppose that is the polygon with obtained by applying the handle normalization algorithm once to . Then and are homotopically equivalent to and , respectively.
Proof.
In the following three steps, we obtain the reduced word equivalent to . Furthermore, we would like to express the new letters in terms of the letters in the word .
Step 1. Let denote the diagonal of the polygon joining the end point of and the common vertex of and . We cut along the diagonal and obtain two polygons and (see Figure 7). Next, we glue the polygons along to get (see Figure 8).
In the new polygon, the image of is described in Figure 8.
Step 2. In this step, we cut the polygon obtained at the end of Step 1 along the diagonal (see Figure 9, left) and then paste along to obtain (Figure 10).
Note that, intersects at an interior point which divides into two segments . The images of and are described in Figure 10. Note that
Step 3. Finally, we cut the polygon along the diagonal (see Figure 11, left) and obtain two polygons and . Next, we glue them along and obtain the polygon given by (Figure 12).
The diagonal intersects at an interior point which divides into segments . Furthermore, splits into two segments and .
We can slide the final point of and the initial point of along the reverse direction of to the initial point of simultaneously by homotopy. Then bound a disc in the surface and hence gives a word which is equivalent to identity. Thus we have
[TABLE]
Similarly, by homotopy, slide the final point of and the initial point of to the final point of . Then we slide the final point of and the initial point in the reverse direction along to the initial point of . The edges and bound a disc. Therefore we have,
[TABLE]
Therefore, by renaming the side by , we have the proposition. ∎
Notation 4.3**.**
Let be a polygon with .
- (a)
We denote by , the polygon obtained from after successive applications of the normalization procedure described in Proposition 4.2. 2. (b)
We denote by , the set of distinct letters in . 3. (c)
We denote by , the set of standard generators of expressed in terms of elements in .
Let and be as in Proposition 4.2. Then the map
[TABLE]
for all , uniquely determines an isomorphism on , which we denote by . This brings us to the following lemma.
Lemma 4.4**.**
Let be a polygon with . Then
[TABLE]
and the mapping
[TABLE]
defines an isomorphism of the homology group such that
[TABLE]
For an isomorphism , we shall denote by , the matrix of with respect to the standard homology generators. The following proposition, which is a direct consequence of Theorem 2.7 and Lemma 4.4, describes a procedure for finding the image of a Type 1 action under .
Theorem 4.5**.**
Consider the Type 1 action
[TABLE]
Then with as in Lemma 4.4, and is induced by where
[TABLE]
An immediate consequence of Theorem 4.5 is the following corollary, which describes the symplectic representation of a Type 2 action realizable as an -compatible pair across a pair of fixed points.
Corollary 4.6**.**
Let be a Type 2 action that is realizable as an -compatible pair of Type 1 actions as in Lemma 2.20 such that Then
[TABLE]
where the blocks are obtained using Theorem 4.5.
We motivate the symplectic representations of arbitrary -compatibilities (between Type 1 actions) with this example.
Example 4.7**.**
Consider the -action
[TABLE]
on . It can be realized as the following -compatible pair of Type 1 actions
[TABLE]
Then is the hexagon with
[TABLE]
Let , as indicated in Figure 13. For , is given by:
[TABLE]
The map is induced by
[TABLE]
while is induced by
[TABLE]
Then by Theorem 4.5, gives the action of on . By the realization of , we have
[TABLE]
To understand the action of on , we write
[TABLE]
so that
[TABLE]
under the action of on Consequently, is given by
[TABLE]
This example motivates the following definition.
Definition 4.8**.**
Let be a Type 2 action that arises from a -compatible pair of Type 1 actions as in Lemma 2.20.
- (i)
We define
[TABLE]
[TABLE]
where denotes the set of standard homology generators for the extra genera obtained by gluing annuli across a pair of compatible orbits of size .
- (ii)
Let be as in (i); let and correspond to compatible orbits in respectively. Then we define
[TABLE]
and
[TABLE]
where the and are as indicated in Figure 14.
Note that for , the arcs and , as indicated in Figure 14, correspond to edge paths in and , which are mapped under the actions of and to edge paths, which we denote by and , respectively. The following theorem, which gives an explicit description of the symplectic representations of Type 1 actions compatible pairs, is now a direct consequence of Theorem 4.5.
Theorem 4.9**.**
Let be as in Definition 4.8. Then the action of on is given as follows:
- (i)
for , is given by Theorem 4.5. 2. (ii)
for , the action of is given by:
[TABLE]
Proof.
We can observe from Figure 14 that
[TABLE]
with , which yields the result. ∎
Once again, by repeatedly applying Theorems 4.9 and 2.25, one can obtain the symplectic representations of arbitrary Type 2 actions. However, for brevity, we shall refrain from explicitly stating any results to this effect.
4.3. Symplectic representations of roots of Dehn twists
Let be a nonseparating curve in for , and let denote the left-handed Dehn twist about . It is known [6, 5] that the conjugacy class of a root of of degree corresponds to the conjugacy class of a -action on having two distinguished fixed points whose local rotational angles add up to modulo . If such a -action exists on , then we remove invariant discs around these fixed points, and attach a -handle with a twist across the resultant boundary circles, thereby realizing a degree root of about the nonseparating curve in . Consequently, the conjugacy classes of roots of of degree correspond to actions of the form
[TABLE]
We call such an action a root realizing action. We denote the root of of degree corresponding to a root realizing action (as in 4.3) by .
In view of the fact that the degree of is odd, and is bounded above by [6, Corollary 2.2], the following result is a direct consequence of Lemma 2.12.
Proposition 4.10**.**
For , let be a root realizing Type 2 action, as in 4.3. Then can be realized as an -compatible pair where
[TABLE]
satisfying
Note that in Proposition 4.10 is in fact a root realizing Type 1 action. Hence, the problem of understanding the symplectic representation of an arbitrary root of reduces to understanding , where is a root realizing Type 1 action. Let be (topologically) realized by removing invariant discs around the two distinguished fixed points and of the action of on , and then attaching a -handle with a twist across the resultant boundary circles. Let be a path in from to whose homotopy class (rel ) does not intersect the free homotopy class of any essential simple closed curve in . Now choose an edge path of the polygon in the homotopy class of (rel . This brings us to the following theorem, which gives an explicit description of .
Theorem 4.11**.**
Let
[TABLE]
be a root realizing Type 1 action. Then
[TABLE]
where is a submatrix, is a submatrix, whose second column is zero and first column is determined by
[TABLE]
and are as in Theorem 4.5, is the order identity matrix, and is uniquely determined by and .
Proof.
Let be an arc on joining terminal point of to the initial point of so that . Then under , and hence we have,
[TABLE]
Also, by construction . From this it follows that has the desired form. Since preserves the symplectic form, is uniquely determined by and , and this completes the proof. ∎
Let be a separating curve in so that . Then it is known [9] that a root of of degree corresponds to a pair of cyclic actions on the , for , having distinguished fixed points such that the local rotational angles induced around the (by the ) satisfy
[TABLE]
We will call such a pair of actions a root realizing action pair of degree n. Since the induced action of on is trivial, it follows immediately that:
Theorem 4.12**.**
Let be a separating curve in , and let be a root of of degree that corresponds to a root realizing action pair of degree . Then
[TABLE]
We conclude this subsection with the following interesting example.
Example 4.13**.**
Consider the root realizing data set
[TABLE]
It can be realized by the following -compatible type-2 data sets
[TABLE]
where is a root realizing data set.
Let be the standard homology generator for the extra genus obtained by attaching a 1-handle with a twist, across the boundary circles obtained by removing invariant discs around fixed points with local rotational angles , so that are standard homology generators for . We have
[TABLE]
For is given by:
[TABLE]
and
[TABLE]
For i=1,2, is given by:
[TABLE]
Then by Theorem 4.5, gives the action of on . Hence, we have
l_{i}\mapsto\left\{\begin{array}[]{r@{\quad: \quad}l}-m_{1}+l_{2}&i=1\\ -m_{1}&i=2\\ -2l_{4}+m_{3}+m_{4}&i=3\\ l_{3}-l_{4}&i=4\end{array}\right.
m_{i}\mapsto\left\{\begin{array}[]{r@{\quad: \quad}l}-l_{2}+m_{2}&i=1\\ l_{1}-2m_{1}+l_{2}-m_{2}&i=2\\ -l_{4}&i=3\\ l_{3}+m_{3}-l_{4}&i=4\end{array}\right.
To understand the action of on , we write , where is an arc on the handle with twist, joining end points of , so that
[TABLE]
under the action of on Then by Theorem 4.11, is given by
[TABLE]
[TABLE]
4.4. Representations of roots of Dehn twists about multicurves
For a multicurve in , conditions for the existence of a root of of degree were derived in [10]. In general, such a root induces a nontrivial permutation of the curves in , and a finite order map on (as in Theorem 2.25). Moreover, the components of may themselves form orbits (called surface orbits) under . It is clear that the components of a single surface orbit must be homeomorphic to each other, so if a surface orbit has components homeomorphic to , we denote it by . Thus, a root of induces a decomposition of in the form
[TABLE]
Furthermore, the restriction of to each is the composition of a cyclic action on with a cyclical permutation of the components of . The must be pairwise compatible across distinguished orbits, in the sense that the orbits must be of the same size, and the induced angles of rotation associated with the orbits must add up to allow the to extend to a root. Using Theorem 2.25, we can build (i.e. realize) each from finitely many pairwise compatibilities between irreducible finite order actions. Finally, by obtaining a suitable extension of Theorems 4.11 and 4.12 to multicurves, one can obtain .
Acknowledgements
The authors would like to thank Siddhartha Sarkar for helpful discussions on the symplectic representations of cyclic actions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Benson Farb and Dan Margalit. A primer on mapping class groups , volume 49 of Princeton Mathematical Series . Princeton University Press, Princeton, NJ, 2012.
- 2[2] Jane Gilman. Structures of elliptic irreducible subgroups of the modular group. Proc. London Math. Soc. (3) , 47(1):27–42, 1983.
- 3[3] Steven P. Kerckhoff. The Nielsen realization problem. Ann. of Math. (2) , 117(2):235–265, 1983.
- 4[4] Ravi S. Kulkarni. Riemann surfaces admitting large automorphism groups. In Extremal Riemann surfaces (San Francisco, CA, 1995) , volume 201 of Contemp. Math. , pages 63–79. Amer. Math. Soc., Providence, RI, 1997.
- 5[5] Dan Margalit and Saul Schleimer. Dehn twists have roots. Geom. Topol. , 13(3):1495–1497, 2009.
- 6[6] Darryl Mc Cullough and Kashyap Rajeevsarathy. Roots of Dehn twists. Geom. Dedicata , 151:397–409, 2011.
- 7[7] Jakob Nielsen. Untersuchungen zur Topologie der geschlossenen zweiseitigen Flächen. III. Acta Math. , 58(1):87–167, 1932.
- 8[8] Jakob Nielsen. Abbildungsklassen endlicher Ordnung. Acta Math. , 75:23–115, 1943.
