LOG DIVISORS FROM A CONFIGURATION SPACE GROUP EQUIPPED WITH ITS COLLECTION OF LOG-FULL
SUBGROUPS
KAZUMI HIGASHIYAMA
Abstract. In the present paper, we study configuration space groups. The goal of this paper is to reconstruct group-theoretically the inertia groups asso- ciated to various types of log divisors of a log configuration space of a smooth log curve from the associated configuration space group equipped with its col- lection of log-full subgroups.
0. Introduction
Let l be a prime number; k an algebraically closed field of characteristic ̸= l;
Sdef= Spec(k); (g, r) a pair of nonnegative integers such that 2g−2+r >0;Xlog→S a smooth log curve of type (g, r) (cf. Notation 1.3, (iv)); n∈Z>1. In the present paper, we study the n-th log configuration spaceXnlog associated toXlog→S (cf.
Definition 2.1). WriteUX for the interior of the log schemeXlog (cf. Notation 1.2, (vi)). The log scheme Xnlog may be thought of as a certain compactification of the usualn-th configuration spaceUXn associated to the smooth curveUX. Write Πn
def= πpro-l1 (Xnlog) for the pro-lconfiguration space group determined byXnlog (cf.
[MzTa], Definition 2.3, (i)), i.e., the maximal pro-l quotient of the fundamental group of the log schemeXnlog (for a suitable choice of basepoint). We shall refer to an irreducible divisor of the underlying scheme ofXnlogcontained in the complement ofUXn as alog divisorofXnlog. Each log divisorV determines, up to Πn-conjugacy, an inertia groupIV(≃Zl)⊆Πn, which plays a central role in the present paper. Let V1, . . . , Vn be distinct log divisors ofXnlog such thatV1∩· · ·∩Vn̸=∅. Then we shall refer toP def= V1∩· · ·∩Vnas alog-full point(cf. Definition 2.2, (ii), and Proposition 2.10). The log-full pointP=V1∩· · ·∩Vndetermines, up to Πn-conjugacy, alog-full subgroupA(≃IV1×· · ·×IVn≃Z⊕ln)⊆Πn(cf. Definition 2.2, (iii)). It is known that the log-full subgroups of a configuration space group may be characterized group- theoretically whenever the configuration space group is equipped with the action of a profinite group that satisfies certain properties (cf. [HMM], Theorem D). In the present paper, we reconstruct group-theoretically the inertia groups associated to the log divisors from a configuration space group equipped with its collection of log-full subgroups. Moreover, we reconstruct group-theoretically the inertia groups associated to the tripodal divisors (cf. Definition 3.1, (ii)) and the drift diagonals (cf. Definition 3.1, (iv)), as well as the drift collections of Πn (cf. Definition 8.13) and the generalized fiber subgroups of Πn (cf. Definition 9.1).
Our main result is as follows:
1
Theorem 0.1. For ∈ {◦,•}, let l be a prime number; k an algebraically closed field of characteristic̸=l;S def= Spec(k);(g, r)a pair of nonnegative integers such that2g−2 +r>0;
Xlog→S
(cf. Notation 1.2, (vi)) a smooth log curve of type(g, r);n∈Z>1;Xlog
n the n-th log configuration space associated to Xlog → S; Π def= πpro-l1 (Xlog
n ) (for a suitable choice of basepoint);
ϕ: Π◦ ∼→Π•
an isomorphism of profinite groups. We suppose that r > 0 (cf. the discussion below);ϕinduces a bijection between the set of log-full subgroups ofΠ◦ and the set of log-full subgroups of Π•. Then the following hold:
(i) ϕinduces a bijection between the set of inertia groups ofΠ◦ associated to log divisors ofXnlog◦ ◦ and the set of inertia groups ofΠ• associated to log divisors ofXnlog• • (cf. Theorem 5.2).
(ii) ϕ induces a bijection between the set of inertia groups of Π◦ associated to tripodal divisors of Xnlog◦ ◦ and the set of inertia groups of Π• associated to tripodal divisors of Xnlog• • (cf. Theorem 6.6).
(iii) ϕ induces a bijection between the set of inertia groups of Π◦ associated to drift diagonals ofXnlog◦ ◦ and the set of inertia groups ofΠ• associated to drift diagonals ofXnlog• • (cf. Theorem 7.3).
(iv) ϕinduces a bijection between the set of drift collections of Π◦ and the set of drift collections ofΠ• (cf. Theorem 8.14).
(v) ϕinduces a bijection between the set of generalized fiber subgroups of Π◦ and the set of generalized fiber subgroups ofΠ• (cf. Theorem 9.3).
Note that, roughly speaking, Theorem 0.1, (i), asserts that we may extract group- theoretically a “geometric direct summandZl” (i.e., an inertia group associated to a log divisor) from “Z⊕ln” (i.e., a log-full subgroup).
Note that one may define the notion of a log-full point even ifr= 0 (cf. [HMM], Definition 1.1). On the other hand, since log-full points do not exist when r= 0, we suppose thatr >0 in the present paper.
In the proof of Theorem 0.1, (ii), we use the fact that, in the notation of Theorem 0.1, in fact (g◦, r◦, n◦) = (g•, r•, n•) (cf. Theorem 3.10, (i)), which is proven in [HMM], Theorem A, (i).
This paper is organized as follows: In§1, we explain some notations. In§2, we define log configuration spaces, log-full points, and log divisors. In §3, we define tripodal divisors and drift diagonals and then proceed to study the geometry of various types of log divisors. In§4, we give a group-theoretic reconstruction of the scheme-theoretically non-degenerate elements (cf. Definition 4.6, (i)) of a log-full subgroup. In§5, we reconstruct the inertia groups associated to the log divisors.
In §6, we reconstruct the inertia groups associated to the tripodal divisors. In
§7, we reconstruct the inertia groups associated to the drift diagonals. In §8, we reconstruct the drift collections of a configuration space group. In§9, we reconstruct the generalized fiber subgroups of a configuration space group.
1. Notations
Notation 1.1. (i) Let G be a group. Then we shall write “1G ∈ G” for the identity element of G.
(ii) LetGbe a group,H ⊆Ga subgroup, andα∈G. Then we shall write ZG(H)def= {g∈G|gh=hgfor anyh∈H}
for the centralizer of H in G;
ZG(α)def= ZG(⟨α⟩) ={g∈G|gα=αg} for the centralizer of αin G;
NG(H)def= {g∈G|gHg−1=H} for the normalizer ofH inG.
Notation 1.2. LetSlog be an fs log scheme (cf. [Naka], Definition 1.7).
(i) WriteS for the underlying scheme ofSlog.
(ii) WriteMS for the sheaf of monoids that defines the log structure ofSlog. (iii) Letsbe a geometric point ofS. Then we shall denote byI(s,MS) the ideal
of OS,s generated by the image of MS,s \ O×S,s via the homomorphism of monoids MS,s → OS,s induced by the morphism MS → OS which defines the log structure ofSlog.
(iv) Lets∈Sandsa geometric point ofSwhich lies overs. Write (MS,s/O×S,s)gp for the groupification of MS,s/O×S,s. Then we shall refer to the rank of the finitely generated free abelian group (MS,s/OS,s× )gpas thelog rankats. Note that one verifies easily that this rank is independent of the choice of s, i.e., depends only on s.
(v) Letm∈Z. Then we shall write
Slog≤mdef= {s∈S|the log rank atsis≤m}.
Note that sinceSlog≤mis open inS(cf. [MzTa], Proposition 5.2, (i)), we shall also regard (by abuse of notation) Slog≤m as an open subscheme ofS.
(vi) We shall write US
def= Slog≤0 and refer to US as the interior of Slog. When US=S, we shall often use the notationS to denote the log scheme Slog. Notation 1.3. Let (g, r) be a pair of nonnegative integers such that 2g−2 +r >0.
(i) Write Mg,r for the moduli stack (over Z) of pointed stable curves of type (g, r) andMg,r ⊆ Mg,r for the open substack corresponding to the smooth curves. Here, we assume the marked points to be ordered.
(ii) Write
Cg,r → Mg,r
for the tautological curve over Mg,r; Dg,r
def= Mg,r\ Mg,r for the divisor at infinity.
(iii) Write Mlogg,r for the log stack obtained by equipping the moduli stack Mg,r
with the log structure determined by the divisors with normal crossingsDg,r.
(iv) The divisor of Cg,r given by the union ofCg,r×Mg,r Dg,r with the divisor of Cg,r determined by the marked points determines a log structure onCg,r; we denote the resulting log stack by Clogg,r. Thus, we obtain a morphism of log stacks
Clogg,r → Mlogg,r
which we refer to as thetautological log curveoverMlogg,r. IfSlogis an arbitrary log scheme, then we shall refer to a morphism
Clog→Slog
whose pull-back to some finite ´etale coveringT →Sis isomorphic to the pull- back of the tautological log curve via some morphism Tlog def= Slog×S T → Mlogg,r as a stable log curve(of type (g, r)). If C → S is smooth, i.e., every geometric fiber of C→S is free of nodes, then we shall refer toClog →Slog as asmooth log curve(of type (g, r)).
(v) A smooth log curve of type (0,3) will be referred to as a tripod. A vertex of a semi-graph of anabelioids of pro-l PSC-type (cf. [CmbGC], Definition 1.1, (i)) of type (0,3) (cf. [CbTpI], Definition 2.3, (iii)) will also be referred to as a tripod.
Definition 1.4. Let G be a semi-graph of anabelioids of pro-l PSC-type (cf.
[CmbGC], Definition 1.1, (i)) andGthe underlying semi-graph ofG. Write Cusp(G) (resp. Node(G), Vert(G), Edge(G))
for the set of cusps (resp. nodes, vertices, edges) ofGand Cusp(G)def= Cusp(G), Node(G)def= Node(G),
Vert(G)def= Vert(G), Edge(G)def= Edge(G).
2. Log configuration spaces and log divisors
Let l be a prime number; k an algebraically closed field of characteristic ̸= l;
Sdef= Spec(k); (g, r) a pair of nonnegative integers such that 2g−2 +r >0;
Xlog→S
(cf. Notation 1.2, (vi)) a smooth log curve of type (g, r); n ∈ Z>0. We suppose that the marked points ofXlog are equipped with an ordering, and that
r >0
(cf. the discussion at the end of the Introduction). In the present§2, we define log configuration spaces, log-full points, and log divisors.
Definition 2.1. The smooth log curveXlog over S determines, up to a choice of ordering of the marked points (which will in factnotaffect the following construc- tion), a classifying morphism S → Mlogg,r. Thus, by pulling back the morphism Mlogg,r+n → Mlogg,r given by forgetting the lastn marked points via this morphism S→ Mlogg,r, we obtain a morphism of log schemes
Xnlog →S.
We shall refer toXnlog as then-th log configuration space associated to Xlog →S.
Note thatX1log=Xlog. WriteX0logdef= S.
Definition 2.2. (i) Write
Πndef= π1pro-l(Xnlog)
for the maximal pro-l quotient of the fundamental group of the log scheme Xnlog (for a suitable choice of basepoint). We refer to [Hsh], Theorems B.1, B.2, for more details on fundamental groups of log schemes.
(ii) Let P be a closed point of Xn. By abuse of notation, we shall use the notation“P” both for the corresponding point of the scheme Xn and for the reduced closed subscheme ofXn determined by this point. Then we shall say that P is a log-full pointofXnlog if
dim(OXn,P/I(P,MXn)) = 0 (cf. Notation 1.2, (iii)).
(iii) LetP be a log-full point ofXnlog andPlogthe log scheme obtained by restrict- ing the log structure ofXnlogto the reduced closed subscheme ofXndetermined byP. Then we obtain an outer homomorphism π1(Plog)→Πn (for suitable choices of basepoints). We shall refer to the subgroup Im(π1(Plog) → Πn), which is well-defined up to Πn-conjugation, as alog-full subgroupatP. (iv) We shall often refer to a point of the scheme Xn as a point of Xnlog. Let
P be a point of Xnlog. Then P parametrizes a pointed stable curve of type (g, r+n) (cf. Definition 2.1). Thus, any geometric point of Xnlog lying over P determines a semi-graph of anabelioids of pro-l PSC-type, which is in fact easily verified to be independent of the choice of geometric point lying over P. We shall writeGP for this semi-graph of anabelioids of pro-l PSC-type.
(v) Let us fix an ordered set Cr,n
def= {c1, . . . , cr, x1
def= cr+1, . . . xn
def= cr+n}.
Thus, by definition, for each point P of Xnlog, we have a natural bijection Cr,n →∼ Cusp(GP). In the following, let us identify the set Cusp(GP) with Cr,n.
(vi) We shall refer to an irreducible divisor of Xn contained in the complement Xn\UXn of the interior UXn of Xnlog as a log divisor of Xnlog. That is to say, a log divisor of Xnlog is an irreducible divisor ofXn whose generic point parametrizes a pointed stable curve with precisely two irreducible components (cf. Definition 2.1).
(vii) LetV be a log divisor ofXnlog. Then we shall writeGV for “GP” in the case where we take “P” to be the generic point ofV.
(viii) For eachi∈ {1, . . . , n}, writepi:Xnlog →Xlogfor the projection morphism of co-profile{i}(cf. [MzTa], Definition 2.1, (ii)). Writeιdef= (p1, . . . , pn) :Xnlog→ Xlog×S· · · ×SXlog.
Definition 2.3. Let m ≥ 2 and y1, . . . , ym ∈ Cr,n distinct elements such that
♯({y1, . . . , ym} ∩ {c1, . . . , cr})≤1. Then one verifies immediately — by considering clutching morphisms (cf. [Knu], Definition 3.8) — that there exists a unique log divisor V of Xnlog, which we shall denote by V({y1, . . . , ym}), that satisfies the following condition: GV has precisely two vertices v1, v2 such that v1 is of type
(0, m+ 1),v2 is of type (g, n+r−m+ 1), andy1, . . . , ym are cusps ofGV|v1 (cf.
[CbTpI], Definition 2.1, (iii)).
Remark 2.4. LetV be a log divisor ofXnlog. Then let usobservethat there exists a unique collection of distinct elementsy1, . . . , ym∈Cr,nsuch that♯({y1, . . . , ym}∩
{c1, . . . , cr}) ≤1 and V =V({y1, . . . , ym}). (Note that uniqueness holds even in the case whereg= 0 (in which caser≥3), as a consequence of the condition that
♯({y1, . . . , ym} ∩ {c1, . . . , cr})≤1.) This observation is essentially a special case of Proposition 2.6, (iii), below.
Definition 2.5. LetGbe a semi-graph of anabelioids of pro-lPSC-type andGthe underlying semi-graph ofG. Suppose thatGis a tree. Lete∈Edge(G),v∈Vert(G) be such thateabuts tov. Writebfor the branch ofethat abuts tov. By replacing eby open edges e1, e2 such thate1 abuts tov, and e2 abuts to the vertex̸=v to whicheabuts (resp. e1 abuts tov, ande2 is an edge which abuts to no vertex) if e∈Node(G) (resp.e∈Cusp(G)), we obtain two connected semi-graphs. WriteG̸∋b
for the semi-graph (among these two connected semi-graphs) that does not contain b. Write G∋b for the semi-graph (among these two connected semi-graphs) that containsb. Observe that
• for arbitrarye∈Edge(G),Gdetermines a natural semi-graph of anabelioids of pro-lPSC-typeG∋bwhose underlying semi-graph may be identified with G∋b;
• ife∈Node(G), thenGalso determines a natural semi-graph of anabelioids of pro-lPSC-typeG̸∋bwhose underlying semi-graph may be identified with G̸∋b.
Proposition 2.6. LetP be a point ofXnlog. WriteGfor the underlying semi-graph of GP (cf. Definition 2.2, (iv)). Then the following hold:
(i) Gis a tree.
(ii) Cusp(GP) ={c1, . . . , cr, x1, . . . , xn}.
(iii) There exists a unique vertex vg ∈Vert(GP) that satisfies the following prop- erties:
(a) The genus ofGP|vg (cf. [CbTpI], Definitions 2.1, (iii); 2.3, (ii)) isg.
(b) Let e ∈Node(GP) that abuts to vg and bg the branch of e that abuts to vg. Then♯(Cusp((G)∋bg)∩ {c1, . . . , cr})≥r−1.
(c) For eachv∈Vert(GP)\ {vg}, the genus ofGP|v is0.
Proof. Assertion (i) follows immediately from the definition of GP. Assertion (ii) follows from Definition 2.2, (v). Finally, we verify assertion (iii). Existence is immediate. Ifg̸= 0, uniqueness is immediate. Ifg= 0, it follows thatr≥3. Now assume that there exists a vertexv′g∈Vert(GP) such thatv′g̸=vg, andvg′ satisfies conditions (a), (b). It follows immediately from the connectedness ofGthat there exists a node e∈Node(GP) such that eabuts to vg, andv′g ∈Vert(G̸∋bg), where we write bg for the branch of e that abuts to vg. By condition (b) in the case of vg, bg, it holds that ♯(Cusp(G∋bg)∩ {c1, . . . , cr}) ≥ r−1 ≥ 2. On the other hand, it follows immediately from the connectedness ofGthat there exists a node e′∈Node(GP) such thate′ abuts tov′g, andvg∈Vert(G̸∋b′g), where we writeb′gfor the branch ofe′ that abuts to vg′. Next observe that it follows immediately from the fact thatGis a tree thatG∋bg is a sub-semi-graph ofG̸∋b′g, which implies that
♯(Cusp(G∋b′g)∩ {c1, . . . , cr})≤r−2. Thus, by condition (b) in the case ofvg′,b′g,
we obtain a contradiction.
Definition 2.7. LetP be a point of Xnlog. WriteGfor the underlying semi-graph of GP, vg ∈Vert(GP) for the vertex of Proposition 2.6, (iii). For e∈ Node(GP), writebefor the branch ofesuch thatvg ∈Vert(G∋be). Then we shall write
IGdef= {Cusp((G)̸∋be)∩Cr,n|e∈Node(GP)} ⊆2Cr,n,
where we write 2(−)for the set of subsets of (−). Note that it follows immediately from Proposition 2.6, (iii), that for eachI∈IG,♯I≥2.
Proposition 2.8. Let P, P′ be points of Xnlog. Write G, G′ for the respective underlying semi-graphs ofGP, GP′;vg, vg′ for the respective vertices characterized in Proposition 2.6, (iii). IfIG=IG′ ⊆2Cr,n, then there exists a unique isomorphism of semi-graphsG→∼ G′ that mapsvg7→vg′ and is compatible with the labels of cusps
∈Cr,n. Moreover,♯Vert(G) =♯IG+ 1,♯Node(G) =♯Node(GP) =♯IG.
Proof. Let J ∈ IG. Write J⊆ def= {I ∈ IG | I ⊆ J ⊆ Cr,n}. Then one verifies immediately that one may construct a (well-defined)semi-graphGJ satisfying the following properties:
(i) The elements of Vert(GJ) are equipped with labels ∈ J⊆ that determine a bijection Vert(GJ)→∼ J⊆.
(ii) Let us call a subset{J1, J2} ⊆J⊆of cardinality≤2 anadjacent pairofJ⊆ if J1(J2, and there does not exist an elementI∈IGsuch thatJ1(I(J2. For e∈Node(GJ), write Vert(e)⊆Vert(GJ)→∼ J⊆ for the subset (of cardinality
≤2) of vertices to whicheabuts. Then the assignment Node(GJ)∋e7→Vert(e)∈2Vert(GJ)→∼ 2J⊆
determines a bijection of Node(GJ) onto the set of adjacent pairs ofJ⊆. (iii) The cusps ofGJ are equipped with labels∈Cr,nin such a way that, for each
I∈J⊆, these labels determine a bijection from the set of cusps of the vertex labeled byIonto the subsetI\(∪
IG∋J∗(IJ∗)⊆Cr,n. Moreover, these labels determine a bijection Cusp(GJ)→∼ J (⊆Cr,n).
Next, one verifies immediately that one may construct a (well-defined)semi-graph GIG satisfying the following properties:
(I) There exists a unique vertex ofGIGequipped with a labelvg. The set of cusps of this vertexvgare equipped with labels∈Cr,n which determine a bijection from the set of cusps of this vertexvg to the subsetCr.n\(∪
I∈IGI)⊆Cr,n. (II) The semi-graphGIG is obtained fromvg(together with its associated cusps) bygluingvgtoGJ, whereJ ∈IGranges over the elements ofIGthat aremax- imalwith respect to the relation of inclusion, along a node eJ ∈Node(GIG) that abuts tovg and the vertex ofGJ labeledJ (cf. (i)).
(III) The cusps ofGIG are equipped with labels∈Cr,n that are compatible with the labels of (I) (in the case of the cusps associated to the vertex labeledvg) and (i) (in the case of the cusps associated to vertices∈Vert(GJ), for J as in (II)). These labels determine a bijection Cusp(GIG)→∼ Cr,n.
Then it follows immediately from Definition 2.7 that there exists a unique isomor- phism of semi-graphsG→∼ GIG that is compatible with the label “vg”, as well as
with the labels of cusps∈Cr,n. SinceGis a tree, it follows thatGIG←∼ Gis also a tree. On the other hand, observe that it follows immediately from the construction ofGIG (cf. (i), (I), (II)), together with the definition ofIG(cf. Definition 2.7), that
♯Vert(GIG) =♯IG+ 1. SinceGIGis a tree, we thus conclude that♯Node(GIG) =♯IG. Finally, sinceGIG iscompletely determinedby the subsetIG⊆2Cr,n, the remainder
of Proposition 2.8 follows immediately.
Proposition 2.9. LetP be a point ofXnlogandI⊆Cr,nsuch that♯(I∩{c1, . . . , cr})
≤1. WriteGfor the underlying semi-graph of GP. Then the following conditions are equivalent:
(i) P ∈V(I)(cf. Definition 2.3).
(ii) I∈IG.
(iii) GV(I) is obtained from GP by generization (with respect to some subset of Node(GP) (cf.[CbTpI], Definition 2.8)).
Proof. The equivalence (i)⇐⇒(iii) follows immediately — by consideringclutching morphisms (cf. [Knu], Definition 3.8) — from the latter portion of Definition 2.2, (vi). The equivalence (ii)⇐⇒(iii) follows immediately from Definition 2.7.
Proposition 2.10. Let m ∈ {1, . . . , n}; V1, . . . , Vm a collection of distinct log divisors ofXnlog such that V1∩ · · · ∩Vm̸=∅. Then there exist nonnegative integers i0, . . . , im such that
i0+· · ·+im=n−m, and the intersectionV1∩ · · · ∩Vmis isomorphic, over S, to
Xi0×S(M0,i1+3×Z· · · ×ZM0,im+3×ZS).
In particular, the intersection V1∩ · · · ∩Vm is irreducible of dimensionn−m; if m=n, thenV1∩ · · · ∩Vn is (the reduced closed subscheme determined by) a log-full point.
Proof. LetP be a generic point ofV1∩· · · ∩Vm. WriteGP for the underlying semi- graph ofGP. Recall from Proposition 2.8 that♯Vert(GP)−1 =♯Node(GP) =♯IGP. Thus, we conclude from Remark 2.4, together with the equivalence (i)⇐⇒ (ii) of Proposition 2.9, that
♯Node(GP) =♯IGP =♯{V |V is a log divisor ofXnlog such thatP ∈V} ≥m.
Since the divisor that determines the log structure ofXnlog is a divisor with normal crossings, we thus conclude that♯Vert(GP)−1 =♯Node(GP) =m, and hence that
{V |V is a log divisor ofXnlog such thatP ∈V}={V1, . . . , Vm}. Thus, it follows from Proposition 2.6, (ii), that
♯{branches of edges (i.e., cusps and nodes) ofGP}=n+r+ 2m.
Next, observe that it follows from Proposition 2.6, (iii), that there exists aclutch- ing morphism
ρP:Xi0×S(M0,i1+3×Z· · · ×ZM0,im+3×ZS)→Xn
(cf. [Knu], Definition 3.8) such thatP lies in the image of this morphismρP. Since the morphism ρP is a proper monomorphism (cf. Propositions 2.6, (iii); 2.8), it follows that the morphism ρP is a closed immersion. Thus, if we write XP for the scheme-theoretic closure ofP inXn andXρP for the image of ρP in Xn, then XP ⊆XρP.
Next, observe that since the sum of the cardinalities of the sets of cusps of the pointed stable curves parametrized by the moduli stack factors of the domain of ρP is equal to
(i0+r) +
∑m
j=1
(ij+ 3), it holds that
(i0+r) +
∑m
j=1
(ij+ 3) =♯{branches of edges ofGP}=n+r+ 2m, and hence that
i0+
∑m
j=1
ij =n−m.
Since
dim(XρP) = dim(Xi0×S(M0,i1+3×Z· · · ×ZM0,im+3×ZS)) =i0+
∑m
j=1
ij, andV1∪ · · · ∪Vmis a divisor with normal crossings (which implies that dim(XP) = dim(V1∩ · · · ∩Vm) =n−m), we thus conclude that
dim(XρP) = dim(XP), and hence thatXρP =XP. Moreover, since
{V |V is a log divisor ofXnlog such thatP ∈V}={V1, . . . , Vm},
we thus conclude from Remark 2.4, together with the equivalence (i) ⇐⇒ (ii) of Proposition 2.9, that{V1, . . . , Vm}determinesIGP, hence, by Proposition 2.8, that {V1, . . . , Vm}determinesGP. But this implies that every generic point ofV1∩· · ·∩Vm
lies in XρP, for some fixedP, and hence that V1∩ · · · ∩Vm is irreducible. This
completes the proof of Proposition 2.10.
3. Various types of log divisors
We continue with the notation introduced at the beginning of §2. In addition, we suppose that n∈ Z>1. In the present §3, we define various types of log divisors and study their geometry.
Definition 3.1. (i) For positive integers i∈ {1, . . . , n−1}, j ∈ {i+ 1, . . . , n}, write
πi,j:X×S· · · ×SX→X×SX
for the projection of the fiber product ofncopies ofX→S to thei-th andj- th factors. Writeδ′i,jfor the inverse image viaπi,jof the image of the diagonal embeddingX ,→X×SX. Writeδi,j for the uniquely determined log divisor of Xnlog whose generic point maps to the generic point ofδi,j′ via the natural morphismXn →X×S· · · ×SX (cf. Definition 2.2, (viii)). We shall refer to the log divisorδi,j as anaive diagonalofXnlog.
(ii) LetV be a log divisor ofXnlog. We shall say thatV is atripodal divisorif one of the vertices of GV (cf. Definition 2.2, (vii)) is a tripod (cf. Notation 1.3, (v)).
(iii) Let V be a log divisor ofXnlog. We shall say thatV is a (g, r)-divisorif one of the vertices ofGV is of type (g, r) (cf. [CbTpI], Definition 2.3, (iii)).
(iv) LetV be a log divisor ofXnlog. We shall say thatV is adrift diagonalif there exist a naive diagonal δ and an automorphism α of Xnlog over S such that V =α(δ).
Remark 3.2. Recall (cf. [NaTa], Theorem D) that:
• when (g, r) = (0,3) or (1,1), any automorphism ofXnlog overS necessarily arises as the composite of an automorphism (of Xnlog that arises from an automorphism) ofXlog over S with an automorphism of Xnlog that arises from a permutation of the r+n marked points of the stable log curve Xn+1log →Xnlog;
• when (g, r) ̸= (0,3),(1,1), any automorphism of Xnlog over S necessarily arises as the composite of an automorphism (of Xnlog that arises from an automorphism) ofXlog over S with an automorphism of Xnlog that arises from a permutation of thenfactors ofXnlog.
Proposition 3.3. The following hold:
(i) It holds that
{naive diagonals}={V({xi, xj})|i∈ {1, . . . , n−1}, j∈ {i+ 1, . . . , n}}
(cf. Definition 2.3).
(ii) If(g, r)̸= (0,3), then
{tripodal divisors}
={V({y1, y2})|y1, y2∈Cr,n are distinct elements,{y1, y2} ̸⊆ {c1, . . . , cr}}
(cf. Definition 2.3).
(iii) If(g, r) = (0,3), then
{tripodal divisors}={V({y1, y2})|Cr,n⊇ {y1, y2} ̸⊆ {c1, c2, c3}}
∪ {V({y1, y2})def= V(Cr,n\ {y1, y2})| {y1, y2} ⊆ {c1, c2, c3}}
(cf. Definition 2.3).
(iv) Let V be a tripodal divisor and α an automorphism of Xnlog over S. Then α(V)is a tripodal divisor.
Proof. First, assertion (i) follows immediately from the various definitions involved.
Next, assertions (ii), (iii) follow immediately from Remark 2.4, together with the definition of tripodal divisors. Finally, we consider assertion (iv). It follows from Re- mark 3.2 thatαlifts to an automorphism ofXn+1log relative to the natural morphism Xn+1log →Xnlog, hence induces an isomorphism of GV with Gα(V). This completes
the proof of assertion (iv).
Proposition 3.4. The following hold:
(i) It holds that
{naive diagonals} ⊆ {drift diagonals} ⊆ {tripodal divisors} ⊆ {log divisors}. (ii) If(g, r)̸= (0,3),(1,1), then
{naive diagonals}={drift diagonals}.
(iii) If(g, r) = (0,3) or(1,1), then
{drift diagonals}={tripodal divisors}.
Proof. First, we verify assertion (i). The first and third inclusions follow imme- diately from the various definitions involved. The second inclusion follows from Proposition 3.3, (i), (iv). This completes the proof of assertion (i). Assertion (ii) follows immediately from Remark 3.2.
Finally, we consider assertion (iii). Let V be a tripodal divisor. Let us first suppose that (g, r) = (0,3). Then Xnlog is naturally isomorphic to the mod- uli stack (Mlog0,n+3)k
def= Mlog0,n+3×ZS over S, on which the symmetric group on n+ 3 letters acts naturally. Moreover, it follows from Proposition 3.3, (iii), that V = V({y1, y2}), where y1, y2 ∈ Cr,n are distinct elements. Thus, there exists a permutationα∈ Sn+3 such that α(V({x1, x2})) =V({y1, y2}). Assertion (iii) in the case where (g, r) = (0,3) now follows immediately.
Next, let us suppose that (g, r) = (1,1). ThenXnlog is naturally isomorphic to the fiber productMlog1,n+1×Mlog
1,1
SoverS, where the arrowS→ Mlog1,1is taken to be the classifying morphismS→ Mlog1,1determined byXlog(cf. Definition 2.1). Thus, one verifies easily, by considering the automorphisms of an elliptic curve given by translation by a rational point, that the action of the symmetric group on n+ 1 letters on Mlog1,n+1 induces an action of the symmetric group on n+ 1 letters on Xnlog. Moreover, it follows from Proposition 3.3, (ii), thatV =V({y1, y2}), where y1, y2∈Cr,n arearbitrary distinct elements (cf. Definition 2.3). Thus, there exists a permutationα∈Sn+1 such thatα(V({x1, x2})) =V({y1, y2}). Assertion (iii) in the case where (g, r) = (1,1) now follows immediately.
Definition 3.5. LetG be a semi-graph of anabelioids of pro-lPSC-type.
(i) We shall say that a vertex ofGis aterminal vertexif precisely one node abuts to it.
(ii) We shall say that a node of G is a terminal node if it abuts to a terminal vertex.
(iii) Write
TerNode(G)⊆Node(G) for the set of terminal nodes ofG.
Proposition 3.6. Let P be a closed point ofXnlog. Then it holds that P is a log-full point⇐⇒Node(Gp) =n.
Proof. This equivalence follows immediately from Definitions 2.1, 2.2, (ii), together with the well-known modular interpretation of the log moduli stacks that appear in the definition of Xnlog (where we recall that the log structure of this log stack
arises from a divisor with normal crossings).
Proposition 3.7. Let P be a log-full point of Xnlog andAa log-full subgroup atP (cf. Definition 2.2, (iii)). Then the following hold:
(i) It holds that ♯Node(GP) = n. The underlying semi-graph of GP is a tree that has preciselyn+ 1 vertices, one of which is of type (g, r) (cf. [CbTpI], Definition 2.3, (iii)); the other vertices are tripods (cf. Notation 1.3, (v)).
(ii) Write Node(GP) ={e1, . . . , en} (cf. (i)). Then for each i∈ {1, . . . , n}, there exists a unique log divisorVi such that there exists an isomorphism ofGVi with (GP) Node(GP)\{ei}(cf.[CbTpI], Definition 2.8) which preserves the respective orderings of cusps. In this situation, we shall say that Vi is the log divisor associated to ei∈Node(GP).
(iii) In the situation of (ii),
P =V1∩ · · · ∩Vn andA=IV1× · · · ×IVn,
where IVi ⊆ Πn is a suitable inertia group associated to Vi contained in A.
Moreover, for each i∈ {1, . . . , n}, it holds thatIVi≃Zl andA≃Z⊕ln. (iv) Letm be a positive number; W1, . . . , Wm distinct log divisors such that P =
W1∩ · · · ∩Wm. Thenm=n, and{W1, . . . , Wm}={V1, . . . , Vn} (cf. (iii)).
Proof. Assertion (i) follows immediately from Propositions 2.6, 2.8, and 3.6, to- gether with the observation that a log-full point (cf. Definition 2.2, (ii)) corre- sponds to an intersection of the sort considered in Proposition 2.10, in the case where n =m, and ij = 0, forj = 0,1, . . . , m. Assertion (ii) follows immediately from Proposition 2.9. Assertion (iii) follows from Propositions 2.9 and 2.10, and [CbTpI], Lemma 5.4, (ii). Assertion (iv) follows immediately from Propositions 2.8,
2.9, 2.10, together with assertion (iii).
Definition 3.8. Let P be a log-full point of Xnlog and V1, . . . , Vn the log divisors such that P =V1∩ · · · ∩Vn (cf. Proposition 3.7, (iv)). We shall say thatVi is a terminal divisorofP if there exists a terminal nodee∈TerNode(GP) such thatVi
is the log divisor associated toe∈Node(GP) (cf. Proposition 3.7, (ii)).
Lemma 3.9. LetP be a log-full point ofXnlog andV1, . . . , Vn the log divisors such thatP =V1∩ · · · ∩Vn (cf. Proposition 3.7, (iv)). Then the following conditions are equivalent:
(i) Vi is a terminal divisor of P.
(ii) Vi is a tripodal divisor or a(g, r)-divisor.
Proof. The implication (i) =⇒ (ii) follows from Proposition 3.7, (i), (ii). The implication (ii) =⇒ (i) follows immediately from the various definitions involved.
Theorem 3.10. For ∈ {◦,•}, let l be a prime number; k an algebraically closed field of characteristic̸=l;S def= Spec(k);(g, r)a pair of nonnegative integers such that2g−2 +r>0;
Xlog→S a smooth log curve of type (g, r);n ∈Z>1;Xlog
n the n-th log configuration space associated to Xlog → S; Π def= πpro-l1 (Xnlog) (for a suitable choice of basepoint);
ϕ: Π◦ ∼→Π•
an isomorphism of profinite groups. Then the following hold:
(i) (g◦, r◦, n◦) = (g•, r•, n•).
(ii) If (g, r) ̸= (0,3),(1,1), then ϕ induces a bijection between the set of fiber subgroups of a given co-length (cf.[MzTa], Definition 2.3, (iii)) ofΠ◦and the set of fiber subgroups of the same co-length ofΠ•.
(iii) Suppose that (g, r)̸= (0,3),(1,1). WriteιΠ: Π→Π1 × · · · ×Π1 for the outer homomorphism induced byι:Xlog
n →Xlog×S· · · ×SXlog (cf.
Definition 2.2, (viii)), where Π1 def= π1pro-l(Xlog) (for a suitable choice of basepoint). Thenϕ induces a commutative diagram
Π◦ ϕ //
ι◦Π
Π•
ι•Π
Π◦1× · · · ×Π◦1 ∼ //Π•1× · · · ×Π•1,
where the lower horizontal isomorphism preserves the respective direct product decompositions (but possibly permutes the factors).
Proof. Assertion (i) follows from [HMM], Theorem A, (i). Assertion (ii) follows from [MzTa], Corollary 6.3. Assertion (iii) follows from assertion (ii).
4. Reconstruction of non-degenerate elements of log-full subgroups We continue with the notation of§3. In the present §4, we reconstruct the subset of scheme-theoretically non-degenerate elements (cf. Definition 4.6, (i), below) of a log-full subgroup (cf. Theorem 4.15 below).
Proposition 4.1. Let m < n be an integer, q:Xnlog → Xmlog a projection, V a log divisor of Xnlog. Write q: Πn → Πm for the outer homomorphism induced by q:Xnlog→Xmlog. Suppose thatq(V)(Xm. Then the following hold:
(i) q(V)is a log divisor of Xmlog.
(ii) Let IV ⊆Πn be an inertia group associated to V. Then q(IV)(≃IV) is an inertia group associated toq(V).
Proof. Assertion (i) follows immediately from the latter portion of Definition 2.2, (vi), together with the well-known modular interpretation of the log moduli stacks that appear in the definition ofXnlogandXmlog. Assertion (ii) follows from [NodNon], Remark 2.4.2, together with thesurjectivityportion of [NodNon], Lemma 2.7, (ii).
Proposition 4.2. LetP be a log-full point ofXnlog;V1, . . . , Vn the log divisors such thatP =V1∩· · ·∩Vn;A=IV1×· · ·×IVn the log-full subgroup atP (cf. Proposition 3.7, (iii), (iv)). Then the following hold:
(i) There exists a tripodal divisor in {V1, . . . , Vn}. Suppose that V1 is a tripodal divisor. Thus, GV1 has precisely two vertices v1, v′1, one of which is a tripod.
Suppose thatv1 is a tripod.
(ii) If r = 1, then there exists a unique (g, r)-divisor in {V1, . . . , Vn}. Suppose thatVn is this unique (g, r)-divisor.
(iii) In the situation of (i), if(g, r)̸= (0,3), then there exists ani0∈ {1+r, . . . , n+
r}such thatci0 is a cusp ofGV1|v1 (cf.[CbTpI], Definition 2.1, (iii)). In this case, write p: Xnlog → Xnlog−1 for the projection morphism of profile {i0−r} (cf.[MzTa], Definition 2.1, (ii)).
(iv) In the situation of (i), if(g, r) = (0,3), then there exists ani0∈ {1, . . . ,3 +n} such that ci0 is a cusp ofGV1|v1. In this case, writep:Xnlog→Xnlog−1 for the