An extremal property of the symmetric decreasing rearrangement
It is shown that for a given log-concave function, its symmetric decreasing rearrangement is always harder to approximate in the symmetric difference metric by inner log-linearizations with a fixed number of break points. This extends a classical result of Macbeath (1951) from convex bodies to a functional setting.
math.FA↗