Step 1: the square of M is a nonnegative submartingale. Since ∣Mt(ω)∣≤K for every t and ω, we have Mt4≤K4 pointwise, so E[Mt4]≤K4<∞ by monotonicity of the integral, that is, Mt2 is square-integrable for every t∈[0,T]. By the lemma on the square of a martingale, X=(Mt2)t∈[0,T] is a square-integrable submartingale with respect to (Ft)t∈[0,T] with Xt(ω)≥0 everywhere.
Step 2: extension to all nonnegative times. Define, for t≥0, Ftext=Fmin(t,T) and Xtext=Xmin(t,T). The family (Ftext)t≥0 is a filtration, since r≤t implies min(r,T)≤min(t,T). Each Xtext is Ftext-measurable, nonnegative and square-integrable, being one of the Xu with u∈[0,T]. For 0≤r≤t and A∈Frext the submartingale inequality E[Xtext1A]≥E[Xrext1A] holds: if t≤T it is the inequality for X at the times r≤t; if r≤T≤t it is the inequality for X at the times r≤T, because Xtext=XT and Frext=Fr; and if T≤r both sides equal E[XT1A]. Hence Xext is a nonnegative square-integrable submartingale indexed by t≥0.
Step 3: the inequality on finite dyadic grids. For a natural number n let Dn={kT2−n:k∈{0,1,…,2n}}, whose elements listed in increasing order form sample times 0=t0<t1<⋯<t2n=T. Claim 1 of Doob's discrete-time L2 maximal inequality, applied to the nonnegative submartingale Xext and these 2n+1 sample times (the index called n in that theorem being 2n here), gives
E[(d∈DnmaxMd2)2]≤4E[XT2]=4E[MT4].
Since x↦x2 is nondecreasing on [0,∞), (maxd∈DnMd2)2=maxd∈DnMd4 pointwise.
Step 4: passage to the supremum. Let D be the set of dyadic partition points of [0,T] from the statement, the points kT2−n with n zero or a natural number; since D0={0,T}⊆D1, one has D=⋃n∈NDn. Let M=supt∈D(∣Mt∣1Ω0), a random variable with 0≤M≤K by the supremum lemma, whose hypotheses hold by assumption (boundedness of every path by K holding even at every ω∈Ω). Define
Wn=d∈Dnmax(∣Md∣1Ω0)4(n∈N),
a random variable by claims 1, 3 and 4 of the arithmetic lemma for measurable functions (finitely many maxima of fourth powers of random variables). Since Dn⊆Dn+1 (each kT2−n equals 2kT2−(n+1)), the sequence (Wn) is nondecreasing; since (∣Md∣1Ω0)4≤Md4, Step 3 gives E[Wn]≤4E[MT4] by monotonicity. The sequence converges pointwise to M4: on one hand Wn≤M4 for every n, because x↦x4 is nondecreasing on [0,∞) and each ∣Md∣1Ω0 with d∈Dn is at most M; on the other hand, if M(ω)>0 and 0<ε<M(ω), claim 3 of the approximation property of the supremum yields t∈D with ∣Mt(ω)∣1Ω0(ω)>M(ω)−ε, and this t lies in Dn for all large n, so Wn(ω)≥(M(ω)−ε)4 for all large n; hence supnWn(ω)≥(M(ω)−ε)4 for every such ε, and since (M(ω)−ε)4 can be made larger than any number below M(ω)4 by taking ε small (x↦x4 being continuous on [0,∞)), supnWn(ω)=M(ω)4; the nondecreasing sequence (Wn(ω))n therefore converges to M(ω)4; the case M(ω)=0 is immediate. By the monotone convergence theorem applied to the nondecreasing sequence of nonnegative random variables (Wn),
E[M4]=n→∞limE[Wn]≤4E[MT4].■