Negativity‐preserving transforms of tuples of symmetric matrices

Abstract Compared to the entrywise transforms which preserve positive semidefiniteness, those leaving invariant the inertia of symmetric matrices reveal a surprising rigidity. We first obtain the classification of negativity preservers by combining recent advances in matrix analysis with some novel arguments relying on well‐chosen test matrices, Sidon sets from number theory, and analytic properties of absolutely monotone functions. We continue with the analogous classification in the multi‐variable setting, revealing for the first time a striking separation of variables, with absolute monotonicity on one side and only homotheties on the other. We conclude with the complex analogue of this result.