• Aucun résultat trouvé

Remarks on Bronštein's root theorem

N/A
N/A
Protected

Academic year: 2021

Partager "Remarks on Bronštein's root theorem"

Copied!
16
0
0

Texte intégral

(1)

HAL Id: hal-01444387

https://hal.archives-ouvertes.fr/hal-01444387

Preprint submitted on 24 Jan 2017

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires

Remarks on Bronštein’s root theorem

Guy Métivier

To cite this version:

Guy Métivier. Remarks on Bronštein’s root theorem. 2017. �hal-01444387�

(2)

Remarks on Bronˇstein’s root theorem

Guy M´ etivier

January 23, 2017

1 Introduction

In [Br1], M.D.Bronˇ stein proved that the roots of hyperbolic polynomials

(1.1) p(t, τ ) = τ

m

+

m

X

k=1

p

k

(t)τ

m−k

.

which depend on t varying in some interval I ⊂ R , are locally Lipschitz func- tions of t, if the coefficients p

k

are C

r

functions of t and the multiplicity of the roots does not exceed r; more importantly, he also proved that the roots are locally uniformly Lipschitz if p depends also continuously of parameters varying in a compact set.

His proof is based on delicate inequalities between the coefficients p

k

implied by hyperbolicity. The goal of this note is to give a different and simpler proof, based on an induction on the degree. We will also drop compactness, to keep only uniform bounds of coefficients in W

r,∞

.

This result is crucial in the proof of other estimates that M.D.Bronˇ stein proved in his other paper [Br2], on the well posedness in Gevrey spaces of hyperbolic equations. We will also quickly discuss these estimates in the last section of this note, as they are indeed equivalent to the Lispchitz smoothness of the roots.

To fix the notations, we make the following assumption.

Assumption 1.1. For t ∈ I := [−T, T ], p(t, ·) is a monic hyperbolic poly- nomial of degree m, which means that it has only real roots which denote by

Universit´e de Bordeaux - CNRS, Institut de Math´ematiques de Bordeaux, Institut de Math´ematiques de Bordeaux,

351 Cours de la Lib´ eration , 33405 Talence Cedex,

France. Guy.Metivier@math.u-bordeaux.fr

(3)

λ

1

(t) ≤ . . . ≤ λ

m

(t). We assume that their multiplicity is less than or equal to r ∈ {1, . . . , m}. We further assume that all the coefficients p

k

belong to the space W

r,∞

(I) and that

∀k ∈ {1, . . . , m}, kp

k

k

Wr,∞(I)

≤ R, (1.2)

∀t ∈ I, ∀τ, ,

r

X

j=0

|∂

τj

p(t, τ )| ≥ δ > 0.

(1.3)

Here W

r,∞

(I ) denotes the space of functions in L

with derivatives up to order r in L

. This is the space of C

r−1

functions such that the (r −1)-th derivative satisfies a Lipschitz condition. The condition (1.3) is a quantitive way to express that the multiplicities of the roots do not exceed r.

Theorem 1.2. For all T

1

< T , there is a constant K which depends on T ,T

1

, R, δ and m, such that for all family of polynomials p(t, ·) which satisfies the Assumption 1.1 one has for all t ∈ [−T

1

, T

1

]:

(1.4) p(t, τ ) = 0 ⇒ |∂

t

p(t, τ )| ≤ K|∂

τ

p(t, τ )|.

Moreover, for all j = 1, . . . , m and t and t

0

in [−T

1

, T

1

]:

(1.5) |λ

j

(t) − λ

j

(t

0

)| ≤ K|t − t

0

|.

The property (1.4) is stated in Lemma 4 of [Br1], as an intermediate step in the proof of the Lipschitz estimate. The equivalence of (1.4) and (1.5) for strictly hyperbolic polynomials is immediate, since the implicit function theorem implies that the roots roots λ

j

and that

t

λ

j

(t) = −∂

t

p(t, λ

j

)/∂

τ

p(t, λ

j

).

Approximating p by strictly hyperbolic polynomials, immediately implies the equivalence of (1.4) and (1.5) (see Lemma 2.5 below an the discussion which follows).

To prove (1.4) at t

0

, we will make several reductions. When r < m,

we will factorize p, on an interval of length which depends only on R and

δ, into products of polynomials of degree at most r, and thus the general

case follows from the case where we take r = m. Note that in this case, the

condition (1.3) is trivial since ∂

τm

p(t, τ ) = m!. Moreover, by translation and

dilatation in t, the key estimate is the following:

(4)

Proposition 1.3. For all R, there is a constant K which depends on R and m, such that for all family of polynomials p(t, ·) on [−1, 1] which satisfies (1.6) ∀k ∈ {1, . . . , m}, kp

k

k

Wm,∞([−1,1])

≤ R,

then

(1.7) p(0, τ ) = 0 ⇒ |∂

t

p(0, τ )| ≤ K|∂

τ

p(0, τ )|.

This proposition is proved by induction on m in Section 3 and the proof of Theorem 1.2 is completed in Section 4. Additional remarks are given in the last Section 5. Before starting the proof we collect in Section 2 several preliminary lemmas which will be needed later on.

Remark 1.4. The Lipschitz regularity of the root stated in Theorem 1.2 is local in ] − T, T [ and in general, does not extend to the boundary, as shown by the example p(t, τ ) = τ

2

− t on [0, 1]. The estimates are not valid at t = 0.

Remark 1.5. The condition on the W

r,∞

norm of the coefficients is sharp, in the sense that it cannot be replaced by W

s,∞

with s < r. For r = m = 2, this is seen on the example p(t, τ ) = τ

2

− a(t) where one can choose a ≥ 0 in W

s,∞

with s < 2 and √

a not Lipschitz. This can be extended in the following way.

Proposition 1.6. For all m ≥ 2 and > 0, there are hyperbolic polynomials (1.1) with coefficients p

k

in C

m−

([−1, 1]) such that there is a root λ

j

(t) which is not Lipschitz continuous near the origin.

The proof is given in Section 4 below.

2 Preliminaries

In this section, we gather several elementary lemmas which will be useful during the proof.

2.1 Sets of hyperbolic polynomials Denote by P

m

the set of monic polynomials

(2.1) p(τ ) = τ

m

+

m−1

X

k=0

p

m−k

τ

k

=

m

Y

j=1

(τ − λ

j

)

(5)

and we identify p with (p

1

, . . . , p

m

) ∈ C

m

. In particular we use the norm

|p| = max |p

k

| on P

m

. It is also natural to introduce the quantity

(2.2) hpi = max |p

k

|

1/k

,

since for all ρ > 0,

(2.3) p

ρ

(τ ) = ρ

m

p(τ /ρ) ⇒ hp

ρ

i = ρhpi.

Moreover, the roots satisfy

(2.4) ∀j, |λ

j

| ≤ 2hpi

since

0 = |p(λ

j

)| ≥ |λ

j

|

m

1 −

m−1

X

k=0

hpi/|λ

j

|

m−k

and the parenthesis is positive when hpi/|λ

j

| < 1/2.

We denote by H

m

the set of hyperbolic polynomials, that is polynomials with only reals roots λ

j

. We label them in nondecreasing order. For p ∈ H

m

, the coefficients p

k

are real. Let H

0m

denote the subset of polynomials p ∈ H

m

such that the coefficient p

1

vanishes. In this case, the roots λ

j

satisfy

(2.5) p

1

= X

λ

j

= 0, p

2

= − 1 2

X λ

2j

≤ 0.

This implies that forall k > 2, |p

k

| ≤ m

k

|2p

2

|

k/2

, or in short (2.6) p ∈ H

0m

⇒ hpi ≤ m|2p

2

|

12

. 2.2 Smooth factorisation

Our proof relies on the factorization of polynomials and a good control of the factors. It is convenient to introduce the following terminology.

Definition 2.1. We say that there is an holomorphic factorization on a a neighborhood O of p ∈ P

m

if there are holomorphic mappings from φ

j

from O to P

mj

, for j = 1, . . . , l, with 1 ≤ m

j

< m, such that for all p ∈ O, (2.7) p(τ ) = p

1

(τ ) . . . p

l

(τ ), p

j

= φ

j

(p).

Recall first the following local result.

(6)

Lemma 2.2. Suppose that p ∈ P

m

can be factorized as p

1

. . . p

l

with p

j

∈ P

mj

with 1 ≤ m

j

< m with non common roots. Then, there is a neighbor- hood O and a holomorphic factorization on O with φ

j

(p) = p

j

. Moreover, if p is hyperbolic, all the factors φ

j

(p) are hyperbolic.

Proof. Consider sets D

j

which contains of all the roots of a

j

and such that D

j

∩ D

k

= ∅ for j 6= k. For p in a neighborhood O of p, p does not vanish on ∪∂D

j

and by Rouch´ e’s theorem p has m

j

roots in D

j

, which yields the decomposition p = p

1

. . . p

l

. Moreover, the symmetric functions of the roots of p

j

are given by

σ

k

(p

j

) = 1 2iπ

Z

∂Dj

τ

p(τ ) p(τ ) τ

k

dτ.

Thus they are holomorphic functions of the coefficients of p. Thus the co- efficients of p

j

, which are polynomials of the σ

k

(p

j

), are also holomorphic functions of the coefficients of p, proving the first part of the lemma.

Because the roots of p

j

are roots of p, it is clear that if p is hyperbolic then all the p

j

are hyperbolic.

Corollary 2.3. Suppose that K is a compact subset of P

m

of polynomials with roots of multiplicity at mots r < m. Then there is ρ > 0 such that for all p ∈ K, there is an analytic factorization on the ball of center p and radius ρ in polynomials p

j

of degree m

j

≤ r.

Proof. By assumption and the lemma, there is an analytic factorization on a neighborhood of all p ∈ K. By compactness, there is ρ > 0 such that one can cover K by balls B

j

of radius ρ such that there is analytic factorization on the ball ˜ B

j

of radius 2ρ with the same center. All p is contained in one of the B

j

and the ball of center ρ and radius ρ is contained in ˜ B

j

.

In particular, we will use the following corollary.

Corollary 2.4. For R > 0, there is ρ > 0 such that for all p ∈ H

0m

such that

(2.8) |p| ≤ R, |p

2

| ≥ 1.

there is an analytic factorization p = p

1

p

2

on the ball of center p and radius ρ.

Proof. Denote by K the set of polynomials in H

m0

which satisfy (2.8). The roots of p ∈ K satisfy P

λ

j

= 0 and P

λ

2j

≥ 2. Therefore there is at

least one positive root and at least one negative root, which shows that the

multiplicities of the roots is strictly less than m.

(7)

2.3 Approximation by strictly hyperbolic polynomials Recall the following result proved by W.Nuij [Nuij] .

Lemma 2.5. If p ∈ H

m

and ε 6= 0, then p

ε

= (1 + ε∂

τ

)

m

p has m distinct real roots.

For the sake of completeness we sketch the proof. Let p = Q

(τ − µ

j

)

rj

where the µ

1

< . . . < µ

l

are distinct. The roots of p + ε∂

τ

p are the multiple roots µ

j

of p, with multiplicity decreased by one, and the zeros of f (τ ) = 1 + ε P

r

j

/(τ −µ

j

), which vanishes in each interval ]µ

j

, µ

j+1

[ and in −] − ∞, µ

1

[ or in ]µ

l

, +∞[ depending on the sign of ε. Hence p + ε∂

τ

p has m real roots counted with their multiplicity and the maximal multiplicity is decreased by one. Iterating m times, all the roots are real and simple.

2.4 Estimates for functions of one real variable

On intervals I ⊂ R and for integers r ≥ 1, we consider the spaces W

r,∞

(I) of functions of class C

r−1

such that the (r − 1)-th derivative is Lipschitz continuous on I . We give below two elementary lemmas.

Lemma 2.6. There is a consant C which depends only on m such that for all a ∈ W

m,∞

([−1, 1]]) and j ≤ m:

(2.9)

tj

a

L

≤ C a

L

+ ∂

tm

a

L

.

Proof. Intregrating m times from 0 to t we see that the function b ∈ W

m,∞

([0, 1]) such that ∂

tm

b = ∂

tm

a, ∂

tj

b(0) = 0 for j < m, is bounded and

k∂

tj

bk

L

≤ k∂

tm

ak

L

.

Moreover, the function a − b is a polynomial of degree less than m and therefore its coefficients are bounded by its L

norm, and there is a constant C which depends only on m such that

k∂

tj

(a − b)k

L

≤ Cka − bk

L

≤ C kak

L

+ k∂

tm

ak

L

. The lemma follows.

Lemma 2.7. For all nonnegative a ∈ W

2,∞

([−1, 1]) one has (2.10) |t| ≤ θ p

a(0)/M ⇒ 1

2 a(0) ≤ a(t) ≤ 2a(0), where M = kak

W2,∞([−1,1])

and θ = ( √

5 − 2).

(8)

Proof. Recall first that for nonnegative functions a ∈ W

2,∞

([−1, 1]):

(2.11) |∂

t

a(0)| ≤ max

(2a(0)k∂

t2

ak

L

)

12

, 2a(0) ≤ 2M

12

a(0)

12

. The first estimate follows from the inequality which is valid for all s ∈ [−1, 1]:

0 ≤ a(s) ≤ a(0) + s∂

t

a(0) + 1 2 s

2

M

2

with M

2

= k∂

t2

ak

L

. If |∂

t

a(0)| ≤ M

2

we can choose s = −∂

t

a(0)/M

2

and we find that |∂

t

a(0)|

2

≤ 2M

2

|a(0)|. If |∂

t

a(0)| ≥ M

2

, we take s = ±1 to obtain that

0 ≤ a(0) − |∂

t

a(0)| + 1

2 M

2

≤ 0 ≤ a(0) − 1

2 |∂

t

a(0)|

and thus |∂

t

a(0)| ≤ 2a(0).

Hence, with δ = p

a(0), one has

|a(t) − δ

2

| ≤ 2|t| √

M δ + 1

2 t

2

M ≤ 1 2 δ

2

if |t| ≤ ( √

5 − 2)δ/ √

M proving the lemma.

3 The main induction

In this section we prove Proposition 1.3 by induction on m, the case m = 1 being trivial. So we assume that m ≥ 2 and that the proposition is proved for polynomials of degree less than m. More precisely, we assume that for all R

1

, there is K

1

such that for all family of monic hyperbolic polynomials {q(t, ·), t ∈ [−1, 1]} of degree ≤ m − 1 with W

m−1,∞

coefficients and such that

(3.1) ∀k, kq

k

k

Wm−1,∞([−1,1])

≤ R

1

, one has

(3.2) q(0, τ ) = 0 ⇒ |∂

t

q(0, τ )| ≤ K

1

|∂

τ

q(0, τ )|.

We fix R > 0 and we look for K such that (1.7) is satisfied for all family of

polynomials p(t, ·) ∈ H

m

which satisfy (1.6).

(9)

We first consider families of hyperbolic polynomials in H

m0

.

Proposition 3.1. Given R, there is K such that for all family of hyperbolic polynomials {p(t, ·) ∈ H

m0

, t ∈ [−1, 1]}, which satisfies the bound (1.6), the property (1.7) is satisfied.

Proof. a) Because p(t, ·) ∈ H

m0

, we know that p

2

(t) ≤ 0. If p

2

(0) = 0 then, because m ≥ 2, ∂

t

p

2

(0) = 0 and |p

2

(t)| ≤

12

R|t|

2

. Hence by (2.6) all the coefficients satisfy p

k

(t) = O(|t|

k

). In particular, τ = 0 is the unique root of p(0, ·) and therefore the estimate is trivially true since ∂

τ

p(0, 0) =

t

p(0, 0) = 0.

From now on we assume that p

2

(0) < 0 and we set δ = p

−p

2

(0)/2 > 0.

b) Let ρ = ( √

5 − 2) p

(2/R). By Lemma (2.7), for |t| ≤ ρδ one has δ

2

≤ −p

2

(t) ≤ 4δ

2

. Note that the interval [−ρδ, ρδ] is contained in [−1, 1]

since δ ≤ p

R/2. By (2.6), the coefficients of p satisfy (3.3) ∀t ∈ [−ρδ, ρδ], |p

k

| ≤ Cδ

k

where C depends only on m. For s ∈ [−1, 1], introduce the polynomial (3.4) q(s, τ ) = δ

−m

p(sρδ, δτ ) = τ

m

+

m

X

k=2

q

k

(s)τ

m−k

the coefficients of which are

(3.5) q

k

(s) = δ

−k

p

k

(ρδs).

The estimate

(3.6) kq

k

k

L([−1,1]

≤ C

follow from (3.3). Moreover,

(3.7) |∂

sm

q

k

(s)| ≤ ρ

m

δ

m−k

k∂

tm

p

k

k

L

≤ R

0

,

where R

0

depends only on R. Here we crucially use that the order of deriva- tion is larger than or equal to k, so that the exponent of δ is nonnegative.

By Lemma 2.6 one can interpolate between (3.6) and (3.7) and there is R

0

which depends only on R and m such that

(3.8) ∀j ≤ m, ∀s ∈ [−1, 1], |∂

tj

q

k

(s)| ≤ R

0

. Moreover, by construction

(3.9) −q

2

(s) = −δ

−2

p

2

(sρδ) ≥ 1.

Summing up, we have proved that the q(s, ·) are hyperbolic polynomials in

H

m0

for s ∈ [−1, 1], which satisfy uniform bounds (3.8), and the additional

condition −q

2

(s) ≥ 1.

(10)

c) By Corollary 2.4 there is ρ > 0, which depends only on R

0

, and an analytic factorization q = q

1

q

2

on the ball centered at q(0, ·) of radius ρ.

The condition |q(s, ·) − q(0, ·)| = max

k

|q

k

(s) − q

k

(0)| ≤ ρ is satisfied on the interval |s| ≤ ρ/R

0

, and hence, there is T > 0, T ≤ 1, depending only on R

0

and m, such that for s ∈ [−T, T ]

(3.10) q(s, τ ) = q

1

(s, τ )q

2

(s, τ ).

Moreover, the coefficients of q

1

and q

2

are analytic functions of the coeffi- cients of q and there is R

00

such that their coefficients satisfy

∀j ≤ m, ∀s ∈ [−T, T ], , |∂

tj

q

kl

(s)| ≤ R

00

.

Consider then ˜ q

l

(s, τ ) = q(sT, τ ) defined for |s| ≤ 1. Then, there is R

1

, depending only on R and m, such that the ˜ q

l

are of degree less than m and satisfy the estimates (3.1) of the induction hypothesis. Therefore, there is K

1

which depends only on R

1

and m such that the polynomials ˜ q

1

and ˜ q

2

satisfy (3.2). Therefore, the q

l

satisfy (3.2) with the constant K

1

/T . At the roots of q

1

one has ∂

t

q = ∂

t

q

1

q

2

and ∂

τ

q = ∂

τ

q

1

q

2

. There is a similar and symmetric result at the roots of q

2

. Because q

1

and q

2

have no root in common, this implies that

(3.11) q(0, τ ) = 0 ⇒ |∂

t

q(0, τ )| ≤ K

1

/T |∂

τ

q(0, τ )|.

d) From the definition (3.4) of q, we see that q(0, τ ) = 0 is equivalent to p(0, δτ ) = 0 and that

s

q(0, τ ) = δ

1−m

ρ∂

t

p(0, δτ ), ∂

τ

q(0, τ ) = δ

1−m

p(0, δτ ).

Hence (3.11) implies that at roots of p(0, τ ) = 0 (3.12) |∂

t

p(t

0

, τ )| ≤ K

1

/T ρ |∂

τ

p(t

0

, τ )|.

This shows that (1.7) is satisfied with the constant K = K

1

/T ρ which depends only on R and m.

We now relax the condition p

1

= 0 and finish the proof of Proposition 1.3.

Proposition 3.2. Given R, there is K such that for all family of hyperbolic

polynomials {p(t, ·) ∈ H

m

, t ∈ [−1, 1]}, which satisfies the bound (1.6), the

property (1.7) is satisfied.

(11)

Proof. Consider

(3.13) p(t, τ ˜ ) = p(τ + p

1

(t)/m).

The polynomials ˜ p(t, ·) all belong to H

0m

: one has ˜ p

1

= 0 and the other coefficients are

˜ p

k

=

k

X

l=0 m−l m−k

(−p

1

/m)

k−l

p

l

. Thus, by (1.2),

|∂

tj

p ˜

k

(t)| ≤ R

1

where R

1

depends only on R and m. Thus, by Proposition 3.1, there is K

1

, depending only on R

1

, such that

˜

p(0, τ ) = 0 ⇒ |∂

t

p0, τ ˜ )| ≤ K

1

|∂

τ

p(0, τ ˜ )|.

Because

t

p(t, τ ˜ ) = ∂

t

p(t, τ + p

1

/m) + 1

m ∂

t

p

1

(t) ∂

τ

p(t, τ + p

1

/m) the estimate (1.7) follows with K = K

1

+ R/m.

The proof of Proposition 1.3 is now complete.

4 Proof of Theorem 1.2

4.1 Proof of (1.4)

Recall the notations. The polynomials are defined for |t| ≤ T and we want to prove (1.4) for |t

0

| ≤ T

1

, where T

1

< T are given. By translation, we can always assume that t

0

= 0 and that the polynomials are defined on the fixed interval |t| ≤ T − T

1

. By dilation, we can further assume that T − T

1

≥ 1, and therefore, the estimate (1.4) immediately follows from Proposition 3.2 when r = m.

We now consider the case r < m. In addition to the uniform bound (1.2) of the W

r,∞

norm of the coefficients, we assume (1.3). Again it is sufficient to prove the estimate for t

0

= 0 and T > 0, R and δ are fixed. Consider the compact set K ⊂ H

m

of polynomials with coefficients bounded by R and satisfying

(4.1) min

τ∈R r

X

j=0

|∂

τj

p(τ )| ≥ δ.

(12)

This is a compact set of polynomials with roots of mulitplicity ≤ r. By Corollary 2.3, there is ρ which depends only on K, that is on R and δ, such that there is an holomorphic factorisation p = p

1

. . . p

l

for |p − p(0, ·)| ≤ ρ.

Hence, for |t| ≤ ρ/R, there is a factorisation p(t, τ ) = p

1

(t, τ ) . . . p

l

(t, τ )

where the coefficients of p

j

are holomorphic functions of the coefficients of p. Therefore, there is R

1

, which depends only on R and δ, such that the W

r,∞

norms of the coefficients of the p

j

are bounded by R

1

. Moreover, the p

j

are hyperbolic of degree at most r. Hence, by the first step, there is K

1

such that

(4.2) p

j

(0, τ ) = 0 ⇒ |∂

t

p

j

(0, τ )| ≤ K

1

|∂

τ

p

j

(0, τ )|.

This implies (1.4) with K = K

1

R

l−11

. 4.2 Proof of (1.5)

As already said, (1.4) and (1.5) are equivalent when p is strictly hyperbolic.

By Lemma 2.5, p

ε

= (1 + ε∂

τ

)

m

∈ H

m

and the W

r,∞

norm of its coefficients is uniformly bounded if ε ∈ [0, 1[. Moreover, decreasing δ if necessary, the property (1.3) remains satisfied uniformly in ε for ε small. Hence, there is a constant K such that the property (1.4) is satisfied for all p

ε

. Hence, for ε > 0 small, the roots of p

ε

are simple and satisfy on [−T

1

, T

1

]

ε,j

(t) − λ

ε,j

(t

0

)| ≤ K|t − t

0

|.

The roots are continuous functions of ε and hence (1.5) follows.

4.3 Proof of Proposition 1.6

Consider a strictly hyperbolic polynomial q(τ ) with 0 as a root:

(4.3) q(τ ) = τ

m

+

m−1

X

k=1

q

m−k

τ

k

.

In particular, q

m−1

= ∂

τ

q(0) 6= 0. There is δ > 0 such that for all real a ∈ [−δ, δ], q(τ ) + a is strictly hyperbolic, with roots µ

1

(a) < . . . < µ

m

(a) which are analytic in a. One of them, say µ

j

, vanishes at a = 0 and ∂

a

µ

j

(0) =

−1/q

m−1

6= 0. Therefore, decreasing δ if necessary, there is c > 0 such that

(4.4) |a| ≤ δ ⇒ |∂

a

µ

j

(a)| ≥ c.

(13)

For t ∈ [−1, 1], consider the polynomial p(t, a, τ ) = t

m

(q(τ /t) + a) = τ

m

+

m−1

X

k=1

t

m−k

q

m−k

τ

k

+ t

m

a.

It is hyperbolic and its roots are tµ

l

(a). In particular, for t > 0, one has λ

j

(t, a) = tµ

j

(a). Now we chose a = a(t) = δ cos(t

−α

) with 0 < α < 1/m.

The coefficients p

1

, . . . , p

m−1

of p(t, a(t), ·) are smooth, and the last one p

m

(t) = δt

m

cos(t

−1−α

) belongs to the H¨ older class C

m−mα

. On the other hand, the t derivative of its j-th root is

µ

j

(a(t)) + αδt

−α

sin(t

−α

) ∂

a

µ

j

(a(t)), which by (4.4) is not bounded as t → 0.

5 Bronˇ stein estimates for hyperbolic polynomials

In [Br2], M.D Bronˇ stein proved the well posed-ness of the Cauchy prob- lem in Gevrey spaces for a hyperbolic operator P (t, x, D

t

, D

x

) , using the construction of a parametrix for e

−tγ(Dx)

P e

tγ(Dx)

, with principal symbol q = 1/P (t, x, τ − iγ(ξ), ξ ). The key step is to prove that q is a good symbol, and this relies on the following estimates.

Theorem 5.1. Suppose that {p(t, ·), t ∈ [−T, T ]} is a family of hyperbolic polynomials which satisfies Assumption 1.1. Then, for all T

1

< T there is a constant C such that for k ≤ m and l ≤ r, one has for t ∈ [T

1

, T

1

] and τ ∈ C with |Im τ | ≤ 1

(5.1) |Im τ |

k+l

τk

lt

p(t, τ )

≤ C |p(τ, a)|.

This theorem essentially rephrases the Proposition 2 of [Br2]. What we want to emphasize here is that these estimates are equivalent to (1.4) (1.5) so that Theorems 1.2 and 5.1 are somehow equivalent.

The estimates of the τ derivatives are classical, using that

(5.2) |p(t, τ )| ≥ c|Im τ |

r

and that

m!k!

τk

p is monic and hyperbolic with maximal multiplicity at most r − 1.

The estimates of the derivatives with respect to the parameter t are

proved by induction on the degree m using the following lemma which follows

from (1.4) (1.5). This lemma is implicit in [Br2] at the bottom of page 92,

but it is sufficiently important to be stated on its own.

(14)

Lemma 5.2. Under Assumption 1.1, given T

1

< T , there is ε

1

> 0 such that for |ε| ≤ ε

1

q = ∂

τ

p+ε∂

t

p is hyperbolic with roots of multiplicity ≤ r −1.

Proof. For the convenience of the reader we recall the essence of Bronˇ stein’s proof. Write

(5.3) p(τ, a) = τ

m

+

m

X

k=1

p

k

(a)τ

m−k

=

m

Y

j=1

(τ − λ

j

(a)).

Because p is monic, q is of degree ≤ m − 1 and the coefficient of τ

m−1

is

(5.4) a(t) = m + ε∂

a

p

1

(t)

Thus there is ε

1

> 0 depending only on R, such that for ε ≤ ε

1

, a ≥

12

m and q is of degree m − 1.

Suppose that µ

1

< . . . < µ

n

are the distinct roots of p(t

0

, ·) with multi- plicity r

j

. For k ≤ r

j

− 1, µ

j

is a root of ∂

τk−1

p(t

0

, ·) and thus (1.4) implies that there is K, which depends only on T

1

and on the bounds R and δ such that

(5.5) |∂

t

τk−1

p(t

0

, µ

j

)| ≤ K|∂

τk

p(t

0

, µ

j

)|.

In particular, if r

j

> 1, µ

j

is a root of ∂

τ

p(t

0

, ·), thus of ∂

t

p(t

0

, ·) and q(t

0

, ·), of multiplicity ≥ r

j

− 1. Moreover (5.5) implies that when τ → µ

j

,

|∂

t

p(t

0

, τ )| ≤ K + O |τ − µ

j

|)

|∂

τ

p(t

0

, τ )|.

Therefore, if |ε|K < 1, q(t

0

, τ )/∂

τ

p(t

0

, τ ) > 0 for τ close to µ

j

.

On ]µ

j

, µ

j+1

[, p(t

0

, ·) has a constant sign, and ∂

τ

p(t

0

, ·) has opposite sign near the ends µ

j

and µ

j+1

. By the remark above, near the ends, q(t

0

, ·) has the same sign as ∂

τ

p(t

0

, ·), provided that |ε|K < 1. Thus q(t

0

, ·) has opposite sign near the ends and q has also a root in the interval ]µ

j

, µ

j+1

[. Because q is of degree m − 1, this implies that q(t

0

, ·) has only real roots: the µ

j

with multiplicity r

j

− 1 and one simple root in each of the interval ]µ

j

, µ

j+1

[.

Proof of Theorem 5.1. We proceed by induction on l.

a) If l = 0, denoting by λ

j

the roots of p, one has

τk

p/p = X

|I|=k

Y

j∈I

(τ − λ

j

)

−1

,

where I denotes subsets of {1, . . . , m} and |I | is the number of elements in

it. The estimate follows since |τ − λ

j

| ≥ |Im τ |.

(15)

b) Similarly, if l = 1, (∂

τk

t

p)/p is a sum of terms

∇λ

j0

Y

j∈I

(τ − λ

j

)

−1

with |I| = k + 1. The estimate follows, knowing the estimate of ∇λ

j0

from Theorem 1.2.

c) Suppose now that the estimate has been proved up to derivatives of order l − 1. Consider the polynomial

q = 1

a ∂

τ

p + ε∂

a

p

, a = m + ε∂

t

p

1

.

By Lemma 5.2, q is monic and hyperbolic, and for T

2

∈]T

1

, T [ and ε small, depending only on R and δ, l the family {q(t, ·), t ∈ [−T

2

, T

2

]} satisfies the Assumption 1.1 for some constants R

1

and δ

1

which depend only on R and δ. Hence, one can apply the induction hypothesis to q and conclude that

τk

tl−1

q(τ, a)

≤ C|Im τ |

−k−l+1

|q(τ, a)| ≤ C|Im τ |

−k−|α|

|p(τ, a)|, since, by step b),

|q| ≤ C|Im τ |

−1

|p|.

One has similar estimates for aq, since a is smooth, and for ∂

τ

p by the induction hypothesis, thus

ε∂

τk

tl

p(τ, a)

. |Im τ |

−k−|α|

|p(τ, a)|

and the estimate is proved at the order l.

Remark 5.3. Theorems 1.2 and (5.1) are closely related. We have used the former to prove the latter, but the converse is also true : if the estimates (5.1) are satisfied, then the main estimate of (1.4) is satisfied. Indeed, it is sufficient to assume that

γ |∂

t

p(t

0

, τ − iγ)| ≤ K

1

|p(t

0

, τ − iγ)|.

At a root τ

0

of p(t

0

, τ

0

) = 0, the right hand side is γ |∂

τ

p(t

0

, τ

0

| + O(γ

2

).

Thus dividing out by γ and letting γ tend to 0 implies that

|∂

t

p(t

0

, τ

0

)| ≤ K

1

|∂

τ

p(t

0

, τ

0

)|.

Remark 5.4. When p(τ, ξ) is polynomial in (τ, ξ) the estimates (5.1) are

proved in a completely different way in [H¨ or] Theorem 12.4.6, using real al-

gebraic geometry. Bronˇ stein’s theorem is much more general since it applies

when the coefficient are only C

r

functions of the parameters.

(16)

Remark 5.5. The estimates (5.1) have another formulation. Introduce

(5.6) p(t, s, τ ˜ ) =

r

X

l=0

1

l! s

l

tl

p(t, τ ).

Then, (5.1) implies that for |s| . |Im τ |,

(5.7) |˜ p(t, s, τ )| . |p(t, τ )|

and that there is δ > 0 such that for |s| ≤ δ|Im τ |,

(5.8) 1

2 |p(t, τ )| ≤ | p(t, s, τ ˜ )| ≤ 2|p(t, τ )|.

Note that (5.7) is indeed equivalent to (5.1) for k = 0, since there is a constant C such that for all polynomial and all γ > 0, q(s) = P

l≤r

q

l

s

l

one has

C

−1

sup γ

l

|q

l

| ≤ sup

|s|≤γ

|q(s)| ≤ C sup γ

l

|q

l

| A direct proof of (5.7) and (5.8) is given in [CNR].

References

[Br1] M.D Bronˇ stein, Smoothness of the roots of polynomials depending on parameters

[Br2] M.D Bronˇ stein, The Cauchy Problem for hyperbolic operators with characteristic of variable multiplicity, Trans. Moscow. Math. Soc., 1982, pp 87–103.

[CNR] F.Colombini, T.Nishitani, J.Rauch Weakly Hyperbolic Systems by Symmetrization, preprint 2016.

[H¨ or] L.H¨ ormander, The analysis of Linear Partial Differential Operators, vol II, Springer Verlag, 1985

[Nuij] W. Nuij, A note on hyperbolic polynomials, Math. Scan. 23 (1968),

pp 69-72.

Références

Documents relatifs

– Estimates of the rate of approximation in a de-Poissonization lemma of Beirlant and Mason [1] is obtained for the case where the distribution satisfy a quantitative condition

The first algorithmic proof of the asymmetric version, where the condition requires the existence of a number in (0, 1) for each event, such that the probability of each event to

In effect it says that if we randomly give values (0 or 1) to a large proportion of the variables which are also randomly selected (this procedure is called a random restriction),

varieties up to isogeny (a free group generated by simple abelian varieties up to isogeny), is the subgroup generated by the Jacobians the whole group? It would actually suffice if

(ii) For every n ≥ 5 there exists a strictly negative curved polyhedron of dimension n whose fundamental group G is hyperbolic, which is homeomorphic to a closed aspherical

Using a different ortho- normal basis would not affect the absolute value Jdet (T)[. Similar remarks apply when the range is a Hilbert space.. Extremal mappings

John8 College, Cambridge, England. Ahnqvist &amp; Wiksells

One could also use &#34;scissors and glue&#34; techniques to produce a concrete Riemann surface leading to an example of the desired kind.. However, implicit in such