Closed

A Laurent refinement tree over the original algebra

Proposition 2.28.8. (A Laurent refinement tree over the original algebra). Assume that the valuation of KK is nontrivial. Every finite covering of XX by objects of RX\mathcal R_X has a subordinate finite Laurent tree in the sense just specified: each leaf is contained in one covering member. All nodes, including those obtained by comparing ratios in intermediate algebras, remain rational over the original AA. The child and intersection maps agree with the actual elementary quotient maps.

Proof

Proof. If A=0A=0, use the single empty node. Otherwise Proposition 2.22.8 gives a standard rational refinement generated by a unit-ideal tuple f0,…,fs∈Af_0,\ldots,f_s\in A. Choose a unit certificate ∑iaifi=1\sum_i a_if_i=1 and κ∈K×\kappa\in K^\times with ∣κ∣max⁡i∥ai∥<1|\kappa|\max_i\|a_i\|<1. Split successively by the elementary Laurent pairs for f0/κ,…,fs/κf_0/\kappa,\ldots,f_s/\kappa. Each partial branch is an intersection of rational subsets over AA: its positive condition has denominator 11, and its negative condition has tuple (fi;κ)(f_i;\kappa), which generates the unit ideal because κ≠0\kappa\ne 0. Proposition 2.22.6 and Lemma 2.18.1 identify its algebra with the simultaneous relation quotient. Theorem 2.19.3 identifies each binary pair with a covering of its parent.

Consider a completed first-stage branch with algebra CC. Let PP and NN be its positive and negative index sets. Lemma 2.22.4 says that C=0C=0 when NN is empty. For i∈Ni\in N, the element fif_i is a unit in CC and ∥κ/fi∥≤1\|\kappa/f_i\|\leq 1. For a nonzero branch, split further, successively, by the finitely many ratios qij=fi/fjq_{ij}=f_i/f_j with i<ji<j in NN. We verify that this second-stage operation stays in RX\mathcal R_X, rather than assuming rational transitivity.

The two rational subsets of the original XX Wij+={∣fi∣≤∣fj∣, ∣κ∣≤∣fj∣},Wij−={∣fj∣≤∣fi∣, ∣κ∣≤∣fi∣}\begin{aligned} W_{ij}^+&=\{|f_i|\leq|f_j|,\ |\kappa|\leq|f_j|\},\\ W_{ij}^-&=\{|f_j|\leq|f_i|,\ |\kappa|\leq|f_i|\} \end{aligned} have unit-ideal tuples (fj;fi,κ)(f_j;f_i,\kappa) and (fi;fj,κ)(f_i;f_j,\kappa). Let DD be CC or any partial second-stage branch. By induction its quotient map from CC is contractive, so both fi,fjf_i,f_j remain units and the bounds ∥κ/fi∥,∥κ/fj∥≤1\|\kappa/f_i\|,\|\kappa/f_j\|\leq 1 persist. Over DD, intersection with Wij+W_{ij}^+ has the joint presentation D{Z,Y}/(fjZ−fi,fjY−κ)≃D{Z,Y}/(Z−qij,Y−κ/fj)≃D{Z}/(Z−qij).D\{Z,Y\}/(f_jZ-f_i,f_jY-\kappa) \simeq D\{Z,Y\}/(Z-q_{ij},Y-\kappa/f_j) \simeq D\{Z\}/(Z-q_{ij}). The first equality uses a unit and does not change the actual ideal. In the second, inclusion and substitution Y=κ/fjY=\kappa/f_j are inverse contractions by Lemma 2.22.2 and the iterated-quotient lemma. Thus this is the positive elementary quotient with its actual quotient norm. The negative intersection is similarly D{Z}/(Z−fj/fi)D\{Z\}/(Z-f_j/f_i), whose actual ideal equals (1−qijZ)(1-q_{ij}Z) because qijq_{ij} is a unit. Imposing both signs gives the same joint presentation as their elementary intersection. All maps fix DD and the indicated ratios, so these isometries commute with restriction. This proves the inductive presentation requirement for every partial branch. The subsets cover their parent because any two nonnegative real numbers are comparable and the scalar lower bounds already hold there.

At a second-stage leaf, Lemma 2.22.3 chooses k∈Nk\in N with ∥fi/fk∥≤1\|f_i/f_k\|\leq 1 for every i∈Ni\in N. For p∈Pp\in P, write fp=κXpf_p=\kappa X_p and κ/fk=Xk\kappa/f_k=X_k from the first-stage relations; then fp/fk=XpXkf_p/f_k=X_pX_k also has norm at most one. Hence the leaf factors contractively through the kkth member of the standard rational family. That member is contained in an original covering member. The construction has finitely many stages and finitely many branches. Empty branches use the zero algebra, as follows either from their explicit relation or from Theorem 1.12.3. This completes the required finite tree. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-001527, 2.28.8.

Proof in chapter · Fixed-edition record