Closed

Bounded monic division

Lemma 1.10.2. (Bounded monic division). Let d≥0d\geq 0 and P=Td+∑i<daiTi,∥ai∥ri≤rd.P=T^d+\sum_{i<d}a_iT^i, \qquad \|a_i\|r^i\leq r^d. Every g∈Er(M)g\in E_r(M) has a unique decomposition g=PQP(g)+RP(g),QP(g)∈Er(M),RP(g)∈P<d(M).g=P Q_P(g)+R_P(g),\qquad Q_P(g)\in E_r(M),\quad R_P(g)\in P_{<d}(M). The two operators are AA-linear and satisfy ∥QP(g)∥r≤r−d∥g∥r,∥RP(g)∥r≤∥g∥r.\|Q_P(g)\|_r\leq r^{-d}\|g\|_r, \qquad \|R_P(g)\|_r\leq\|g\|_r. Moreover, ∥Pq∥r=rd∥q∥r\|Pq\|_r=r^d\|q\|_r for every q∈Er(M)q\in E_r(M).

Proof

Proof. First let g∈M[T]g\in M[T]. Remove its highest nonzero term mTnmT^n, with n≥dn\geq d, by subtracting mTn−dPmT^{n-d}P. Every term in this multiple has weighted norm at most ∥m∥rn\|m\|r^n. Thus the current dividend never has norm greater than the original ∥g∥r\|g\|_r, and each quotient contribution has norm at most r−d∥g∥rr^{-d}\|g\|_r. 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 PqPq is the highest coefficient of qq. In particular, this argument requires no division by a coefficient of MM.

The estimates extend QP,RPQ_P,R_P to Er(M)E_r(M) 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 QP(Pq)=qQ_P(Pq)=q and RP(Pq)=0R_P(Pq)=0; continuity gives these identities for all series qq. Since also QP(s)=0Q_P(s)=0 and RP(s)=sR_P(s)=s for s∈P<d(M)s\in P_{<d}(M), uniqueness holds for series as well.

For the norm equality, take q=∑jmjTj≠0q=\sum_jm_jT^j\ne 0 and choose the largest jj such that ∥mj∥rj=∥q∥r\|m_j\|r^j=\|q\|_r. This largest index exists because the weighted coefficients tend to zero. In the coefficient of Tj+dT^{j+d} in PqPq, the monic contribution is mjm_j. Every other contribution is aimj+d−ia_im_{j+d-i} with i<di<d, and its weighted norm is strictly smaller than rd∥q∥rr^d\|q\|_r, since j+d−i>jj+d-i>j. 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 rd∥q∥rr^d\|q\|_r. Submultiplicativity supplies the reverse inequality. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-001374, 1.10.2.

Proof in chapter · Fixed-edition record