Theorem 2.13.2. (The Laurent coefficient normal form). For the data just specified, there are -linear maps given by the convergent coefficient formulas They satisfy In particular, every has a unique decomposition The relation map satisfies and has closed image. Its image is the actual kernel of , so is an isometric isomorphism of Banach -modules. The quotient norm of is , attained at its unique representative supported on the two coordinate axes, with the origin counted once. The associated short exact sequence is split as a sequence of Banach -modules.
Proof
Proof. Step 1: polynomial reduction and its bounds. On a monomial , put and define where the sum is zero if . Extend these formulas -linearly to polynomials, and define by the displayed axis formula. The weights satisfy Thus does not increase the norm of a monomial. Every monomial in its -image has weight at most , because its weight relative to the original one is . Applying the ultrametric inequality to finite sums proves The axis formula preserves each nonzero coefficient and its weight, so is isometric, on Laurent polynomials and on the full coefficient space.
Step 2: completion and the explicit sums. Choose finite polynomial truncations converging to . The preceding bounds make and Cauchy in their respective complete coefficient spaces. Their limits define and . Applying the same bounds to differences of two approximations proves independence of the truncations, linearity and the asserted bounds. This constructs the extensions directly.
For a fixed , the terms in the claimed formula for satisfy For fixed , the terms in the formula for satisfy Both series therefore converge in by Lemma 1.1.2. The bounded coordinate maps of Lemma 2.13.1 identify their sums with the limits constructed from polynomial truncations. In particular, the formulas define families with the required uniform finite-tail condition; this also follows by approximating their images by the corresponding finite polynomial images.
Step 3: the identities. For a polynomial monomial, telescoping gives Summing over monomials proves and on polynomials. Substitution of gives . The axis formula gives and . Every map in these identities is bounded. Taking limits of polynomial truncations proves all five identities on the complete spaces.
Step 4: the relation image and the quotient norm. The identities give the displayed decomposition. Applying and to any such decomposition proves uniqueness. Their bounds, together with the bound for , imply These are the asserted norm equality. Taking gives , and hence injectivity of . If converges, this equality makes Cauchy. Completeness gives a limit , and boundedness of identifies the original limit as . Thus is closed.
We have , while implies . This proves the kernel equality with the algebraic image, without first taking its closure. For every , The choice gives and attains equality. Hence the quotient norm is exactly . The target is complete, so the quotient is a Banach module. The right inverse , the left inverse and the decomposition prove the splitting and norm-strictness. A representative supported on the two axes equals for a unique ; applying identifies with the class, proving the final uniqueness assertion. ◻