Proposition 1.2.2. The weighted Gauss norm makes a Banach algebra and is multiplicative. Polynomials are dense. The same finite-support multiplicativity argument applies to weighted Laurent polynomials.
Proof
Proof. Completeness follows coefficientwise: a Cauchy sequence has Cauchy coefficients, and a uniform tail estimate passes to their limits. Truncating a series proves density. The convolution formula for a product and the ultrametric inequality give submultiplicativity.
For nonzero polynomials , choose the lexicographically largest exponent attaining , and attaining . In the coefficient of , the term has weighted size . Any other term with that size would involve two maximizing exponents. If the first is smaller than , the second is larger than , a contradiction. Thus this coefficient has a unique term of maximal size, so cancellation cannot lower it. This proves multiplicativity for polynomials.
For general series, take polynomial truncations whose errors are strictly smaller than the nonzero norms of and . Their norms equal those of , and the product errors tend to zero. Continuity of the norm gives the result. The argument for finite Laurent sums is unchanged because lexicographic order on is translation invariant. ◻