Proof. The zero algebra gives the empty case. Otherwise choose a rational presentation R′={z:∣fi(z)∣≤ρi∣g(z)∣ (1≤i≤m)},h0g+i=1∑mhifi=1 in Ar, with ρi>0. Use the coefficient norm of Theorem 1.16.2 and set C=max(∥h0∥,ρ1∥h1∥,…,ρm∥hm∥)>0,δ=C−1. For x∈σr,A−1(R′), evaluating the unit identity gives 1≤Cσr,A(x)(g),σr,A(x)(g)≥δ. Write g=∑νgνTν and fi=∑νfiνTν. Choose finite index sets G,Fi⊂Zs such that the omitted coefficient weights satisfy ∥gν∥rν<δ/2(ν∈/G),∥fiν∥rν<ρiδ/2(ν∈/Fi). Such sets exist by coefficient convergence. For each ν∈G, define Rν⊆MK(A) by δrμ∣gμ(x)∣rμ∣fiμ(x)∣≤rν∣gν(x)∣,≤rν∣gν(x)∣(μ∈G),≤ρirν∣gν(x)∣(1≤i≤m, μ∈Fi). This is an original-A rational presentation with denominator gν: its numerators are 1, the gμ, and the fiμ, with respective radii rν/δ, rν−μ, and ρirν−μ. The numerator 1 guarantees the unit-ideal condition. Empty members, including those with gν=0, are allowed.
At a point of σr,A−1(R′), the denominator value is at least δ. The omitted g-coefficients have smaller value, so some retained coefficient gν attains its Gauss maximum. The rational inequalities and the same Gauss formula then put the point in Rν. Conversely, on Rν, the first two conditions and the omitted-coefficient bound give σr,A(x)(g)=rν∣gν(x)∣≥δ. The retained fi-coefficients satisfy the required bound by the third condition, while the omitted coefficients are smaller than ρiδ. Therefore σr,A(x)(fi)≤ρiσr,A(x)(g) for every i. This proves the exact set equality σr,A−1(R′)=ν∈G⋃Rν. The proof also allows an empty tuple r, zero retained coefficients and an empty inverse image. ◻