1. Composition operators on an algebra of polynomials
Let K be a commutative field of characteristic 0, and K[X] the algebra of polynomials in one indeterminate over K (Alg., IV. 1); throughout this section by an operator on K[X] we shall mean a linear map U of the vector space K[X] (over K) into itself; since the monomials Xn(n⩾0) form a basis for this space, U is determined by the polynomials U(Xn); specifically, if f(X)=∑k=0∞λkXk with λk∈K, then
U(f)=k=0∑∞λkU(Xk).
If G is a commutative algebra over K, with an identity element, the G-module G[X] is obtained by extending the field of scalars K of the vector space K[X] to G; every operator U on K[X] extends in a unique manner to a linear map of the G-module G[X] to itself, which we again denote by U (Alg., II, p. 278); for each element g(X)=∑k=0∞γkXk, with γk∈G, one has U(g)=∑k=0∞γkU(Xk).
Consider in particular the case where G = K[Y]; then G[X] is the ring K[X,Y] of polynomials in two indeterminates over K; to avoid confusion we denote the extension of U to G[X] by UX. For any polynomial g(X,Y)=∑k=0∞γk(Y)Xk where γk(Y)∈K[Y] one thus has UX(g)=∑k=0∞γk(Y)U(Xk). Since UX is linear one sees that if one writes g(X,Y)=∑h=0∞βh(X)Yh then one also has UX(g)=∑h=0∞U(βh)Yh.
Under the canonical isomorphism of K[X] onto K[Y] which associates Y with X the operator U transforms to an operator on K[Y], which we will denote UY, to avoid confusion, so that UY(f(Y)) is the polynomial obtained by replacing X by Y in the polynomial U(f(X))=UX(f(X)). This operator UY can in turn be extended to an operator (again denoted by UY) on K[X,Y]: if g(X,Y)=∑h=0∞βh(X)Yh then
UY(g(X,Y))=h=0∑∞βh(X)UY(Yh).
As an example of these extensions we cite the derivation operator D on K[X] (Alg., IV. 6), which gives the partial derivation operators D_X and D_Y on K[X,Y].
For any polynomial f∈K[X] we denote by TY(f) the polynomial f(X+Y) in K[X,Y]; the map TY is a K-linear map from K[X] into K[X,Y], called a translation operator.
Definition 1
One says that an operator U on K[X] is a composition operator if it commutes with the translation operator, that is, if UXTY=TYU.
In other words, if f is an arbitrary polynomial in K[X], and if g=U(f), one must have g(X+Y)=UX(f(X+Y)).
It follows immediately from this definition that for every polynomial f(X)∈K[X] one has, in the above notation,
UX(f(X+Y))=UY(f(X+Y)).
(1)
Example 1
For every λ∈K the operator which to every polynomial f(X) associates the polynomial f(X+λ) is a composition operator.
Example 2
The derivation D on K[X] is a composition operator (cf. prop. 1).
Remark
Since K is an infinite field the operator U on K[X] is a composition operator if and only if for every polynomial f∈K[X] and every element α∈K one has, putting g=U(f), that g(X+α)=U(f(X+α)). (Alg., IV. 16, cor.).
It is clear that every linear combination of composition operators, with coefficients in K, is a composition operator; the same is true for the composition of two composition operators. In other words, the composition operators form a subalgebra Γ of the algebra of endomorphisms of the vector space K[X].
Proposition 1
For an operator U on K[X] to be a composition operator it is necessary and sufficient that it commute with the derivation D on K[X].
Indeed, the Taylor formula shows that for every polynomial f∈K[X] one has
for U to be a composition operator, one must then have UDk=DkU for every integer k≥1, and in particular UD=DU. Conversely, if this relation holds, it implies UDk=DkU for every integer k≥1, by induction on k; the Taylor formula then shows that g(X+Y)=UX(f(X+Y)).
For every polynomial f∈K[X,Y] we denote by U0(f) the term independent of X in the polynomial UX(f); in particular, if f∈K[X], U0(f) is the constant term in U(f), and U0 is a linear form on K[X]. For every polynomial f∈K[X] let g=U(f); by def. 1 of VI, p. 270
and if, in this formula, one replaces X by 0, one obtains
g(Y)=k=0∑∞k!1U0(Xk)Dkf(Y).
Thus one sees that
U(f(X))=k=0∑∞k!1μkDkf(X)(2)
where μkis the constant term in the polynomialU(Xk).
This formula shows that the μk determine the composition operator U completely; conversely, if (μn) is an arbitrary sequence of elements of K then the formula (2) defines an operator U which clearly commutes with D, so (VI, p. 270, prop. 1) is a composition operator. From now on we shall write (2) in the form
U=k=0∑∞k!1μkDk.(3)
This formula can be interpreted in topological language as follows: if one considers the discrete topology on K[X], and the topology of simple convergence on the algebra End(K[X]) of endomorphisms of K[X] (Gen. Top., X, p. 277), the series with general term k!1μkDk is commutatively convergent in End(K[X]) and has sum U (Gen. Top., III, p. 269).
The formula (3) shows that to every formal seriesu(S)=∑k=0∞αkSk in one indeterminate over K (Alg., IV. 41) one can associate the composition operator U=∑k=0∞αkDk, which in future we shall denote by u(D). This remark can be clarified in the following manner:
Theorem 1
The map which to every formal series* u(S)=∑k=0∞αkSkin one indeterminate over K associates the composition operatoru(D)=∑k=0∞αkDkonK[X]is an isomorphism of the algebraK[[S]]of formal series onto the algebraΓ *of composition operators.
One verifies immediately that this map is an homomorphism. It remains to see that it is injective, in other words, that the relation ∑k=0∞αkDk=0 implies αk=0 for every k; now h!αh is the constant term in the polynomial obtained by applying ∑k=0∞αkDk to Xh, whence the theorem.
Corollary
The algebra Γ of composition operators in K[X] is commutative.
Example
If U is the operator which to each polynomial f(X) associates f(X+λ) (where λ∈K), one has U0(Xk)=λk, and so U=∑k=0∞k!1(λD)k. By analogy with the series expansion of eλ (III, p. 105) we write eS or exp(S) for the formal series ∑n=0∞n!1Sn in the ring K[[S]]; so one can write U=eλD. Replacing the field K by the field of rational fractions K(Y) in this argument one sees similarly that the translation operatorTY can be written eYD.
Furthermore, in the ring K[[S,T]] of formal series in two indeterminates over K one has
(expS)(expT)=p,q∑p!Spq!Tq
=n=0∑∞n!1((0n)Sn+(1n)Sn−1T+⋯+(nn)Tn)
=exp(S+T)
and in particular
(expS)(exp(−S))=1
which justifies the notation we have introduced.
Scholium
The isomorphism of the algebra K[[S]] of formal series and the algebra Γ of composition operators on K[X] sometimes allows one to prove propositions on formal series most simply, by proving them for the corresponding composition operators (cf. VI, p. 274, prop. 6).
2. Appell polynomials attached to a composition operator
Given a composition operator U=∑k=0∞αkDk=0 let p be the least of the integers k such that αk=0; we shall say that p is the order of the operator U.
Proposition 2
Every composition operator of order 0 is invertible in the algebra Γ of composition operators on K[X].
Indeed, a formal series ∑k=0∞αkSk such that α0=0 is invertible in the ring K[[S]] (Alg., IV. 41); the proposition thus follows from th. 1 of VI, p. 271.
Proposition 3
Let U be a composition operator of order p; then U(f)=0 for every polynomial f of degree <p; for every polynomial f=0 of degree n≥p, U(f) is a polynomial =0 of degree n−p.
This is an immediate consequence of formula (2) of VI, p. 271 and of the definition of the order of U.
It is clear that every operator U of order p can be written in a unique way as U=DpV=VDp, where V is an operator of order 0 (and so invertible).
Definition 2
Let U=DpV be a composition operator of order p on K[X]. The polynomial un(X)=V−1(Xn) is called the Appell polynomial of index n attached to the operator U.
If V−1=∑k=0∞k!1βkDk (with β0=0) one thus has
un(X)=k=0∑n(kn)βkXn−k.
(6)
One verifies that un is a polynomial of degree n (prop. 3); further
un(0)=βn.
Proposition 4
The Appell polynomials attached to U satisfy the relations
dXdun=nun−1
(7)
un(X+Y)=k=0∑n(kn)un−k(X)Yk
(8)
U(un(X))=(n−p)!n!Xn−p.
(9)
These formulae are in fact respectively equivalent to the following relations (bearing def. 2 in mind):
DV−1=V−1D(10)
(exp(YDX))VX−1=VX−1exp(YDX)(11)
UV−1=Dp.(12)
Proposition 5
For every polynomial f∈K[X] and every composition operator of order p one has
f(p)(X+Y)=k=0∑∞k!1U(f(k)(X))uk(Y)(13)
(generalized Taylor expansion).
Indeed, if one puts U=DpV=VDp one has (VI, p. 270, formula (1))
the Taylor formula and by def. 2 of VI, p. 273; it suffices to apply the operator U to the first and last terms of formula (14) to obtain (13).
3. Generating series for the appell polynomials
Let E be the ring of formal series in an indeterminate S, with coefficients in the ring of polynomials K[X] (Alg., IV. 41); in other words, the ring of formal series g(X,S)=∑n=0∞αn(X)Sn where the αn belong to K[X]. For every operator U on K[X] we defines a map UX of E to itself by putting UX(g(X,S))=∑n=0∞U(αn)Sn. It is clear that E is a module over the ring K[[S]] of formal series in S with coefficients in K; by the linearity of U on K[X] one verifies immediately that for every element θ∈K[[S]] and every g∈E one has UX(θg)=θUX(g); in other words, UX is a linear map of the module E into itself.
Proposition 6
Let U=DpV=u(D) be a composition operator of order p on K[X], u(S) being a formal power series of order p in K[[S]]. Then
UX(exp(XS))=u(S)exp(XS)(15)
u(S)Spexp(XS)=n=0∑∞n!1un(X)Sn(16)
n being the Appell polynomial of index n attached to U.
By the scholium to th. 1 (VI, p. 271), to establish (15) it is enough to show that for every polynomial f(Y)∈K[Y] one has
UX(exp(XDY)(f(Y)))=u(DY)(exp(XDY)(f(Y))).
Now the first term in (17) is UX(f(X+Y)), and, since U=u(D), the second term in (17) is UY(f(X+Y)), so the identity (17) reduces to (1) (VI, p. 270).
It now suffices to apply (15) to the composition operator V−1=Dp/u(D) to obtain (16), since, by definition, one has
V−1(exp(XS))=n=0∑∞n!1un(X)Sn.
Note that (16) can also be obtained by multiplying the formal series Sp/u(S) and exp(XS), taking account of (6).
One says that the formal series (16) is the generating series of the Appell polynomials attached to U.
4. Bernoulli polynomials
Consider the composition operator U defined by
U(f(X))=f(X+1)−f(X);
one can write U=eD−1 (VI, p. 270, Example 1); this is an operator of order 1, and if one puts U=DV one has V−1=eD−1D. The Appell polynomial of degree n corresponding to the operator U is called the Bernoulli polynomial of degree n and is denoted by Bn(X); if one puts bn=Bn(0) one has the formulae
Bn(X)=k=0∑n(kn)bn−kXk
(18)
eS−1SeXS=n=0∑∞n!1Bn(X)Sn
(19)
and in particular
eS−1S=n=0∑∞n!1bnSn
(20)
The formulae (7) and (9) of VI, p. 273, give, for the Bernoulli polynomials, the relations
dXdBn=nBn−1(X)
(21)
Bn(X+1)−Bn(X)=nXn−1.
(22)
In particular, one has Bn(1)−Bn(0)=0 for n>1, which, taking account of (18), gives the induction relation
m=0∑n−1(mn)bm=0(for n>1)
which enables one to calculate the bn step-by-step. These numbers are clearly rational; since one can write
eS−1S=−2S+2SeS−1eS+1
and since (VI, p. 272, formula (5))
e−S−1e−S+1=−eS−1eS+1
one sees that in the formal series for 2SeS−1eS+1 all the terms of odd degree have coefficient zero; so one has
b0=1,b1=−21,b2n−1=0for n>1.
The rational numbers b2n (n≥1) are called the Bernoulli numbers; we shall see (VI, p. 288) that b2n has the sign of (−1)n−1. The formula (23) gives, for the first values of n,
5. Composition operators on functions of a real variable
Let I be an interval in R containing the interval R+=[0,+∞[; let E be a vector space over the field C, formed of functions of a real variable with complex values, defined on I. We suppose that for every a⩾0 and every function f∈E the function x↦f(x+a) belongs to E; further, we assume that E contains the restrictions to I of the polynomials with complex coefficients and the exponentialseλx, where λ is an arbitrary complex number. Any linear map U of E into the space of all maps from I into the field C of complex numbers will be called an operator on E; if f∈E and g=U(f) it will be convenient to use the notation
g(x)=Uξξ(f(ξ))
where ξ is a dummy variable in the functional symbolism of the right-hand term (cf. II, p. 58). For every a⩾0 the operator which to any function f∈E associates the restriction to I of the function x↦f(x+a) is called the translation operator by a.
Definition 3
One says that an operator U on E is a composition operator if, for every a⩾0, it is permutable with the translation operator by a*.
In the notation introduced above, this definition becomes the identity
Ux+aξ(f(ξ))=Uxξ(f(ξ+a))
in x and a (x∈I,a⩾0). One can exchange the rôles of x and a in this identity if x⩾0, then put a=0; one thus obtains for x⩾0
Uxξ(f(ξ))=U0ξ(f(ξ+x))
where U0 is the linear form on E which to each function f∈E associates the value g(0) of g=U(f).
If f is a polynomial, one has f(ξ+x)=∑k=0∞k!1f(k)(ξ)xk, and formula (26) shows that U(f) is also a polynomial; restricted to the set of polynomials in x, with coefficients in C, (a set which one can identify with the algebra C[X]), the operator U is then a composition operator in the sense of def. I of VI, p. 270, and all the results of the preceding sections can be applied to it.
We again write un for the Appell polynomials attached to the operator U. To the generalized Taylor expansion of a polynomial (VI, p. 274, formula (13)) there corresponds, for more general functions, the following result:
Theorem 2
Let f be a function admitting a continuous (n+1)th derivative on I, and belonging, with all its derivatives f(m) for 1≤m≤n, to E. If U is a composition operator of order p≤n on E one has, for x≥0 and h≥0
f(p)(x+h)=m=0∑nm!1um(x)Uhξ(f(m)(ξ))+Rn(x,h)
(27)
with
Rn(x,h)=−Uhξ(∫0ξ−x−hn!1un(x+η)f(n+1)(ξ−η)dη)
(28) (generalized Taylor expansion).
Consider the integral ∫0ξ−x−hn!1un(x+η)f(n+1)(ξ−η)dη, defined for all ξ∈I, and apply to it the formula for integration by parts of order n+1 (II, p. 59, formula (11)); taking account of the relations
un(k)=n(n−1)…(n−k+1)un−k
derived from (7) (VI, p. 273) by recursion, one obtains
We apply the operator U to the two sides of (29), considered as functions of ξ, then take the value of the function so obtained for the value h of the variable ξ; remarking that, by the formulae (26) (VI, p. 277) and (9) (VI, p. 272), one has
Uhξ(um(ξ−h))=U0ξ(um(ξ))={0p!for m=pfor m=p
one finally obtains (27).
6. Indicatrix of a composition operator
With the same hypotheses as in n° 5, the formula (26) of (VI, p. 277) applied to the function eλx, gives
Uλξ(eλξ)=U0ξ(eλxeλξ)=eλxU0ξ(eλξ)=u(λ)eλx
(30) on putting u(λ)=U0ξ(eλξ). One says that the function u(λ), defined on C, with complex values, is the indicatrix of the composition operator U. Note that if the restriction of U to the ring C[X] of polynomials is equal to the series
Dpn=0∑∞αnDn
(VI, p. 271, th. 1) (which we have denoted u(D) in VI, p. 271), the series of complex terms with general term αnλn+pis not necessarily convergent for λ=0, and that even if it converges for certain values of λ, the sum is not necessarily equal to the indicatrixu(λ)of U (VI, p. 291, exerc. 2). We shall say that the composition operator U is regular if there exists a neighbourhood of 0 in C such that the series with general term αnλn+p is absolutely convergent and has sum equal to the indicatrixu(λ) on this neighbourhood1. Let us apply formula (27) of VI, p. 278, to the function eλx, making h=0; since Dm(eλx)=λmeλx one has U0ξ(Dm(eλx))=λmu(λ); it then follows that for every complex λ such that u(λ)=0
If U is a regular operator, for all λ∈C such that the entire series u(λ)=∑n=0∞αnλn+p and ∑n=0∞βnn!λn are absolutely convergent2, it follows from formula (16) and the formula for the product of two absolutely convergent series (Gen. Top., VIII, p. 115, prop. 1) that one has
u(λ)λp=n=0∑∞βnn!λn.
Similarly, since the Taylor expansion of eλx is absolutely convergent for every λ∈C and every x∈C (III, p. 106) one also has (formulae (6) (VI, p. 273) and (16) (VI, p. 274)), for all the values considered and for all x∈C
u(λ)λneλx=n=0∑∞un(x)n!λn.
Remark
One can use formula (33) (resp. (34)) to calculate the βn (resp. the un(x)) by using the following lemma on entire series:
(1) Later we shall study series whose general terms are of the form cnzn (cn∈C,z∈C), which one calls entire series; in particular we shall see that when such a series is absolutely convergent for z=z0 it is normally convergent for ∣z∣≤∣z0∣. (2) It follows from the theory of entire series that when one of these series is absolutely convergent in a neighbourhood V of 0, the other is absolutely convergent in a neighbourhood W⊂V of 0.
emma. If two entire series∑n=0∞cnλn,∑n=0∞dnλnare absolutely convergent for allλin a neighbourhood of0, and if∑n=0∞cnλn=∑n=0∞dnλnfor these values ofλ, thencn=dnfor all integersn⩾0.
If, by any procedure, one can find an entire series that converges to λp/u(λ) on a neighbourhood of 0, then the coefficients of this series are necessarily equal to the βn/n!. Is this procedure that we shall apply in the examples that follow.
Example 1
If U is the identity map one has u(λ)=1 and the operator U is clearly singular; since un(x)=xn the formula (27) of VI, p. 278, can be written, putting ξ=ξ−η
that is, it reduces to the Taylor formula (II, p. 62).
Example 2
Let us take for U the composition operator which, to every function f defined on R+, associates the function x↦f(x+1)−f(x); then
Uλξ(f(ξ))=f(x+1)−f(x);
we have seen (VI, p. 275) that the restriction of U to C[X] is equal to eD−1. Since, on the other hand, u(λ)=eλ−1, the operator U is regular; we shall see (VI, p. 288) how to determine the Bernoulli numbers bn by calculating an expansion of eλ−1λ as a convergent entire series. On applying formula (27) of VI, p. 278 to a primitive of a function f admitting a continuous nth derivative on R+, we obtain
f(x+h)=∫hh+1f(t)dt
+m=1∑nm!1Bm(x)(f(m−1)(h+1)−f(m−1)(h))+Rn(x,h)
with
This lemma is a particular case of a general result that we will prove later; here is the proof. If an entire series ∑n=0∞cnλn is absolutely convergent for λ=λ0 then for every integer k⩾0 the series ∑n=0∞cn+kλn is normally convergent for ∣λ∣⩽∣λ0∣, so is continuous on this disc (Gen. Top., X, p. 283); one concludes that ∑n=k+1∞cnλn=o(λk) on a neighbourhood of 0. The lemma then follows from the uniqueness of the coefficients of an asymptotic expansion of a function in terms of the λn (V, p. 223).
Let E be the vector space of functions f defined and continuous on R, and such that the integral ∫−∞+∞f(x+ξ)e−ξ2/2dξ converges for all x≥0. The operator U defined by
Uλξ(f(ξ))=2π1∫−∞+∞e−ξ2/2f(x+ξ)dξ
is then defined on E and is clearly a composition operator. The space E contains all the exponentials eλx (λ arbitrary complex), and one has
The series ∑n=0∞e−ξ2/2n!(λξ)n can therefore be integrated term-by-term over R (II, p. 72, cor. 1), which proves that the series ∑n=0∞αnλn converges absolutely for every λ∈C, and has a sum equal to u(λ)=eλ2/2=∑n=0∞2nn!λ2n; thus the operator U is regular. Applying the lemma mentioned above shows that α2n=1/2nn!,α2n+1=0 for every n≥0; the operator U is thus of order 0. One has
u(λ)1=e−λ2/2=n=0∑∞2nn!(−1)nλ2n,
the series being absolutely convergent for every λ∈C; another application of the lemma shows that β2n=2nn!(−1)n(2n)!,β2n+1=0; further, the series ∑n=0∞n!λnun(x) is absolutely convergent for every λ∈C and every x∈R, and one has
In the formula (35) of VI, p. 280, let us replace x by 0 and h by x; since Bm(0)=bm it follows from the relations (24) of VI, p. 276, that for each integer p>0 one can write
f(x)=∫xx+1f(t)dt−21(f(x+1)−f(x))
+k=1∑p(2k)!b2k(f(2k−1)(x+1)−f(2k−1)(x))+Rp(x)
with
Rp(x)=−(2p+1)!1∫01B2p+1(t)f(2p+1)(x+1−t)dt.
In this formula let us successively replace x by x+1,x+2,…,x+n, and combine the formulae obtained, one by one; we obtain
The remainder Tp(x,n) in this formula can be rewritten in the following way: denote by B2p+1(t) the periodic function with period 1 which is equal to B2p+1(t) on the interval [0,1[. Then
The formula (39) is called the Euler-Maclaurin summation formula; it is applicable to every complex function having a continuous (2p+1)th derivative on an interval [x0,+∞[, for every x≥x0. We shall see (VI, p. 288) how to estimate the remainderTp(x,n) in this formula.