Closed

Points of a strict rational quotient

Theorem 2.19.3. (Points of a strict rational quotient). With A,g,fi,ρ,BA,g,f_i,\rho,B as in Corollary 2.19.2, the map induced by A→BA\to B is a homeomorphism M(B)→∼V={x∈M(A):∣fi∣x≤ρi∣g∣x for 1≤i≤s},\mathcal M(B)\xrightarrow{\sim} V=\{x\in\mathcal M(A): |f_i|_x\leq\rho_i|g|_x \text{ for }1\leq i\leq s\}, where both spectra carry the evaluation topology and VV the subspace topology. The subset VV is closed. This includes B=0B=0 and an empty spectrum; it does not assert that an algebra with empty spectrum must be zero.

Proof

Proof. Step 1: construct the point over xx. The unit-ideal identity in the preceding proof shows that ∣g∣x>0|g|_x>0 for every x∈Vx\in V. By Lemma 1.6.1, xx defines an absolute value on the field Fx=Frac⁡(A/ker⁡x)F_x=\operatorname{Frac}(A/\ker x), with ∣a∣x≤∥a∥|a|_x\leq\|a\| for a∈Aa\in A. Evaluate polynomials at Xi=fi/gX_i=f_i/g in FxF_x. The resulting multiplicative seminorm αx\alpha_x on A[X]A[X] satisfies αx(∑νaνXν)≤max⁡ν∣aν∣x∏i∣fi/g∣xνi≤max⁡ν∥aν∥ρν.\alpha_x\left(\sum_\nu a_\nu X^\nu\right) \leq\max_\nu |a_\nu|_x\prod_i|f_i/g|_x^{\nu_i} \leq\max_\nu\|a_\nu\|\rho^\nu. For polynomials P,QP,Q, the ultrametric inequality also gives ∣αx(P)−αx(Q)∣≤αx(P−Q)≤∥P−Q∥.|\alpha_x(P)-\alpha_x(Q)|\leq\alpha_x(P-Q)\leq\|P-Q\|. Given F∈D=A{ρ−1X}F\in D=A\{\rho^{-1}X\}, choose polynomial truncations Pn→FP_n\to F. The displayed estimate makes αx(Pn)\alpha_x(P_n) a Cauchy sequence of real numbers and makes its limit independent of the truncations. Define αx(F)\alpha_x(F) to be this limit. Polynomial density follows from Lemma 2.13.1. Addition, multiplication and the scalar rule pass to the limit: for multiplication, polynomial approximations are norm-bounded and their products converge by submultiplicativity. Thus the extension is a multiplicative seminorm with αx(F)≤∥F∥,∣αx(F)−αx(G)∣≤∥F−G∥.\alpha_x(F)\leq\|F\|,\qquad |\alpha_x(F)-\alpha_x(G)|\leq\|F-G\|. It kills every gXi−figX_i-f_i and therefore the actual ideal JJ. If F−G∈JF-G\in J, the ultrametric inequality gives αx(F)=αx(G)\alpha_x(F)=\alpha_x(G). The induced seminorm on BB is bounded by its quotient norm, by taking the infimum over lifts. It extends the fixed absolute value on KK and defines a point yxy_x over xx. In particular, when B=0B=0, this construction rules out any x∈Vx\in V. It uses no completion of FxF_x.

Step 2: image and uniqueness. A bounded multiplicative seminorm on the nonzero strict affinoid algebra BB is contractive by Lemma 1.6.1. Hence ∣xi∣y≤ρi|x_i|_y\leq\rho_i, and the relations show that its restriction belongs to VV. For a polynomial PP of total degree at most NN, write QP=∑νaνfνgN−∣ν∣∈A,gNP(x1,…,xs)=QPin B.Q_P=\sum_\nu a_\nu f^\nu g^{N-|\nu|}\in A, \qquad g^N P(x_1,\ldots,x_s)=Q_P\quad\text{in }B. For every point yy over xx, this gives ∣P∣y=∣QP∣x/∣g∣xN|P|_y=|Q_P|_x/|g|_x^N. Thus its values on polynomial images are fixed. These images are dense in BB, and contractivity gives the same continuity estimate used in Step 1. Therefore y=yxy=y_x. Restriction is continuous because each evaluation on AA is an evaluation on BB.

Step 3: continuity of the inverse. For each polynomial PP, the function x↦∣QP∣x/∣g∣xNx\mapsto|Q_P|_x/|g|_x^N is continuous on VV. Fix v∈Bv\in B and any lift F∈DF\in D. Polynomial truncations satisfy, uniformly for x∈Vx\in V, ∣∣v∣yx−∣Pn∣yx∣≤∥F−Pn∥⟶0.\bigl||v|_{y_x}-|P_n|_{y_x}\bigr|\leq\|F-P_n\|\longrightarrow0. It follows that x↦∣v∣yxx\mapsto|v|_{y_x} is continuous. Explicitly, given a point of VV and ε>0\varepsilon>0, choose a truncation with error less than ε/3\varepsilon/3 and use continuity of its evaluation to bound the difference of its values by ε/3\varepsilon/3 on a neighborhood. The two approximation errors then bound the difference for vv by ε\varepsilon. Since the evaluation topology is the weakest topology making all these functions continuous, x↦yxx\mapsto y_x is continuous. Finally, the finitely many inequalities defining VV are closed conditions on continuous real-valued functions. ◻

Selected scopes (1)

Citation

Non-Archimedean Geometry Foundations, Tag NAG-001444, 2.19.3.

Proof in chapter · Fixed-edition record