Closed

Perturbing affinoid generators

Lemma 2.26.3. (Perturbing affinoid generators). Let π0:A⟨X1,…,Xn⟩↠B\pi_0:A\langle X_1,\ldots,X_n\rangle\twoheadrightarrow B be a surjective homomorphism, with AA strict norm-admissible and BB carrying its actual quotient norm. Write hi0=π0(Xi)h_i^0=\pi_0(X_i). If hi∈Bh_i\in B satisfy δ=max⁡i∥hi−hi0∥<1,\delta=\max_i\|h_i-h_i^0\|<1, then substitution Xi↦hiX_i\mapsto h_i defines a contractive surjection π:A⟨X⟩→B\pi:A\langle X\rangle\to B. The quotient norm induced by π\pi equals the given norm on BB. The case n=0n=0 uses δ=0\delta=0.

Proof

Proof. Each hi0h_i^0 and hih_i has norm at most one. The bounded substitution criterion gives π\pi. A telescoping product expansion gives ∥hα−(h0)α∥≤δ\|h^\alpha-(h^0)^\alpha\|\leq\delta for every nonconstant monomial, and the constant monomial has difference zero. The ultrametric inequality, followed by polynomial approximation, therefore gives ∥π(F)−π0(F)∥≤δ∥F∥(F∈A⟨X⟩).\|\pi(F)-\pi_0(F)\|\leq\delta\|F\| \qquad(F\in A\langle X\rangle). Fix λ>1\lambda>1 with q=λδ<1q=\lambda\delta<1. For b∈Bb\in B, choose a π0\pi_0-lift F0F_0 with ∥F0∥≤λ∥b∥\|F_0\|\leq\lambda\|b\|, taking zero when b=0b=0. Then e1=b−π(F0)e_1=b-\pi(F_0) has norm at most q∥b∥q\|b\|. Repeat for each successive error. This produces FjF_j with ∥Fj∥≤λqj∥b∥,∥b−π(∑j=0mFj)∥≤qm+1∥b∥.\|F_j\|\leq\lambda q^j\|b\|, \qquad \left\|b-\pi\left(\sum_{j=0}^m F_j\right)\right\| \leq q^{m+1}\|b\|. The sum F=∑jFjF=\sum_jF_j converges, has norm at most λ∥b∥\lambda\|b\|, and satisfies π(F)=b\pi(F)=b. Thus π\pi is surjective. Its quotient norm is at least ∥b∥\|b\| because it is contractive, and at most λ∥b∥\lambda\|b\| for every sufficiently small λ>1\lambda>1. Letting λ↓1\lambda\downarrow 1 proves equality. This proof requires only approximate quotient lifts; it does not assume that a norm-minimizing lift exists. If B=0B=0, the statement is immediate. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-001508, 2.26.3.

Proof in chapter · Fixed-edition record