Maximizing Probability Bounds Under Moment-Matching Restrictions

Abstract

The problem of characterizing a distribution by its moments dates to work by Chebyshev in the mid-nineteenth century. There are clear (and close) connections with characteristic functions, moment spaces, quadrature, and other very classical mathematical pursuits. Lindsay and Basak posed the specific question of how far from normality could a distribution be if it matches k normal moments. They provided a bound on the maximal difference in cdfs, and implied that these bounds were attained. It will be shown here that in fact the bound is not attained if the number of even moments matched is odd. An explicit solution is developed as a symmetric distribution with a finite number of mass points when the number of even moments matched is even, and this bound for the even case is shown to hold as an explicit limit for the subsequent odd case. As Lindsay noted, the discrepancies can be sizable even for a moderate number of matched moments. Some comments on implications are proffered.