• Aucun résultat trouvé

Essentiality of Multiple Flow Parameters

with a first order perturbation which is the Lie bracket

X0,Y0 .

4.4 Essentiality of Multiple Flow Parameters

At present, we again consider r arbitrary vector fields with analytic coefficients defined on a certain, unnamed domain ofKnwhich contains the origin:

Xk=

n i=1

ξki(x1, . . . ,xn) ∂

xi

(k=1···r).

Though the collection X1, . . . ,Xk does not necessarily stem from anr-term group, each individual Xk nonetheless generates the one-term continuous transformation groupx0=exp(tXk)(x)with corresponding infinitesimal transformationsx0i=xi+ ε ξki(x); this is the reason why we shall hence sometimes alternatively refer to such general vector fieldsXkas beinginfinitesimal transformations.

Definition 4.1.The rinfinitesimal transformations X1, . . . ,Xr will be called inde-pendent(of each other) if they are linearly independent, namely if thenequations:

0≡e1ξ1i(x) +···+erξri(x) (i=1···n)

in whiche1, . . . ,erareconstants, do implye1=···=er=0.

For instance, Theorem 3 on p. 40 states that anr-term continuous local trans-formation groupx0i=fi(x;a1, . . . ,ar)whose parametersakare allessentialalways gives rise to therinfinitesimal transformationsXk:=afk(x;e),k=1, . . . ,r, which areindependent of each other.

Introducingrarbitrary auxiliary constantsλ1, . . . ,λr, one may consider the one-term group generated by the general linear combination:

C:=λ1X1+···rXr, ofX1, . . . ,Xr, namely the flow:

x0i=exp(tC)(xi) =xi+t

1C(xi) + t2

1·2C C(xi) +···

=xi+t

r k=1

λkξki+t2

1...r

k,j

λkλj

1·2 Xkji) +···

=:hi(x;t,λ1, . . . ,λr) (i=1···n). If theXk≡ −af

k(x;e)do stem from anr-term continuous groupx0i=fi(x;a1, . . . ,ar), a natural question is then to compare the above integrated finite equations hi(x;t,λ1, . . . ,λr)to the original transformation equations fi(x;a1, . . . ,ar). Before studying this question together with Lie and Engel, we focus our attention on a subquestion whose proof shows a beautiful, synthetical, geometrical idea: that of prolongating the action jointly to finite sets of points.

At first, without assuming that theXkstem from anr-term continuous group, it is to be asked (subquestion) whether the parametersλ1, . . . ,λrin the above integrated transformation equationsx0i=hi(x;λ1, . . . ,λr)are all essential. In the formula just above, we notice that the r+1 parameters only appear in the formtλ1, . . . ,tλr, hence because theλkare arbitrary, there is no restriction to sett=1. We shall then simply writehi(x;λ1, . . . ,λr)instead ofhi(x; 1,λ1, . . . ,λr).

4.4 Essentiality of Multiple Flow Parameters 75

Theorem 8.If the r independent infinitesimal transformations:

Xk(f) =

Proof. Here exceptionally, we observed a harmless technical incorrection in Engel-Lie’s proof ([2], pp. 62–65) about the link between the generic rank ofX1

x, . . . ,Xr

x

and a lower bound for the number of essential parameters2.

However, Lie’s main idea is clever and pertinent: it consists in the introduction of exactlyr(the number ofλk’s) copies of the same space x1, . . . ,xnwhose coor-dinates are labelled asx(1µ), . . . ,x(nµ) forµ=1, . . . ,rand to consider the family of transformation equations induced by thesame transformation equations:

x(iµ)0=exp(C) x(iµ)

=hi x(µ)1, . . . ,λr

(i=1···n;µ=1···r)

on each copy of space, again witht =1. Geometrically, one thus views how the initial transformation equationsx0i=hi(x;λ1, . . . ,λr)actsimultaneouslyonr-tuples of points. Written in greater length, these transformations read:

(5’) x(iµ)0=x(iµ)+ an idea also reveals to be fruitful in other contexts.

According to the theorem stated on p. 15, in order to check that the parameters

λ1, . . . ,λrare essential, one only has to expandx0in power series with respect to the

2 On page 63, it is said that if the numberrof the independent infinitesimal transformationsXkis 6n, then ther×nmatrix ξki(x)16i6n

16k6rof their coefficients is of generic rank equal tor, although this claim is contradicted withn=r=2 by the two vector fieldsx∂x +y∂y andxx∂x +xy∂y. Nonetheless, the ideas and the arguments of the written proof (which does not really needs such a fact) are perfectly correct.

powers ofxat the origin:

x0i=

α∈Nn

Uαi)xα (i=1...n),

and to show that the generic rank of the infinite coefficient mapping λ 7−→

Uαi)16i6nα∈Nn is maximal possible equal tor. Correspondingly and immediately, we get the expansion of ther-times copied transformation equations:

(5”) x(iµ)0=

α∈NnUαi,(µ)) (x(µ))α (i=1...n;µ=1...r), with, for eachµ=1, . . . ,r, thesamecoefficient functions:

Uαi,(µ))≡Uαi) (i=1...n;αNn;µ=1...r).

So the generic rank of the corresponding infinite coefficient matrix, which is just an r-times copy of the same mappingλ7−→ Uαi)16i6nα∈Nn, does neither increase nor decrease.

Thus, the parametersλ1, . . . ,λrfor the transformation equations x0=h(x;λ)are essential if and only if they are essential for the diagonal transformation equations x(µ)0=h x(µ),µ=1, . . . ,r, induced on the r-fold copy of the space x1, . . . ,xn.

Therefore, we are left with the purpose of showing that the generic rank of ther times copy of the infinite coefficient matrixλ7−→ Uαi,(µ))16i6n,α∈Nn 16µ6ris equal tor. We shall in fact establish more, namely that the rank at λ =0 of this map already equalsr, or equivalently, that the infinite constant matrix:

Uαi,(µ)

∂λk

(0)

16i6n,α∈Nn,16µ6r 16k6r

,

whoserlines are labelled with respect to partial derivatives, has rank equal tor.

To prepare this infinite matrix, if we differentiate the expansions (5’) which iden-tify to (5”) with respect to λk atλ =0, and if we expand the coefficients of our infinitesimal transformations:

ξki(x(µ)) =

α∈Nnξkiα(x(µ))α (i=1...n;k=1...r;µ=1...r)

with respect to the powers ofx1, . . . ,xn, we obtain a more suitable expression of it:

Uαi,(µ)

∂λk

(0)

16i6n,α∈Nn,16µ6r

16k6r

ξkiα16i6n,α∈Nn

16k6r ··· ξkiα16i6n,α∈Nn

16k6r

=:

JΞ(0)···JΞ(0).

4.4 Essentiality of Multiple Flow Parameters 77 As argued up to now, it thus suffices to show that this matrix has rank r. Also, we observe that this matrix identifies with theinfinite jet matrixJΞ(0)of Taylor coefficients of ther-fold copy of the samer×nmatrix of coefficients of the vector fieldsXk:

Ξ(x):=

ξ11(x)··· ξ1n(x)

··· ··· ···

ξr1(x)··· ξrn(x)

.

This justifies the symbolJintroduced just above. At present, we can formulate an auxiliary lemma which will enable us to conclude.

Lemma 4.2.Let n>1, q>1, m>1be integers, letxKnand let:

A(x) =

a11(x)··· a1m(x)

··· ··· ···

aq1(x)··· aqm(x)

be an arbitrary q×m matrix of analytic functions:

ai j(x) =

α∈Nn

ai jαxα (i=1...q;j=1...m)

that are all defined in a fixed neighborhood of the origin inKn, and introduce the q×∞constant matrix of Taylor coefficients:

JA(0):= ai jα16j6m,α∈Nn

16i6q

whose q lines are labelled by the index i. Then the following inequality between (generic) ranks holds true:

rkJA(0)>genrkA(x).

Proof. Here, our infinite matrixJA(0)will be considered as acting byleft multi-plication onhorizontal vectors u= (u1, . . . ,uq), so thatuJA(0)is an∞×1 matrix, namely an infinite horizontal vector. Similarly,A(x)will act on horizontal vectors of analytic functions(u1(x), . . . ,ur(x)).

Supposing that u = (u1, . . . ,uq)Kq is any nonzero vector in the kernel of JA(0), namely: 0=uJA(0), or else in greater length:

0=u1a1jα+···+uqaq jα (j=1...m;αNn),

we then immediately deduce, after multiplying each such equation byxα and by summing up over allαNn:

0≡u1a1j(x) +···+uqaq j(x) (j=1...m),

so that the same constant vectoru= (u1, . . . ,uq)also satisfies 0≡u A(x). It follows that the dimension of the kernel ofJA(0)is smaller than or equal to the dimension

of the kernel ofA(x)(at a genericx): this is just equivalent to the above inequality

between (generic) ranks. ut

Now, for eachq=1,2, . . . ,r, we want to apply the lemma with the matrixA(x) being the q-fold copy of matrices Ξ(x(1))···Ξ(x(q)), or equivalently in greater length:

Ξq exq :=

ξ11(1)··· ξ1n(1) ξ11(2)··· ξ1n(2) ··· ξ11(q) ··· ξ1n(q)

··· ··· ··· ··· ··· ··· ··· ··· ··· ···

ξr1(1)··· ξrn(1) ξr1(2)··· ξrn(2) ··· ξr1(q) ··· ξrn(q)

,

where we have abbreviated:

exq:= x(1), . . . ,x(q) .

Lemma 4.3.It is a consequence of the fact that X1,X2, . . . ,Xrare linearly indepen-dent of each other that for every q=1,2, . . . ,r, one has:

genrk

Ξ x(1) Ξ x(2) ··· Ξ x(q)>q.

Proof. Indeed, forq=1, it is at first clear that genrk Θ(x(1))>1, just because not all theξki(x)vanish identically.

We next establish by induction that, as long as they remain<r, generic ranks do increase of at least one unity at each step:

genrk

Ξq+1 exq+1

>1+genrk

Ξq exq , a fact which will immediately yield the lemma.

Indeed, if on the contrary, the generic ranks would stabilize, and still be <r, then locally in a neighborhood of a generic, fixed ex0q+1, both matrices Ξq+1

and Ξq would have the same, locally constant rank. Consequently, the solutions ϑ1(exq)···ϑr(exq)

to the (kernel-like) system of linear equations written in matrix form:

0 ϑ1(exq)···ϑr(exq) Ξq exq

,

which are analytic nearex0qthanks to an application of Cramer’s rule and thanks to constancy of rank, would be automatically also solutions of the extended system:

0 ϑ1(exq)···ϑr(exq)

Ξq(exq) Ξ(x(q+1)),

whence there would existnonzerosolutions(ϑ1, . . . ,ϑr)to the linear dependence equations:

0= ϑ1···ϑr

Ξ x(q+1)

4.4 Essentiality of Multiple Flow Parameters 79 which areconstantwith respect to the variablex(q+1), since they only depend upon exq. This exactly contradicts the assumption thatX1(q+1), . . . ,Xr(q+1)are independent

of each other. ut

Lastly, we may chain up a series of (in)equalities that are now obvious conse-quences of the lemma and of the assertion:

rank

JΞ(0)···JΞ(0)=rankJΞr(0)>genrkΞr exr

=r, and since all ranks are anyway6r, we get the promised rank estimation:

r=rank

JΞ(0)···JΞ(0),

which finally completes the proof of the theorem. ut

In order to keep a memory track of the trick of extending the group action to an r-fold product of the base space, we also translate a summarizing proposition which is formulated on p. 66 of [2].

Proposition 5.If the r infinitesimal transformations:

Xk(f) =

n i=1

ξki(x1, . . . ,xn)∂f

xi

(k=1...r)

are independent of each other, if furthermore:

x(1µ), . . . ,x(nµ) (µ=1...r)

are r different systems of n variables, and if lastly one sets for abbreviation:

Xk(µ)(f) =

n i=1

ξki x(1µ), . . . ,x(nµ)

f

x(iµ)

(k,µ=1...r),

then the r infinitesimal transformations:

Wk(f) =

r µ=1

Xk(µ)(f) (k=1...r)

in the nr variables x(iµ)satisfynorelation of the form:

n k=1

χk x1(1), . . . ,x(1)n , . . . ,x(r)1 , . . . ,x(r)n

Wk(f)0.

Also, we remark for later use as in [2], p. 65, that during the proof of the the-orem 8 above, it did not really matter that the equations (5) represented the finite

equations of a family of one-term groups. In fact, we only considered the terms of first order with respect toλ1, . . . ,λr in the finite equations (5), and the crucial Lemma 4.3 emphasized during the proof was true under the only assumption that the infinitesimal transformationsX1, . . . ,Xr were mutually independent. Consequently, Theorem 8 can be somewhat generalized as follows.

Proposition 4.If a family of transformations contains the r arbitrary parame-ters e1, . . . ,erand if its equations, when they are expanded with respect to pow-ers of e1, . . . ,er, possess the form:

x0i=xi+

r k=1

ekξki(x1, . . . ,xn) +··· (i=1···n),

where the neglected terms in e1, . . . ,er are of second and of higher order, and lastly, if the functionsξki(x)have the property that the r infinitesimal transfor-mations made up with them:

Xk(f) =

n i=1

ξki(x1, . . . ,xn)∂f

xi

(k=1···r)

are independent of each other, then those transformation equations representr different transformations, or what is the same: the r parameters e1, . . . ,er are essential.

Documents relatifs