This paper characterizes the rigidity of toric varieties derived from bipartite graphs by linking their geometric properties to combinatorial features of the graphs, providing criteria for rigidity based solely on graph structure.
Contribution
It offers a novel combinatorial characterization of the faces of the cone associated with bipartite graph-derived toric varieties and establishes graph-based criteria for their rigidity.
Findings
01
Faces of the cone are characterized by independent sets of the bipartite graph.
02
Criteria for rigidity are derived purely from graph properties.
03
The approach connects combinatorial graph theory with algebraic geometry of toric varieties.
Abstract
One can associate to a bipartite graph a so-called edge ring whose spectrum is an affine normal toric variety. We characterize the faces of the (edge) cone associated to this toric variety in terms of some independent sets of the bipartite graph. By applying to this characterization the combinatorial study of deformations of toric varieties by Altmann, we present certain criteria for their rigidity purely in terms of graphs.
Equations64
Edr(G):=C[titj∣{i,j}∈E(G),i,j∈V(G)].
Edr(G):=C[titj∣{i,j}∈E(G),i,j∈V(G)].
C[xe∣e∈E(G)]
C[xe∣e∈E(G)]
xe
TV(G):=Spec(C[xe∣e∈E(G)]/IG)=Spec(C[σG∨∩M])
TV(G):=Spec(C[xe∣e∈E(G)]/IG)=Spec(C[σG∨∩M])
\{a\in\mathbb{Q}^{m+n}\ |\ \langle b,a\rangle=0\text{ for all }b\in\sigma_{G}^{\vee}\}=\big{\langle}\sum_{i=1}^{m}e_{i}-\sum_{j=1}^{n}f_{j}\big{\rangle}.
\{a\in\mathbb{Q}^{m+n}\ |\ \langle b,a\rangle=0\text{ for all }b\in\sigma_{G}^{\vee}\}=\big{\langle}\sum_{i=1}^{m}e_{i}-\sum_{j=1}^{n}f_{j}\big{\rangle}.
N:=Zm+n/(1,−1) and M:=Zm+n∩(1,−1)⊥.
N:=Zm+n/(1,−1) and M:=Zm+n∩(1,−1)⊥.
N(A):={v∈V(G)∣v is adjacent to some vertex in A}.
N(A):={v∈V(G)∣v is adjacent to some vertex in A}.
HA:={x∈MQ∣vi∈A∑xi=vi∈N(A)∑xi}.
HA:={x∈MQ∣vi∈A∑xi=vi∈N(A)∑xi}.
IG(∗):={Two-sided maximal independent sets}⊔{One-sided independent sets Ui\{∙} not
IG(∗):={Two-sided maximal independent sets}⊔{One-sided independent sets Ui\{∙} not
contained in any two-sided independent set}
G[[A]]:=\left\{\begin{array}[]{ll}G[A\sqcup N(A)]\sqcup G[(U_{1}\backslash A)\sqcup(U_{2}\backslash N(A))],\text{if }A\subseteq U_{1}\text{ is one-sided.}\\
G[A\sqcup N(A)]\sqcup G[(U_{2}\backslash A)\sqcup(U_{1}\backslash N(A))],\text{if }A\subseteq U_{2}\text{ is one-sided.}\\
G[A_{1}\sqcup N(A_{1})]\sqcup G[A_{2}\sqcup N(A_{2})],\text{if }A=A_{1}\sqcup A_{2}\text{ is two-sided.}\par\end{array}\right.
G[[A]]:=\left\{\begin{array}[]{ll}G[A\sqcup N(A)]\sqcup G[(U_{1}\backslash A)\sqcup(U_{2}\backslash N(A))],\text{if }A\subseteq U_{1}\text{ is one-sided.}\\
G[A\sqcup N(A)]\sqcup G[(U_{2}\backslash A)\sqcup(U_{1}\backslash N(A))],\text{if }A\subseteq U_{2}\text{ is one-sided.}\\
G[A_{1}\sqcup N(A_{1})]\sqcup G[A_{2}\sqcup N(A_{2})],\text{if }A=A_{1}\sqcup A_{2}\text{ is two-sided.}\par\end{array}\right.
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.
One can associate to a bipartite graph a so-called edge ring whose spectrum is an affine normal toric variety. We characterize the faces of the (edge) cone associated to this toric variety in terms of some independent sets of the bipartite graph. By applying to this characterization the combinatorial study of deformations of toric varieties by Altmann, we present certain criteria for their rigidity purely in terms of graphs.
We want to investigate rigidity of a certain family of affine toric varieties by utilizing combinatorial tools from bipartite graphs. While the investigation of rigidity in general is difficult, we are able to present simple criteria for the rigidity in the case where the toric variety is constructed from a graph.
1.1. Toric varieties arising from graphs
Let G be a simple graph. We denote its vertex set as V(G) and its edge set as E(G). One defines the edge ring associated to G as
[TABLE]
Consider the surjective ring morphism
[TABLE]
where e={i,j}∈E(G). The kernel IG of this morphism is called the edge ideal. The associated toric variety to the graph G is defined as
[TABLE]
where σG∨ is called the dual edge cone. The edge ring Edr(G) is an integrally closed domain and hence TV(G) is a normal variety. For more details on the theory, we refer the reader to [HHO(18)]. In this paper, we focus on the case where G is a bipartite graph. We examine the first order deformations of TV(G), more precisely we investigate certain criteria for the bipartite graph G such that the first order deformations of TV(G) are all trivial, that is TV(G) is rigid.
1.2. Examples of rigid varieties
The first example of a rigid singularity is the cone over the Segre embedding Pr×P1 in P2r+1 (r≥1) which has been introduced by Grauert and Kerner in [GK(64)]. We will observe that this is in fact the toric variety associated to the complete bipartite graph Kr+1,2. In Theorem 4.3, we also give an alternative proof to the classical fact in [KL(71)] that TV(Km,n) is rigid except for m=n=2.
Another well-known class of rigid varieties is introduced by Schlessinger in [Sch(71)], which are isolated quotient singularities with dimension greater than three.
Many aspects of the infinitesimal deformations of affine normal toric varieties have been studied by K. Altmann in [Alt(95)],[Alt(97)] and [Alt(00)]. In these papers, it has been shown that the first order deformations of affine normal toric varieties are multi-graded. The homogeneous pieces TX1(−R) are given by a so-called deformation degreeR∈M, where M is the character group of the torus. For the computation of TX1(−R), one first considers the crosscut in degree R, which is the intersection of the associated cone of the toric variety with an affine space defined by R. Next, one examines the two-dimensional faces of this intersection and loosely speaking, how these two-dimensional faces are connected to each other. In [[Alt(95)], Corollary 6.5.1], it was proved that if the affine toric variety is Q-Gorenstein and Q-factorial in codimension 3 then it is rigid. Another approach for the deformations of affine toric varieties has been discussed in [Fil(18)] via Hochschild cohomology which provides concrete calculations for the homogenous piece TX1(−R). We follow the technique by Altmann which we present in Section 3.1 and we introduce many additional interesting families (not necessarily Q-Gorenstein nor an isolated singularity) of rigid toric varieties throughout this paper.
1.3. Studying rigidity in terms of graphs
It suffices for our purposes to assume that G⊆Km,n is a connected bipartite graph. This has the following reason: if G=G1⊔G2⊂Km,n is not connected, then one calculates the edge cones σG1∨⊆MQ1 and σG2∨⊆MQ2 for the connected components G1 and G2 and obtains σG∨=σG1∨+σG2∨⊆MQ1⊕MQ2. Hence, the associated toric variety is simply TV(G)=TV(G1)×TV(G2). If one of these toric varieties is not rigid, then TV(G) is also not rigid. If every connected component of G yields a rigid associated toric variety, then TV(G) is rigid.
The first attempt on investigating the rigidity of TV(G) has been done in [BHL(15)] where one considers the connected bipartite graph G⊊Kn,n with one edge removed from the complete bipartite graph Kn,n. Here n denotes the number of vertices of the disjoint sets of Kn,n. They prove in Proposition 7.1 that TV(G) is rigid for n≥4 and TV(G) is not rigid for n=3. The proof is done by techniques from commutative algebra which we do not utilize.
In order to apply the constructions in Section 3.1, we first describe the edge coneσG associated to the toric variety TV(G). A characterization for the extremal ray generators of the edge cone σG was given by C.H. Valencia and R.H. Villarreal in [VV(05)]. In Theorem 2.8, we refine this approach and present a one-to-one correspondence between the set of extremal ray generators of the cone σG and the so-called first independent sets. The advantage of using this approach is that we are able to determine the faces of σG. For this, one defines a spanning subgraph G{A}⊆G associated to the first independent set A. In Theorem 2.18, we prove that a set S of d first independent sets, equivalently a set of d extremal rays of σG, spans a face of dimension d if and only if ⋂A∈SG{A} has d+1 connected components. In particular, we describe the supporting hyperplane of a face by the degree sequence of this intersection graph.
This result allows us to prove that TV(G) is smooth in codimension 2 (Theorem 3.8). We provide a detailed exposition of three dimensional faces of σG in Section 3.3 motivated by Theorem 3.3. In particular, we determine when the edge cone σG admits a non-simplicial three-dimensional face (Theorem 3.17). In that case, we prove the following.
Let G⊆Km,n be a connected bipartite graph. Assume that the edge cone σG admits a three-dimensional non-simplicial face. Then TV(G) is not rigid.
As an application to the general investigation of the rigidity of TV(G) in Section 3, we present the characterization of rigid affine toric varieties TV(G), where G has exactly one two-sided first independent set C=C1⊔C2. In other words, we consider the connected bipartite graphs G⊂Km,n where we remove all the edges between two vertex sets ∅=C1⊊U1 and ∅=C2⊊U2. Here, U1 and U2 denote the disjoint sets of the bipartite graph G. For the case where ∣C1∣=1 and ∣C2∣=1, we recover the result in [[BHL(15)] Proposition 7.1] without the assumption of m=n.
Let G⊊Km,n be a connected bipartite graph with exactly one two-sided first independent set C∈IG(1). Then
(1)
TV(G)* is not rigid, if ∣C1∣=1 and ∣C2∣=n−2 or if ∣C1∣=m−2 and ∣C2∣=1.*
2. (2)
TV(G)* is rigid, otherwise.*
Throughout this work, many examples have been checked using the software Polymake [GJ(00)] and the computer algebra system Singular [DGPS(15)]. In [Por(19)], we present the function which takes as an input the dual edge cone and outputs the information about rigidity of the associated toric variety. In particular it draws the representative picture of the crosscut for any given deformation degree R∈M.
The edge ideals IG for finite connected graphs having no loop and no multiple edge were studied in [HO(99)]. They are characterized explicitly in terms of primitive even closed walks and in particular of cycles without a chord in the bipartite case. Throughout this paper, we focus on the bipartite case and investigate the corresponding edge cones. Let G⊆Km,n be a connected bipartite graph and denote its disjoint sets by U1 and U2. We label the vertices in U1 as {1,…,m} and the vertices in U2 as {m+1,…,m+n}. Let ei denote a canonical basis element of Zm×0 and fj denote a canonical basis element of 0×Zn. By construction of the edge ideal, one obtains that the dual edge cone σG∨ is generated by the ray generators ei+fj∈Zm+n, for {i,j}∈E(G).
Proposition 2.1**.**
Let G⊆Km,n be a connected bipartite graph. Then the dimension of the dual edge cone σG∨ is m+n−1.
Proof.
Let AG be the (incidence) matrix whose columns are the ray generators of σG∨. Suppose that x∈Qm+n is an element of coker(AG). Then xi+xj=0 whenever there is a path from vertex i to vertex j. Since G is connected, we obtain that the corank of AG is at most one. However the rows of AG are linearly dependent and therefore the rank of AG is smaller than or equal to m+n−1. It follows that dimσG∨=m+n−1.
∎
Remark 1**.**
If G is not a tree, then the generators of the dual edge cone σG∨ in Qm+n are linearly dependent. The relations are formed by the cycles without a chord of G. If G is a tree, σG∨ has m+n−1 generators. In both cases, the dual cone σG∨ is not a full dimensional cone in the vector space Qm+n. Equivalently, the edge cone σG⊆Qm+n is not strongly convex.
We calculate (σG∨)⊥ as
[TABLE]
The one-dimensional subspace (σG∨)⊥ is the minimal face of σG⊆Qm+n. We denote it by (1,−1). Hence we consider the cone σG/(1,−1)⊆Qm+n/(1,−1) which is a strongly convex polyhedral cone. Therefore we set the lattices we use for the edge and dual edge cone as follows:
[TABLE]
We denote their associated vector space as NQ:=N⊗ZQ and MQ:=M⊗ZQ. In order to distinguish the elements of these vector spaces, we denote the ones in NQ by normal brackets and the ones in MQ by square brackets. For the same reason, we denote the canonical basis elements as ei∈NQ and ei∈MQ. In particular, we follow the notation of [CLS(10)] for cones and toric varieties.
2.2. Description of the extremal rays of an edge cone
We start with certain definitions from Graph Theory. Although these definitions do also work for an arbitrary abstract graph G, we preserve our assumption of G⊆Km,n being connected and bipartite.
Definition 2.2**.**
(1)
A nonempty subset A of V(G) is called an independent set if it contains no adjacent vertices.
3. (2)
The neighbor set of A⊆V(G) is defined as
[TABLE]
4. (3)
The supporting hyperplane of the dual edge cone σG∨⊆MQ associated to an independent set ∅=A is defined as
[TABLE]
Note that since no pair of vertices of an independent set A is adjacent, we obtain that A∩N(A)=∅.
Definition 2.3**.**
(1)
A subgraph of G with the same vertex set as G is called a spanning subgraph (or full subgraph) of G.
3. (2)
Let A⊆V(G) be a subset of the vertex set of G. The induced subgraph of A is defined as the subgraph of G formed from the vertices of A and all of the edges connecting pairs of these vertices. We denote it as G[A] and we have the convention G[∅]=∅.
The next Proposition shows that every facet of σG∨ can be constructed by an independent set satisfying certain conditions. Note that there is a one-to-one correspondence between the facets of σG∨ and the extremal rays of σG. The face τ⪯σG∨ is a facet of σG∨ if and only if τ∗:=τ⊥∩σG is an extremal ray of σG. We will interpret the next result in Theorem 2.8 and give an alternative one-to-one description between the extremal ray generators of σG and certain independent sets. This description allows us to study the faces of σG.
Proposition 2.4**.**
([VV(05)], Proposition 4.1, 4.6)
Let A⊊Ui be an independent set. Then HA∩σG∨ is a proper face of σG∨. In particular, if A⊊U1, then HA∩σG∨ is a facet of σG∨ if and only if G[A⊔N(A)] and G[(U1\A)⊔(U2\N(A))] are connected and their union is a spanning subgraph of G. Furthermore, any facet of σG∨ has the form HA∩σG∨ for some A⊊Ui, i=1 or i=2.
Example 1**.**
Let G⊊K2,2 be the connected bipartite graph with disjoint sets U1={1,2} and U2={3,4} and the edge set E(G)=E(K2,2)\{1,3}. Recall that we have the edge cone σG in NQ≅Q4/(1,1,−1−1)≅Q3 and the dual edge cone σG∨ in MQ≅Q4∩(1,1,−1,−1)⊥≅Q3. The three-dimensional cone σG∨⊂MR is generated by the extremal rays [1,0,0,1], [0,1,1,0] and [0,1,0,1]. The independent sets inducing the facets of σG∨ in Proposition 2.4 are colored in yellow. Here, the independent set {3} is not considered, since we have H{3}∩σG∨=H{1}∩σG∨. The blue color represents the induced subgraph G[(U1\A)⊔(U2\N(A))] and the black color represents the induced subgraph G[A⊔N(A)]. The graphs are labeled by their associated facets of σG∨.
2413G
2413a1
2413a2
2413a3
Let us calculate the facet a1 of σG∨ given by the independent set A1={2}. Equivalently, we calculate the extremal ray generator a1∗ of σG. The supporting hyperplane associated to A1 is HA1={(x1,x2,x3,x4)∈MR∣x2=x3+x4}. Therefore the facet a1 is spanned by [0,1,1,0] and [0,1,0,1]. In the same way, one obtains that a2 is generated by [1,0,0,1] and [0,1,0,1] and a3 is generated by [1,0,0,1] and [0,1,1,0]. Moreover we obtain a1∗=e1, a2∗=e3, and a3∗=e2−e3.
Remark 2**.**
The disjoint sets U1 and U2 of a bipartite graph G⊆Km,n are also independent sets and they induce the dual edge cone itself. For instance, in Example 1, if we consider the independent set U1={1,2}, then we obtain G[{1,2}⊔N({1,2})]=G, i.e. H{1,2}∩σG∨=σG∨. On the other hand, not all faces of the edge cone can be induced by the independent sets A=Ui as in Proposition 2.4. Let us consider the one-dimensional face a1∩a2=⟨[0,1,0,1]⟩≺σG∨. It is represented by the edge {2,4}∈E(G), but there exists no independent set A such that ⟨[0,1,0,1]⟩=HA∩σG∨. It is because one obtains that HU2∩σG∨=σG∨ and H{1}∩σG∨=H{3}∩σG∨=a3.
In order to state our alternative description in Theorem 2.8, we present the central definitions that we need.
Definition 2.5**.**
An independent set A⊊V(G) is called a maximal independent set if there is no other independent set containing it. We say that an independent set is one-sided if it is contained either in U1 or in U2. In a similar way, A=A1⊔A2 is called a two-sided independent set if ∅=A1⊊U1 and ∅=A2⊊U2.
Let us consider the following independent sets:
[TABLE]
Here {∙} stands for a single vertex in Ui.
Definition 2.6**.**
Let G[[A]] be the subgraph of G associated to the independent set A defined as
[TABLE]
We define the associated bipartite subgraphG{A}⊆G to the independent set A as the spanning subgraph G[[A]]\sqcup\big{(}V(G)\backslash V(G[[A]])\big{)}.
Now, we come to our characterization of the independent sets, defining a facet of σG∨.
Definition 2.7**.**
We say that A∈IG(∗) is a first independent set if the associated subgraph G{A} has two connected components. We denote the set of first independent sets by IG(1).
Example 2**.**
Let G⊊K2,2 be the connected bipartite graph from Example 1. We observe that {1}⊔{3} is a two-sided maximal independent set and the associated subgraph G{{1}⊔{3}} is the fourth bipartite graph in Figure 1. Likewise, the second and third graphs are the associated subgraphs G{{2}} and G{{4}} to the one-sided independent sets {2}⊂U1 and {4}⊂U2 which are not contained in any two-sided independent set. Note that all these associated subgraphs have two connected components and thus these independent sets are first independent sets. In particular, we have that G=G{{1,2}}=G{{3,4}}.
Theorem 2.8**.**
There is a one-to-one correspondence between the set of extremal generators of the cone σG and the first independent set IG(1) of G. In particular, the map is given as
[TABLE]
for a fixed i∈{1,2} with Ai=∅.
Note that we preserve the curly notation a:=π(A) for an extremal ray a⪯σG associated to A∈IG(1) for the rest of this paper. We also identify an extremal ray with its primitive ray generator.
This section is devoted to the proof of the one-to-one correspondence between the set of extremal ray generators of σG and the first independent sets of G. For this end, we prove certain combinatorial properties of independent sets and consequently we describe the supporting hyperplane for the extremal ray a by the degree sequence of the graph G{A}.
Proposition 2.9**.**
Let A=A1⊔A2∈IG(∗) be a two-sided maximal independent set. Then, one has N(A2)=U1\A1 and A2=U2\N(A1).
Proof.
Let x∈N(A2). By definition there exists a vertex y∈A2 such that {x,y}∈E(G). Since A is an independent set, x can not be in A1. Conversely, let x∈U1\A1. Since G is connected, there exists a vertex y∈U2 such that {x,y}∈E(G). Suppose that x∈/N(A2). This means that for any a2∈A2, {x,a2}∈/E(G). This implies that x∈A1 by maximality of the independent set A. The other equality follows similarly.
∎
Lemma 2.10**.**
Let A∈IG(∗) be a one-sided independent set not contained in any two-sided independent set. Then N(A) is equal to one of the disjoint sets of G. If HA∩σG∨ is a facet of σG∨, then A=Ui\{ui} for some ui∈Ui. Moreover, one obtains the following equality HA∩σG∨=Hei∩σG∨ where Hei denotes the supporting hyperplane of σG∨ associated to ei.
Proof.
Let A⊊U1 be a one-sided independent set. Suppose that N(A)=U2, then A⊔(U2\N(A)) is a two-sided independent set containing A. Hence, if A is a one-sided independent set not contained in any two-sided independent set, then N(A)=U2. Suppose now that HA∩σG∨ is a facet of σG∨, then the induced subgraph G[(U1\A)⊔(U2\N(A))] consists of isolated vertices. Thus this induced subgraph is connected if and only if ∣A∣=m−1. The supporting hyperplane HA associated to A is
[TABLE]
where xi indicates that xi is omitted.
Since the chosen lattice N=Zm+n/(1,−1), we obtain the equality HA∩σG∨=Hei∩σG∨. In particular Hei is a supporting hyperplane, since Hei+⊃σG∨ or equivalently ei∈σG.
∎
Remark 3**.**
Let A∈IG(∗) be a two-sided maximal independent set. By the equalities from Proposition 2.9, we observe that
[TABLE]
[TABLE]
hold. In particular, the union of induced subgraphs G[A1⊔N(A1)] and G[(U1\A1)∪(U2\N(A1))] is a spanning subgraph. If Ai=Ui\{ui}∈IG(∗), then the union of the induced subgraphs G[Ai⊔N(Ai)] and G[(Ui\Ai)∪(Uj\N(Aj))]=ui is a spanning subgraph of G.
Lemma 2.11**.**
If A=A1⊔A2 is a two-sided independent set and if HA1∩σG∨ is a facet of σG∨, then there exists a maximal two-sided independent set A′=A1⊔A2′∈IG(∗) for some vertex set A2′⊇A2.
Proof.
Assume that the two-sided maximal independent set A′=A1⊔A2′ is not maximal, i.e. there exists a vertex set A1′⊋A1 such that A′′=A1′⊔A2′ is a maximal two-sided independent set. Let v∈A1′\A1 be a vertex. By Proposition 2.4, since HA1∩σG∨ is a facet of σG∨, the induced subgraph G[(U1\A1)⊔(U2\N(A1))]=G[(U1\A1)⊔A2′] must be connected. However v is an isolated vertex in G[(U1\A1)⊔(U2\N(A1))] which is a contradiction.
∎
Remark 4**.**
We observe that there is a symmetry for the supporting hyperplanes for a two-sided maximal independent set A=A1⊔A2∈IG(∗). Recall that the supporting hyperplane associated to a one-sided independent set Ai⊆Ui is defined as
[TABLE]
Assume that x∈HA1∩σG∨. By the definition of HAi and since MQ≅Qm+n∩(1,−1)⊥, it follows that ∑vi∈N(A2)xi=∑vi∈A2xi and hence x∈HA2∩σG∨. Therefore it is enough to consider only one component Ai of the maximal two-sided independent set A=A1⊔A2 for the associated supporting hyperplane.
Example 3**.**
Let G⊊K4,4 be the connected bipartite graph with the edge set E(G)=E(K4,4)\{{1,5},{2,5},{3,5}}. We consider the one-sided independent set A={1,2,3}. Since N(A)={6,7,8}⊊U2, it is contained in a two-sided independent set which is {1,2,3,5}. We observe in the figure below that this two-sided independent set forms a facet τ of σG∨ and it is maximal. Therefore, one obtains that τ=H{1,2,3}∩σG∨=H{5}∩σG∨.
23487615
23487615
23487615
Moreover, the independent sets of form Ui\{∙}∈IG(∗) other than A give the remaining facets of σG∨.
If HA1∩σG∨ is a facet of σG∨, then there exists an independent set A=A1⊔A2∈IG(∗).
For A=A1⊔A2∈IG(∗), the induced subgraphs G[A1⊔N(A1)] and G[A2⊔N(A2)] might be not connected. In the next example, we observe that IG(∗) is a necessary but not a sufficient condition to form a facet. This remark and Proposition 2.13 will be useful for us once we start describing the lower dimensional faces of σG∨ in Section 2.4.
Example 4**.**
Let G⊊K4,4 be as in the figure below. Consider the two-sided maximal independent set A=A1⊔A2={1,2}⊔{5,6}. We obtain that N(A1)={7,8} and N(A2)={3,4}. One can observe that although A={1,2,5,6} is a maximal two-sided independent set, the induced subgraph G[A1⊔N(A1)] is not a connected graph.
23487615
23487615
In the next proposition, we examine the case where G{A} has more than two connected components. We show that these independent sets in fact give rise to certain facets of σG∨.
Proposition 2.13**.**
Let A=A1⊔A2∈IG(∗) be an independent set. Suppose that the induced subgraph G[A1⊔N(A1)] consists of d connected bipartite graphs Gi with vertex sets Xi⊆A1 and N(Xi)⊆N(A1) and the induced subgraph G[(U1\A1)⊔(U2\N(A1))] is connected. Then, for each i∈[d] there exist two-sided maximal independent sets Xi⊔(A2⊔⨆j=iN(Xj)) forming facets of σG∨.
Proof.
We have two cases to examine:
(i) Let A1=U1\{u}. We obtain the two-sided maximal independent sets Xi⊔(⨆j=iN(Xj)). Since G is connected, for each i∈[d], there exists a vertex xi∈N(Xi)⊆N(A1) such that {u,xi}∈E(G). The associated subgraphs G{Xi⊔(⨆j=iN(Xj))} have therefore two connected components. Thus, these maximal independent sets form facets of σG∨.
(ii) Let A=A1⊔A2 be a two-sided maximal independent set. We obtain again the two-sided maximal independent sets Xi⊔(A2⊔⨆j=iN(Xj)). Since G is connected, N(N(A2))⊃A2⊔⋃i∈[k]xi, where xi∈N(Xi). Therefore, the associated subgraphs
G{Xi⊔(A2⊔⨆j=iN(Xj))} have two connected components. Thus, these maximal independent sets form facets of σG∨.
In particular, if A2=∅, one can state the proposition symmetrically with G[A2⊔N(A2)] having d connected components and G[A1⊔N(A1)] being connected.
∎
Example 5**.**
Consider the graph G⊊K4,4 from Example 4 and the maximal two-sided independent set A={1,2,5,6}. The induced subgraph G[A2⊔N(A2)] is connected. The two connected bipartite graphs of G[A1⊔N(A1)] have the vertex sets X1⊔N(X1):={1}⊔{8} and X2⊔N(X2):={2}⊔{7}. Hence, we obtain the following two-sided maximal independent sets forming facets of σG∨: A′:=X1⊔A2⊔N(X2)={1,5,6,7} and A′′:=X2⊔A2⊔N(X1)={2,5,6,8}. We see in the figure below that their associated subgraphs have two connected components while G{A} has three connected components. In particular, we will observe in Example 7 that (HA1∩σG∨)∗ is actually a two-dimensional face of σG.
By Theorem 2.12 and Proposition 2.4, the map π is surjective. Let A=A1∈IG(1) be a one-sided and B∈IG(1) be a two-sided first independent set. Suppose that we have the equality (HA1∩σG∨)∗=(HB1∩σG∨)∗. Then a=ei for some i∈[m] by Lemma 2.10 with A1=U1\{i}. Since A1 is not contained in any two-sided independent set, B1=A1. Assume that B1⊇{i} or B1⊊A1, then ei+fj∈HB1∩σG∨ but not in HA1∩σG∨ where m+j∈N(B1) or m+j∈B2 respectively. Thus A and B are either both one-sided or both two-sided. If they are both one-sided, then A=B. Let both of them be two-sided and assume that we have A1=N(B2) and B2=N(A1) and that N(N(B2))=B2 and N(N(A1))=A1. This means that G is not connected. Therefore, we obtain that A=B.
∎
One may also describe the supporting hyperplane for the extremal ray a=π(A) by the degree sequence of the graph G{A}.
Definition 2.14**.**
The degree (valency) sequence of a graph G⊆Km,n is the (m+n)-tuple of the degrees (valencies) of its vertices. Let A∈IG(1) be a first independent set. We denote the degree sequence of the associated subgraph G{A} by Val(A)∈σG∨∩M. We denote the supporting hyperplane of σG⊆NQ for m∈σG∨ as
[TABLE]
Proposition 2.15**.**
The extremal ray generators of the cone σG∨ for a bipartite graph G form the Hilbert basis of σG∨.
Proof.
See [[VV(05)], Lemma 3.10]. The notation R+A used in this paper is σG∨⊆M⊗ZR in our context. Also, NA stands for the semigroup generated by the generators of σG∨ with nonnegative integer coefficients.
∎
Theorem 2.16**.**
Let A∈IG(1) be a first independent set. Then, the extremal ray generators of the facet π(A)∗=a∗≺σG∨ are exactly the extremal ray generators of σG{A}∨. Moreover, one obtains that a=(HAi∩σG∨)∗=HVal(A)∩σG.
Proof.
Let a∗=HA1∩σG∨≺σG∨ be the facet associated to the first independent set A. Since the extremal rays of σG∨ form the Hilbert basis by Proposition 2.15, the facet a∗ is generated by the extremal rays of σG′∨, where G′ is a subgraph of G. By the definition of the supported hyperplane HA1, the extremal rays of σG{A1}∨ are in the set of extremal ray generators of a∗. If A is two-sided, then σG{A2}∨ is also included in a∗. These are the only extremal ray generators of a∗. To show this, we examine the edges in E(G)\E(G{A}) in two cases:
∙ If A=U1\{i} is one-sided, then for j∈[m], ei+fj∈M is not in the generator set of a∗.
∙ If A=A1⊔A2 is two-sided, then the remaining rays ei+fj for i∈N(A2) and j∈N(A1) with {i,j}∈E(G) are not in the generator set of a∗.
By construction, Val(A)∈σG∨∩M. We have a=HVal(A)∩σG if and only if Val(A)∈Relint(a∗). Since we chose Val(A)∈σG∨ to be the sum of the generators of the facet a∗, we obtain that Val(A)∈Relint(a∗).
∎
Example 6**.**
Let us recall the graph G from Example 3. The one-sided first independent sets are in form Ui\{v} for i∈{1,2} with v=4. Consider the only two-sided first independent set A={1,2,3,5}. The facet a∗ is generated by the generators of σG{A}∨ where G{A} is the third bipartite graph in Figure 2. We calculate Val(A)=[3,3,3,1,1,3,3,3]∈σG∨ and obtain that a=HVal(A)∩σG=e4−f1∈σG.
2.4. Description of the faces of an edge cone
In Section 3.1, we remark that one needs to study the compact edges and compact 2-faces of the cross-cut Q(R) for the homogeneous piece TTV(G)1(−R) of the vector space of first order deformations of the toric variety TV(G). Therefore we investigate the combinatorial description of the faces of σG in terms of graphs in this section. We introduce the technique to find the faces of σG by intersecting the induced subgraphs G{A} associated to the first independent sets.
Lemma 2.17**.**
Let G⊆Km,n be a bipartite graph with k connected components. Then dim(σG)=m+n−1 and dim(σG∨)=m+n−k.
Proof.
Recall that by Proposition 2.1, if G is connected, then the rank of the incidence matrix AG is m+n−1. Suppose that G has k connected components Gi. Then the incidence matrix AG is
[TABLE]
Therefore the rank of AG, i.e. dimension of the dual edge cone is m+n−k. Furthermore, since σG∨ contains no linear subspace, the edge cone σG⊆NQ is full dimensional and hence dim(σG)=m+n−1.
∎
Theorem 2.18**.**
Let S⊆IG(1) be a subset of d first independent sets and let π be the bijection from Theorem 2.8. The extremal ray generators π(S) span a face of dimension d if and only if the dimension of the dual edge cone of the spanning subgraph G[S]:=⋂A∈SG{A} is m+n−d−1, i.e. G[S] has d+1 connected components. In particular, the face is equal to HValS∩σG where ValS is the degree sequence of the graph G[S].
Proof.
By Theorem 2.8, if A∈S, then the associated facet a∗⪯σG∨ is generated by the extremal ray generators of σG{A}∨. Hence, intersecting these induced subgraphs G{A} is equivalent to intersecting the extremal ray generators of the facets. Every face of σG∨ is the intersection of the facets it is
contained in. This intersection forms a face τ of σG (and therefore a face of σG∨) since we have:
[TABLE]
where ValS∈Relint(σG[S]∨)⊊σG∨. By Lemma 2.17, dim(σG∨)=dim(σG)=m+n−1. Thus, the dimension of τ is d if and only if the dimension of τ∗ is m+n−d−1. Hence, this means that the dimension of the cone σG[S]∨ is m+n−d−1.
∎
Corollary 2.19**.**
Let τ:=HValS∩σG⪯σG be a face of dimension d which is given by the intersection of subgraphs formed by a subset S⊊IG(1) where ∣S∣≥d. If G[S]⊂G{A′} for some A′∈IG(1)\S, then the associated extremal ray generator a′ is also included in the extremal ray generators of the face τ.
Proof.
It follows from Theorem 2.18 by dropping the condition of S consisting of d elements and from the fact that every face is an intersection of facets it is contained in.
∎
Proposition 2.20**.**
The maximal independent sets of Proposition 2.13 form d-dimensional faces τ⪯σG. Moreover τ=(HA1∩σG∨)∗.
Proof.
Let Ci denote the two-sided maximal independent sets Xi⊔(A2⊔⨆j=iN(Xj)) for i∈[d]. By Theorem 2.18, the dual edge cone of the intersection subgraph ⋂i∈[d]G{Ci} is m+n−d−1. Furthermore, since ⋂i∈[d]G{Ci}=G{A}, one obtains that
[TABLE]
∎
Proposition 2.21**.**
Let A be an independent set of V(G). Then τ=HVal(A)∩σG is a d-dimensional face of σG where m+n−d−1=dim(σG{A}∨).
We examine the two and three-dimensional faces of σG for G⊊K4,4 from Example 4. We use the notation from Theorem 2.8. The edge cone σG is generated by the extremal ray generators e1,e2,e3,e4,f1,f2,a′,a′′. From the figure in Example 5, we observe that G{A}=G{A′}∩G{A′′}, thus (HA1∩σG∨)∗ is a two-dimensional face spanned by a′ and a′′. Furthermore, we see that the intersection of the associated subgraphs G{A′}∩G{A′′} with another associated subgraph to an extremal ray of σG has four connected components. The only pair of extremal rays which does not span a two-dimensional face of σG is {e3,e4}. One can infer this in Figure 4 below: The intersection G{U1\{3}}∩G{U1\{4}} has the edge set consisting of only two edges {1,8} and {2,7}. This implies that any triple of extremal ray generators containing {e3,e4} does not span a three-dimensional face of σG. In particular by Proposition 2.21, for the independent set {1,2} we obtain a five-dimensional face of σG, since G{{1,2}} has six connected components as seen in the figure. More precisely this five-dimensional face is spanned by e3,e4,f1,f2,a′ and a′′, as G{{1,2}} contains the associated subgraphs of these extremal rays. Lastly, a computation on the intersection of associated subgraphs shows that any triple not containing both e3 and e4 spans a three-dimensional face of σG.
23487615G
23487615G{U1\{3}}
23487615G{U1\{4}}
23487615G{{1,2}}
3. On the classification of the general case
This section starts with preliminaries about deformation theory and in particular the technique which we utilize for affine toric varieties. This motivates us to provide a detailed exposition of two and three-dimensional faces of the edge cone σG for a connected bipartite graph G. Using the tools from Section 2, we prove that the toric variety TV(G) is smooth in codimension 2 in Theorem 3.8. Next, we prove that the non-simplicial three-dimensional faces of an edge cone are generated exactly by four extremal ray generators in Theorem 3.17. Then, we conclude that the toric varieties associated to the edge cones having non-simplicial three-dimensional faces are not rigid in Theorem 3.18. Moreover, we characterize the bipartite graphs whose edge cones have only simplicial three-dimensional faces through Section 3.3. In this case, we determine its two and three-dimensional faces and we focus on its non 2-faces pairs and non 3-faces triples. However, in the general setting, it may be challenging to predict the faces of σG. We observe this more detailed in Example 14.
3.1. Deformation Theory
A deformation of an affine algebraic variety X0 is a flat morphism π:X⟶S with 0∈S such that π−1(0)=X0, i.e. we have the following commutative diagram.
X_{0}$$\mathcal{X}[math]S$$\pi
The variety X is called the total space and S is called the base space of the deformation. Let π:X⟶S and π′:X′⟶S be two deformations of X0. We say that two deformations are isomorphic if there exists a map ϕ:X⟶X′ over S inducing the identity on X0. Let A be an Artin ring where S=Spec(A). For an affine algebraic variety X0, one has a contravariant functor DefX0 such that DefX0(A) is the set of deformations of X0 over S=Spec(A) modulo isomorphisms.
Definition 3.1**.**
The map π is called a first order deformation of X0 if S=Spec(C[ϵ]/(ϵ2)). We set TX01:=DefX0(C[ϵ]/(ϵ2)).
The variety X0 is called rigid if TX01=0. This implies that a rigid variety X0 has no nontrivial infinitesimal deformations. This means that every deformation π∈DefX0(A) over an Artin ring A is trivial i.e. isomorphic to the trivial deformation X0×S⟶S.
From now on, let X0 be an affine normal toric variety. We refer to the techniques which are developed in [Alt(00)] in order to describe the C-vector space TX01. The deformation space TX01 is multigraded by the lattice elements of M, i.e. TX01=⨁R∈MTX01(−R). We first set some definitions in order to define the homogeneous part TX01(−R). Then, we introduce the formula of TX01 for when X0 is smooth in codimension 2.
Let us call R∈M a deformation degree and let σ⊆NQ be generated by the extremal ray generators a1,…,an. We consider the following affine space
[TABLE]
We define the crosscut of σ in degree R as the polyhedron Q(R):=σ∩[R=1] in the assigned vector space [R=0]:={a∈NQ∣⟨R,a⟩=0}⊆NQ. It has the cone of unbounded directions Q(R)∞:=σ∩[R=0] and the minimal convex compact part Q(R)c such that Q(R)c+Q(R)∞=Q(R) holds. The minimal convex compact part Q(R)c is generated by the vertices ai:=ai/⟨R,ai⟩ where ⟨R,ai⟩≥1. An useful observation is that ai is a lattice vertex in Q(R) if ⟨R,ai⟩=1. Note that in the next definition, there is a choice of an orientation included in regarding edges in Q(R) as elements of R⊥.
Definition 3.2**.**
(i)
Let d1,…,dN∈R⊥⊂NQ be the compact edges of Q(R). The vector ϵˉ∈{0,±1}N is called a sign vector assigned to each two-dimensional compact face ϵ of Q(R) defined as
[TABLE]
such that ∑i∈[N]ϵidi=0, i.e the oriented edges ϵidi form a cycle along the edges of the face ϵ⪯Q(R). We choose one of both possibilities for the sign of ϵ.
(ii)
For every deformation degree R∈M, the related vector space V(R) is defined as
[TABLE]
Example 8**.**
Let us consider the cone over a double pyramid P over a triangle in N≅Z4 with extremal ray generators a1=(0,1,0,1), a2=(1,0,0,1), a3=(−1,−1,0,1), a4=(0,0,1,1) and a5=(0,0,−1,1). For the deformation degree R1=[1,1,1,1]∈M, we obtain the compact part Q(R1)c as a two-dimensional face ϵ generated by a1, a2, and a4. We choose the sign vector ϵˉ=(1,1,1) to this two-dimensional face and we obtain the elements of V(R1) as tˉ=(t,t,t). Now let us consider the deformation degree R2=[0,1,0,1]∈M. Then Q(R1)c consists of two two-dimensional faces ϵ and ϵ′=conv(a1,a2,a5) where a1,a2 is a common edge of both ϵ and ϵ′. Up to a fixed labelling of the compact edges, we choose the sign vectors as ϵ=(1,1,1,0,0) and ϵ′=(0,0,1,1,1). Hence we obtain that V(R2) is a one-dimensional vector space generated by (1,1,1,1,1).
If the affine normal toric variety X0 is smooth in codimension 2, then TX01(−R) is contained in V(R)/C(1,…,1). Moreover, it is built by those vectors tˉ satisfying tij=tjk where aj is a non-lattice common vertex in Q(R) of the edges dij=aiaj and djk=ajak. Thus, TX01(−R) equals the set of equivalence classes of those Minkowski summands of R≥0.Q(R) that preserve up to homothety the stars of non-lattice vertices of Q(R).
Here, a polyhedron P is called a Minkowski summand of R≥0.Q(R) if there is a P′ such that R≥0Q(R)=P+P′, where P and P′ have the same cone of unbounded directions. The star of a vertex v∈Q(R) is defined as the set of faces having v as a face. In general, if the toric variety X0 is not smooth in codimension 2, then the homogeneous piece TX01(−R) consists of elements of V(R)⊕W(R)/C(1,1) satisfying certain conditions ([Alt(00)], Theorem 2.7). Here the vector space W(R) is equal to R#(non-lattice vertices of Q(R)).
Example 9**.**
Let us consider the cone σ⊆NQ over P as in Example 8. The two dimensional faces of σ are all the pairs of generating rays except {a4,a5}. These are all smooth and hence TV(σ) is smooth in codimension 2. For the deformation degrees R1 and R2, by Theorem 3.3, we obtain that TTV(σ)(Ri)=0 for i=1,2. Note that the three dimensional faces of σ are all simplicial by construction. In particular one observes that the only cross-cut Qc(R) with TTV(σ)(−R)1=0 consists of compact edges ai,a4 and ai,a5 for i=1,2,3 and ai is a lattice vertex. Since no such R∈M exists, TV(σ) is a rigid toric variety.
Remark 5**.**
Let us consider the cone σ′ generated by b1=(1,0,0,1), b2=(1,1,1,−1), b3=(0,1,0,0), b4=(0,0,1,0) and b5=(1,0,0,0). It is combinatorially equivalent to σ from Example 8, i.e. their face lattices are isomorphic. However for the deformation degree R=[1,0,0,0], Q(R)c consists of compact edges b1,b5 and b2,b5 where b5 is a lattice vertex. Hence TTV(σ′)1(−R)=0 and TV(σ′) is not rigid. Therefore, we emphasize the importance of calculating Q(R) for each deformation degree R∈M than just its combinatorial structure.
Remark 6**.**
The following two cases in Figure 6 will appear often while we study rigid toric varieties. The first figure was in particular studied in Example 8. For the second figure let ϵ1,ϵ2⪯Q(R) be the compact 2-faces connected by the vertex a. As in the previous case we obtain that t1=t2=t3 and t4=t5=t6. By Theorem 3.3, if a is a non-lattice vertex, then we obtain that t3=t4. We note also that there are pairs of vertices of Q(R) where their convex hull is not contained in Q(R). This implies that the corresponding pair of extremal rays do not form a two dimensional face. We call these pairs of extremal rays non 2-faces and we focus on these in the proofs for rigidity.
Moreover we will refer to these two cases by “t is transferred by an edge or a vertex” during the investigation of the skeleton of Q(R).
3.2. The two-dimensional faces of the edge cone
We investigate here all possible types of pairs of first independent sets. Our aim is to find necessary and sufficient graph theoretical conditions for the pairs of extremal rays to span a two-dimensional face of σG. We will also use these results to prove that TV(G) is smooth in codimension 2. We introduce the notation for the tuples of first independent sets forming d-dimensional faces analogously to IG(1) as in the following definition.
Definition 3.4**.**
A tuple from the first independent set IG(1) is said to form a d-dimensional face, if their associated tuple of extremal ray generators of σG under the map π of Theorem 2.8 forms a d-dimensional face of σG. We denote the set of these tuples by IG(d).
Denote the set of d-dimensional faces of σG as σG(d). Recall that we have the following one-to-one correspondence by Theorem 2.18 as follows:
[TABLE]
where t≥d and ⋂i∈[t]G{Ii} has d+1 connected components.
We label the first independent sets IG(1) as in three types: A=U1\{a}, B=U2\{b} and the two-sided maximal independent set C=C1⊔C2.
Let A=U1\{a}, A′=U1\{a′} and B=U2\{b} be first independent sets.
(1)
(A,A′)∈IG(2)* if and only if G[A∩A′] is connected.*
2. (2)
(A,B)∈IG(2)* if and only if G[A⊔B] is connected.*
Proposition 3.6**.**
Let A=U1\{a} and C=C1⊔C2 be first independent sets. One obtains that (A,C)∈IG(2) if and only if one of the three following conditions is satisfied.
(1)
A∩C1=∅* and C2=U2\{∙}.*
2. (2)
C1⊊A* and G[C2⊔(N(C2)\{a})] is connected.*
3. (3)
N(C2)⊊A* and G[(C1\{a})⊔N(C1)] is connected.*
Proof.
Assume A∩C1=∅, i.e. C1={a}. Then the graph G{A}∩G{C} has the isolated vertex set C1⊔N(C1). In this case, (A,C)∈IG(2) if and only if C2=U2\{b} for some vertex b∈U2. This implies in particular that U2\{b}∈/IG(1). Now let us consider the case where A∩C1=∅. Since A=U1\{a}, it is either C1⊊A or N(C2)⊊A. We now prove (2), the case (3) follows symmetrically. We require the intersection subgraph G[A]∩G[C] to have three connected components. Since it consists of G[C1]⊔(G[A]∩G[C2]), and a is an isolated vertex, G[C2⊔(N(C2)\{a})] must be connected.
∎
Example 10**.**
Let us consider the bipartite graph G⊂K5,4 as in Figure 7. We observe the existence of two two-sided first independent sets C={3}⊔{6,7} and C′={1,2}⊔{8,9}. Let A=U1\{4} and A′=U1\{5}. Since G[A∩A′] has two connected components, (A,A′)∈/IG(2). In particular, we obtain that (A,A′,C,C′)∈IG(3). Since we have that A∩C1=∅ and C2=U2\{8,9}, (A,C)∈/IG(2). On the other hand (A′,C)∈IG(2), since {3}⊂A′ and the induced subgraph G[{6,7}⊔{1,2,5}] is connected.
234598716G
234598716G{C}
234598716G{C′}
234598716G{A∩A′}
The pairs of type (C,C′)
We would like to consider the possible pairs of two-sided first independent sets, which we denote by C=C1⊔C2 and C′=C1′⊔C2′. Suppose that C1⊊C1′. Then C1⊔C2∪C2′ is also a two-sided independent set strictly containing C, unless C2′⊊C2. By the maximality condition on C and C′, it is impossible that C1=C1′ or C2=C2′. By the connectivity assumption on G, it is impossible that C1∪C1′=U1 and C2∪C2′=U2. Consequently, under the conditions where C1=C1′ or C2=C2′, and C∪C′=U1⊔U2, one obtains five types of pairs of (C,C′):
Type (i): C1⊊C1′ and C2′⊊C2.
Type (ii): C1∩C1′=∅ and C2∩C2′=∅.
Type (iii): C1∩C1′=∅ and C2∩C2′=∅.
Type (iv): C1∩C1′=∅ and C2∩C2′=∅.
Type (v): C1∩C1′=C1=C1′=∅ and C2∩C2′=C2=C2′=∅.
We investigate the 2-face conditions by following these types in the following Lemma.
Lemma 3.7**.**
Let C and C′ be two-sided first independent sets with C=C1⊔C2 and C′=C1′⊔C2′. Then (C,C′)∈IG(2) if and only if it is one of the following types:
(1)
C1⊊C1′* and C2′⊊C2, where G[(C1′\C1)⊔(C2\C2′)] is connected.*
2. (2)
C1⊔C1′=U1\{∙}* and C2⊔C2′=U2 or C2⊔C2′=U2\{∙} and C1⊔C1′=U1.*
3. (3)
C1∩C1′=∅* and C2∩C2′=∅, where G[C1∩C1′] is connected with N(C1∩C1′)=U2\(C2⊔C2′) and C1∪C1′=U1.*
4. (4)
C1∩C1′=∅* and C2∩C2′=∅, where G[C2∩C2′] is connected with N(C2∩C2′)=U1\(C1⊔C1′) and C2∪C2′=U2.*
Proof.
The pair (C,C′) forms a 2-face of σG if and only if G{C}∩G{C′} has three connected components. We would like to divide the proof into five types which we introduced just before the statement of this Lemma. For the related intersection subgraph G{C}∩G{C′}, we must calculate four intersections:
Type (i): (C1⊊C1′ and C2′⊊C2). One obtains two connected subgraphs \bf G_{1}$$=\operatorname{G}\{C_{1}\} and \bf G_{2}$$=\operatorname{G}\{C^{\prime}_{2}\}. The graph G3 is empty, since C1\C1′=∅ and C2′\C2=∅. The subgraph G4 is not empty. Assume that G4 has an isolated vertex u∈C1′\C1. Then C1⊔{x}⊔C2 is an independent set. This contradicts the fact that C is maximal. Similarly, there exists no isolated vertex in C2\C2′ of the subgraph G4, otherwise C′ is not maximal. However it is possible that G[(C1′\C1)⊔(C2\C2′)] has k≥2 connected components with vertex sets Xi⊊C1′\C1 and Yi⊊C2\C2′, for i∈[k]. This means in particular that for I⊊[k], there exist first independent sets of form CI:=(C1⊔⨆i∈IXi)⊔(C2\⨆i∈IYi). We examine this case in Lemma 3.12.
Type (ii): (C1∩C1′=∅ and C2∩C2′=∅). The subgraphs G1 and G2 are empty. Since C1′⊆U1\C1=N(C2) and C2′⊆U2\C2=N(C1), we obtain that \bf G_{3}$$=\operatorname{G}[C_{1}\sqcup C_{2}^{\prime}] and \bf G_{4}$$=\operatorname{G}[C_{2}\sqcup C_{1}^{\prime}]. Since we cannot have that C1⊔C1′=U1 and C2⊔C2′=U2, there must exist exactly one isolated vertex v such that G{C}∩G{C′}=G3⊔G4⊔{v}. For if not, G{C}∩G{C′} has more than three connected components. Let us suppose for the moment {v}=U1\(C1⊔C1′). Then \bf G_{3}=$$\operatorname{G}[C_{1}\sqcup N(C_{1})] and \bf G_{4}=$$\operatorname{G}[C_{2}\sqcup N(C_{2})] are connected and therefore (C,C′)∈IG(2). It follows similarly if v∈U2\(C2⊔C2′). Note that in these cases, Ui\{v}∈/IG(1).
Type (iii):(C1∩C1′=∅ and C2∩C2′=∅). The subgraph G2 is empty. Assume that C1∪C1′=U1. Then the intersection subgraph G{C}∩G{C′} do not contain U1\(C1∪C1′) as a vertex set. This implies that one must have C1∪C1′=U1 for otherwise G{C}∩G{C′} has at least four connected components. The subgraphs \bf G_{3}$$=\operatorname{G}[(C_{1}\backslash C^{\prime}_{1})\sqcup C^{\prime}_{2}] and \bf G_{4}$$=\operatorname{G}[(C^{\prime}_{1}\backslash C_{1})\sqcup C_{2}] are connected subgraphs. Consequently, (C,C′)∈IG(2) if and only if G[C1∩C1′⊔U2\(C2⊔C2′)] is connected and C1∪C1′=U1. Type (iv) (C1∩C1′=∅ and C2∩C2′=∅) follows similarly to Type (iii).
Type (v): (C1∩C1′=C1=C1′=∅ and C2∩C2′=C2=C2′=∅). Assume that C1∪C1′=U1. Then C2∩C2′=∅ is an isolated vertex set of G. The same holds for the assumption C2∪C2′=U2. This means that we must have C1∪C1′=U1 and C2∪C2′=U2. But, this implies that G{C}∩G{C′} has at least four non-empty connected components.
∎
Example 11**.**
Let us consider the first independent sets C={3}⊔{6,7} and C′={1,2}⊔{8,9} from Example 10. The pair (C,C′) is of Type (ii). But we observe that C1⊔C1′=U1\{4,5}. Hence (C,C′)∈/IG(2).
Now, we utilize the information from Lemma 3.7 in order to give a concise proof for the next theorem.
Theorem 3.8**.**
Let G⊆Km,n be a connected bipartite graph. Then TV(G) is smooth in codimension 2.
Proof.
Recall that N=Zm+n/(1,−1)≅Zm+n−1. Let A,B,C∈IG(1) be types of first independent sets as before. The pairs of one-sided first independent sets are the pairs of the canonical basis of Zm+n. The extremal rays of σG associated to two-sided first independent sets are in form of c=∑i∈U1\C1ei−∑m+j∈C2fj∈N. Consider now the pairs of type (A,C)∈IG(2). Following the conditions from Proposition 3.6 for any i∈N(C2) not equal to a and for any m+j∈N(C1), the set {e1,…,ei^,…,em,f1,…,fj^,…,fn} extends the extremal ray c to a Z-basis of N. Note that if N(C2)={a}, then A\{a}∈/IG(1).
We now consider the pair of two extremal rays {c,c′} associated to two-sided first independent sets C and C′. By Lemma 3.7, there are four cases we should consider:
(1)
{e1,…,ei^,…,ei′^,…,em,f1,…,fj^,…,fn} for some i∈C1′\C1 and i′∈N(C2′), and m+j∈N(C1),
2. (2)
{e1,…,ei^,…,em,f1,…,fj^,…,fj′^,…,fn} for i∈U1\(C1⊔C1′) and for some m+j∈C2, and m+j′∈C2′,
3. (3)
{e1,…,ei^,…,ei′^,…,em,f1,…,fj^,…,fn} for some i∈C1\C1′ and i′∈C1′\C1, and m+j∈N(C1)∩N(C1′),
4. (4)
{e1,…,ei^,…,em,f1,…,fj^,…,fj′^,…,fn} for some i∈N(C2)∩N(C2′) and m+j∈C2\C2′ and m+j′∈C2′\C2
extends the pair {c,c′} to a Z-basis of N.
∎
In Remark 5, for rigidity of a toric variety TV(σ) we have seen that, it is not sufficient that all 3-faces of σ are simplicial. However, from the next proposition we conclude in Theorem 3.18, as soon as σG has a non-simplicial three-dimensional face, TV(G) is not rigid.
Proposition 3.9**.**
Let TV(σ) be an affine normal toric variety. Assume that τ is a face of σ and TV(τ) is not rigid. Then TV(σ) is also not rigid.
Proof.
Let m∈σ∨ and let τ=Hm∩σ be a face of σ. Since TV(τ) is not rigid, there exists a deformation degree R∈M such that TTV(τ)1(−R)=0. Let us set another deformation degree R′=R−k.m∈M for some positive integer k≫0. Since −m∈R evaluates negative on σ\τ, we obtain that the compact part of Q(R′) consists of the face τ. Therefore TTV(σ)1(−R′)=TTV(τ)1(−R)=0.
∎
3.3. The three-dimensional faces of the edge cone
Since the toric variety TV(G) is smooth in codimension 2, we can now apply Theorem 3.3 to pursue our investigation on the rigidity of TV(G). Also with the motivation of Proposition 3.9 we first investigate the non-simplicial three-dimensional faces τ⪯σG. There exists a pair of extremal ray generators of τ which does not form a two-dimensional face. Therefore, we treat the pairs of first independent sets which do not form a two-dimensional face and which are contained in the set of extremal ray generators of a three dimensional face. By using Corollary 2.19 and the 2-face conditions from Section 3.2, we conclude that non-simplicial three-dimensional faces of σG are generated exactly by four extremal ray generators in Theorem 3.17. In addition in Lemma 3.12 we prove that if the pair of first independent sets of Type (i) does not form a 2-face, then the associated toric variety is not rigid.
Lemma 3.10**.**
Let A=U1\{a}∈IG(1) and A′=U1\{a′}∈IG(1). Assume that {a,a′} forms part of the extremal ray generators of a three-dimensional face of σG.
(1)
If (A,A′)∈IG(2), then the three-dimensional face is simplicial.
2. (2)
If (A,A′)∈/IG(2), then either
(i)
(A,A′,B,C)∈IG(3), where B=U2\{b}∈IG(1) and C=(A∩A′)⊔{b}∈IG(1) or
2. (ii)
(A,A′,C,C′)∈IG(3), where C1⊔C1′=A∩A′ and C2⊔C2′=U2.
Proof.
(1) The subgraph G{A∩A′} has three connected components. Let B=U2\{b}. We first investigate the intersection subgraph G{A}∩G{A′}∩G{B}. By assumption, the dimension of its dual edge cone must be m+n−4. Therefore, the intersection subgraph has four connected components with three isolated vertices a,a′ and b. Hence (A,B),(A′,B)∈IG(2). The fact that (A,A′,A′′)∈IG(3) is similarly obtained. Let C∈IG(1). We next investigate the intersection subgraph G{A}∩G{A′}∩G{C}. It has by assumption four connected components with at least two isolated vertices, a and a′. If C1={a} and C2=U2\{∙} then the intersection subgraph has three isolated vertices. In this case by Proposition 3.6, (A,C),(A′,C)∈IG(2). For the other cases G{A}∩G{C} and G{A′}∩G{C} have three connected components with one isolated vertex, i.e. (A,C),(A′,C)∈IG(2). Therefore (A,A′,C)∈IG(3).
(2) The intersection subgraph G{A}∩G{A′} has four connected components. Since a,a′∈U1 are isolated vertices of this graph, the proof falls naturally into two parts:
(i) G{A}∩G{A′} has an isolated vertex b∈U2 and G[(A∩A′)⊔(U2\{b})] is connected. Since G, G[A⊔N(A)], and G[A′⊔N(A′)] are connected, we obtain the following first independent set C:=(A∩A′)⊔{b}∈IG(1). Also, since G[(A∩A′)⊔(U2\{b})] is connected, then G[U2⊔B] is connected, i.e. B:=U2\{b}∈IG(1). We observe in particular that (A,B),(A′,B),(A,C),(A′,C)∈IG(2). Hence, we obtain (A,A′,B,C)∈IG(3). In particular, in the case where G=K2,2, the first independent set C={b} and therefore we obtain the edge cone σK2,2 as the non-simplicial 3-face.
(ii) G[(A∩A′)⊔U2] has two connected components with no isolated vertices. Let us denote the vertex sets as X1⊔X2=A∩A′ and Y1,⊔Y2⊊U2 where G[X1⊔Y1] and G[X2⊔Y2] are connected. Since G{A} and G{A′} have two connected components, there exist edges {a,y1},{a,y2},{a′,y1′},{a′,y2′}∈E(G) for some vertices y1,y1′∈Y1 and y2,y2′∈Y2. Thus C:=X1⊔Y2∈IG(1) and C′:=X2⊔Y1∈IG(1). By Lemma 3.7(2), we know that (C,C′)∈/IG(2) and by Lemma 3.6(2), we know that (A,C),(A,C′),(A′,C),(A′,C′)∈IG(2). Hence, we obtain that (A,A′,C,C′)∈IG(3).
∎
Lemma 3.11**.**
Let A=U1\{a}∈IG(1) and B=U2\{b}∈IG(1). Assume that {a,b} forms part of the extremal generators of a three-dimensional face of σG.
(1)
If (A,B)∈IG(2) then the three-dimensional face is either
(i)
the non-simplicial one from ** Lemma 3.10* (2)$$\operatorname{(i)} or*
2. (ii)
(A,B,C,C′)∈IG(3), with C1\C1′={a} and C2′\C2={b} or C1′\C1={a} and C2\C2′={b} or
3. (iii)
simplicial.
2. (2)
If (A,B)∈/IG(2), then (A,B,C,C′)∈IG(3), where C1⊔C1′=A and C2⊔C2′=B.
Proof.
(1) The intersection subgraph G{A}∩G{B} has three connected components with two isolated vertices a and b. Analysis similar to the proof of Lemma 3.10(1) shows that (A,A′,B)∈IG(3) and (A,B,B′)∈IG(3). We investigate now the intersection G{A}∩G{B}∩G{C}. If {a}=C1 and b∈N(C1) with N(C1)≥3, then we have that (A,B,C)∈IG(3) unless {b}⊔C1\{a} is an independent set. In this case, we obtain a first independent set C′∈IG(1) with C1\C1′={a} and C2′\C2′={b}. If N(C1)=2, this gives rise to the case (2)(ii) from Lemma 3.10 where (A,A′,B,C)∈IG(3). In the other cases similar to proof of Lemma 3.10, we obtain that (A,B,C)∈IG(3).
(2) The intersection G{A}∩G{B} has of four connected components. This intersection subgraph cannot have four isolated vertices, because this means that we have that G⊆K2,2. We studied these cases in Example 1 and in Theorem 4.3. Assume that the intersection subgraph has three isolated vertices {a,a′,b} and one connected component. This means that a′∩U2\{b} is an independent set. But this contradicts the fact that B∈IG(1). The case with three isolated vertices {a,b,b′} is similarly impossible, because A∈IG(1). Assume lastly that the intersection has two isolated vertices {a,b} and two connected graphs with vertex sets X1⊔X2=A and Y1⊔Y2=B. Since G[A⊔N(A)] and G[B⊔N(B)] are connected, we obtain that C:=X1⊔Y2 and C′:=X2⊔Y1 of Type (ii) and (C,C′)∈/IG(2). We conclude that (A,C),(A,C′),(B,C),(B,C′)∈IG(2) and (A,B,C,C′)∈IG(3).
∎
Example 12**.**
Consider the first independent sets A,A′,C and C′ from Example 10. Since (A,A′)∈/IG(2) and G{A∩A′} has four connected components, we observe that (A,A′,C,C′)∈IG(3) and it is the case from Lemma 3.10 (2)(ii). Let B=U2\{9}∈IG(1). Then we observe that B forms a 2-face with every first independent set except B′=U2\{8}. In that case we have the symmetrical case to Lemma 3.10 (2)(i), namely (B,B′,A′′,C)∈IG(3) with A′′=U1\{3}. In particular, we observe that (A′′,B)∈IG(2) and (A′′,B′)∈IG(2).
The calculation of an intersection of subgraphs associated to three two-sided independent sets can easily become heavily combinatorial. Therefore, by using Lemma 3.7, we would like to eliminate some cases of these two-sided independent sets resulting in a non-rigid toric variety. This will simplify the calculations for three-dimensional faces in Lemma 3.13.
Lemma 3.12**.**
Let C=C1⊔C2∈IG(1) and C′=C1′⊔C2′∈IG(1). If (C,C′)∈/IG(2) is of Type (i), then TV(G) is not rigid.
Proof.
Recall that (C,C′) of Type (i) means that C1⊊C1′ and C2′⊊C2. By Lemma 3.7(1), we infer that if (C,C′)∈/IG(2), then G[(C1′\C1)⊔(C2\C2′)] has k≥2 connected components without isolated vertices. Denote the vertex sets Xi⊊C1′\C1 and Yi⊊C2\C2′, for i∈[k]. Since C∈IG(1), we know that G[C2⊔N(C2)] is connected. Thus, for each i∈[k], we obtain that N(Yi)=Xi⊔Zi where Zi⊆N(C2′). We can use the connectivity argument of G[C1′⊔N(C1′)] symmetrically for each neighborhood vertex set N(Xi). This implies that for a subset I⊊[k], there exist first independent sets of form
[TABLE]
Now let i,j∈[k] and consider the pair (Ci,Cj)∈/IG(2) of Type (v). We calculate the intersection subgraph G{Ci}∩G{Cj} as
[TABLE]
and conclude that it has four connected components. This means that {ci,cj} is contained in the extremal generator set of a 3-face of σG. By Corollary 2.19, we search for first independent sets such that the intersection subgraph G{Ci}∩G{Cj} is a subgraph of their associated subgraph. We observe that G{C} and G{Ci,j} satisfy this condition. Moreover (C,Ci),(C,Cj),(Ci,Ci,j),(Cj,Ci,j)∈IG(2) of Type (i). Hence we obtain the non-simplicial 3-face (C,Ci,Cj,Ci,j)∈IG(3). Let α∈N(C2′) and β∈N(C1) be two vertices and let R=eα+fβ∈M be a deformation degree. Since the associated extremal rays to the tuple (C,Ci,Cj,Ci,j) are all lattice vertices in Q(R), by Proposition 3.9, we conclude that TV(G) is not rigid.
∎
Proposition 3.13**.**
Let C=C1⊔C2∈IG(1) and C′=C1′⊔C2′∈IG(1). Assume that (C,C′)∈/IG(2) and {c,c′} forms part of the extremal generators of a three-dimensional face of σG.
(1)
If (C,C′) is of Type (ii), then one obtains the three-dimensional face either from Lemma 3.10(2)$$\operatorname{(ii)} or from Lemma 3.11(2).
2. (2)
If (C,C′) is of Type (iii), then one obtains either one of the following
(i)
(A,C,C′,C′′)∈IG(3), where C′′=(C1∩C1′)⊔(C2⊔C2′)∈IG(1) and A=C1∪C1′∈IG(1).
2. (ii)
(C,C′,C,C′)∈IG(3), where C1∪C1′=U1, C1⊔C1′=C1∩C1′, C2∩C2′=C2⊔C2′, and C2⊔C2′=U2.
3. (iii)
(B,C,C′,C′′)∈IG(3), where C1∪C1′=U1, C′′=(C1∩C1′)⊔(C2⊔C2′)⊔{b}∈IG(1), and B=U2\{b}∈IG(1).
3. (3)
If (C,C′) is of Type (v), then there exist the first independent sets C:=(C1∩C1′)⊔(C2∪C2′)∈IG(1), C′:=(C1∪C1)⊔(C2∩C2′)∈IG(1) and one obtains that (C,C′,C,C′)∈IG(3).
Proof.
By the assumption, the intersection subgraph G{C}∩G{C′} has four connected components.
(1) The intersection subgraph G{C}∩G{C′} has the following isolated vertices:
[TABLE]
The number of isolated vertices can be at most two. If there is exactly one isolated vertex, we concluded in Lemma 3.7 that (C,C′)∈IG(2). Hence, we conclude that there are two isolated vertices. Assume that N(C2)∩N(C2′)={a,a′} and C2⊔C2′=U2. Since G[C1⊔N(C1)] and G[C1′⊔N(C1′)] are connected, we have that A,A′∈IG(1). We observe that (A,A′)∈/IG(2) and therefore it is the case that we examined in Lemma 3.10(2)$$\operatorname{(ii)}. Assume now that N(C2)∩N(C2′)={a} and N(C1)∩N(C1′)={b}. Similarly to the previous investigation, we have that A,B∈IG(1) and it is the case that we examined in Lemma 3.11(2).
(2) It is impossible that C2⊔C2′=U2, because then C1∩C1′ is a set of isolated vertices in G. We also conclude that U1\(C1∪C1′) has at most one vertex. Assume first that C1∪C1′=U1. In the intersection subgraph G{C}∩G{C′}, there cannot be isolated vertices in C1∩C1′, because this implies that these are isolated vertices in G. Since G[C2⊔N(C2)] and G[C2′⊔N(C2′)] are connected, there are two possibilities for the subgraph G[(C1∩C1′)⊔(N(C1)⊔N(C1′))]:
∙ The subgraph G[(C1∩C1′)⊔U2\(C2⊔C2′⊔{b})] is connected. This implies that there exist first independent sets C′′:=(C1∩C1′)⊔C2⊔C2′⊔{b} and B=U2\{b}. Moreover (C,C′′)∈IG(2) and (C′,C′′)∈IG(2) are of Type (i) and (B,C′′)∈/IG(2).
∙ The subgraph has two connected components and no isolated vertices. Let us denote their vertex sets as Xi⊊C1∩C1′ and Yi⊊U2\{C2⊔C2′}. Then there exist two first independent sets:
[TABLE]
[TABLE]
We observe that (C,C),(C,C′),(C′,C),(C′,C′)∈IG(2) of Type (i). In particular, (C,C′)∈/IG(2) of Type (iv).
Assume now that U1\C1∪C1′={a}. Then the subgraphs G1, G3, and G4 must be connected. Moreover, there exist two first independent sets C′′:=(C1∩C1′)⊔C2⊔C2′∈IG(1) and A=U1\{a}. We observe that (A,C),(A,C′)∈IG(2) and the pairs (C,C′′),(C′,C′′)∈IG(2) are of Type (i).
(3) One cannot have that C1∪C1′=U1 or C2∪C2′=U2, because otherweise G has isolated vertices. Also, the subgraph Gi must be connected for each i∈[4]. We thus observe that there exist two first independent sets
[TABLE]
[TABLE]
of Type (i). Moreover we have that (C,C),(C′,C),(C,C′),(C′,C′)∈IG(2), but (C,C′)∈/IG(2).
∎
Consider the pair (B,C)∈IG(2) such that {b,c} forms part of the extremal ray generators of a three-dimensional face. We covered all possible triples of the forms (A,B,C) and (B,B,C) in Lemma 3.10 and Lemma 3.11. For the triples of form (B,C,C′), we finished studying the cases where (C,C′)∈/IG(2) in Proposition 3.13. We are left with the task of determining the cases where (C,C′)∈IG(2).
Lemma 3.14**.**
Let B=U2\{b}∈IG(1), C=C1⊔C2∈IG(1) and C′=C1′⊔C2′∈IG(1). Assume that (B,C)∈IG(2), (C,C′)∈IG(2) and {b,c,c′} forms part of the extremal generators of a three-dimensional face of σG. Then the three-dimensional face is either
(1)
(A,B,C,C′)∈IG(3)* from Lemma 3.11(1)(ii) or*
2. (2)
simplicial.
Proof.
Consider the intersection G{C}∩G{C′}. If (C,C′) is of Type (i), without loss of generality let us assume that C1′⊊C1 and C2⊊C2′. For each type of (C,C′)∈IG(2), the induced subgraph G[C2⊔N(C2)] is not empty. If b∈C2, then we obtain that (B,C′)∈IG(2). For the rest, we divide the proof into the four types of the pair (C,C′)∈IG(2):
Type (i): Let b∈C2′\C2. The triple (B,C,C′)∈/IG(2) if and only if C1\C1′={a}. This is the case from Lemma 3.11 (1)(ii). Let b∈N(C1′). We conclude that G[C1′⊔N(C1′)\{b}] is connected and therefore (B,C′)∈IG(2).
Type (ii): Let b∈C2′. Then G[C2′\{b}⊔N(C2′)] is connected, since otherwise B∈/IG(1). Hence (B,C′)∈IG(2). Note that we cannot have that C2⊔C2′⊔{b}=U2, since otherwise B∈IG(1).
Type (iii): Let b∈C2′. Then G[(C2′\{b})⊔(U1\C1′)] is connected and therefore (B,C′)∈IG(2). If b∈U2\(C2⊔C2′), we conclude similarly that (B,C,C′)∈IG(3). Note that as in the case of Type (ii), C2⊔C2′⊔{b}=U2.
Type (iv): Let b∈C2′\C2. Since B∈IG(1), the induced subgraph G[C2′\{b}⊔N(C2′)] is connected. Hence (B,C′)∈IG(2).
∎
Corollary 3.15**.**
Let B=U2\{b}∈IG(1) and C=C1⊔C2∈IG(1). Assume that (B,C)∈/IG(2) and {b,c} forms part of the extremal generators of a three-dimensional face of σG. Then one obtains the non-simplicial three-dimensional face in Lemma 3.10(2)$$\operatorname{(i)} or in Lemma 3.11 or in Proposition 3.13(2)$$\operatorname{(i)} and (iii).
Proof.
We only need to show that there exists no three-dimensional face containing the extremal rays {b,c,c′} where (C,C′)∈IG(2) and (B,C′)∈/IG(2). Consider the intersection G{B}∩G{C} which has four connected components. Since we want to have another c′ in the generator set, we have two possibilities:
∙ If b∈C2, there exist two first independent sets C1 and C2 such that C1∪C11∪C12=U1 and C21⊔C22⊔{b}=C2.
∙ If b∈N(C1), there exist two first independent sets C1 and C2 such that C11⊔C12=C1 and C2∪C21∪C22⊔{b}=N(C1).
However, these have been examined in Proposition 3.13(2)$$\operatorname{(i)} and (iii).
∎
Example 13**.**
Consider the first independent sets B=U2\{9} and C′={1,2}⊔{8,9} from the bipartite graph in Example 10. We observe that (B,C′)∈IG(2) and if {b,c′} forms part of the extremal generators of a three dimensional face, then this 3-face is simplicial by Proposition 3.13. Moreover as studied in Example 11, (C,C′)∈/IG(2) is of Type (ii) and we obtain the case from Proposition 3.13 (1) or equivalently from Lemma 3.10(2)$$\operatorname{(ii)} for the 3-faces containing {c,c′}.
Finally, we are left with characterizing the triples (C,C′,C′′)∈IG(3). The next result, follows by the recent calculations and Lemma 3.7.
Corollary 3.16**.**
Let C, C′ and C′′ be three first independent sets of G. Assume that (C,C′,C′′)∈IG(3) forms a three-dimensional face of σG. Then its two-dimensional faces are one of the following type:
3.4. Non-rigidity for toric varieties with non-simplicial three-dimensional faces
Using the compilations from Section 3.3, we characterize the non-simplicial three-dimensional faces of σG and show that in this case TV(G) is not rigid. After that, we are reduced to proving the rigidity for the toric varieties whose edge cone σG admits only simplicial three-dimensional faces. We classified this type of edge cones explicitly in Section 3.3.
Theorem 3.17**.**
Let G⊆Km,n be a connected bipartite graph and let τ⪯σG be a three-dimensional non-simplicial face of the edge cone σG. Then τ is spanned by four extremal rays.
Let G⊆Km,n be a connected bipartite graph. Assume that the edge cone σG admits a three-dimensional non-simplicial face. Then TV(G) is not rigid.
Proof.
Let G[S]⊊G be the intersection subgraph associated to the non-simplicial three-dimensional face τ generated by π(S) as defined in Lemma 2.18. We have also proven that τ=HValS∩σG, where ValS is the degree sequence of the graph G[S]. Since ValS∈σG∨, the lattice point −ValS evaluates negative on every extremal ray except the extremal ray generators of τ. Hence, we consider the deformation degree R′=R+k(−ValS)∈M for k≫0 where [R,τ]≥1. Thus, the compact part of the crosscut Q(R′) consists of τ. We are now reduced to examine the non-simplicial 3-faces from Lemma 3.10(2)$$\operatorname{(i)},\operatorname{(ii)}, Lemma 3.11(2), and Proposition 3.13. For each case, by Proposition 3.9, it is sufficient to show that there exists a deformation degree R∈M such that the extremal rays π(S) are lattice vertices in R. We find such deformation degrees as following:
(2)(ii): ea+ea′+fb+fb′, where a∈N(C2′), a′∈C1′, b∈C2\(C2∪C2′), and b′∈C′\(C1∪C1′).
(2)(iii): ea+ea′+fb+fb′, where a∈N(C2′), a′∈N(C2), and b′∈U2\C′′.
(3): ea+fb, where a∈N(C2′) and b∈N(C1).
∎
3.5. Examples of pairs of first independent sets not spanning a two-dimensional face
As noted in Remark 6, it is crucial to examine the non 2-faces of σG while investigating the rigidity of TV(G). In the next example, we explain the challenge about using this technique for a general bipartite graph G.
Example 14**.**
Let G⊊Km,n be a connected bipartite graph and let A=U1\{a} and A′=U1\{a′} be two first independent sets. Assume that (A,A′)∈/IG(1) and the edge cone σG does not have any non-simplicial three-dimensional face. By Proposition 3.5 and Lemma 3.10, the induced subgraph G[(U1\{a,a′})⊔U2] has k connected components where k≥3. If this induced subgraph has isolated vertices, say the set Y⊊U2 as in the first figure, then we obtain the maximal independent set (A∩A′)⊔Y. This maximal independent set is not a first independent set, unless G[A∩A′⊔(U2\Y)] is connected. However, even if this induced subgraph is connected, there might exist another first independent set, say C∈IG(1) with C1⊊A∩A′ and C2⊊U2\Y. This possibility makes the investigation iterative and hard to control.
Another possibility is that G[A∩A′⊔(U2\Y)] has more than 2 connected components. This means that there exist disjoint vertex sets Xi⊊A∩A′ and Yi⊊U2\Y where G[Xi⊔Yi] is connected as illustrated in the second figure. Since G{A} and G{A′} have two connected components, we obtain the first independent sets Ci:=Xi⊔(U2\Yi). A pair (Ci,Cj) is of Type (iv) and does not form a 2-face. Let R=ea+ea′−exi−exj∈M where xi∈Xi and xj∈Xj and we consider the crosscut Q(R). Although G[Xi⊔Yi] is connected, as in the previous situation there might exists an independent set D with D1i⊊Xi, D2i⊊Yi and xi∈D1i. Moreover there might exist first independents set Di:=D1i⊔D2i⊔C2i. We observe that (Di,Ci) of Type (i) forms a 2-face, otherwise by Lemma 3.12, σG has non-simplicial three-dimensional faces. However (Di,Cj) is of Type (iv) and does not form a 2-face. Furthermore, there cannot exist any first independent set containing both Xi and Yi. Hence we obtain that T1(−R)=0 for this possibility. However, for rigidity, one needs to examine all non 2-face pairs, e.g. (Di,Cj)∈/IG(2).
We observe that as long as we know more information about the bipartite graph G, it is more probable that we are able to determine the rigidity of TV(G). In this manner, we study the edge cones associated to so-called toric matrix Schubert varieties in [Por(20)]. After examining their face structure, we are able to classify the rigid toric matrix Schubert varieties.
4. Rigidity of complete bipartite graphs with multiple edge removals
In this section, we would like to apply the results from Section 3 to the complete bipartite graphs with multiple edge removals. In particular, this section generalizes the results in [BHL(15)], where the complete bipartite graphs with one edge removal were studied. First we prove in Theorem 4.3 that
TV(Km,n) is rigid except for m=n=2. Next, we consider two vertex sets C1⊊U1 and C2⊊U2 of the complete bipartite graph Km,n and we remove all the edges between these two sets. This means that we obtain a two-sided first independent set C:=C1⊔C2∈IG(1). Without loss of generality, we assume that C1={1,…,t1} and C2={m+1,…,m+t2} and therefore π(C)=c=∑i>t1ei−∑j≤t2fj under the map from Theorem 2.8. In Theorem 4.6, we prove that TV(G) is rigid except the cases where ∣C1∣=1 and ∣C2∣=n−2 or ∣C1∣=m−2 and ∣C2∣=1.
4.1. Complete bipartite graphs
Let us first study the case with no edge removals i.e. the determinantal singularity TV(Km,n). The toric variety TV(Km,n) is the affine cone over a Segre variety which is the image of the embedding Pm−1×Pn−1⟶Pmn−1. It is a famous result by Thom, Grauert-Kerner and Schlessinger as in [KL(71)] that it is rigid whenever m≥2 and n≥3. Note that TV(Km,n) is Q-Gorenstein and Q-factorial in codimension 3 for m=n. By Corollary 6.5.1 in [Alt(95)], it follows that TV(Km,m) is rigid. We prove this classical result combinatorially with graphs also for m=n. Note that if m=1 or n=1 then Km,n is a tree and hence TV(Km,n) is smooth and rigid. Therefore we consider the cases with m≥2 and n≥2.
First, we collect some facts about the faces of the edge cone σKm,n.
Proposition 4.1**.**
The edge cone σKm,n⊂NQ is generated by the extremal ray generators e1,…,em,f1,…,fn.
Proof.
The complete bipartite graph has no edge removals, therefore it has no two-sided first independent set. The associated subgraph G{Ui\{u}} has two connected components for each u∈Ui and i=1,2.
∎
Example 15**.**
Let us study the small examples K2,2, K2,3, and K3,3 which will be excluded in Proposition 4.2. The three-dimensional edge cone σK2,2 is generated by the extremal rays e1,e2,f1,f2 where (e1,e2) and (f1,f2) do not span a 2-face. For K2,3 we observe that the intersection graphs G{U1\{1}}∩G{U1\{2}} and G{U2\{3}}∩G{U2\{4}}∩G{U2\{5}} have five isolated vertices and therefore (e1,e2) does not span a 2-face and (f1,f2,f3) does not span a 3-face. The second figure is the combinatorial representation of the four dimensional cone σK2,3.
f_{1}$$f_{2}$$e_{1}$$e_{2}$$\sigma_{K_{2,2}}
f_{1}$$e_{1}$$f_{2}$$f_{3}$$e_{2}
Finally, consider the complete bipartite graph K3,3. Similar to the calculation on K2,3, we observe that (e1,e2,e3) and (f1,f2,f3) do not span 3-faces. Any other triple of extremal ray generators spans a 3-face.
Proposition 4.2**.**
The two-dimensional faces of σKm,n are
(1)
all pairs except (e1,e2), if m=2 and n≥3.
2. (2)
all pairs of extremal rays, if m≥3 and n≥3.
The three-dimensional faces of σKm,n are
(1)
all triples of extremal rays not containing both e1 and e2, if m=2, n≥4.
2. (2)
all triples of extremal rays except (e1,e2,e3), if m=3 and n≥4.
3. (3)
all triples of extremal rays, if m≥4 and n≥4.
Proof.
The characterization of the two-dimensional faces follows by Proposition 3.5. Since there exists no two-sided first independent set, the characterization of the three-dimensional faces follows by Lemma 3.10 (1) and by Lemma 3.11 (1)(iii).
∎
Example 16**.**
Let us study the deformation space for the complete bipartite graphs from Example 15. For K2,2 and the deformation degree R=[1,1,1,1]∈M, the vertices of Q(R) are all lattice vertices. This implies that TTV(K2,2)1(−R)=0. Next, let us consider the edge cone σK2,3. It does not have any non-simplicial 3-face. It suffices to check the cases where the non 2-face pair (e1,e2) or non 3-face triple (f1,f2,f3) is in the compact part of crosscut Q(R). Suppose that f1,f2,f3 are vertices in Q(R), for a deformation degree R=[R1,…,R5]∈M. Then we obtain that R1+R2≥3. This means that there exists a non-lattice vertex ei∈Q(R). Now suppose that e1 and e2 are vertices in Q(R). Then we have that R3+R4+R5≥2 and thus there exists a non-lattice vertex fj or there exist two lattice vertices fk and fl in Q(R). In Figure 8, these cases and their vector space V(R) are illustrated.
Finally, we consider the edge cone of K3,3. Similar to σK2,3, if f1,f2 and f3 are vertices in Q(R), then there exists a non-lattice vertex ei in Q(R). The same follows symmetrically for the vertices e1,e2 and e3.
Theorem 4.3**.**
TV(Km,n)* is rigid except for m=n=2.*
Proof.
We have shown in Example 16 that TV(K2,2) is not rigid and TV(K2,3) and TV(K3,3) are rigid. By Proposition 4.2, it remains to prove three cases:
[m=2 and n≥4]: The 2-faces are all pairs except (e1,e2) and the 3-faces are all triples which do not contain both e1 and e2. Assume that there exists a deformation degree R∈M such that e1 and e2 are vertices in Q(R) and fj is a lattice vertex in Q(R) for some j∈[n]. Then we obtain that
[TABLE]
Thus there exists a vertex fj′∈Q(R) with j′=j. Hence we conclude that TKm,n1(−R)=0, since (e1,fj,fj′) and (e2,fj,fj′) are 3-faces and t is transfered by the edge fjfj′ as explained in Remark 6.
[m=3 and n≥4]: The 2-faces are all pairs and the 3-faces are all triples except (e1,e2,e3). We just need to check the case where the non 3-face (e1,e2,e3) is in the compact part of Q(R). In this case, we obtain that ∑i=4n+3Ri≥3. This implies that there exists a vertex fj for some j∈[n]. Thus t is transfered by the 2-faces (fj,e1), (fj,e2) and (fj,e3).
[m≥4 and n≥4]: All pairs are 2-faces and all triples are 3-faces. Hence the associated toric variety is rigid.
∎
4.2. Complete bipartite graphs with multiple edge removals
Recall again that C∈IG(1) is two-sided with C1={1,…,t1} and C2={m+1,…,m+t2}. We denote π(C) as c=∑i>t1ei−∑j≤t2fj under the map from Theorem 2.8.
Proposition 4.4**.**
Let G⊂Km,n be a connected bipartite graph with exactly one two-sided first independent set C∈IG(1).
(1)
The pair (fn−1,fn) does not span a two-dimensional face if and only if ∣C2∣=n−2. Moreover, no simplicial three-dimensional face contains both fn−1 and fn.
2. (2)
The pair (c,e1) does not span a two-dimensional face if and only if ∣C1∣=1 and ∣C2∣=n−1, Moreover, no simplicial three-dimensional face contains both c and e1.
3. (3)
If ∣C1∣=1 and ∣C2∣=n−2, then TV(G) is not rigid.
Proof.
By Lemma 3.10 (2)(i), we obtain the non-simplicial 3-faces (c,e1,fn−1,fn) in (3). It results to a non-rigid toric variety TV(G) by Theorem 3.18. In (1), by Proposition 3.5 (1), (fn−1,fn) does not span a two-dimensional face. Since we have exactly one two-sided first independent set C, by Lemma 3.10 (2)(i), the only three-dimensional face containing (fn−1,fn) is again (c,e1,fn−1,fn) as in (3). Similarly for (2), by Proposition 3.6(1) an (3) (c,e1) does not span a two-dimensional face if and only if ∣C1∣=1 and ∣C2∣=n−1.
∎
Note that the cases where ∣C2∣=1 and ∣C1∣=m−2 can be studied symmetrically. In the next proposition, we examine the three-dimensional faces of σG. These statements can also be studied symmetrically.
Proposition 4.5**.**
Let G⊂Km,n be a connected bipartite graph with exactly one two-sided first independent set C∈IG(1).
(1)
The triple (fn−2,fn−1,fn) does not span a three-dimensional face if and only if ∣C2∣=n−3.
2. (2)
The triple (c,e1,e2) does not span a three-dimensional face if and only if ∣C1∣=2 and ∣N(C1)∣=1.
3. (3)
The triple (e1,fn−1,fn) does not span a three-dimensional face if and only if ∣C2∣=n−2
4. (4)
The triple (c,e1,f1) does not span a three-dimensional face if and only if ∣C1∣=1 or ∣C2∣=1, except for G⊂K2,2.
Proof.
For (1), the intersection subgraph G{U2\{m+n−2}}∩G{U2\{m+n−1}}∩G{U2\{m+n}} has more than four connected components if and only if ∣C2∣=n−3. For (2), the intersection subgraph G{C}∩G{U1\{1}}∩G{U1\{2}} has more than four connected components if and only if ∣C1∣=2. In particular, if ∣N(C1)∣=1, (c,e1,e2) spans a 3-face. For (3) we refer to the proof of Proposition 4.4 (1) and (3). For (4), the intersection subgraph G{C}∩G{U1\{1}} has more than three connected components if ∣C1∣ or ∣C2∣ is equal to one. In particular the graph G⊂K2,2 has been examined in Example 1: σG is generated by (c,e1,f1) and TV(G) is rigid.
∎
Theorem 4.6**.**
Let G⊊Km,n be a connected bipartite graph with exactly one two-sided first independent set C∈IG(1). Then
(1)
TV(G)* is not rigid, if ∣C1∣=1 and ∣C2∣=n−2 or if ∣C1∣=m−2 and ∣C2∣=1.*
2. (2)
TV(G)* is rigid, otherwise.*
Proof.
The first case follows from Proposition 4.4 (3). For the other cases, we study the non 2-faces and 3-faces appearing in the compact part of Q(R) utilizing the previous two propositions. First of all, note that there exists no case such as two 2-faces connected only by a common lattice vertex in Q(R). This is because, it would mean that there exist four non 2-faces and this is impossible for our bipartite graph G.
∙ Assume that ∣C2∣=n−2. We consider the non 2-face (fn−1,fn) in Q(R). This means that Rn−1≥1 and Rn≥1. This implies that either there exists i∈[m] such that Ri≥1 or there exists m+j∈C2 such that Rm+j≤−1 i.e. c∈Q(R).
(1)
Ri≥1: Suppose that R evaluates zero or negative on all other extremal rays except ei,fn−1 and fn. Then ei is not a lattice vertex in Q(R) and (ei,fn−1) and (ei,fn) are 2-faces. If ei is not an extremal ray, i.e. if ∣C1∣=m−1, then c is not a lattice vertex in Q(R) and (c,fn−1) and (c,fn) are 2-faces by Proposition 4.4 (2). Suppose now that there exists another i′∈[m]\{i} such that Ri′≥1. If ei and ei′ are not lattice vertices, we are done. If at least one of them is a lattice vertex, then we check if (ei,ei′) spans a 2-face. If it does span a 2-face, then we obtain the 3-faces (ei,ei′,fn−1) and (ei,ei′,fn). If it does not span a 2-face, then ∣C1∣=m−2 and let ei=en−1 and ei′=en by Proposition 4.4 (1). In that case, c is a non-lattice vertex and we obtain the 3-faces (c,ei,fj) where i∈{m−1,m} and j∈{n−1,n} as in the figure below.
2. (2)
Rm+j≤−1: We need to examine the case where c is a lattice vertex. Then there exists i∈C1 such that Ri≥1, i.e. ei∈σG(1). By Proposition 4.4 (2), (c,ei) spans a 2-face. By Proposition 4.5 (4), (c,ei,fn−1) and (c,ei,fn) span 3-faces, since G is connected and thus n≥3.
∙ Assume that ∣C1∣=1. We know that (c,e1) is a non 2-face by Proposition 4.4 (2). Assume that there exists R∈M that evaluates on the extremal rays c and e1 bigger than or equal to one. Then there exists m+j∈N(C1) such that Rm+j≥1. Assume that fj is a lattice vertex, then there exists m+j′∈N(C1) such that fj′∈Q(R). Now, we must examine if (fj′,fj), (fj′,e1) and (fj′,c) are 2-faces. Since we excluded the case where ∣C2∣=n−2 and we have that {m+j,m+j′}∈N(C1)=U2\C2, by Proposition 4.5, (c,fj,fj′) and (e1,fj,fj′) span 3-faces.
∣C2∣=1: Consider the non 2-face (c,f1) in Q(R). Then there exists i∈[m]\{1} such that ei∈Q(R). Similarly to the case of non 2-face (c,e1), either ei is a non-lattice point or ei is a lattice point and there exists another lattice point ei′ in Q(R). Since ∣C1∣=m−2 and ∣C1∣=2, (ei,ei′,f1) and (c,ei,ei′) span 3-faces. In particular if both non 2-faces (c,e1) and (c,f1) appear in Q(R) then (ei,fj,fj′) spans a 3-face and it suffices to conclude this part of the proof. Note that this is the case which was studied in [BHL(15)] for m=n.
2. (2)
∣C1∣=m−2=1: Consider the non 2-face (e2,e3) in Q(R). The pairs (e1,e3), (e3,c), (e1,e2) and (c,e2) do span 2-faces. Furthermore we have R4+…+Rn+3≥3. This means that there exists j∈[n] such that Rm+j≥1. The ray fj is an extremal ray generator, otherwise (c,e1) spans a 2-face. Since we excluded the case where ∣C2∣=1, (c,fj), (e1,fj), (e2,fj) and (e3,fj) span 2-faces. Additionally (c,e2,fj), (e1,e2,fj), (c,e3,fj) and (e1,e3,fj) span 3-faces.
∙ Assume that ∣C2∣=n−3. For the non 3-face (fn−2,fn−1,fn), we refer to second case of the proof of Theorem 4.3. There is a small detail here that one needs to pay attention to. If ∣C1∣=m−1, then em is not an extremal ray generator of σG. But then the deformation degree R∈M with Rm=Rm+n−2+Rm+n−1+Rm+n evaluates bigger than or equal to one on c∈σG(1). The triples (c,fj,fk) are 3-faces where j,k∈{n−1,n−2,n}.
∙ Assume that ∣C1∣=2. For the non 3-face (c,e1,e2), we have R1≥1, R2≥1 and R3+…+Rm−Rm+1…−Rm+t2≥1. This implies that Rm+t2+1+…+Rm+n≥3 where t2=∣C2∣ as before. Then there exists j∈N(C1) such that Rm+j≥1. Note that if fj is not an extremal ray generator then (c,e1,e2) spans a 3-face. Otherwise, (e1,e2,fj) is always a 3-face. The pair (c,fj) is not a 2-face if and only if j∈C2 and ∣C2∣=1, which is impossible.
∎
Example 17**.**
Let G⊂K4,5 be the connected bipartite graph constructed by removing two edges connected to the vertex {1} in U1. This means that there exists a two-sided first independent set C=C1⊔C2∈IG(1) with ∣C1∣=1 and ∣C2∣=2. By Proposition 4.5, (f3,f4,f5) does not span a three-dimensional face and by Proposition 4.4 (2), (e1,c) does not span a two-dimensional face. In particular we observe that in Figure 9 the second graph is the intersection subgraph associated to the extremal ray set (f3,f4,f5) and (c,e1). Let us for example consider the compact part of crosscut Q(R) for R=[2,0,0,0,0,−1,1,1,1]∈M as in the figure below. Except from the triples (c,e1,f3) and (f3,f4,f5), all triples in this figure span 3-faces. Therefore TTV(G)1(−R)=0.
This paper is part of author’s Ph.D. thesis which has been published online at Freie Universität Berlin Library. The author wishes to express her gratitude to her advisor Klaus Altmann for suggesting the problem and many helpful conversations. The author also thanks Berlin Mathematical School for the financial support.
Bibliography16
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[Alt(95)] K. Altmann, Minkowski sums and homogeneous deformations of toric varieties , Tohoku Math. J. (2) 47 (1995), no. 2, 151–184. doi:10.2748/tmj/1178225590.
2[Alt(97)] K. Altmann, The versal deformations of an isolated, toric Gorenstein singularity , Invent. math. 128 (1997), 443-479.
3[Alt(00)] K. Altmann, One-parameter families containing three-dimensional toric Gorenstein singularities , Explicit Birational Geometry of 3-Folds (ed. Alessio Corti, Miles Reid), p. 21-50, London Mathematical Society Lecture Note Series. 281, Cambridge University Press, 2000.
4[BHL(15)] M. Bigdeli, J. Herzog, and D. Lu, Toric rings, inseparability and rigidity , Multigraded Algebra and Applications, The 24th National School on Algebra, Springer Proceedings in Mathematics and Statistics, p. 41-75, 2018.
5[CLS(10)] David A. Cox, John B. Little and Henry K. Schenck, Toric varieties , English. Providence, RI: American Mathematical Society (AMS), 2011. ISBN: 978-0-8218-4819-7/hbk.
6[DGPS(15)] W. Decker, G.-M. Greuel, G. Pfister and H. Schönemann, Singular 4-0-2 - A computer algebra system for polynomial computations . http://www.singular.uni-kl.de. 2015.
7[Fil(18)] M. Filip, Hochschild cohomology and deformation quantization of affine toric varieties , J. Alg. 508 (2018), 188–214.
8[GJ(00)] E. Gawrilow and M. Joswig, polymake: a framework for analyzing convex polytopes , Polytopes - combinatorics and computation (Oberwolfach, 1997), 43-73, DMW Sem., 29, Birkhäuser, Basel, 2000. MR 1785292 (2001 f:52033).