Reason: First publication: proof of the stopped completion-of-squares lemma on a cascade block.
Proof
Throughout we use linearity and monotonicity of the integral freely. All random variables below are bounded — the entries of Zs,z˙(s),Es,Bs,Qs,Vs,Rs,Rs−1,Ws are continuous in s, hence bounded on [0,T] by conclusion (a) of the completion-of-squares theorem, while ∣ss∣≤2N everywhere and ∣as∣ is bounded by the adopted setting, and ∣es∣≤ceN−1/2(∣ss∣2+∣as∣2) is bounded in turn by conclusion (b) of that theorem, whence so is gs=es+Esss+Bsas — so every expectation appearing exists and is finite, and the finiteness assertions of claim 3 hold.
Step 1: proof of claim 1. That τ≥t♭ everywhere is immediate, since σ≥t♭. Let s∈[0,T]. If s<t♭ then τ>s everywhere, so {τ≤s}=∅∈Fssys. If s≥t♭ then
{τ≤s}=(G∩{σ≤s})∪(Ω∖G),
because off G one has τ=t♭≤s. Here G∈Ft♭sys⊆Fssys, a filtration being nondecreasing, and {σ≤s}∈Fssys by the definition of a stopping time; a σ-algebra being closed under complements, intersections and unions, {τ≤s}∈Fssys. Thus τ is a stopping time.
For s∈[t♭,T] and ω∈Ω: if ω∈/G then τ(ω)=t♭≤s, so 1{s<τ}(ω)=0=1G(ω)1{s<σ}(ω); if ω∈G then τ(ω)=σ(ω) and both sides equal 1{s<σ}(ω). Since τ≥t♭, min(t♭,τ)=t♭ everywhere; and for t∈[t♭,T] and ω∈/G, min(t,τ(ω))=min(t,t♭)=t♭.
Step 2: proof of claim 2. Fix s and ω and drop them from the notation. Since Z is symmetric, s⋅(ETZ)s=s⋅(ZE)s=s⋅Z(Es), by the transpose identity y⋅(Mz)=(MTy)⋅z of claim 3 of the componentwise toolkit together with the entry definitions; hence s⋅(ETZ+ZE)s=2s⋅Z(Es). Substituting the density z˙=−(ETZ+ZE−WR−1WT+Q) of (H2) and the definition e=g−Es−Ba, so that g=Es+Ba+e,
On the other hand R is symmetric by conclusion (a) of the completion-of-squares theorem and invertible under (H1), so R−1 is symmetric as well, and expanding u=a+R−1WTs,
using RR−1=I and R−1RR−1=R−1, and a⋅(WTs)=s⋅(Wa) by the transpose identity. Hence the first bracket above equals u⋅Ru−a⋅Ra. Finally, by the first display of conclusion (a) of the completion-of-squares theorem applied to z=z=(s,a),
21i,j=1∑l+mHijzizj=s⋅Qs+s⋅Va+a⋅Ra,
so the second bracket equals 21∑Hijzizj−a⋅Ra. Substituting both brackets, the terms a⋅Ra cancel and claim 2 follows.
Step 3: proof of claim 3. Apply conclusion (c) of the stopped weighted second-moment lemma with the stopping time τ of claim 1, at the two times t♯ and t♭, and subtract. On the left, at t♭ we have min(t♭,τ)=t♭ by claim 1, so the term is E[1Ω0st♭⋅Zt♭st♭]; at t♯, splitting 1Ω0=1G+1Ω0∖G (legitimate as G⊆Ω0) and using min(t♯,τ)=t♭ off G (claim 1) and min(t♯,τ)=min(t♯,σ) on G, the term is
E[1Gs♯⋅Z♯s♯]+E[1Ω0∖Gst♭⋅Zt♭st♭].
Subtracting, the common term E[1Ω0∖Gst♭⋅Zt♭st♭] cancels and the left-hand difference equals E[1Gs♯⋅Z♯s♯]−E[1Gst♭⋅Zt♭st♭]. On the right, the two integrals over [0,t♯] and [0,t♭] differ by the integral over [t♭,t♯], by the splitting of a Lebesgue integral over adjacent compact subintervals (obtained, as in the proof of the time-shift lemma, from claim 2 of the toolkit and claim 2 of the null-set lemma), the integrand being measurable and bounded by conclusion (a) of the stopped lemma. In that integrand, for s∈[t♭,t♯] we have 1{s<τ}=1G1{s<σ} by claim 1, and 1Ω01G=1G; substituting claim 2 for ss⋅z˙(s)ss+2ss⋅Zsgs and rearranging the resulting identity — moving the term carrying 21∑Hijzizj to the left and the boundary terms to the right — gives exactly the display of claim 3.
Insert claim 3 for the first term on the right. In the resulting expression the term ∫E[1G1{s<σ}us⋅Rsus]ds is at least r∫E[1G1{s<σ}∣us∣2]ds by hypothesis (H1) and monotonicity, and the term 2∫E[1G1{s<σ}ss⋅Zses]ds is at least −Xlin: indeed, by claim 1 of the componentwise toolkit and the bound ∣Zsγδ∣≤CZ,
using claim 1 of the componentwise toolkit twice, in the form ∑γ∣xγ∣≤p∣x∣ for x∈Rp with p=l, and then conclusion (b) of the completion-of-squares theorem; multiplying by the indicator, taking expectations and integrating gives the claimed bound. This proves the displayed inequality of claim 4.
For the final assertion, let (s,ω) satisfy s∈[t♭,t♯] and 1G(ω)1{s<σ}(ω)=1, that is, ω∈G and s<σ(ω). The confinement condition gives ρs(ω)≤ρ∗, and claim 2 of the localized coercivity lemma gives 21(l+m)(ωL(ρs)+CPωb(ρs))≤2cJ. Hence the integrand of Xquad is bounded above pointwise by 2cJ1G1{s<σ}∣zs∣2, and integrating gives Xquad≤2cJ∫[t♭,t♯]E[1G1{s<σ}∣zs∣2]ds. ■