Functional Calculi, Positivity, and Convolution of Matrices

TL;DR

This paper develops a framework for convolution as a positivity-preserving matrix transform, extending classical entrywise calculus theories and revealing connections to combinatorics and polynomial identities.

Contribution

It introduces a novel convolution-based matrix calculus that preserves positivity and generalizes classical theories, incorporating Cayley--Hamilton-type results and combinatorial insights.

Findings

Convolution defines a positivity-preserving matrix transform.

Established a Cayley--Hamilton-type theory for convolution.

Linked convolution to the Bruhat order on symmetric groups.

Abstract

Convolution admits a natural formulation as a functional operation on matrices. Motivated by the functional and entrywise calculi, this leads to a framework in which convolution defines a matrix transform that preserves positivity. Within this setting, we establish results parallel to the classical theories of P\'olya--Szeg\H{o}, Schoenberg, Rudin, Loewner, and Horn in the context of entrywise calculus. The structure of our transform is governed by a Cayley--Hamilton-type theory valid in commutative rings of characteristic zero, together with a novel polynomial-matrix identity specific to convolution. Beyond these analytic aspects, we uncover an intrinsic connection between convolution and the Bruhat order on the symmetric group, illuminating the combinatorial aspect of this functional operation. This work extends the classical theory of entrywise positivity preservers and operator monotone functions into the convolutional setting.