Review pending

Lemma 11.6.3 · Selection below a continuous barrier

Lemma 11.6.3. (Selection below a continuous barrier). If f∈D(S)f\in D(\mathscr S) and b∈C(K,R)b\in C(K,\mathbf R) satisfy f<bf<b everywhere on KK, then there is s∈Ss\in\mathscr S such that f≤s<bon K.\begin{equation} f\leq s<b\quad\text{on }K. \end{equation}

Argument in the manuscript

Proof. We prove the assertion by induction on the stage containing ff. At stage zero, take s=fs=f. At a successor stage, write fj↓ff_j\downarrow f with all fjf_j in the preceding stage. The sets Oj={z∈K:fj(z)<b(z)}O_j=\{z\in K:f_j(z)<b(z)\} are open, increase with jj, and cover KK. Openness uses upper semicontinuity of fj−bf_j-b, and the covering property uses f<bf<b. By compactness, ON=KO_N=K for some NN. Apply the induction hypothesis to fNf_N and the same barrier bb. It gives f≤fN≤s<bf\leq f_N\leq s<b. At a limit ordinal, ff already belongs to one earlier stage by definition, so the induction hypothesis applies directly. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-900120.

Proof in chapter