Theorem 2.22.5. (Rational factorization for strict targets). Let , and let For every strict norm-admissible affinoid and bounded unital -algebra map , there is a bounded factorization if and only if the induced map has image in . The factorization is unique. Zero targets and zero quotients are included. Consequently two strict rational presentations of the same subset of have a unique bounded -algebra isomorphism with bounded inverse; an inclusion of such subsets gives the unique bounded restriction map in the reverse direction. These maps commute with composition. No assertion about generalized non-strict targets is made.
Proof
Proof. A bounded homomorphism pulls a bounded multiplicative seminorm back to one, so the stated map on spectra is defined. If the factorization exists, Theorem 2.19.3 gives its image condition. Conversely, assume this condition and first take . At a point , the inequalities and the image of the unit-ideal identity imply . Theorem 1.12.3 therefore makes a unit of . Put . For every one has ; Theorem 1.13.4 gives a finite bound for all , . Corollary 2.19.2 constructs the unique bounded factorization. If , the unique map has the stated properties directly. In particular, a zero cannot factor into a nonzero ; the preceding construction would contradict its unit equation.
For two presentations with the same subset, apply the first assertion to each presentation as a target of the other. The composites and identity maps agree on , so uniqueness makes the composites identities. The same uniqueness proves composition compatibility for inclusions. The isomorphisms need not preserve the chosen presentation norms; boundedness in both directions is the conclusion. ◻