On independent GKM-graphs without nontrivial extensions
Abstract.
In this paper an example of a -independent -type GKM-graph without nontrivial extensions is constructed for any . It is shown that this example cannot be realized by a GKM-manifold for any or .
Key words and phrases:
Torus action, GKM-theory1. Introduction
GKM-theory [gkm-98], [gu-za-01] provides with a useful method for computation of the equivariant cohomology ring for a wide class of manifolds equipped with a torus action (having only isolated fixed points) called GKM-manifolds. The main tool of this theory is a graph that is naturally asssociated with the orbit space of the equivariant -skeleton for a GKM-manifold. The labels on the edges of this graph are given by the tangent weights of the fixed points associated with the torus action. By abstracting from the torus action one obtains the definition of a GKM-graph axiomatized in [gu-za-01]. Apart from the equivariant cohomology ring many other important geometric objects and topological invariants related to a GKM-manifold can be studied in terms of the respective GKM-graph, such as Betti numbers [gu-za-01], invariant almost complex structures [gu-ho-za-06], invariant symplectic and Kähler structures [go-ko-zo-20], etc.
A GKM-manifold is called a GKM-manifold in -general position if any tangent weights at any fixed point of this action on are linearly independent. A -independent GKM-graph is defined similarly. Properties of a GKM-action of a -action on in -general position were studied in several papers (in a wider context of equivariantly formal smooth actions with isolated fixed points). The number is called the complexity of the -action on . In [ma-pa-06] it was shown that the equivariant cohomology ring of a torus manifold with vanishing odd cohomology groups (that is, a -dimensional GKM-manifold of complexity which is automatically -independent) is isomorphic to the Stanley-Reisner ring of the face poset of the GKM-graph. Also see [ma-ma-pa-07] for treatment of equivariant topology for torus manifolds from GKM-perspective. Furthermore, any GKM-manifold of complexity with a GKM-action in general position (that is, in -general position) has a description [ay-ma-so-22] of the equivariant cohomology ring in terms of face rings similar to [ma-pa-06]. The poset of faces in the orbit space was associated to a GKM-manifold with the -action in [ay-ma-so-22]. We remark that in the case of complexity this object was studied in earlier papers [ma-pa-06] (for a locally standard action, so that is a manifold with corners) and in [ay-ma-19] (for a general case, so that is a homological cell complex). It was shown in [ay-ma-so-22] that for a GKM-manifold in -general position the subposets and are - and -acyclic, respectively, for any and . This implies by [ma-pa-06, ay-ma-19] that the corresponding orbit space of is -acyclic. This result was proved in [ma-pa-06] for (-independent case) and in [ay-ma-19] for the case of arbitrary . On the other hand, by dropping the condition of general position, an arbitrary -action on a smooth manifold (of complexity ) with isolated fixed points shows much more complicated behaviour of the orbit space homology [ay-ch-19]. Therefore, GKM-actions in -general position form a particularly nice class of GKM-actions exhibiting many useful properties (depending on the value of ).
A natural question (called an extension problem in [ku-19]) is how to determine whether a given GKM-action extends to an effective GKM-action of a torus of greater dimension (so that the complexity of the new action is lower) on the same manifold, or not. This question leads to a search of a -independent -type GKM-action that is nonextendible for arbitrary . Homogeneous GKM-manifolds [gu-ho-za-06] supply with many interesting examples of GKM-graphs, including those of positive complexity. Recall that if the Euler characteristic of a homogeneous complex manifold is nonzero then it is a GKM-manifold by [gu-ho-za-06], where is a compact connected semisimple Lie group, is an arbitrary parabolic subgroup in and is any maximal torus of . Two phenomena occur for homogeneous GKM-manifolds related to the search problem mentioned above. Firstly, S. Kuroki proved the following gap property for of type with the natural GKM -action on as above (unpublished): if the respective GKM-graph is -independent for some then it is -independent, where is the rank of . This leads to a conjecture that any homogeneous GKM-manifold satisfies such a gap property. Secondly, the natural -action on the Grassmanian of -planes in is a GKM-action admitting no nonisomorphic extensions for any . This can be shown by modifying the proof for from [ku-19] in a simple way. This result leads to another conjecture that most of the homogeneous GKM-manifolds are nonextendible with possibly a few exceptions determined by the condition that the respective automorphism group identity component is greater than . (The description of is given in [ak-95], for instance.)
Therefore the extension problem seems to be a bit challenging. Instead, one can study a rather simplistic extension problem for arbitrary GKM-graphs by replacing a GKM-action of on with an -type -independent GKM-graph (not necessarily coming from a GKM-action). An occurring new realization problem here is to determine whether a given GKM-graph is a GKM-graph of some GKM-manifold. We remark that some results on realization problem were obtained in dimensions in [ca-ga-ka] for GKM-graphs (in terms of conditions given by the ABBV localization formula), and for GKM-orbifolds in dimension in [da-ku-so-18, Remark 4.13].
In this paper, we give new examples of non-realizable and non-extendible actions of different complexity. The precise statement is given in the following main theorem of this paper (see Theorem LABEL:thm:example_).
Theorem 1.
For any there exists an -type GKM-graph satisfying the following properties:
-
(i)
The GKM-graph is -independent;
-
(ii)
The GKM-graph has no nontrivial extensions;
-
(iii)
The GKM-graph is not realized by a GKM-action if or .
The necessary tools for the proof of Theorem 1 are twofold. Firstly, in Section 2 we give a sufficient criterion (Corollary 2.12) of non-extendibility of any GKM-graph satisfying some condition formulated in terms of chords for a face in the GKM-graph. Secondly, in Section 3 for any -independent GKM-manifold with the corresponding GKM-graph , we compare (Proposition 3.9) some subposets in the face poset of a GKM-graph with the subposets in the face poset of . The obtained comparison implies (by [ay-ma-so-22]) partial acyclicity for some subposets in . In this case turns out to be a simplicial poset for any face of dimension not exceeding in (Proposition 3.14). The respective Euler characteristic of the order complex for the poset is computed in terms of the corresponding -numbers (Proposition 3.13).
In Section 4 we explicitly construct an example which is suitable for the proof of Theorem 1. Here is a brief outline of the construction. Firstly we introduce an infinite -regular graph embedded into . We endow it with an axial function in order to obtain a torus graph . We add to it edges and define the axial function agreeing to that of causing the increase of the complexity for a GKM-graph. The resulting -type GKM graph is -independent. We remark that the definition of the axial function on is obtained by applying the decision method of Tarski [ta-51] to some Vandermonde matrices (Lemma 4.9) and therefore it is implicit. The infinite GKM graph is periodic (invariant) with respect to the subgroup in the group of parallel translations in . The quotient of the GKM-graph by the group is shown to be a well-defined GKM-graph without multiple edges and loops.
In the concluding Section LABEL:sec:proof of this paper we prove that satisfies all conditions of Theorem 1 (where we put , ). We apply the results on acyclicity of face subposets in GKM-manifolds (in the case of complexity ) from [ma-pa-06] in order to prove non-realizability of the constructed GKM-graph by studying the respective Euler characteristic (by the comparison results mentioned above). This argument relies on the explicit computation of face numbers in the torus graph (Lemma LABEL:lm:eucomp). The nonextendibility is proved by using the method of chords mentioned above.
2. An obstruction to a GKM-graph extension
In this section we recall some definitions from GKM-theory (we follow the notation from [gu-za-01] and [ku-09]). We introduce an obstruction to have extensions for a given GKM-graph in terms of chords.
Definition 2.1.
[gu-za-01] A GKM-graph is a triple consisting of:
-
•
a graph with the set of vertices and with the set of edges , where and it is required that for an edge one has ;
-
•
a collection of bijections
such that the identity
holds for any , where is the star of at ;
-
•
a function satisfying the rank condition
the opposite sign condition
and the congruence condition
for some integer and for any with a common source, and .
The collection is called a connection of and the function is called an axial function of .
In this section we fix a GKM-graph with the corresponding connected -valent graph , axial function on and a connection on it.
Definition 2.2.
[gu-za-01] A connected -regular subgraph of is called an -face (or a face) of , if holds for any such that (in [gu-za-01] it is called a totally geodesic subgraph). Any edge is called a transversal edge to a face in , where . Let
be a span of a face in , where denotes the -linear span of vectors , where runs over . The GKM-graph is called a GKM-graph of -type, if is -valent and the rank of is equal to .
Remark 2.3.
A face of a GKM-graph becomes a well-defined GKM-graph by taking restrictions of the connection and of the axial function from to . The span of the face is well defined because of the identity for every which immediately follows from the congruence condition.
Definition 2.4.
A GKM-graph is called -complete if for any , any integer and any distinct edges there exists an -face of such that holds. An -regular -complete GKM-graph is called a complete GKM-graph. A GKM-graph is called -independent if for any and any distinct edges the values of the axial function on are linearly independent in .
Definition 2.5.
Let be a face of . We call a transversal edge to a chord of the face , if . If the face in admits no chords then we call a chordless face of .
Example 2.6.
The standard -action on the flag manifold is a GKM-action with the GKM-graph of -type and with as the underlying graph [gu-ho-za-06, p.40]. The GKM-graph satisfies the opposite sign condition. It has five -faces (three -cycles and two -cycles). For any such -cycle -face the remaining transversal edges in are chords of .
Proposition 2.7.
Let be a -face of a -complete GKM-graph . Then for any chord of and any edge path in such that , , one has , where by definition (see [ta-04])
Proof.
By the -completeness condition, there exists a -face of such that and belong to . Notice that holds by the definition. The definition of invariance also implies that holds. However, has cardinality one, since and are - and -faces, respectively. Hence,
holds. Observe that holds by the definition of invariance, because belongs to by the condition. Therefore, we conclude that holds. This proves the claim of the proposition. ∎
Proposition 2.8.
For a chord of a face in suppose that there exists an edge path in such that , and hold. Then one has .
Proof.
Let . Notice that one has , because is a face in , where and , . Hence, holds for any . One deduces the identity
(2.1) |
from the congruence condition. We conclude that
(2.2) |
holds. Notice that the identities , hold. Together with the inclusion (2.2) this implies the claim of the proposition. ∎
Proposition 2.9.
Suppose that the underlying graph of has finitely many vertices. Then, if is -independent, then is -complete, where .
Proof.
Fix a nonzero integer . Let be an -element set of some mutually different edges in with a common origin . In order to prove the claim it is enough to construct an -face in such that the inclusion
(2.3) |
holds. We give the inductive definition as follows:
By the definition, the filtration is bounded by the finite set from above. Hence, there exists such that holds for any . Define the subgraph in by the formulas
The set is closed under reversion of an edge operation, because holds for any . By the condition, for any there exists an edge path such that and holds. Hence, is a connected subgraph in . It follows from the definition that is a face of . It remains to show that is an -face. Assume the contrary. Then there exists . It follows from the definition that there exist and such that and
holds. It follows from the formula (2.1) that
Hence, the collection of vectors , , is linearly dependent. However, this contradicts the condition of -independency of , because . We conclude that is an -face, which proves the claim of the proposition. ∎
Corollary 2.10.
Suppose that the underlying graph of has finitely many vertices. Then, if is a -independent (-independent, respectively) GKM-graph for some , then any -face (face, respectively) of is chordless, where .
Proof.
Assume the contrary. Then there exist an -face of and its chord , where . One has , because is -independent and is -regular, where . By Proposition 2.9, is -complete. Then one can apply Propositions 2.7 and 2.8 in order to obtain . This contradiction proves the first claim of the corollary. The proof of the second claim is similar to the proof of the first claim. ∎
Definition 2.11.
Let , be two GKM-graphs with the same underlying graph , the same connection , with the axial functions , taking values in and , respectively. The GKM-graph is called an extension of (see [ku-19]), if there exists an epimorhism such that holds for any . We say that an -type GKM-graph has no nontrivial extensions if for any it does not admit an extension to an -type GKM-graph. (This terminology was proposed by S. Kuroki.)
The next corollary is a principal tool for the proof of Theorem 1.
Corollary 2.12.
Suppose that the underlying graph of has finitely many vertices. Then, if is a -complete GKM-graph and there exists a -face of such that any transversal edge to is a chord for , then has no nontrivial extensions.
3. Face posets of a GKM-graph and of a GKM-manifold
In this section we continue to recall some basic notions of GKM-theory and of the related [ma-ma-pa-07, ay-ma-so-22] posets , of faces arising from the orbit space and from the GKM-graph of a given GKM-manifold with the -action, respectively. We compare some specific simplicial subposets in , under assumption of -general position for . After that we recall the P.Hall formula for the Euler characteristic of an order complex for a finite simplicial poset which is used later in the text.
Definition 3.1.
[ma-ma-pa-07, ay-ma-so-22] For a GKM-graph the collection of all faces in is called a face poset of the GKM-graph with the partial order given by inclusion of faces in .
Due to [ma-pa-06, Lemma 2.1] one can give the following definition of a GKM-manifold that is equivalent to the standard one (e.g. see [gu-za-01]).
Definition 3.2.
[gkm-98, gu-za-01, ma-pa-06] A smooth manifold with an effective action of is called a GKM-manifold if the following conditions hold:
-
•
the set of -fixed points in is finite and nonempty;
-
•
the tangent weights of the -action at any are pairwise linearly independent;
-
•
all odd cohomology groups of vanish, i.e. one has .
Remark 3.3.
To any complex GKM-manifold one associates a GKM-graph, e.g. see [ku-09]. We notice that for an arbitrary GKM-manifold the opposite sign condition is in general satisfied only up to a sign. We also remark that it is possible to have loops and multiple edges for a GKM-action. In this paper we restrain from considering such torus actions and we use a restricted definition of a GKM-graph (where it is a simple graph). Let and be two GKM-actions of tori on the same manifold . The action of is called an extension of the action on if there is a group monomorphism that is equivariant with respect to these torus actions. In other words, the -action is the restriction of the -action. The epimorphism
corresponding to induces the extension of the GKM-graphs , corresponding to the - and the -action, respectively.
Example 3.4.
The natural -action on has no notrivial extensions by proving that for the corresponding GKM-graph by Corollary 2.12 (see Example 2.6). This fact may also be easily obtained by the results of [ku-19], or by studying the automorphism group of the homogeneous space (in a different category of complex-analytic torus actions).
Consider a GKM-action of on .
Definition 3.5.
[ay-ma-so-22] For a smooth -action on , consider the canonical projection to the respective orbit space, and let
(3.1) |
be the filtration on the orbit space , where denotes the -orbit of in . The closure of a connected component of is called an -face (or a face) of if it contains at least one fixed point.
Definition 3.6.
[ay-ma-so-22] The poset of faces for the GKM-manifold is the poset of faces of nonnegative dimension ordered by inclusion in the orbit space of the -manifold .
Recall that a topological space is called -acyclic if holds for any , and acyclic, if holds. Let be the poset of faces for a GKM-manifold . Let be the poset of faces of nonnegative dimension (ordered by inclusion) of a GKM-graph . We need the following particular case of a theorem from [ay-ma-so-22].
Theorem 3.7.
[ay-ma-so-22, Theorem 1] For any GKM-manifold of complexity in -general position (that is, holds) the -dimensional poset is -acyclic, where .
Lemma 3.8.
[ay-ma-so-22, p.5, Lemma 2.9] The full preimage of any face is a smooth submanifold in called a face submanifold in .
The claim of the following proposition is reminiscent to [ay-ma-so-22, Lemma 3.8] (although not quite the same).
Proposition 3.9.
For a GKM-manifold in -general position for some the following claims hold.
For any , any -face in is an equivariant -skeleton of a face submanifold in and the GKM-graph is a torus graph.
The span of splits off as a direct factor in .
The posets and are isomorphic for any face of such that , where is the face in corresponding to by .
Proof.
Choose and let . Let be a closed subgroup in corresponding to the sublattice in , where . Let be the identity component (in particular, a torus) of . Notice that the sublattice corresponding to the subtorus splits off as a direct factor in and that there is a lattice embedding of a finite index. The connected component of such that is a smooth manifold with effective -action by Lemma 3.8, where . Notice that . The set of weights of the -action on at embed to the set of weights of the -action on at . One has . Hence, are linearly dependent for any . Then by linear independence condition we conclude that holds. Therefore, , is a GKM-manifold, its equivariant -skeleton is a GKM-graph of type and is a face of the GKM-graph . Notice that this implies . Hence, the claims , are proved. By the definition, one has . The inverse inclusion holds by . This proves . The proof is complete. ∎
Let be a finite poset [st-86]. Recall the following definitions.
Definition 3.10.
[st-86] The order complex of a finite poset is the simplicial complex
on the vertex set consisting of chains of increasing elements in . By definition the -faces of a simplex are , where are arbitrary numbers (i.e. the chains obtained by dropping the elements of ), .
Definition 3.11.
[st-86] The poset with the least element is called a simplicial poset if the subposet of is a Boolean lattice for any . For any element of a simplicial poset a length of is the length of a maximal chain in . Here . Define the dimension of a simplicial poset to be the number . For a simplicial poset let
be the number of elements in of length , where . In particular, .
Remark 3.12.
The poset has the least element by the definition and is therefore acyclic. For a torus action with a dense open orbit the poset has the least element and is contractible, too. However, for an arbitrary -action on the poset is neither acyclic nor simplicial, in general. This is due to the fact that the orbit space is a homological cell complex and the group isomorphism holds, e.g. see [ma-pa-06, Proposition 5.14]. For instance, it can be checked for the -action on (Example 2.6) that the corresponding orbit space is homeomorphic to a sphere , e.g. see [ay-ma-19].
In the following we need the following well-known Philip Hall’s theorem.
Proposition 3.13.
[ro-64, Proposition 6] Let be a simplicial poset of dimension . Then the Euler characteristic of the order complex for in the reduced simplicial homology is given by the formula:
The computation of Euler characteristic for certain face subposets in for a -complete GKM-graph is possible (by using Proposition 3.13) due to the following proposition.
Proposition 3.14.
Let be a -complete GKM-graph for some . Then for any -face of the poset is a simplicial poset of dimension . In particular, for any one has in , and is equal to the number of -dimensional faces in .
Proof.
In order to prove the claim of the proposition it is enough to show that for any face in the poset is isomorphic to the poset of faces in . Let . Since the connection of is -independent, any face is uniquely determined by the collection of mutually different elements from , and vice versa. Moreover, for any one has iff . This implies the necessary claim. The proof is complete. ∎
4. A periodic GKM-graph and its quotient
In this section we give a detailed construction of the GKM-graph suitable for the proof of Theorem 1 and study some of its properties.
Construction 4.1 (Graph ).
Let be the edge graph of the cube
with center at and with edges of length . For any we define the graph embedded into as the union of the following graphs:
-
(i)
Graph , where runs over all points with integral coordinates;
-
(ii)
Graph , where runs over ;
-
(iii)
A diagonal, that is, an edge of the form
(and its inverse), where runs over , runs over , and is the standard basis of .
Notice that the graph is a -regular connected graph with infinite set of vertices. We call a cubical subgraph any subgraph in of the form , where . For any vertex denote by a unique cubical subgraph in such that holds.
Construction 4.2 (Functions ).
For any define the functions , where and . For any and any vertex of let
(4.1) |
By definition, the function is then uniquely defined by taking the same values on the vertices of any diagonal of , where and . Define
(4.2) |
for any vertex of .
Construction 4.3 (Graph ).
For any and let be the graph obtained from by adding the edges , where , where runs over and runs over the subset of elements such that holds.
Notice that the graph is a -valent connected graph with infinite set of vertices, and that holds (see Figure LABEL:fig:cross, LABEL:fig:edges).
Construction 4.4 (Axial function on ).
Fix a collection of integers . Let , be the function taking value for any and any . By definition, for any let be the inner (outer, respectively) normal of the unit length for the corresponding to facet of the cube in if (if , respectively). For any diagonal , where and , let , . In particular, one has for any (see Figure 1). For any let
(4.3) |
for any , where are the values of on denoted in such a way that holds for .
Denote by the automorphism of the graph induced by the linear operator in , where ; . Notice that is well defined for any and that the identities
(4.4) |
(4.5) |
hold for any , ; ; ; and any .
Our next task is to define the connections , on and compatible with and by describing the corresponding facets, respectively. We do this by listing all facets in the corresponding graphs in the next two definitions. One can easily check that the facets given below are compatible with and .
Definition 4.5 (Facets of ).
For any let be the subgraph in . Denote by a unique subgraph in corresponding to the facet of the respective cube with the normal vector such that , where . Let be any diagonal of . For any let be the -valent subgraph of that is the union of subgraphs , and , where runs over diagonals of incident to , runs over and runs over .
Definition 4.6 (Facets of ).
For any let be the union of the subgraphs , and edges (and their inverses), where runs over , runs over and runs over the union of all vertices of these graphs. For any define the subgraph of to be obtained by omitting all edges in , where runs over .
Proposition 4.7.
Let be any edge such that holds for some . Then one has
(4.6) |
Proof.
By the definition, the values of on the vertices of are equal to each other for any . This proves (4.6) for (if ). By definition, the values of are mutually equal on the vertices of the graph , as well as on the vertices of any diagonal emanating from , where ; and . Suppose that holds for some . Notice that holds. Without loss of generality, let and let . Let , be both unique diagonals of terminating at and , respectively. Notice that holds for the respective subgraphs in . Then one uses Construction 4.2 and (4.1) to conduct the following computation
The proof is complete. ∎
Lemma 4.8.
The function satisfies the rank, opposite and congruence conditions with respect to and (see Definition 2.1).
Proof.
Notice that the rank condition is satisfied for by the construction. Let . Consider the following cases.
1) Let . The opposite sign condition is easily deduced for along the edge . In terms of Construction 4.4 of , one has for some . Then one has for any and . Hence, by Proposition 4.7 and by (4.3) one has
(4.7) |
where . Hence, the congruence condition holds for along the edge .
2) Let . Let . Then for some . By Construction 4.4, the equality holds for any . By (4.4) and (4.3) then one has
Hence, the opposite sign condition holds for along the edge . If , then the congruence relations hold for along . Suppose that holds. Choose any such that holds. Then by (4.4) one has
for any . Hence, by (4.3), the computation (4.7) holds in this case. This implies that the congruence condition holds for along the edge . The proof is complete. ∎
Lemma 4.9.
Let . Then there exist integers such that the axial function is -independent.
Proof.
For any vertex the values of the axial function on are given by the columns of the following -matrix:
(4.8) |
where for in terms of Construction 4.4, and depend on . By slightly abusing the notation let be the -minor of the above matrix (4.8) corresponding to the columns with indices in (4.8) (from left to right). For any integers there exists an integer such that the inequalities and hold, where . If then
Let . The ordering of the variables induces the lexicographical ordering on the polynomials from the ring . In this ordering the maximal monomial in is equal to
In particular, is a nonzero polynomial in . Hence, the left-hand sides in the system of inequalities , where exhausts all -subsets of and runs over , includes no zero polynomials. The set of real solutions for this system is the complement to the finite union of subsets of zero measure in , because is periodic (see (4.5)). Therefore, this complement has a rational point with the corresponding coordinates . By multiplying with the respective least common multiple one obtains such that is -independent. This completes the proof. ∎
Remark 4.10.
The values of the axial function obtained in Lemma 4.9 may not be primitive, in general. However, one can replace each non-primitive value of with the corresponding primitive vector in . Notice that the axial function obtained during this procedure is -independent and its values at any star of contain a basis of .
Construction 4.11 (GKM-graph ).
For any define an equivalence relation on by putting for any such that for some . For any , , define the graph to be the quotient of by . Define the axial function and the connection to be induced by and on the quotient graph on , respectively (see (4.5) and Fig. LABEL:fig:conng2).
Example 4.12.
For any the GKM-graph is isomorphic to the edge graph of the standard -dimensional cube with the axial function induced by the embedding of to .
By slightly abusing the notation let be the quotient map.
Proposition 4.13.
For any , , the GKM-graph is a well defined graph with finitely many vertices and edges. Furthermore, it has neither multiple edges nor loops, and has type . The objects where ; where ; are well defined for any .
Proof.
The quotient is obtained by gluing all pairs of opposite facets of the cube by respective translations in . Hence, is identified with . It follows from (4.4) that is well defined for any ; . The graph has neither loops nor multiple edges because the integral distance between distinct vertices of any its edge (with respect to ) is less or equal to and the integral length of any nonzero element from is greater or equal to . Clearly, the automorphism of is well-defined for any . We check that for any the edges , , are distinct. By applying ] for some without loss of generality assume that , where belongs to the big diagonal of the respective cube. It follows from the definition that , , are distinct for any and any . The proof is complete. ∎