A distribution function is nondecreasing and right-continuous. Every nondecreasing function has finite left limits, so is càdlàg. Along each partition its increments are nonnegative and telescope, givingFor each , the set is finite because the sum of its positive jumps is at most . Every jump belongs to some , so is countable.
For a finite partition, the identity givesThe first sum tends to the Lebesgue-Stieltjes integral . In the second, intervals containing no prescribed large jump contribute at most their largest increment times ; first retain finitely many jumps above a threshold and then let the threshold vanish. The limit is therefore , proving
Refine a dyadic partition by inserting and . The triangle inequality shows that its variation over is at least . Passing to the defining limit givesConsequently the càdlàg functionsare nondecreasing: for , the displayed inequality makes both increments nonnegative. Thus they are distribution functions in the Stieltjes sense and ; this is the Jordan decomposition of a function of bounded variation.
Now , so is countable by part (a). For any finite subset , partitions isolating its points and the triangle inequality giveTaking the supremum over finite proves .
Apply part (a)'s square formula, extended by the Jordan decomposition of a function of bounded variation from nondecreasing functions to arbitrary càdlàg functions of bounded variation, to , , and . Sincelinearity of the Lebesgue-Stieltjes integral leaves . At each time , polarization of the jump correction givesOnly common jump times contribute, and hence
Articles by others on the same topic
There are currently no matching articles.