Saturday, April 13, 2024

The topology on the ring of polynomials and the continuity of the evaluation map

Polynomials are an algebraic gadget, and one is rarely led to think about the topology a ring of polynomials should carry. That happened to me, though, more or less by accident, when María Inés de Frutos Fernández and I worked on implementing in Lean the evaluation of power series. So let's start with them. To simplify the discussion, I only consider the case of one inderminate. When there are finitely many of them, the situation is the same; in the case of infinitely many indeterminates, there might be some additional subtleties, but I have not thought about it.

\gdef\lbra{[\![}\gdef\rbra{]\!]} \gdef\lpar{(\!(}\gdef\rpar{)\!)} \gdef\bN{\mathbf N} \gdef\coeff{\operatorname{coeff}} \gdef\eval{\operatorname{eval}} \gdef\colim{\operatorname{colim}}

Power series

A power series over a ring RR is just an expression anTn\sum a_nT^n, where (a0,a1,)(a_0,a_1, \dots) is a family of elements of RR indexed by the integers. After all, this is just what is meant by “formal series”: coefficients and nothing else.

Defining a topology on the ring R[ ⁣[T] ⁣]R\lbra T\rbra should allow to say what it means for a sequence (fm)(f_m) of power series to converge to a power series ff, and the most natural thing to require is that for every nn, the coefficient am,na_{m,n} of TnT^n in fmf_m converges to the corresponding coeffient ama_m of TnT^n in ff. In other words, we endow R[ ⁣[T] ⁣]R\lbra T\rbra with the product topology when it is identified with the product set RNR^{\bN}. The explicit definition may look complicated, but the important point for us is the following characterization of this topology: Let XX be a topological space and let f ⁣:XR[ ⁣[T] ⁣]f\colon X \to R\lbra T\rbra be a map; for ff to be continuous, it is necessary and sufficient that all maps fn ⁣:XRf_n\colon X \to R are continuous, where, for any xXx\in X, fn(x)f_n(x) is the nnth coefficient of f(x)f(x). In particular, the coeffient maps R[ ⁣[T] ⁣]RR\lbra T\rbra\to R are continuous.

What can we do with that topology, then? The first thing, maybe, is to observe its adequacy wrt the ring structure on R[ ⁣[T] ⁣]R\lbra T\rbra.

Proposition.If addition and multiplication on RR are continuous, then addition and multiplication on R[ ⁣[T] ⁣]R\lbra T\rbra are continuous.

Let's start with addition. We need to prove that s ⁣:R[ ⁣[T] ⁣]×R[ ⁣[T] ⁣]R[ ⁣[T] ⁣]s\colon R\lbra T\rbra \times R\lbra T\rbra\to R\lbra T\rbra is continuous. By the characterization, it is enough to prove that all coordinate functions sn ⁣:R[ ⁣[T] ⁣]×R[ ⁣[T] ⁣]Rs_n\colon R\lbra T\rbra \times R\lbra T\rbra\to R, (f,g)coeffn(f+g) (f,g)\mapsto \coeff_n(f+g) , are continuous. But these functions factor through the nnth coefficient maps: coeffn(f+g)=coeffn(f)+coeffn(g)\coeff_n(f+g) = \coeff_n(f)+\coeff_n(g), which is continuous, since addition, coefficients and projections are continuous. This is similar, but slightly more complicated for multiplication: if the multiplication map is denoted by mm, we have to prove that the maps mnm_n defined by mn(f,g)=coeffn(fg)m_n(f,g)=\coeff_n(f\cdot g) are continuous. However, they can be written as  mn(f,g)=coeffn(fg)=p=0ncoeffp(f)coeffnp(g). m_n(f,g)=\coeff_n(f\cdot g) = \sum_{p=0}^n \coeff_p(f)\coeff_{n-p}(g). Since the projections and the coefficient maps are continuous, it is sufficient to prove that the maps from Rn+1×Rn+1R^{n+1} \times R^{n+1} to RR given by ((a0,,an),(b0,,bn))p=0napbnp((a_0,\dots,a_n),(b_0,\dots,b_n))\mapsto \sum_{p=0}^n a_p b_{n-p} are continuous, and this follows from continuity and commutativity of addition on RR, because it is a polynomial expression.

Polynomials

At this point, let's go back to our initial question of endowing polynomials with a natural topology.

An obvious candidate is the induced topology. This looks correct; in any case, it is such that addition and multiplication on R[T]R[T] are continuous. However, it lacks an interesting property with respect to evaluation.

Recall that for every aRa\in R, there is an evaluation map evala ⁣:R[T]R\eval_a\colon R[T]\to R, defined by ff(a)f\mapsto f(a), and even, if one wishes, the two-variable evaluation map R[T]×RRR[T]\times R\to R.
The first claim is that this map is not continuous.

An example will serve of proof. I take RR to be the real numbers, fn=Tnf_n=T^n and a=1a=1. Then fnf_n converges to zero, because for each integer mm, the real numbers coeffm(fn)\coeff_m(f_n) are zero for n>mn>m. On the other hand, fn(a)=fn(1)=1f_n(a)=f_n(1)=1 for all nn, and this does not converge to zero!

So we have to change the topology on polynomials if we want that this map be continuous, and we now give the correct definition. The ring of polynomials is the increasing union of subsets R[T]nR[T]_n, indexed by integers nn, consisting of all polynomials of degree less than nn. Each of these subsets is given the product topology, as above, but we endow their union with the “inductive limit” topology. Explicitly, if YY is a topological space and u ⁣:R[T]Yu\colon R[T]\to Y is a map, then uu is continuous if and only if, for each integer nn, its restriction to R[T]nR[T]_n is continuous.

The inclusion map R[T]R[ ⁣[T] ⁣]R[T]\to R\lbra T\rbra is continuous, hence the topology on polynomials is finer than the topology induced by the topology on power series. As the following property indicates, it is usually strictly finer.

We can also observe that addition and multiplication on R[T]R[T] are still continuous. The same proof as above works, once we observe that the coefficient maps are continuous. (On the other hand, one may be tempted to compare the product topology of the inductive topologies, with the inductive topology of the product topologies, a thing which is not obvious in the direction that we need.)

Proposition.Assume that addition and multiplication on RR are continuous. Then the evaluation maps evala ⁣:R[T]R\eval_a \colon R[T]\to R are continuous.

We have We have to prove that for every integer nn, the evaluation map evala\eval_a induced a continuous map from R[T]nR[T]_n to RR. Now, this map factors as a projection map R[T]Rn+1R[T]\to R^{n+1} composed with a polynomial map (c0,,cn)c0+c1a++cnan(c_0,\dots,c_n)\mapsto c_0+c_1a+\dots+c_n a^n. It is therefore continuous.

Laurent series

We can upgrade the preceding discussion and define a natural topology on the ring R( ⁣(T) ⁣)R\lpar T\rpar of Laurent series, which are the power series with possibly negative exponents. For this, for all integers dd, we set R( ⁣(T) ⁣)dR\lpar T\rpar_d to be the set of power series of the form f=n=dcnTn f=\sum_{n=-d}^\infty c_n T^n, we endow that set with the product topology, and take the corresponding inductive limit topology. We leave to the reader to check that this is a ring topology, but that the naïve product topology on R( ⁣(T) ⁣)R\lpar T\rpar wouldn't be in general.

Back to the continuity of evaluation

The continuity of the evaluation maps ff(a)f\mapsto f(a) were an important guide to the topology of the ring of polynomials. This suggests a more general question, for which I don't have a full answer, whether the two-variable evaluation map, (f,a)f(a)(f,a)\mapsto f(a), is continuous. On each subspace R[T]d×RR[T]_d\times R, the evaluation map is given by a polynomial map ((c0,,cd,a)c0+c1a++cdad(c_0,\dots,c_d,a)\mapsto c_0 +c_1a+\dots+c_d a^d), hence is continuous, but that does not imply the desired continuity, because that only tells us about R[T]×RR[T]\times R with the topology colimd(R[T]d×R)\colim_d (R[T]_d\times R), while we are interested in the topology (colimdR[T]d)×R(\colim_d R[T]_d)\times R. To compare these topologies, note that the natural bijection colimd(R[T]d×R)(colimdR[T]d)×R\colim_d (R[T]_d\times R) \to (\colim_d R[T]_d)\times R is continuous (because it is continuous at each level dd), but the continuity of its inverse is not so clear.

I find it amusing, then, to observe that sequential continuity holds in the important case where RR is a field. This relies on the following proposition.

Proposition.Assume that RR is a field. Then, for every converging sequence (fn)(f_n) in R[T]R[T], the degrees deg(fn)\deg(f_n) are bounded.

Otherwise, we can assume that (fn)(f_n) converges to 00 and that deg(fn+1)>deg(fn)\deg(f_{n+1})>\deg(f_n) for all nn. We construct a continuous linear form ϕ\phi on R[T]R[T] such that ϕ(fn)\phi(f_n) does not converge to 00. This linear form is given by a formal power series ϕ(f)=adcd\phi(f)=\sum a_d c_d for f=cdTdf=\sum c_dT^d, and we choose the coefficients (an)(a_n) by induction so that ϕ(fn)=1\phi(f_n)=1 for all nn. Indeed, if the coefficients are chosen up to deg(fn)\deg(f_n), then we fix ad=0a_d=0 for deg(fn)<d<deg(fn+1)\deg(f_n)<d<\deg(f_{n+1}) and choose adeg(fn+1)a_{\deg(f_{n+1})} so that ϕ(fn+1)=1\phi(f_{n+1})=1. This linear form is continuous because its restriction to any R[T]dR[T]_d is given by a polynomial, hence is continuous.

Corollary. — If RR is a topological ring which is a field, then the evaluation map R[T]×RRR[T]\times R\to R is sequentially continuous.

Consider sequences (fn)(f_n) in R[T]R[T] and (an)(a_n) in RR that converge to ff and aa respectively. By the proposition, there is an integer dd such that deg(fn)d\deg(f_n)\leq d for all nn, and deg(f)d\deg(f)\leq d. Since evaluation is continuous on R[T]d×RR[T]_d\times R, one has fn(an)f(a)f_n(a_n)\to f(a), as claimed.

Remark. — The previous proposition does not hold on rings. In fact, if R=ZpR=\mathbf Z_p is the ring of pp-adic integers, then ϕ(pnTn)=pnϕ(Tn)\phi(p^nT^n)=p^n \phi(T^n) converges to 00 for every continuous linear form ϕ\phi on R[T]R[T]. More is true since in that case, evaluation is continuous! The point is that in Zp\mathbf Z_p, the ideals (pn)(p^n) form a basis of neighborhoods of the origin.

Proposition. — If the topology of RR is linear, namely the origin of RR has a basis of neighborhoods consisting of ideals, then the evaluation map R[T]×RRR[T]\times R\to R is continuous.

By translation, one reduces to showing continuity at (0,0)(0,0). Let VV be a neighborhood of 00 in RR and let II be an ideal of RR such that IVI\subset V. Since it is an subgroup of the additive group of RR, the ideal II is open. Then the set IR[T]I\cdot R[T] is open because for every dd, its trace on R[T]dR[T]_d, is equal to IR[T]dI\cdot R[T]_d, hence is open. Then, for fIR[T]f\in I\cdot R[T] and aRa\in R, one has f(a)If(a)\in I, hence f(a)Vf(a)\in V.

Here is one case where I can prove that evaluation is continuous.

Proposition.If the topology of RR is given by a family of absolute values, then the evaluation map (f,a)f(a)(f,a)\mapsto f(a) is continuous.

I just treat the case where the topology of RR is given by one absolute value. By translation and linearity, it suffices to prove continuity at (0,0)(0,0). Consider the norm 1\|\cdot\|_1 on R[T]R[T] defined by f1=cn\|f\|_1=\sum |c_n| if f=cnTnf=\sum c_nT^n. By the triangular inequality, one has f(a)f1|f(a)|\leq \|f\|_1 for any aRa\in R such that a1|a|\leq 1. For every r>0r>0, the set VrV_r of polynomials fR[T]f\in R[T] such that f1<r\|f\|_1<r is an open neighborhood of the origin since, for every integer dd, its intersection with R[T]dR[T]_d is an open neighborhood of the origin in R[T]dR[T]_d. Let also WW be the set of aRa\in R such that a1|a|\leq 1. Then Vr×WV_r\times W is a neighborhood of (0,0)(0,0) in R[T]×RR[T]\times R such that f(a)<r|f(a)|<r for every (f,a)Vr×W(f,a)\in V_r\times W. This implies the desired continuity.

No comments :

Post a Comment