Theorem 1.13.4. (Pointwise boundedness and power boundedness). Let be a strict norm-admissible -affinoid algebra, with the zero algebra allowed. Fix a bounded admissible strict presentation , and write for its quotient norm. For , the following conditions are equivalent:
for every .
for every maximal ideal of , with its extending residue absolute value.
There are an integer and elements satisfying
There is a real such that for every integer .
Condition (4) is unchanged if the norm is replaced by any uniformly equivalent norm. In particular, it holds for the given admissible norm on . The statement requires neither reducedness nor nontrivial valuation.
Proof
Proof. If , conditions (1) and (2) are vacuous, the polynomial gives (3), and every power has norm zero. Assume . Theorem 1.12.3 identifies each maximal residue absolute value with a bounded point, proving (1)(2).
Step 1: an equation on each irreducible quotient. By Theorem 1.11.5, is Noetherian and every prime ideal is closed. It has finitely many minimal primes by [StacksAlg] (Tag 00FR, Lemma 10.31.6). Put and write for the image of . Every maximal residue field of is a maximal residue field of , so condition (2) holds for .
Apply the presentation-compatible form of Theorem 1.12.2 to . It supplies a contractive homomorphism whose composite into is a finite injection. Lemma 1.13.3 gives a monic equation for with coefficients of Gauss norm at most one. Map these coefficients into by . The resulting monic polynomial has all coefficients of quotient norm at most one and satisfies . This is why the lift to the specified presentation is needed: it controls the coefficients in , not merely their images in .
Step 2: remove the nilpotent error. Let . This is monic, and every coefficient has norm at most one by submultiplicativity and the ultrametric inequality. Moreover belongs to every minimal prime. By [StacksAlg] (Tag 00E0(4),(7), Lemma 10.17.2), the intersection of the minimal primes is the nilradical: every prime contains a minimal prime, and the intersection of all primes is the radical of zero. Thus for some integer . The monic polynomial still has all coefficients of norm at most one and annihilates . This proves (2)(3), including nonreduced .
Step 3: control all powers. Suppose (3) holds and set Multiplication of the monic equation by gives, for , Induction proves (4). Finally, a bounded multiplicative seminorm is contractive for by Lemma 1.6.1; hence (4) gives for every . Taking th roots proves (1). Uniformly equivalent norms have the same bounded subsets, proving the last assertion. ◻