Papers
Topics
Authors
Recent
Search
2000 character limit reached

Entrywise Positivity Preservers on Green Matrices

Published 19 Aug 2026 in math.RA | (2608.18491v1)

Abstract: We classify the entrywise functions that preserve positive semidefiniteness on discrete Green matrices (G(p,q)=(p_{\min(i,j)}q_{\max(i,j)})) with positive parameters, without requiring the resulting matrix to retain Green structure. For matrices of all orders, the preservers are the zero function and the functions (f(t)=\int_{[0,\infty)}tα\,dμ(α)), where (μ) is a nonzero finite positive measure and the integral is finite for every (t>0). Requiring the resulting matrix to be totally nonnegative reduces the nonzero preservers to (f(t)=ctα), where (c>0) and (α\ge0). These power functions also preserve positive semidefinite Green structure, while strict Green structure is preserved precisely when (α>0). No regularity assumption is needed for these classifications. We also characterize continuously differentiable functions that are entrywise Loewner monotone on every fixed-(q) Green family: this holds precisely when (f') is a positive mixture of nonnegative real powers, with the zero measure allowed.

Authors (1)

Summary

  • The paper proves that PSD-preserving functions are exactly zero or finite positive mixtures of nonnegative powers, f(t)=∫t^αdμ(α), with rank-one and 2×2 tests sufficient to force the classification.
  • It shows that total-nonnegativity preservation is far more rigid than PSD preservation, allowing only monomials ct^α, while strict Green inputs produce positive-definite outputs exactly when μ assigns positive mass to (0,∞).
  • It classifies fixed-q Loewner preservers through integrated power mixtures and characterizes Green-structure preservers as c exp(φ(log t)), which reduces to ct^α under mild regularity assumptions.

Overview and setting

This paper classifies the functions f:(0,)Rf:(0,\infty)\to\mathbb{R} that act entrywise, f[A]=(f(aij))f[A] = (f(a_{ij})), on the cone of positive-parameter discrete Green matrices G(p,q)G(p,q) with entries gij=pmin(i,j)qmax(i,j)g_{ij} = p_{\min(i,j)}q_{\max(i,j)}, pi,qi>0p_i, q_i > 0. Green matrices of this form arise as discrete Green kernels of second-order boundary-value problems and as inverses of irreducible tridiagonal ZZ-matrices. The paper distinguishes sharply between several output requirements: positive semidefiniteness (PSD) alone, total nonnegativity (TN), positive definiteness on strict Green inputs, Loewner monotonicity on fixed-parameter families, and preservation of Green structure itself. Except for the Loewner-monotonicity problem, no regularity is assumed on ff a priori; positivity, monotonicity, and continuity are derived as consequences of the preservation property.

The key structural tool is the factorization G(p,q)=DqLdiag(Δ1,,Δn)LTDqG(p,q) = D_q L\,\mathrm{diag}(\Delta_1,\dots,\Delta_n)\,L^T D_q, where DqD_q is diagonal, LL is the lower-triangular summation matrix, and f[A]=(f(aij))f[A] = (f(a_{ij}))0 are the increments of the ratio sequence f[A]=(f(aij))f[A] = (f(a_{ij}))1 with f[A]=(f(aij))f[A] = (f(a_{ij}))2. This yields the criteria f[A]=(f(aij))f[A] = (f(a_{ij}))3 and f[A]=(f(aij))f[A] = (f(a_{ij}))4; combined with Pinkus's criterion, PSD and TN coincide on the input Green class.

PSD preservers: a Laplace-transform representation

The central theorem states that f[A]=(f(aij))f[A] = (f(a_{ij}))5 preserves PSD on the Green class at all orders if and only if either f[A]=(f(aij))f[A] = (f(a_{ij}))6 or

f[A]=(f(aij))f[A] = (f(a_{ij}))7

for a nonzero finite positive Borel measure f[A]=(f(aij))f[A] = (f(a_{ij}))8 with finite integral at every f[A]=(f(aij))f[A] = (f(a_{ij}))9. The representing measure is unique. The proof proceeds in two steps. First, testing on positive rank-one matrices G(p,q)G(p,q)0 (which are Green with G(p,q)G(p,q)1) forces G(p,q)G(p,q)2 to be a continuous PSD Hankel kernel on G(p,q)G(p,q)3, so the Hankel kernel representation of Belton–Guillot–Khare–Putinar gives a bilateral Laplace representation G(p,q)G(p,q)4 with G(p,q)G(p,q)5 finite. Second, a two-by-two test matrix of the form G(p,q)G(p,q)6 with G(p,q)G(p,q)7 forces G(p,q)G(p,q)8 to be nondecreasing; a support lemma then shows that a finite measure whose bilateral Laplace transform is nondecreasing must be supported on G(p,q)G(p,q)9. Conversely, any such measure works because gij=pmin(i,j)qmax(i,j)g_{ij} = p_{\min(i,j)}q_{\max(i,j)}0 is PSD for gij=pmin(i,j)qmax(i,j)g_{ij} = p_{\min(i,j)}q_{\max(i,j)}1 and gij=pmin(i,j)qmax(i,j)g_{ij} = p_{\min(i,j)}q_{\max(i,j)}2 for gij=pmin(i,j)qmax(i,j)g_{ij} = p_{\min(i,j)}q_{\max(i,j)}3, so gij=pmin(i,j)qmax(i,j)g_{ij} = p_{\min(i,j)}q_{\max(i,j)}4 is an integral of nonnegative quadratic forms.

A notable refinement is a reduced test family: the full classification is already forced by (i) all positive rank-one matrices and (ii) the two-by-two matrices above. Thus the entire preserver class is determined by tests of order at most two, and every nonzero preserver is automatically positive, nondecreasing, continuous, and multiplicatively log-convex, gij=pmin(i,j)qmax(i,j)g_{ij} = p_{\min(i,j)}q_{\max(i,j)}5.

Loewner monotonicity on fixed-gij=pmin(i,j)qmax(i,j)g_{ij} = p_{\min(i,j)}q_{\max(i,j)}6 fibers

Fixing gij=pmin(i,j)qmax(i,j)g_{ij} = p_{\min(i,j)}q_{\max(i,j)}7, the family gij=pmin(i,j)qmax(i,j)g_{ij} = p_{\min(i,j)}q_{\max(i,j)}8 is convex — in contrast, the paper shows gij=pmin(i,j)qmax(i,j)g_{ij} = p_{\min(i,j)}q_{\max(i,j)}9 itself is not convex, via an explicit sum of two rank-one Green matrices that violates the Green multiplicative identity pi,qi>0p_i, q_i > 00. For pi,qi>0p_i, q_i > 01, Loewner monotonicity pi,qi>0p_i, q_i > 02 within every fixed-pi,qi>0p_i, q_i > 03 family holds if and only if

pi,qi>0p_i, q_i > 04

with pi,qi>0p_i, q_i > 05 a finite positive Borel measure, the zero measure allowed. Necessity follows by differentiating along the direction pi,qi>0p_i, q_i > 06 and applying the PSD classification to pi,qi>0p_i, q_i > 07; sufficiency follows from convexity of the fiber and a Schur-product integral argument. The paper leaves open whether the same classification holds when pi,qi>0p_i, q_i > 08 and pi,qi>0p_i, q_i > 09 have different ZZ0-sequences.

Rigidity of totally nonnegative output

Requiring TN output collapses the preservers dramatically: the only possibilities are ZZ1 and ZZ2 with ZZ3, ZZ4. The proof is a clean rigidity argument: TN of a specific nonprincipal minor of an order-three strict Green test matrix yields the reverse Cauchy–Schwarz inequality ZZ5 for the normalized Laplace transform ZZ6, while Cauchy–Schwarz itself gives ZZ7; equality forces the representing measure to be a Dirac mass. The paper emphasizes the contrast: although PSD and TN coincide on Green inputs, the output problems differ — the function ZZ8 (measure ZZ9) preserves PSD on the Green class but maps the strict Green matrix ff0 to a matrix with a negative minor. This is a concrete disanalogy with the full-PSD-cone setting.

Positive definite output and structure preservation

For strict Green inputs (strictly increasing ratios, hence positive definite), PSD output upgrades to positive definite output precisely when the representing measure has positive mass on ff1; measures concentrated at ff2 give rank-one images ff3.

For structure preservation, the paper first gives an intrinsic characterization: a symmetric positive-entry matrix is Green if and only if ff4 for all ff5. For positive-entry Green matrices with no PSD requirement, the preservers are exactly ff6 with ff7 an arbitrary additive function — possibly discontinuous, since no regularity is imposed. Under any mild regularity (continuity, measurability, local boundedness, or monotonicity on an interval), this reduces to ff8 with ff9. Requiring PSD or strict Green output forces monotonicity of G(p,q)=DqLdiag(Δ1,,Δn)LTDqG(p,q) = D_q L\,\mathrm{diag}(\Delta_1,\dots,\Delta_n)\,L^T D_q0, hence G(p,q)=DqLdiag(Δ1,,Δn)LTDqG(p,q) = D_q L\,\mathrm{diag}(\Delta_1,\dots,\Delta_n)\,L^T D_q1 or G(p,q)=DqLdiag(Δ1,,Δn)LTDqG(p,q) = D_q L\,\mathrm{diag}(\Delta_1,\dots,\Delta_n)\,L^T D_q2 respectively.

A sharpness result shows that order-three tests cannot be replaced by order two: G(p,q)=DqLdiag(Δ1,,Δn)LTDqG(p,q) = D_q L\,\mathrm{diag}(\Delta_1,\dots,\Delta_n)\,L^T D_q3 maps every PSD Green matrix of order two to a PSD Green matrix (via the AM–GM inequality G(p,q)=DqLdiag(Δ1,,Δn)LTDqG(p,q) = D_q L\,\mathrm{diag}(\Delta_1,\dots,\Delta_n)\,L^T D_q4) and every strict Green matrix of order two to a strict one, yet is not of the form G(p,q)=DqLdiag(Δ1,,Δn)LTDqG(p,q) = D_q L\,\mathrm{diag}(\Delta_1,\dots,\Delta_n)\,L^T D_q5. Since every symmetric positive-entry G(p,q)=DqLdiag(Δ1,,Δn)LTDqG(p,q) = D_q L\,\mathrm{diag}(\Delta_1,\dots,\Delta_n)\,L^T D_q6 matrix is Green, order two carries no information beyond positive definiteness in this setting.

Limitations and open questions

The classifications concern all matrix orders and functions on G(p,q)=DqLdiag(Δ1,,Δn)LTDqG(p,q) = D_q L\,\mathrm{diag}(\Delta_1,\dots,\Delta_n)\,L^T D_q7; preservers for Green matrices admitting zero entries or parameters, and preserver classes fixed to a single dimension, are explicitly left unstudied. The Loewner-monotonicity classification is restricted to G(p,q)=DqLdiag(Δ1,,Δn)LTDqG(p,q) = D_q L\,\mathrm{diag}(\Delta_1,\dots,\Delta_n)\,L^T D_q8 functions and to fixed-G(p,q)=DqLdiag(Δ1,,Δn)LTDqG(p,q) = D_q L\,\mathrm{diag}(\Delta_1,\dots,\Delta_n)\,L^T D_q9 fibers, and the cross-DqD_q0 version is open. The TN rigidity argument relies on a specific order-three test family; whether weaker test families (e.g., only principal minors) suffice is not addressed.

Conclusion

The paper provides a complete, regularity-free classification of entrywise positivity preservers on discrete Green matrices, organized by output requirement: Laplace-transform mixtures of nonnegative real powers for PSD output, monomials for TN output and for Green-structure preservation (with DqD_q1 for strict structure), and additive-perturbation forms for Loewner monotonicity on fixed-DqD_q2 fibers. The proofs are elementary, relying on rank-one and low-order test matrices together with the Hankel kernel representation, and the paper identifies precisely which test orders are necessary.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.