17.08.2013 Views

THÈSE Estimation, validation et identification des modèles ARMA ...

THÈSE Estimation, validation et identification des modèles ARMA ...

THÈSE Estimation, validation et identification des modèles ARMA ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Chapitre 2. Estimating weak structural V<strong>ARMA</strong> models 80<br />

Writing d t(ϑ) = e t(ϑ)− ˜e t(ϑ), we obtain for t > p,<br />

dt(ϑ) = Cdt−1(ϑ) = C t−p dp(ϑ) = C t−p<br />

<br />

bp −˜ <br />

bp +C bp−1 −˜ <br />

bp−1 Note that C is the companion matrix of the polynomial<br />

P(z) = Id −<br />

q<br />

i=1<br />

A −1 −1<br />

0 BiB0 A0z i = A −1<br />

0<br />

+···+C p−1<br />

<br />

b1 −˜ <br />

b1 +C p b0. −1<br />

Bϑ(z)B0 A0.<br />

By A2, the zeroes of P(z) are of modulus strictly greater than one :<br />

P(z) = 0 ⇒ |z| > 1 (2.28)<br />

By a well-known result on companion matrices, (2.28) is equivalent to ρ(C) < 1, where<br />

ρ(C) denote the spectral radius of C. By the compactness of Θ, we thus have<br />

We thus have<br />

supρ(C)<br />

< 1.<br />

ϑ∈Θ<br />

supdt(ϑ)<br />

≤ Kρ<br />

ϑ∈Θ<br />

t ,<br />

where K and ρ are as in the statement of the lemma. The conclusion follows. ✷<br />

Lemma 7. Under the assumptions of Theorem 2.1, we have<br />

<br />

<br />

sup˜<br />

<br />

<br />

ℓn(ϑ)−ℓn(ϑ) = o(1)<br />

almost surely.<br />

ϑ∈Θ<br />

Proof of Lemma 7 : We have<br />

˜ℓn(ϑ)−ℓn(ϑ) = 1<br />

n<br />

n<br />

t=1<br />

{˜<strong>et</strong>(ϑ)−<strong>et</strong>(ϑ)} ′ Σ −1<br />

e ˜<strong>et</strong>(ϑ)+e ′ t(ϑ)Σ −1<br />

e {˜<strong>et</strong>(ϑ)−<strong>et</strong>(ϑ)}.<br />

In the proof of this lemma and in the rest on the paper, the l<strong>et</strong>ters K and ρ denote<br />

generic constants, whose values can be modified along the text, such that K > 0 and<br />

0 < ρ < 1. By Lemma 6,<br />

<br />

<br />

sup˜<br />

<br />

<br />

ℓn(ϑ)−ℓn(ϑ) ≤ K<br />

n<br />

ϑ∈Θ<br />

≤ K<br />

n<br />

n<br />

t=1<br />

n<br />

t=1<br />

ρ t<br />

<br />

sup<br />

ϑ∈Θ<br />

<br />

<strong>et</strong>(ϑ)+sup ˜<strong>et</strong>(ϑ)<br />

ϑ∈Θ<br />

ρ t sup<strong>et</strong>(ϑ)<br />

(2.29)<br />

ϑ∈Θ

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!