NAG-002330 · Accepted whole

The least marked semistable hull

4 Analytic curves and skeleta

Open in the English reader · PDF page 792

Statement · exact TeX
\begin{theorem}[The least marked semistable hull]
\label{v037:f5:leastsemistablehull}
Suppose $C$ admits a semistable algebraic model over $O$, and fix
an unramified marking datum $D$. For every finite nonempty set
$S\subset C^{\an}$ of points with unramified branch certificates,
there is a least finite vertex set $H_D(S)$ admissible for $(C,D)$
and containing $S$. Equivalently, there is a marked semistable
algebraic model $\mathcal M_D(S)$ containing $S$ such that every
marked semistable algebraic model containing $S$ has a unique
marked morphism to $\mathcal M_D(S)$ inducing the identity on $C$.

For $S\subset S'$ the resulting models have a unique compatible
morphism $\mathcal M_D(S')\to\mathcal M_D(S)$.
Any finite nonempty family of models marked by $D$ has a least
common dominating model: take $S$ to be the union of their vertex
sets. Any group of compatible semilinear isometric automorphisms
of $(C,D)$ preserving $S$ extends uniquely to $\mathcal M_D(S)$.
\end{theorem}
Full selected proof · exact TeX
\begin{proof}
Theorem~\ref{v037:f5:vertexcertificate} constructs an original-field
semistable model containing $S$. Apply
Theorem~\ref{v037:f5:unramifiedrefinement} to give it the prescribed
smooth marking $D$, while retaining $S$; call the resulting model
$\mathcal X$. Proposition~\ref{v037:f5:leastcontraction} gives
$\mathcal M=\mathcal X_S$.

Let $\mathcal Y$ be any other model marked by $D$ and containing
$S$. Theorem~\ref{v037:f5:commondomination} gives an actual common
marked semistable model $\mathcal T$ of $\mathcal X$ and
$\mathcal Y$. Its geometric graph can be pruned to that of
$\mathcal X$, and then to the terminal graph of $\mathcal M$,
by Proposition~\ref{v036:f5:forestnecessity} and
Lemma~\ref{v037:f5:pruningconfluence}. It can also be pruned to
the graph of $\mathcal Y$. The protected geometric labels are
the same entire inverse image of $S$ throughout, by
Proposition~\ref{v036:f5:vertexarithmetic}. Confluence
therefore makes the terminal graph obtained from $\mathcal Y$
equal to that of $\mathcal M$, with the same retained analytic
labels. In particular $V(\mathcal M)\subset V(\mathcal Y)$.
Theorem~\ref{v037:f5:algebraicdomination} and
Corollary~\ref{v037:f5:intrinsicuniqueness} give the unique marked
map $\mathcal Y\to\mathcal M$.

The vertex set $H_D(S)=V(\mathcal M)$ is admissible by
Theorem~\ref{v037:f5:intrinsiccorrespondence}. Conversely every
admissible finite set containing $S$ is the vertex set of a model
in the preceding comparison. Thus it contains $H_D(S)$.
This proves both the minimum and independence of the initially
chosen model. It also proves that $\mathcal M$ is unique up to
its unique generic-identity marked isomorphism.

If $S\subset S'$, the model for $S'$ contains $S$, giving the
stated unique morphism and all composition compatibilities.
For a finite family of marked models, each vertex has a certificate
by Theorem~\ref{v037:f5:vertexcertificate}. Apply the construction
to their finite nonempty union. Its model dominates every family
member by vertex inclusion. Every common dominating model contains
that union and therefore has a unique map to this one.

Finally a compatible semilinear isometry preserving $S$ transports
the class of marked models containing $S$ to itself. The universal
property identifies its transform of $\mathcal M$ with
$\mathcal M$; equivalently, it preserves $H_D(S)$.
Corollary~\ref{v037:f5:intrinsicactions} extends these isometries
to the model and proves the group law and uniqueness.
Every construction kept the original valuation ring and absolute
value; $\Omega$ was used only for the geometric graph comparison.
\end{proof}
Typeset reader excerpt
Typeset mathematical passage from PDF page 793
PDF page 793

Typed proof inputs

Reader cross-references

Proof map

Verified map inputs · NAG-002330

AND · joint registered proof inputs

  • NAG-002271 · The arithmetic of a model vertex · accepted whole Exact source window 278–300
    • Insert the given certified points and prescribed marking in one original-field model. Its least contraction is terminal in the same protected geometric graph as the graph reached from any competing model via actual common domination. Whole geometric preimages identify the original labelled vertices. Use actual marked domination and uniqueness.
  • NAG-002275 · Necessity of the geometric marked forest condition · accepted whole Exact source window 278–300
    • Insert the given certified points and prescribed marking in one original-field model. Its least contraction is terminal in the same protected geometric graph as the graph reached from any competing model via actual common domination. Whole geometric preimages identify the original labelled vertices. Use actual marked domination and uniqueness.
  • NAG-002311 · Algebraic domination from vertex inclusion · accepted whole Exact source windows 302–316, 278–300
    • Transfer the minimum to admissible sets by the precise original-field correspondence. Inclusion gives the unique morphism for nested sets, and the union of finitely many vertex sets has certificates and yields the least common dominating model.
    • Insert the given certified points and prescribed marking in one original-field model. Its least contraction is terminal in the same protected geometric graph as the graph reached from any competing model via actual common domination. Whole geometric preimages identify the original labelled vertices. Use actual marked domination and uniqueness.
  • NAG-002312 · Algebraic uniqueness without a supplied common model · accepted whole Exact source windows 302–316, 318–325, 278–300
    • Transfer the minimum to admissible sets by the precise original-field correspondence. Inclusion gives the unique morphism for nested sets, and the union of finitely many vertex sets has certificates and yields the least common dominating model.
    • Transport the actual marked model by the given compatible semilinear isometries. The universal property preserves the least set, and the fixed-model extension theorem supplies the action and uniqueness.
    • Insert the given certified points and prescribed marking in one original-field model. Its least contraction is terminal in the same protected geometric graph as the graph reached from any competing model via actual common domination. Whole geometric preimages identify the original labelled vertices. Use actual marked domination and uniqueness.
  • NAG-002316 · Realizing an unramified marking on the original model · accepted whole Exact source window 278–300
    • Insert the given certified points and prescribed marking in one original-field model. Its least contraction is terminal in the same protected geometric graph as the graph reached from any competing model via actual common domination. Whole geometric preimages identify the original labelled vertices. Use actual marked domination and uniqueness.
  • NAG-002318 · Common original-field semistable models · accepted whole Exact source window 278–300
    • Insert the given certified points and prescribed marking in one original-field model. Its least contraction is terminal in the same protected geometric graph as the graph reached from any competing model via actual common domination. Whole geometric preimages identify the original labelled vertices. Use actual marked domination and uniqueness.
  • NAG-002321 · Which original-field points occur as model vertices · accepted whole Exact source windows 278–300, 302–316
    • Insert the given certified points and prescribed marking in one original-field model. Its least contraction is terminal in the same protected geometric graph as the graph reached from any competing model via actual common domination. Whole geometric preimages identify the original labelled vertices. Use actual marked domination and uniqueness.
    • Transfer the minimum to admissible sets by the precise original-field correspondence. Inclusion gives the unique morphism for nested sets, and the union of finitely many vertex sets has certificates and yields the least common dominating model.
  • NAG-002323 · Intrinsic correspondence over the original field · accepted whole Exact source window 302–316
    • Transfer the minimum to admissible sets by the precise original-field correspondence. Inclusion gives the unique morphism for nested sets, and the union of finitely many vertex sets has certificates and yields the least common dominating model.
  • NAG-002324 · Extension of semilinear actions · accepted whole Exact source window 318–325
    • Transport the actual marked model by the given compatible semilinear isometries. The universal property preserves the least set, and the fixed-model extension theorem supplies the action and uniqueness.
  • NAG-002328 · Confluence and finite forests · accepted whole Exact source window 278–300
    • Insert the given certified points and prescribed marking in one original-field model. Its least contraction is terminal in the same protected geometric graph as the graph reached from any competing model via actual common domination. Whole geometric preimages identify the original labelled vertices. Use actual marked domination and uniqueness.
  • NAG-002329 · The least contraction retaining specified vertices · accepted whole Exact source window 278–300
    • Insert the given certified points and prescribed marking in one original-field model. Its least contraction is terminal in the same protected geometric graph as the graph reached from any competing model via actual common domination. Whole geometric preimages identify the original labelled vertices. Use actual marked domination and uniqueness.