The product rule in κ∗(Mg,nct)
I. Setayesh
Department of Mathematics, Faculty of Mathematical Sciences, Tarbiat Modares University, P.O. Box 14115-137, Tehran, Iran.
School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran.
[email protected]
Abstract.
We describe explicit formulas for the product rule in κ∗(Mg,nct).
1. Introduction
Let ϵ:Mg,n+1→Mg,n be the forgetful map, viewed as the universal curve over Mg,n, the moduli space of stable curves of genus g with n marked points. Let Li→Mg,n+1 be the cotangent line bundle over Mg,n+1, whose fiber over a given curve is the cotangent space at the ith marked point. Define
[TABLE]
By restriction, one can define the psi and kappa classes over Mg,n, the moduli space of smooth curves of genus g with n marked poines, and Mg,nct, the moduli space of curves of compact type. Consider the sub-ring of A∗(Mg,nct) generated by the kappa classes, and call it the kappa ring. In [3] Pandharipande described an additive basis for the kappa ring.
Theorem**.**
[3]
Given D,n∈N, the set
[TABLE]
generates κD(Mg,nct) as a Q-vector space, and for n>0 it is a Q-basis.
The natural question to ask, as first raised by Pandharipande [3], is to determine explicit formulas for the product rule in the kappa ring of Mg,nct, that is the main result of this paper.
Theorem 1**.**
Let A={a1,⋯,ak} be a multi-set of integers, and n,g,d∈N be integers such that d=2g+n−∑ai−2. In A∗(Mg,nct) we have:
[TABLE]
where
[TABLE]
in which M=min{ℓ(t),d}, SP(A) (resp. SP(A,d)) is the set of partitions of the multi-set A (resp. into at most d parts) and ℓ(p) is the number of components of p (for notations see Definition 5 and Definition 9).
Plan of the paper.
In Section 2 we review some known results relating kappa classes and pushforwards of the psi classes. Section 3 contains the proof of the main theorem. The main idea is to use the following theorem of Pandharipande.
Theorem 2**.**
[3]
There is a canonical surjective map ιg,n:κ∗(M0,n+2g)→κ∗(Mg,nct) which is an isomorphism for n>0.
This allows us to reduce the computation to the case of genus zero. In the genus zero case, by the work of Keel [2] we have a very good understanding of the Chow ring, and we can explicitly compute all the required classes. In Section 4 we prove the combinatorial identity used in the Section 3.
Acknowledgement. I would like to thank M. Einollah Zade, M. Saghafian and E. Salavati for their collaboration in the proof of Theorem 22. I am also grateful to E. Eftekhary and F. Janda for helpful comments on an earlier version of this paper. This work was partially done when the author visited the Institute for Mathematical Research (FIM) in Zurich and the result was first presented in a lecture in the Einstein series in Algebraic Geometry at Humboldt University supported by the Einstein Stiftung in Berlin.
2. Kappa and Psi classes
In this section we explain the relation between the kappa classes and pushforwards of the psi classes. Before stating the results, we need to fix some notations.
Definition 3**.**
Let πg,nk:Mg,n+k→Mg,n denote the forgetful map which forgets the last k marked points, and let q be the multi-set {q1,⋯,qk}. We define:
ψ(q)=ψ(q1,⋯,qk):=(πg,nk)∗(i=1∏kψn+iqi+1).
κq=κq1,⋯,qk:=i=1∏rκqi.
Definition 4**.**
Let A={a1,⋯,ak} be a multi-set. Given σ∈Sk with the cycle decomposition σ=γ1…γr (including the 1-cycles). We define:
σi(a):=j∈γi∑aj.
σ(A)={σ1(A),⋯,σr(A)} (as multi-set).
Definition 5**.**
Let A={a1,⋯,ak} be a multi-set, we denote the set of partitions of A by SP(A). Given p∈SP(A), we use the following notations.
∣A∣=j=1∑kaj.
SP(A;l) (resp. SP(A,l)) denotes the set of partitions of A with exactly (resp. at most) l parts.
We denote the components of p by pi, i.e. p=⨆pi.
ℓ(p) denotes the number of components of p. Also we write ℓ(A)=k and from the context it should be clear whether we work with a multi-set or a partition, so there should be no confusions.
∣p∣={∣p1∣,⋯,∣pℓ(p)∣} (as multi-set)
By abuse of notation we write ψ(p) instead of ψ(∣p∣), i.e.
[TABLE]
The relation between the kappa classes and pushforward of the psi classes, due to Faber, is (see [1]):
[TABLE]
Lemma 6**.**
([1], [3, Lemma 11])
The subset of Ad(Mg,n) defined by
[TABLE]
are related by an invertible linear transformation independent of g and n.
The map in one direction is given by the Faber’s formula. The inverse map is given by the following proposition.
Proposition 7**.**
κA=p∈SP(A)∑(−1)n+ℓ(p)ψ(p).
Proof.
Given q∈SP(A), we say that a pair (p,σ) with p∈SP(A) and σ∈Sℓ(p) splits q if σ(∣p∣)=q. Using Faber’s formula we have:
[TABLE]
Let {kn} denote the number of partitions of a set of n elements into k parts (the Stirling numbers of the second kind). Given a splitting (p,σ) of q=⨿i=1rqi, by restriction of p to each qi we obtain an element pi of SP(qi) and the restriction of σ is a permutation with only one cycle of length ℓ(pi). Using the identity
[TABLE]
for the Stirling numbers of the second kind (see [4]), we have:
[TABLE]
Hence if for some i we have ℓ(qi)>1 then the coefficient of κq is zero. Therefore the only term with non-zero contribution is q0={a1}∪{a2}∪⋯∪{an}. Therefore we have:
[TABLE]
∎
Example 8**.**
[TABLE]
3. Product of kappa classes
As we explained in the introduction, Theorem 2 shows that any relation in κ∗(M0,n) is also valid in κ∗(Mg,nct). Moreover for n>1 all the relations in κ∗(Mg,nct) are obtained in this manner. Therefore in order to prove Theorem 1, it is enough to show that those relations hold in κ∗(M0,n). Thus we start by computing the product rule in the kappa ring of M0,n, but we need to fix some more notations.
Definition 9**.**
Let A={a1,⋯,ak} be a multi-set.
A!=i=1∏kai!.
A+1={ai+1∣i=1,⋯,k}.
(A∣A∣)=(a1,a2,⋯,aka1+a2+⋯+ak).
Given p,q∈SP(A), we write q≤p if q is a refinement of p. We use the following notations.
[p:q]∈SP(∣q∣) denotes the partition induced from p on the multi-set ∣q∣. Note that ℓ(p)=ℓ([p:q]).
q∣pi∈SP(pi) denotes the partition induced from q on the multi-set pi (by restriction).
λA=λa1,⋯,an:=p∈SP(A)∑(−1)n+ℓ(p)(∣p∣+1∣(∣p∣+1)∣).
In the following proposition we compute the product rule in the top degree of κ∗(M0,n).
Proposition 10**.**
Let A={a1,⋯,ak} be a multi-set of integers such that i∑ai=n−3.
Then in An−3(M0,n) we have:
[TABLE]
Proof.
Since An−3(M0,n)=Q, we have to integrate both sides over M0,n. Given p=⨿i=1rpi∈SP(A), we have:
[TABLE]
Therefore the result follows from Proposition 7.
∎
Definition 11**.**
Let A={a1,⋯,ak} be a multi-set, q≤p∈SP(A).
[TABLE]
Note that Na1=1.
Definition 12**.**
A genus zero n−pointed stable weighted graph is a connected graph G together with a map m:V(G)→2{1,⋯,n} that satisfies the following conditions.
The sets m(v) (for v∈V(G)) form a partition of {1,⋯,n}. We call m(v) the set of markings at the vertex v.
For each v∈V(G) we have d(v):=deg(v)+♯m(v)≥3.
H1(G)=0, i.e. G is a tree.
For any genus zero n−pointed stable weighted graph G, we have a cycle [G]⊂M0,n obtained as follows. We take [G] to be the image of the map
[TABLE]
obtained by gluing along the edges of G.
Remark 13**.**
In [2] Keel proved that A∗(M0,n) is generated by cycles of the form [G], and it has perfect pairing. Therefore given a Chow class α∈A∗(M0,n), in order to show that α vanishes it is enough to show that the pairing of α against all the classes of the form [G] are zero. Note that if α belongs to the kappa ring, then α.[G] depends only on the dimension of components of [G] and not the distribution of the markings. Thus α.[G] depends only on the dimension sequence of G, i.e. {d(v)−3:v∈V(G)}.
The following theorem describes an additive basis for the kappa ring of M0,n.
Theorem 14**.**
[3]
Given D∈N, a Q-basis of κD(M0,n) is given by
[TABLE]
Theorem 15**.**
Let A={a1,⋯,ak} be a multi-set of integers, and n,d∈N be such that d=n−∑ai−2. In A∗(M0,n) we have:
[TABLE]
Proof.
Using Remark 13 it is enough to check that the integral of both sides against cycles of the form [G] are equal. Note that both sides belong to An−d−2(M0,n), so they can be paired with cycles with exactly (n−3)−(n−d−2)=d−1 nodes. Thus we have to consider cycles that their dimension sequence have exactly d terms.
If the integral of the left (or right) hand side over [G] is non-zero, then there is a way to put κa1,⋯,κal on irreducible components of [G] such that the dimension of each component is equal to the sum of degree of kappa classes over it. Therefore there is a partition p of the multi-set {a1,⋯,al} (with at most d parts) such that the multi-set of dimension of irreducible components of [G] is equal to ∣p∣. We call such G a p−graph, and call [G] a p−cycle. Therefore it is enough to check our claim for all the strata of the form [G], where G is a p−graph for some p∈SP(A,d).
By Theorem 14, kappa classes of the from κp for p∈SP(A,d) form an additive basis for the kappa ring, therefore for each p there exist (a unique) xp such that
[TABLE]
Hence we have to prove that
[TABLE]
We prove this by induction on ℓ(p). Given a partition p with ℓ(p)=d, we integrate both sides of (3.1) against a p−cycle [G]. By Proposition 10 the integral of the left side is λp, and the integral of the right hand side is xp. Hence we get xp=λp, which confirms 3.2.
Fix p∈SP(A) with ℓ(p)=e<d. Similarly by Proposition 10 the integral of the left hand side of (3.1) is ∏λpi=λp, and the integral of the right hand side is given by
[TABLE]
Since any partition q in this sum, except p, has length at least e+1 by the induction hypothesis we know that
[TABLE]
Thus we obtain
[TABLE]
Let p=p1⨿⋯⨿pe, in order to simplify the formulas we denote q∣pi (resp. r∣pi) by qi′ (resp. ri′), then λ[p:q]=i=1∏eλ∣qi′∣ and N[q:r]=∏N[qi′:ri′]. Therefore we obtain:
[TABLE]
In the first line q<p is a proper sub partition, and in the second identity we added the term −N[p:r] and took the sum over all partitions. Therefore in order to finish the proof, it is enough to check that the terms in the parenthesis are zero, which is the content of the following lemma.
∎
Lemma 16**.**
Given a multi-set A and a partition s of A. We have
[TABLE]
Proof.
We have
[TABLE]
Hence it is enough to check that the term in the left is zero. We denote the multi-set s by B, and b:=♯B.
[TABLE]
The data of a triple r≤p≤q∈SP(B) is equivalent to the data of r≤q∈SP(B) plus the data of a partition p′:=[p:r]≤[q:r]∈SP(∣r∣). The data of a partition p′:=[p:r]≤[q:r]∈SP(∣r∣) is equivalent to the following.
For each 1≤l≤ℓ(q)=ℓ([q:r]), the data of a partition
[TABLE]
of the multi-set [q:r]l.
Note that any multi-set pi induces a unique pl′j and we have
[TABLE]
Also if we vary i and j, rij runs over all components of r, hence
[TABLE]
Therefore
[TABLE]
Note that for a partition t of a set X there are exactly j=1∏ℓ(t)(ℓ(tj)−1)! permutations σ of X such that the partition of X obtained from the cycle decomposition of σ is equal to t. Hence we have
[TABLE]
Therefore if r=q then the term
[TABLE]
vanishes, and if r=q we get (−1)ℓ(q). So
[TABLE]
∎
Theorem 17**.**
Let A={a1,⋯,ak} be a multi-set of integers such that d=n−∣A∣−2. In A∗(M0,n) we have:
[TABLE]
where
[TABLE]
and M=min{ℓ(t),d}.
Proof.
We define Ck(A) as follows.
[TABLE]
The data of q∈SP(A;k) and r∈SP(∣q∣) is equivalent to the data of q≤r∈SP(A) with q∈SP(A;k), and this is equivalent to the data of r∈SP(A) plus the following. For each 1≤j≤ℓ(r) a partition
[TABLE]
of the multi-set rj, such that ∑ℓ(qj′)=k. For such pairs (q,r) and (r,{qj′}j), we have
[TABLE]
and as in the proof of Lemma 16 we have i∏λqi=i,j∏λqj′i.
[TABLE]
In the second line we expanded λqj′i, and in the third line we switch the role of qj′i and tji which by now is standard. In the fourth line we used Theorem 22.
Now we switch the role of t and r, and take the sum over t and r~. We use the fact that ∣∣ti∣+1∣ for a partition ti∈SP(ri) is equal to ∣r~i+1∣ for the corresponding component of r~∈SP(t) (as we explained in the proof of lemma 16), and also (∣t∣+1)!=∏(∣ti∣+1)!.
[TABLE]
Therefore:
[TABLE]
By reordering the terms in the expression and using Theorem 22, we get the required result.
[TABLE]
∎
Proof of Theorem 1.
As we mentioned in the introduction, Theorem 2 implies that the expression of Theorem 17 hold in κ∗(Mg,nct) for any genus g. This completes the proof of Theorem 1.
∎
Example 18**.**
We consider two special cases of Theorem 1. In both cases, in order to get a non-zero contribution from (M−ℓ(r)ℓ(t)−ℓ(r)), we have to consider special r and t.
d=1 so M=1. In order to get a non-zero contribution we must have ℓ(r)=1. There we obtain:
[TABLE]
that is the result of Proposition 10.
d=n which implies M=ℓ(t). In order to get a non-zero contribution we must have r=t. So
[TABLE]
which vanishes unless ℓ(pi)=1 for each i.
4. Combinatorial identity
This section contains the statement and proof of the combinatorial identity (Theorem 22) that we used in the previous section. The methods are completely combinatorial and are independent from the rest of the paper.
Lemma 19**.**
Let A={a1,⋯,an} be a multi-set of integers.
[TABLE]
Proof.
Let Kn+1 be the complete graph on n+1 vertices with vertices labeled by 1=a0,a1,⋯,an. For a spanning tree T⊂Kn+1 we denote the Prüfer code of T by P(T), and
[TABLE]
which we call the Prüfer function of T. For definition and basic properties of the Prüfer code see [4] page 13.
Let Tk be the set of spanning tree of Kn+1 with deg(v0)=k. We compute the sum
S=T∈Tk∑p(T) in two ways.
- (1)
If we forget the condition deg(v0)=k, then any sequence of length n−1 of ai’s would appear exactly once as the Prüfer code of a spanning tree of Kn+1. For trees in Tk the label a0=1 appears exactly k−1 times, and the remaining entries are filled with the rest of ai’s with no extra conditions.
In order to specify the code for a tree T∈Tk, we have to chose the location of the k−1 a0−entries, where we have (k−1n−1) choices, and the remaining n−k entries are filled arbitrary with the remaining ai’s, which contributes (a1+⋯+an)n−k to S. Therefore
[TABLE]
2. (2)
For a tree T∈Tk the vertex v0 is connected to exactly k disjoint sub-trees G~1,…,G~k of T. v0 is connected to a unique vertex in each G~i, and we denote by Gi the union of G~i, v0 and the edge connecting them. The vertex set of G~i’s gives a partition p of A into exactly k parts. The Prüfer code of each Gi uniquely determines Gi, and if we know all the Gi’s then T and the Prüfer code of it are uniquely determined. Therefore we have:
[TABLE]
Note that the Prüfer code of each Gi is a sequence of length ℓ(pi)−1, and the entries are from pi. If we take the sum over all such trees any sequence of length ℓ(pi)−1 with entries in pi appears exactly once, so
[TABLE]
Thus we have
[TABLE]
∎
Definition 20**.**
For x∈R we denote the falling factorial of x by
[TABLE]
Let P(x1,⋯,xn)∈R[x1,⋯,xn] be a polynomial in n variables. If
[TABLE]
we define the falling factorialization of P to be
[TABLE]
Remark 21**.**
It is straight forward to see that we have:
[TABLE]
Using induction on the number of variables, we see that for falling factorials we have the multinomial coefficient theorem.
[TABLE]
Theorem 22**.**
Let A={a1,⋯,an} be a multi-set of integers.
[TABLE]
Proof.
We can rewrite the identity as
[TABLE]
or equivalently, if we set B=A+1 as
[TABLE]
Note that by Remark 21 the left hand side of (4.1) is the falling factorialization of
[TABLE]
and similarly the right hand is the falling factorialization of
[TABLE]
By Lemma 19
[TABLE]
so their falling factorializations are also equal, which completes the proof.
∎