--- title: Positive Semi-definite Functions url: https://www.emergentmind.com/topics/positive-semi-definite-functions type: topic --- # Positive Semi-definite Functions A positive semi-definite (PSD) function is a mapping that, under defined rules, ensures that certain induced matrices or kernels remain positive semi-definite. The concept pervades matrix analysis, operator theory, probability, functional analysis, and machine learning, unifying a broad taxonomy of entrywise functions, kernel functions, and matrix-valued functionals that preserve positivity. This article surveys structural definitions, classical theorems, forbidden-block phenomena, dimension-dependent classifications, analytic characterizations, extension to multivariate and matrix-valued functions, and applications in statistical inference and computational modeling. ## 1. Definitions and Fundamental Properties A function $f: I \to \mathbb{C}$ (or $\mathbb{R}$), applied entrywise to an $n \times n$ positive semi-definite matrix $A = (a_{ij})$, is called a positivity preserver if $f[A] = (f(a_{ij}))$ is itself positive semi-definite for all $A$ in the cone $P_n(I)$ of $n \times n$ PSD matrices with entries from $I$ [2002.00332]. For kernel functions $K: X \times X \to \mathbb{C}$, $K$ is PSD if for every $n$ and every $x_1,...,x_n \in X$, the matrix $K_{jk} = K(x_j, x_k)$ is PSD [1603.05512]. Analogous notions generalize to block-matrices and matrix-valued functions, where positivity demands are formulated over quadratic forms or block-structured kernels [1602.00384]. The foundational Schur product theorem asserts that the Hadamard product of two PSD matrices is again PSD. Consequently, monomials and polynomials with non-negative coefficients preserve positivity under entrywise action [2002.00332][1603.05512]. ## 2. Classical Theorems: Absolute Monotonicity and Entrywise Preservers Schoenberg's theorem, refined by Rudin, classifies all real or complex functions that preserve PSD under entrywise action across matrices of all sizes and entries in $(−\rho, \rho)$ (or $D(0,\rho)$). Namely, $f$ must admit a power-series expansion $f(x) = \sum_{k=0}^\infty a_k x^k$ with all $a_k \geq 0$; such functions are absolutely monotonic [2002.00332][1504.07674][1602.04777]. In the multivariate setting, symmetric functions $f:[0,\infty)^m \to \mathbb{C}$ preserving positivity on block-partitioned matrices must have a multivariate power series with non-negative coefficients [1612.03660]. These conditions are sharp and exclude any function with negative coefficients, as negative monomials will generate matrices lacking the PSD property for some configurations. ## 3. Dimension-Dependent and Fixed-Dimension Phenomena The fixed-dimension problem investigates which functions preserve positivity when entrywise applied to $N \times N$ matrices. This setting relaxes the constraint of absolute monotonicity, permitting certain negative coefficients under tight threshold bounds [1504.07674][1602.04777][1602.00332][1602.04777]. Specifically, for polynomials $f(x)=\sum_{k=0}^M a_k x^k$, entrywise positivity preservation on $P_N(D(0,p))$ is equivalent to: - $a_0,...,a_{N-1} \geq 0$. - For $M \geq N$, $a_M \geq -\mathcal{C}(a_0,...,a_{N-1}; z^M; N,p)^{-1}$, where $\mathcal{C}$ is an explicit threshold involving binomial coefficients and Schur polynomial data [1504.07674]. A summary table for positivity-preserving polynomial coefficients in fixed dimension: | Degree $k$ | Coefficient Condition | Comments | |-----------------------|-------------------------------|--------------------------------------| | $0 \leq k < N$ | $a_k \geq 0$ | All lower-order terms must be non-neg.| | $k \geq N$ | $a_k \geq$ tight lower bound | Threshold via combinatorial formula | Cell decompositions of the PSD cone and Rayleigh-quotient formulations further elucidate these phenomena, demonstrating discontinuities and stratifications in critical-value maps and kernel structures [1602.04777][1504.07674]. ## 4. Forbidden Block Structure and Novel PSD-Preservers When functions are forbidden from acting on specific principal blocks (diagonal or otherwise), entirely new families of PSD-preserving functions arise. For diagonal blocks of size $1 \times 1$, the classical absolutely monotonic structure persists, but subject to the constraint $g(x) \geq f(x)$ for $x \in [0,\infty)$ when $f$ is not applied to the diagonal [2002.00332]. The most striking phenomenon emerges when forbidden blocks have size $K \geq 2$ and form a partition. Entrywise maps $f(z)=c z$ with $c \in [−1/(K−1), 1 ]$ preserve PSD. The allowance for negative $c$ when $K > 2$ proves that such linear preservers are not absolutely monotonic, establishing the existence of dimension-free non-absolutely-monotonic PSD-preservers [2002.00332]. Overlapping forbidden blocks collapse the structure back to the classical theory, restricting to absolutely monotonic maps. ## 5. PSD-Valued and Matrix-Valued Functions Matrix-valued and PSD-valued functions generalize the scalar paradigm to maps $F: \mathbb{R}^n \to \mathbb{C}^{m \times m}$ or $f: \mathcal{X} \to S_n^+$ [2111.11306][1602.00384]. Positive semidefiniteness is defined via block matrices, requiring, for all $N$, that $[F(x_p-x_q)]$ is PSD. Conditional positive semidefiniteness demands nonnegativity on vectors with zero sum [1602.00384]. A matrix-valued version of Schoenberg's theorem asserts that $F$ is conditionally positive semidefinite if and only if the Hadamard exponential $\exp_H(t F)$ is PSD for all $t > 0$, given by entrywise exponentiation [1602.00384]. However, in operator contexts, $\exp_H(tF(-i\nabla))$ fails to be positivity-preserving for $m \ge 2$, even when the kernel property holds. In the context of kernel sum-of-squares models, any PSD-valued function $f: \mathcal{X} \to S_n^+$ can be globally and uniformly approximated by functions of the form $F_A(x) = \Phi(x)^T A \Phi(x)$ with $A \succeq 0$ and $\Phi$ an RKHS feature map [2111.11306]. This class is closed under universal approximation, convex function modeling via Hessian sum-of-squares representations, and provides practical and theoretical guarantees for learning under shape constraints. ## 6. Connections with Special Functions and Gram-Kernel Transformations A unifying scheme identifies many special functions as PSD kernel generators. If $F(\xi)$ admits an integral or series representation as a transform of a positive measure (Laplace, Fourier, Mellin, etc.), then the matrix $K_{jk}=F(x_j+x_k)$ or $F(x_j-x_k)$ is PSD by Gram’s criterion or Bochner–Schoenberg theory [1603.05512]. Classical examples include Gamma, Beta, hypergeometric, theta, elliptic, zeta, and modular functions. For each, the construction proceeds by identifying an orthogonal function family under a positive measure, forming the Gram matrix, and recognizing Schur-product closure. Such constructions not only produce combinatorial and analytic PSD kernels but also connect to the theory of positivity preservers via entrywise application and operator-theoretic perspectives. ## 7. Implications for Statistical, Computational, and Analytical Applications The theory of PSD functions informs diverse disciplines including high-dimensional statistics, where nonlinear shrinkage estimators are required to preserve the covariance matrix's positive semidefiniteness [1602.04777][1504.07674]. The explicit coefficient bounds and stratification structures enable precise regularization, graphical model estimation, and covariance matrix inference. In computational mathematics, kernel sum-of-squares models offer algorithmic tractability for PSD- and convex-constrained learning, with efficient primal and dual reformulations and universally approximating families [2111.11306]. The Gram-kernel paradigm underpins a broad spectrum of kernel methods and special function theory, spanning orthogonal polynomial ensembles to modular forms. The analytic classification of entrywise and block-structured PSD-preservers and their fixed-dimension variants supplies rigorous design rules for preserving matrix positivity under transformations, ensuring validity of probabilistic and geometric modeling frameworks in contemporary research. Source: https://www.emergentmind.com/topics/positive-semi-definite-functions