Closed

The free-polyradius field

Lemma 1.16.1. (The free-polyradius field). For every finite free tuple rr, the space KrK_r is a complete valued extension field of KK. Its multiplication extends Laurent-polynomial multiplication, its absolute value is the displayed weighted supremum norm, and ∣Tν∣=rν|T^\nu|=r^\nu. Every nonzero a=∑νaνTνa=\sum_\nu a_\nu T^\nu has a unique dominant term, and if this term is aμTμa_\mu T^\mu, then a=aμTμ(1+h),∥h∥<1,a−1=aμ−1T−μ∑n≥0(−h)n,∥a−1∥=∥a∥−1.\begin{aligned} a&=a_\mu T^\mu(1+h),\qquad \|h\|<1,\\ a^{-1}&=a_\mu^{-1}T^{-\mu}\sum_{n\geq0}(-h)^n, \qquad \|a^{-1}\|=\|a\|^{-1}. \end{aligned} No spherical completeness, nontrivial valuation, or restriction on the characteristic is required.

Proof

Proof. We first check the underlying normed space. The vanishing condition implies boundedness: there are only finitely many terms of weight at least one, and all other terms have weight less than one. Finite-support families are dense, by retaining only the finitely many terms above a prescribed error threshold. If (a(j))(a^{(j)}) is Cauchy for the weighted norm, each coefficient is Cauchy in KK and has a limit aνa_\nu. Given ϵ>0\epsilon>0, choose jj so that ∥a(j)−a(k)∥<ϵ/2\|a^{(j)}-a^{(k)}\|<\epsilon/2 for every sufficiently large kk. Passing to each coefficient limit gives ∣aν−aν(j)∣rν≤ϵ/2|a_\nu-a^{(j)}_\nu|r^\nu\leq\epsilon/2. Outside a finite set the terms of a(j)a^{(j)} have weight less than ϵ/2\epsilon/2. Thus the limiting family has weight at most ϵ/2<ϵ\epsilon/2<\epsilon outside that set. It belongs to KrK_r, and the same estimate proves convergence in norm. This proves completeness. The identical argument proves completeness of c0(Zs,r;E)c_0(\mathbf Z^s,r;E) whenever EE is complete.

For Laurent polynomials, the ultrametric inequality and rν+μ=rνrμr^{\nu+\mu}=r^\nu r^\mu give ∥fg∥≤∥f∥∥g∥\|fg\|\leq\|f\|\|g\|. Approximate each of two elements by Laurent polynomials. This inequality makes the polynomial products a Cauchy sequence and makes its limit independent of the approximations. It defines a bounded bilinear multiplication on KrK_r. Associativity, commutativity, distributivity and the unit law extend from the dense Laurent-polynomial subalgebra by continuity. In particular, this constructs the product without assuming an infinite convolution or its rearrangement in advance.

Let a≠0a\ne 0. Its positive supremum is attained: choose a nonzero term of weight dd and maximize over the finite nonempty set of terms of weight at least dd. Two distinct nonzero terms cannot have the same weight. Such an equality would put rν−μ=∣aμ/aν∣r^{\nu-\mu}=|a_\mu/a_\nu| in ∣K×∣|K^\times|, contrary to freeness. Let aμTμa_\mu T^\mu be the unique maximizing term. After deleting it, the remaining terms have supremum strictly less than its weight. Indeed, terms of weight at least half the maximal weight form a finite set, and the others are uniformly smaller. Multiplication by the invertible monomial aμ−1T−μa_\mu^{-1}T^{-\mu} shifts the coefficients and rescales the norm exactly, so it gives a=aμTμ(1+h)a=a_\mu T^\mu(1+h) with ∥h∥<1\|h\|<1.

Submultiplicativity implies ∥hn∥≤∥h∥n\|h^n\|\leq\|h\|^n, so the geometric series converges. Its finite-sum identity proves that it is the inverse of 1+h1+h. This inverse equals 1+u1+u with ∥u∥<1\|u\|<1, hence has norm one. The asserted formula for a−1a^{-1} and its norm follow. Thus every nonzero element is invertible. Finally, for a,b≠0a,b\ne 0, submultiplicativity applied to a−1(ab)=ba^{-1}(ab)=b gives ∥a∥∥b∥≤∥ab∥≤∥a∥∥b∥.\|a\|\|b\|\leq\|ab\|\leq\|a\|\|b\|. The norm is therefore multiplicative. Constant families embed KK isometrically, as claimed. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-001548, 1.16.1.

Proof in chapter · Fixed-edition record