If for some N∈N and p>1, Xn≥0(n≤N), EXNp<∞ then
E(n≤NmaxXnp)≤(p−1p)pEXNp a.s.
Explanation
The form of the equation can be seen as extracting the (p−1p)p resulting from n≤Nmax⋅np and calculating its upper bound. Since (p−1p)>1, if p is too large, the inequality’s value decreases, and it is crucial that the final number N can be large. In practical applications to statistics beyond theory, this N can be considered quite large, so there is no particular concern that N is limited.
Proof
Strategy: First, for a constant L, choose (L∧n≤NmaxXnp) and cut off the value based on L to develop the equation. Here, ∧ means (f∧g)(x):=min{f(x),g(x)} for two functions f,g. After obtaining a satisfactory expression through various tricks, sending L to infinity will eventually leave only ∞∧n≤NmaxXnp=n≤NmaxXnp.
Part 1.
Consider an increasing sequence {Ln} that satisfies Ln+1>Ln for all n∈N, where Y:=n≤NmaxXn.
EX=∫0∞P(X>t)dt
By considering t:=λp, according to another expression of expectation,
E[(Y∧Ln)p]====∫0∞P[(Y∧Ln)p>t]dt∫0∞P[(Y∧Ln)p>λp]pλp−1dλ∫0∞P(Y∧Ln>λ)pλp−1dλ∫0LnP(Y∧Ln>λ)pλp−1dλ
The reason why the integration interval can be reduced from [0,∞] to [0,Ln] is because if 0≤λ≤Ln, then there is no need to consider up to ∞ since it deals with P(Y∧Ln>λ) anyway. Meanwhile, since Ln will be sent to infinity at the end of the proof, cases where Ln<λ is even less of a concern.
Part 2.
If {(Xn,Fn)} is a submartingale, for all λ>0λP(n≤NmaxXn≥λ)≤∫(maxn≤NXn≥λ)XNdP
If 0≤λ≤Ln, since it’s essentially Y≥Ln and according to the inequality for submartingales [3], P(Y≥λ)≤∫(Y≥λ)XNdP, thus
E[(Y∧Ln)p]≤≤≤≤∫0LnP(Y∧Ln>λ)pλp−1dλ∫0LnP(Y≥λ)pλp−1dλ∫0Lnλ1∫(Y≥λ)XNdPpλp−1dλp∫0Ln∫(Y≥λ)XNλp−2dPdλ
Part 3.
According to Fubini’s theorem,
E[(Y∧Ln)p]≤≤====p∫0Ln∫(Y≥λ)XNλp−2dPdλp∫Ω∫0Y∧LnXNλp−2dλdPp∫ΩXN∫0Y∧Lnλp−2dλdPp∫ΩXNp−11(Y∧Ln)p−1dPp−1p∫ΩXN(Y∧Ln)p−1dPp−1pE[XN(Y∧Ln)p−1]
Hölder’s inequality: For p>1, if p1+q1=1 and f∈Lp(E), g∈Lq(E) then fg∈L1(E) and ∣fg∣1≤∣f∣p∣g∣q
If we set q:=p−1p, then q(p−1)=p and, according to Hölder’s inequality,
E[(Y∧Ln)p]≤≤≤≤≤p−1pE[XN(Y∧Ln)p−1]p−1pXN(Y∧Ln)p−11q∥XN∥p(Y∧Ln)p−1qq[EXNp]1/pE[(Y∧Ln)(p−1)⋅q]1/qq[EXNp]1/pE[(Y∧Ln)p]1/q
Dividing both sides by E[(Y∧Ln)p]1/q,
E[(Y∧Ln)p]1−1/q≤q[EXNp]1/p
Taking the p power to both sides, 1−1/q=1−(p−1)/p=1/p, therefore
E[(Y∧Ln)p]≤qp[EXNp]
Taking the limit to both sides,
n→∞limE[(Y∧Ln)p]≤n→∞limqp[EXNp]
When n→∞, since Y∧Ln↗Y, according to the Monotone Convergence Theorem,
En→∞lim[(Y∧Ln)p]≤qp[EXNp]
Organizing the equation,
EYp≤qp[EXNp]