Theorem 12.1.2. The function is smooth, convex, symmetric in its coordinates, and nondecreasing in each coordinate. It satisfies If , then on a neighbourhood of the function is independent of and equals the regularized maximum of the remaining coordinates. Furthermore,
Argument in the manuscript
Proof. Put . After changing variables, is the convolution of the locally integrable function with the smooth compactly supported probability kernel . Differentiating that kernel proves smoothness. For , apply the convexity inequality for to and integrate. This proves convexity. Monotonicity and permutation symmetry follow directly from the integral.
Translation by adds inside the maximum, and the kernel has mass one. Jensen’s inequality gives the lower bound in (12.1.2), since . The upper bound follows from . The pointwise estimate proves (12.1.3).
For the deletion assertion choose realizing the other maximum. Then throughout the kernel support. The maximum does not use the th coordinate; integrating out contributes the factor one. The strict gap persists near . Finally, monotonicity and convexity give the derivative inequalities. Differentiate (12.1.1) once in , then once in , to obtain the two remaining identities. ◻