Maximal inequalities for stochastic convolutions and pathwise uniform convergence of time discretisation schemes

Abstract

We prove a new Burkholder-Rosenthal type inequality for discrete-time processes taking values in a 2-smooth Banach space. As a first application we prove that if (S(t,s))0≤ s≤ T is a C0-evolution family of contractions on a 2-smooth Banach space X and (Wt)t∈ [0,T] is a cylindrical Brownian motion on a probability space (,P), then for every 0<p<∞ there exists a constant Cp,X such that for all progressively measurable processes g: [0,T]× X the process (∫0t S(t,s)gsdWs)t∈ [0,T] has a continuous modification and Et∈ [0,T]\| ∫0t S(t,s)gsdWs \|p≤ Cp,Xp E (∫0T \| gt\|2γ(H,X)dt)p/2. Moreover, for 2≤ p<∞ one may take Cp,X = 10 D p, where D is the constant in the definition of 2-smoothness for X. Our result improves and unifies several existing maximal estimates and is even new in case X is a Hilbert space. Similar results are obtained if the driving martingale gtdWt is replaced by more general X-valued martingales dMt. Moreover, our methods allow for random evolution systems, a setting which appears to be completely new as far as maximal inequalities are concerned. As a second application, for a large class of time discretisation schemes we obtain stability and pathwise uniform convergence of time discretisation schemes for solutions of linear SPDEs dut = A(t)utdt + gtdWt, u0 = 0, Under spatial smoothness assumptions on the inhomogeneity g, contractivity is not needed and explicit decay rates are obtained. In the parabolic setting this sharpens several know estimates in the literature; beyond the parabolic setting this seems to provide the first systematic approach to pathwise uniform convergence to time discretisation schemes.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…