Proposition 4.49.4. (The least contraction retaining specified vertices). Let be a marked semistable algebraic model, with vertex set , and let . There is a marked semistable algebraic model and a morphism retaining such that every marked contraction retaining has a unique factorization Its geometric marked graph is the terminal graph of Definition 4.49.2, with protected set equal to the entire inverse image of and with the vertices whose normalized residual component is . The construction uses finitely many actual contractions over .
Proof
Proof. Use the actual coefficient extension to from Lemma 4.28.1 and the geometric marked dual graph of Definition 4.45.3. Its vertex set is the entire inverse image of by Proposition 4.45.2. The normalized residual component at a retained geometric vertex is unchanged under a model morphism: it is the intrinsic normal proper curve of Theorem 4.29.2. This makes the decoration independent of subsequent contractions.
A geometric component is itself a smooth projective line exactly when its normalization is a projective line and it has no self-node. Here a self-node is precisely a loop of the dual graph. Indeed the actual normalization squares of Lemma 4.24.1 separate exactly the two branches of each node. At a node joining different components, the selected component has just one smooth branch: in a pointed étale chart it is one of the two axes. Smooth locality on the source, [StacksAlg] (Tag 036U), descends this assertion to that component. Away from the nodes normalization is already an isomorphism, as in Lemma 4.31.1. Thus a component without self-nodes is its smooth normalization; the assertion follows.
Let be the set of all currently deletable geometric vertices. It is invariant under : the action preserves incidence, loops, the marked-leg set, the normalized component isomorphism class, and the protected set. Lemma 4.49.1 makes the entire inverse image of a subset of original components.
Every vertex of the graph induced by has degree at most two in the full graph. A connected component of it cannot contain a cycle: all vertices of that cycle would already have full degree two and no edge leaving it. It would be the whole connected graph, contrary to the nonempty protected complement. Thus is a tree. Put . Counting its internal edges gives All its actual geometric components are smooth projective lines by the preceding paragraph. Therefore the complement of satisfies the exact marked forest condition, and Theorem 4.45.5 constructs an actual original- contraction deleting precisely . Its fibre description gives exactly the graph operations in Lemma 4.49.3, including the transfer of a mark and the creation of a self-node from two coincident ends. The whole marking remains the original finite étale -scheme.
Repeat with all deletable vertices of the new model. Each nonempty round removes original components and retains , so after finitely many rounds the process stops at a model with no deletable geometric vertex. Each round is a forest contraction and hence decomposes combinatorially into elementary prunings by Lemma 4.49.3. That lemma identifies the resulting graph with its unique terminal graph. Single geometric deletions in this combinatorial comparison need not descend individually; every algebraic round used the entire invariant forest and the original-field contraction theorem.
Now let be any marked contraction retaining . Proposition 4.45.6 says that its removed components satisfy the marked forest condition. The target has the graph of that forest contraction: the exact contraction of Theorem 4.45.5 to the same vertex set has the stated fibres and is identified with by Proposition 4.45.7. It is consequently a sequence of elementary prunings on the geometric graph. Continuing to a terminal graph and applying confluence shows that every retained vertex of is a vertex of . The entire-fibre identification of Proposition 4.45.2 gives the same inclusion for original analytic vertices. Theorem 4.46.2 now supplies the actual map , and Corollary 4.46.3 makes it marked. Uniqueness of the morphisms inducing the generic identity proves the factorization and its uniqueness. ◻