Proposition 2.28.8. (A Laurent refinement tree over the original algebra). Assume that the valuation of is nontrivial. Every finite covering of by objects of 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 . The child and intersection maps agree with the actual elementary quotient maps.
Proof
Proof. If , use the single empty node. Otherwise Proposition 2.22.8 gives a standard rational refinement generated by a unit-ideal tuple . Choose a unit certificate and with . Split successively by the elementary Laurent pairs for . Each partial branch is an intersection of rational subsets over : its positive condition has denominator , and its negative condition has tuple , which generates the unit ideal because . 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 . Let and be its positive and negative index sets. Lemma 2.22.4 says that when is empty. For , the element is a unit in and . For a nonzero branch, split further, successively, by the finitely many ratios with in . We verify that this second-stage operation stays in , rather than assuming rational transitivity.
The two rational subsets of the original have unit-ideal tuples and . Let be or any partial second-stage branch. By induction its quotient map from is contractive, so both remain units and the bounds persist. Over , intersection with has the joint presentation The first equality uses a unit and does not change the actual ideal. In the second, inclusion and substitution 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 , whose actual ideal equals because is a unit. Imposing both signs gives the same joint presentation as their elementary intersection. All maps fix 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 with for every . For , write and from the first-stage relations; then also has norm at most one. Hence the leaf factors contractively through the th 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. ◻