Theorem 2.19.3. (Points of a strict rational quotient). With as in Corollary 2.19.2, the map induced by is a homeomorphism where both spectra carry the evaluation topology and the subspace topology. The subset is closed. This includes 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 . The unit-ideal identity in the preceding proof shows that for every . By Lemma 1.6.1, defines an absolute value on the field , with for . Evaluate polynomials at in . The resulting multiplicative seminorm on satisfies For polynomials , the ultrametric inequality also gives Given , choose polynomial truncations . The displayed estimate makes a Cauchy sequence of real numbers and makes its limit independent of the truncations. Define 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 It kills every and therefore the actual ideal . If , the ultrametric inequality gives . The induced seminorm on is bounded by its quotient norm, by taking the infimum over lifts. It extends the fixed absolute value on and defines a point over . In particular, when , this construction rules out any . It uses no completion of .
Step 2: image and uniqueness. A bounded multiplicative seminorm on the nonzero strict affinoid algebra is contractive by Lemma 1.6.1. Hence , and the relations show that its restriction belongs to . For a polynomial of total degree at most , write For every point over , this gives . Thus its values on polynomial images are fixed. These images are dense in , and contractivity gives the same continuity estimate used in Step 1. Therefore . Restriction is continuous because each evaluation on is an evaluation on .
Step 3: continuity of the inverse. For each polynomial , the function is continuous on . Fix and any lift . Polynomial truncations satisfy, uniformly for , It follows that is continuous. Explicitly, given a point of and , choose a truncation with error less than and use continuity of its evaluation to bound the difference of its values by on a neighborhood. The two approximation errors then bound the difference for by . Since the evaluation topology is the weakest topology making all these functions continuous, is continuous. Finally, the finitely many inequalities defining are closed conditions on continuous real-valued functions. ◻