Lemma 1.10.2. (Bounded monic division). Let and Every has a unique decomposition The two operators are -linear and satisfy Moreover, for every .
Proof
Proof. First let . Remove its highest nonzero term , with , by subtracting . Every term in this multiple has weighted norm at most . Thus the current dividend never has norm greater than the original , and each quotient contribution has norm at most . The degree strictly decreases, so finitely many steps give the required polynomial decomposition and estimates. Its uniqueness follows because the highest coefficient of a nonzero polynomial is the highest coefficient of . In particular, this argument requires no division by a coefficient of .
The estimates extend to by polynomial approximation and Lemma 1.10.1. Applying the estimates to differences proves independence of the approximation. The decomposition and linearity pass to the limit. On polynomials one has and ; continuity gives these identities for all series . Since also and for , uniqueness holds for series as well.
For the norm equality, take and choose the largest such that . This largest index exists because the weighted coefficients tend to zero. In the coefficient of in , the monic contribution is . Every other contribution is with , and its weighted norm is strictly smaller than , since . A term of strictly larger norm than all other terms cannot cancel in a non-Archimedean normed module: apply the triangle inequality also after solving for that term. Hence this coefficient has weighted norm . Submultiplicativity supplies the reverse inequality. ◻